On the complexity of approximating the diamond norm

Informational complexity and efficient methods for the solution of convex extremal problems

Original

D. B. Yudin and A. S. Nemirovskii · 1976

Earlier work this paper cites.

A polynomial algorithm in linear programming

L. G. Khachiyan · 1979

Earlier work this paper cites.

Geometric Algorithms and Combinatorial Optimization

M. Grötschel, L. Lovász, and A. Schrijver · 1988

Earlier work this paper cites.

Quadratic optimization

C.A. Floudas and V. Visweswaran · 1995

Earlier work this paper cites.

Quantum computations: algorithms and error correction

A.Y. Kitaev · 1997

Earlier work this paper cites.

Parallelization, amplification, and exponential time simulation of quantum interactive proof systems

A. Kitaev and J. Watrous · 2000

Earlier work this paper cites.

Quantum Computation and Quantum Information

M. Nielsen and I. Chuang · 2000

Cited alongside, same era.

Classical and Quantum Computation

A.Y. Kitaev, A. Shen, and M.N. Vyalyi · 2002

Cited alongside, same era.

Solving convex programs by random walks

D. Bertsimas and S. Vempala · 2004

Cited alongside, same era.

Advanced topics in quantum information processing

J. Watrous · 2004

Cited alongside, same era.

On the hardness of distinguishing mixed-state quantum computations

B. Rosgen and J. Watrous · 2005

Cited alongside, same era.

Consistency of local density matrices is QMA-complete

Y.K. Liu · 2006

Later among the works it cites.

Sub– and super–fidelity as bounds for quantum fidelity

J. A. Miszczak, Z. Puchała, P. Horodecki, A. Uhlmann, and K. Życzkowski · 2008

Later among the works it cites.

Distinguishing short quantum computations

B. Rosgen · 2008

Later among the works it cites.

QIP = PSPACE \text{QIP}=\text{PSPACE}

R. Jain, Z. Ji, S. Upadhyay, and J. Watrous · 2009

Closest in time.

Semidefinite programs for completely bounded norms

J. Watrous · 2009

Closest in time.