Quantum Interactive Proofs and the Complexity of Separability Testing
Reads0
Chats0
TLDR
In this article, it was shown 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.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 employing prior work on entanglement purification protocols to prove 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.read more
Citations
More filters
Journal ArticleDOI
A Survey of Quantum Property Testing
Ashley Montanaro,Ronald de Wolf +1 more
TL;DR: This survey describes recent results obtained for quantum property testing and surveys known bounds on testing various natural properties, such as whether two states are equal, whether a state is separable, whether two operations commute, etc.
Book
Quantum Proofs
Thomas Vidick,John Watrous +1 more
TL;DR: An overview of many of the known results concerning quantum proofs, computational models based on this concept, and properties of the complexity classes they define is provided.
Posted Content
A Survey of Quantum Property Testing
Ashley Montanaro,Ronald de Wolf +1 more
TL;DR: In this article, the authors present a survey of quantum testers for properties of quantum objects, such as states or operations. But their focus is on properties of classical objects and not on quantum objects.
Journal ArticleDOI
The controlled SWAP test for determining quantum entanglement
TL;DR: In this article, the controlled SWAP test is adapted to an efficient and useful test for entanglement of a pure state, and it is shown that the test can evidence the presence of entanglements (and further, genuine n-qubit entenglement) and can distinguish entomblement classes, and that concurrence of a two-qu bit state is related to the test's output probabilities.
Journal ArticleDOI
Computable and operationally meaningful multipartite entanglement measures
TL;DR: In this article, the authors introduced a family of entanglement measures called concentratable entanglements, which is a general framework for quantifying and characterizing multipartite entangements.
References
More filters
Journal ArticleDOI
The polynomial-time hierarchy☆
TL;DR: The problem of deciding validity in the theory of equality is shown to be complete in polynomial-space, and close upper and lower bounds on the space complexity of this problem are established.
Book
Quantum Information Theory
TL;DR: The author develops all of the tools necessary for understanding important results in quantum information theory, including capacity theorems for classical, entanglement-assisted, private and quantum communication.
Proceedings ArticleDOI
Trading group theory for randomness
TL;DR: The aim of this paper is to replace most of the (proven and unproven) group theory of [BS] by elementary combinatorial arguments and defines a new hierarchy of complexity classes “just above NP
Journal Article
Quantum measurements and the Abelian Stabilizer Problem
TL;DR: In this article, a polynomial quantum algorithm for the stabilizer problem with factoring and the discrete logarithm is presented, which is based on a procedure for measuring an eigenvalue of a unitary operator.
Journal ArticleDOI
Cryptographic distinguishability measures for quantum-mechanical states
TL;DR: In this paper, four measures of distinguishability for quantum-mechanical states are surveyed from the point of view of the cryptographer with a particular eye on applications in quantum cryptography.