Quantum circuits with mixed states
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
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
On the Hardness of Distinguishing Mixed-State Quantum Computations
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
Notes on super-operator norms induced by schatten norms
Quantum Information & Computation
Experimentally feasible measures of distance between quantum operations
Quantum Information Processing
Some bounds on the minimum number of queries required for quantum channel perfect discrimination
Quantum Information & Computation
| Hi-index | 0.00 |
Entanglement is sometimes helpful in distinguishing between quantum operations, as differences between quantum operations can become magnified when their inputs are entangled with auxiliary systems. Bounds on the dimension of the auxiliary system needed to optimally distinguish quantum operations are known in several situations. For instance, the dimension of the auxiliary space never needs to exceed the dimension of the input space [23, 14] of the operations for optimal distinguishability, while no auxiliary system whatsoever is needed to optimally distinguish unitary operations [2, 6]. Another bound, which follows from work of R. Timoney [24], is that optimal distinguishability is always possible when the dimension of the auxiliary system is twice the number of operators needed to express the difference between the quantum operations in Kraus form. This paper provides an alternate proof of this fact that is based on concepts and tools that are familiar to quantum information theorists.