The Quantum Moment Problem and Bounds on Entangled Multi-prover Games

@article{Doherty2008TheQM,
  title={The Quantum Moment Problem and Bounds on Entangled Multi-prover Games},
  author={Andrew C. Doherty and Yeong-Cherng Liang and Ben Toner and Stephanie Wehner},
  journal={2008 23rd Annual IEEE Conference on Computational Complexity},
  year={2008},
  pages={199-210}
}
We study the quantum moment problem: given a conditional probability distribution together with some polynomial constraints, does there exist a quantum state rho and a collection of measurement operators such that (i) the probability of obtaining a particular outcome when a particular measurement is performed on rho is specified by the conditional probability distribution, and (ii) the measurement operators satisfy the constraints. For example, the constraints might specify that some… 

Figures from this paper

Entangled protocols and non-local games for testing quantum systems
TLDR
This thesis investigates multi-prover interactive proofs for verifying quantum behavior, and focuses on the stringent testing scenario in which the verifier in the interactive proof is completely classical as described above.
Classical and Quantum Partition Bound and Detector Inefficiency
TLDR
For one- way communication, it is shown that the quantum one-way partition bound is tight for classical communication with shared entanglement up to arbitrarily small error.
Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision
TLDR
Lower bounds are given on the complexity class PZK-MIPcoδ (2, 1,1, s) of perfect zero-knowledge multi-prover proofs with approximately-commuting operator strategies, as the gap 1 --- s gets arbitrarily small.
Quantum Strategies and Local Operations
TLDR
A new formalism for quantum strategies, which specify the actions of one party in any multi-party interaction involving the exchange of multiple quantum messages among the parties, is introduced and the existence of a ball of local operations with shared randomness lying within the space spanned by the no-signaling operations and centred at the completely noisy channel is established.
Product-state approximations to quantum ground states
TLDR
A new quantum version of the de Finetti theorem is proved which does not require the usual assumption of symmetry and is described a way to analyze the application of the Lasserre/Parrilo SDP hierarchy to local quantum Hamiltonians.
Monogamy of non-local quantum correlations
  • B. Toner
  • Computer Science
    Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
  • 2008
TLDR
This work bound the trade-off between AB's and AC's violation of the Clauser–Horne–Shimony–Holt inequality and demonstrates that forcing B and C to be classically correlated prevents A and B from violating certain Bell inequalities, relevant for interactive proof systems and cryptography.
A strong no-go theorem on the Wigner’s friend paradox
Does quantum theory apply at all scales, including that of observers? New light on this fundamental question has recently been shed through a resurgence of interest in the long-standing Wigner’s
Beating Random Assignment for Approximating Quantum 2-Local Hamiltonian Problems
TLDR
The first approximation algorithm beating this bound is presented, a classical polynomial-time 0.764-approximation for strictly quadratic instances, and it is conjecture these are the hardest instances to approximate.
The Weirdness Theorem and the Origin of Quantum Paradoxes
TLDR
The ‘weirdness theorem’ is given that characterises the conditions under which weirdness will show up, and shows that whenever logic has bounds due to the algorithmic nature of its tasks, then weirdness arises in the special form of negative probabilities or non-classical evaluation functionals.
An Optimal Product-State Approximation for 2-Local Quantum Hamiltonians with Positive Terms
We resolve the approximability of the maximum energy of the Quantum Max Cut (QMC) problem using product states. A classical 0.498-approximation, using a basic semidefinite programming relaxation, is
...
...

References

SHOWING 1-10 OF 69 REFERENCES
On the Power of Entangled Provers: Immunizing games against entanglement
TLDR
The results imply that, unless P = NP, the value of entangled prover games cannot be computed by semi-definite programs that are polynomial in the size of the verifier’s system, a method that has been successful for more restricted quantum games.
Unique Games with Entangled Provers are Easy
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are `unique' constraints (i.e.,
Entangled Games are Hard to Approximate
TLDR
This work implies that, unless P = NP, the values of entangled-player games cannot be computed by semidefinite programs that are polynomial in the size of the referee's system, a method that has been successful for more restricted quantum games.
The Unique Games Conjecture with Entangled Provers is False
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ constraints (i.e.,
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
TLDR
It is proved that any polynomial-round quan tum interactiveProof system with two-sided bounded error can be parallelized to a quantum interactive proof system with exponentially small one-sided error, in which the prover and verifier exchange only 3 messages.
Extremal quantum correlations for N parties with two dichotomic observables per site
Consider a scenario where $N$ separated quantum systems are measured, each with one among two possible dichotomic observables. Assume that the $N$ events corresponding to the choice and performance
Non-deterministic exponential time has two-prover interactive protocols
TLDR
It is shown that the class of languages having tow-prover interactive proof systems is nondeterministic exponential time and that to prove membership in languages inEXP, the honest provers need the power ofEXP only.
Bounding the set of quantum correlations.
We introduce a hierarchy of conditions necessarily satisfied by any distribution P_{alphabeta} representing the probabilities for two separate observers to obtain outcomes alpha and beta when making
On the Independence of Local Algebras in Quantum Field Theory
A review is made of the multitude of different mathematical formalizations of the physical concept ‘two observables (or two systems) are independent’ that have been proposed in quantum theories,
Consequences and limits of nonlocal strategies
TLDR
This paper investigates various aspects of the nonlocal effects that can arise when entangled quantum information is shared between two parties, and establishes limits on nonlocal behavior by upper-bounding the values of several of these games.
...
...