Nonexistence of a universal quantum machine to examine the precision of unknown quantum states
arXiv:1110.4540 · doi:10.1103/PhysRevA.84.062313
Abstract
In this work, we reveal a new type of impossibility discovered in our recent research which forbids comparing the closeness of multiple unknown quantum states with any non-trivial threshold in a perfect or an unambiguous way. This impossibility is distinct from the existing impossibilities in that it is a "collective" impossibility on multiple quantum states while most other "no-go" theorems concern with only one single state each time, i.e., it is an impossibility on a non-local quantum operation. This novel impossibility may provide a new insight into the nature of quantum mechanics and it implies more limitations on quantum information tasks than the existing "no-go" theorems.
References in corpus (17)
- Unconditionally secure quantum bit commitment is impossible
- Noncommuting mixed states cannot be broadcast
- Is Quantum Bit Commitment Really Possible?
- A generalized no-broadcasting theorem
- Impossibility of deleting an unknown quantum state
- Comparison of two unknown pure quantum states
- No purification for two copies of a noisy entangled state
- Strong no-go theorem for Gaussian quantum bit commitment
- Unambiguous comparison of the states of multiple quantum systems
- Sequential Implementation of Global Quantum Operations
- On the generalization of quantum state comparison
- Impossibility of Growing Quantum Bit Commitments
- Comparing the states of many quantum systems
- Unambiguous comparison of ensembles of quantum states
- Ancilla-assisted sequential approximation of nonlocal unitary operations
- Comparison of mixed quantum states
- Unambiguous Examining the Orthogonality of Multiple Quantum States