Stabilization of Quantum Computations by Symmetrization
SIAM Journal on Computing
Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
Classical deterministic complexity of Edmonds' Problem and quantum entanglement
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Tensor decomposition and approximation schemes for constraint satisfaction problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Quantum Algorithms for Learning and Testing Juntas
Quantum Information Processing
SIAM Journal on Computing
The complexity of the consistency and n-representability problems for quantum states
The complexity of the consistency and n-representability problems for quantum states
Computational Complexity
All Languages in NP Have Very Short Quantum Proofs
ICQNM '09 Proceedings of the 2009 Third International Conference on Quantum, Nano and Micro Technologies
The detectability lemma and quantum gap amplification
Proceedings of the forty-first annual ACM symposium on Theory of computing
Tensors in Image Processing and Computer Vision
Tensors in Image Processing and Computer Vision
Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies
CCC '09 Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity
Random Tensors and Planted Cliques
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
No Strong Parallel Repetition with Entangled and Non-signaling Provers
CCC '10 Proceedings of the 2010 IEEE 25th Annual Conference on Computational Complexity
Strong NP-hardness of the quantum separability problem
Quantum Information & Computation
Computational complexity of the quantum separability problem
Quantum Information & Computation
Hypercontractivity, sum-of-squares proofs, and their applications
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On QMA protocols with two short quantum proofs
Quantum Information & Computation
Coding theorem and strong converse for quantum channels
IEEE Transactions on Information Theory
Strong converse to the quantum channel coding theorem
IEEE Transactions on Information Theory
Epsilon-net method for optimizations over separable states
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
QMA variants with polynomially many provers
Quantum Information & Computation
Hi-index | 0.00 |
We give a test that can distinguish efficiently between product states of n quantum systems and states that are far from product. If applied to a state |ψ〉 whose maximum overlap with a product state is 1 − ε, the test passes with probability 1 − Θ(ε), regardless of n or the local dimensions of the individual systems. The test uses two copies of |ψ〉. We prove correctness of this test as a special case of a more general result regarding stability of maximum output purity of the depolarizing channel. A key application of the test is to quantum Merlin-Arthur games with multiple Merlins, where we obtain several structural results that had been previously conjectured, including the fact that efficient soundness amplification is possible and that two Merlins can simulate many Merlins: QMA(k) = QMA(2) for k ≥ 2. 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 Õ(√n) qubits. We also show how QMA(2) with log-sized proofs is equivalent to a large number of problems, some related to quantum information (such as testing separability of mixed states) as well as problems without any apparent connection to quantum mechanics (such as computing injective tensor norms of 3-index tensors). As a consequence, we obtain many hardness-of-approximation results, as well as potential algorithmic applications of methods for approximating QMA(2) acceptance probabilities. 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 generalization of classical linearity testing.