An efficient test for product states, with applications to quantum Merlin-Arthur games
Preprint
Abstract
We give a test that can distinguish efficiently between product states of n quantum systems and states which are far from product. If applied to a state psi whose maximum overlap with a product state is 1-epsilon, the test passes with probability 1-Theta(epsilon), regardless of n or the local dimensions of the individual systems. The test uses two copies of psi. We prove correctness of this test as a special case of a more general result regarding stability of maximum output purity of the depolarising channel. A key application of the test is to quantum Merlin-Arthur games, where we show that a witness from two unentangled provers can simulate a witness from arbitrarily many unentangled provers, up to a constant loss of soundness. Building on a previous result of Aaronson et al, this implies that there is an efficient quantum algorithm to verify 3-SAT with constant soundness, given two unentangled proofs of O(sqrt(n) polylog(n)) qubits. This result implies complexity-theoretic obstructions to finding a polynomial-time algorithm to determine separability of mixed quantum states, even up to constant error, and also to proving "weak" variants of the additivity conjecture for quantum channels. Finally, our test can also be used to construct an efficient test for determining whether a unitary operator is a tensor product, which is a generalisation of classical linearity testing.Keywords
All Related Versions
This publication has 30 references indexed in Scilit:
- Counterexamples to Additivity of Minimum Output p-Rényi Entropy for p Close to 0Communications in Mathematical Physics, 2008
- Counterexamples to the Maximal p-Norm Multiplicativity Conjecture for all p > 1Communications in Mathematical Physics, 2008
- Finite size mean-field modelsJournal of Physics A: General Physics, 2006
- Multiplicativity of Completely Bounded p-Norms Implies a New Additivity ResultCommunications in Mathematical Physics, 2006
- Experimental determination of entanglement with a single measurementNature, 2006
- Equivalence of Additivity Questions in Quantum Information TheoryCommunications in Mathematical Physics, 2003
- Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?2003
- Counterexample to an additivity conjecture for output purity of quantum channelsJournal of Mathematical Physics, 2002
- On the Complexity of k-SATJournal of Computer and System Sciences, 2001
- Self-testing/correcting with applications to numerical problemsJournal of Computer and System Sciences, 1993