Quantum interactive proofs and the complexity of separability testing
arXiv:1308.5788 · doi:10.4086/toc.2015.v011a003
Abstract
We identify a formal connection between physical problems related to the detection of separable (unentangled) quantum states and complexity classes in theoretical computer science. In particular, we show that to nearly every quantum interactive proof complexity class (including BQP, QMA, QMA(2), and QSZK), there corresponds a natural separability testing problem that is complete for that class. Of particular interest is the fact that the problem of determining whether an isometry can be made to produce a separable state is either QMA-complete or QMA(2)-complete, depending upon whether the distance between quantum states is measured by the one-way LOCC norm or the trace norm. We obtain strong hardness results by proving that for each n-qubit maximally entangled state there exists a fixed one-way LOCC measurement that distinguishes it from any separable state with error probability that decays exponentially in n.
arXiv commentv2: 43 pages, 5 figures, completely rewritten and in Theory of Computing (ToC) journal format
References in corpus (22)
- Quantum entanglement
- Mixed State Entanglement and Quantum Error Correction
- Quantum fingerprinting
- Geometric measure of entanglement and applications to bipartite and multipartite quantum states
- Entanglement-Assisted Classical Capacity of Noisy Quantum Channels
- Fully device independent quantum key distribution
- A complete family of separability criteria
- Substituting Quantum Entanglement for Communication
- On the Entangling Power of Quantum Evolutions
- Distinguishing separable and entangled states
- Authentication of Quantum Messages
- N-representability is QMA-complete
- Hiding classical data in multi-partite quantum states
- A decoupling approach to the quantum capacity
- Improving zero-error classical communication with entanglement
- Detecting multipartite entanglement
- Testing product states, quantum Merlin-Arthur games and tensor optimisation
- A comparison of old and new definitions of the geometric measure of entanglement
- Detection of Multiparticle Entanglement: Quantifying the Search for Symmetric Extensions
- The Efficiency of Quantum Identity Testing of Multiple States
- Parallel approximation of min-max problems
- Improved Soundness for QMA with Multiple Provers
Cited by in corpus (14)
- Computable and operationally meaningful multipartite entanglement measures
- The controlled SWAP test for determining quantum entanglement
- Estimating distinguishability measures on quantum computers
- Mixed-state quantum anomaly and multipartite entanglement
- Operational meaning of quantum measures of recovery
- Testing symmetry on quantum computers
- Stabilizer Testing and Magic Entropy via Quantum Fourier Analysis
- Quantum Causal Unravelling
- A Hierarchy of Multipartite Correlations Based on Concentratable Entanglement
- Schrödinger as a Quantum Programmer: Estimating Entanglement via Steering
- Entanglement Detection with Quantum-inspired Kernels and SVMs
- Parallel-in-time quantum simulation via Page and Wootters quantum time
- Quantum Computational Complexity and Symmetry
- Quantum state testing beyond the polarizing regime and quantum triangular discrimination