Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Quantum computation and quantum information
Quantum computation and quantum information
Classical and Quantum Computation
Classical and Quantum Computation
Solving convex programs by random walks
Journal of the ACM (JACM)
On the Hardness of Distinguishing Mixed-State Quantum Computations
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
Sub- and super-fidelity as bounds for quantum fidelity
Quantum Information & Computation
Consistency of local density matrices is QMA-Complete
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Computational distinguishability of degradable and antidegradable channels
Quantum Information & Computation
| Hi-index | 0.00 |
The diamond norm is a norm defined over the space of quantum transformations. This norm has a naturaloperational interpretation: it measures how well one can distinguish between two transformationsby applying them to a state of arbitrarily large dimension. This interpretation makes this norm usefulin the study of quantum interactive proof systems. In this note we exhibit an efficient algorithm for computing this norm using convex programming.Independently of us, Watrous [1] recently showed a different algorithm to compute this norm. An immediatecorollary of this algorithm is a slight simplification of the argument of Kitaev and Watrous [2]that QIP ⊆ EXP.