2008
DOI: 10.48550/arxiv.0803.4373
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

The quantum moment problem and bounds on entangled multi-prover games

Andrew C. Doherty,
Yeong-Cherng Liang,
Ben Toner
et al.

Abstract: The quantum moment problem and bounds on entangled multi-prover games,

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

1
13
0

Year Published

2009
2009
2019
2019

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(14 citation statements)
references
References 178 publications
(548 reference statements)
1
13
0
Order By: Relevance
“…In a local classical model we have the maximum value of 0, while the largest violation one could get with qubits was 0.25, which could already be achieved with a maximally entangled pair of qubits (see e.g., [11,13,[16][17][18]23]). On the other hand, the best upper bounds are based on the NPA method [10] and at level three it yields the significantly higher upper bound, 0.250 875 56 [11,16]. We could even go above level three to an intermediate level in [13], and presently we have got the upper bound 0.250 875 38 at level four.…”
Section: Introductionmentioning
confidence: 80%
See 1 more Smart Citation
“…In a local classical model we have the maximum value of 0, while the largest violation one could get with qubits was 0.25, which could already be achieved with a maximally entangled pair of qubits (see e.g., [11,13,[16][17][18]23]). On the other hand, the best upper bounds are based on the NPA method [10] and at level three it yields the significantly higher upper bound, 0.250 875 56 [11,16]. We could even go above level three to an intermediate level in [13], and presently we have got the upper bound 0.250 875 38 at level four.…”
Section: Introductionmentioning
confidence: 80%
“…The method invented by Navascués, Pironio and Acín (NPA) [10] is based on the solution of a hierarchy of semidefinite programming (SDP) relaxations and is particularly useful since it gives better and better upper bounds on the maximum violation of an arbitrary Bell inequality by stepping to higher levels in the hierarchy. Moreover, the series of upper bounds in the hierarchy keep to the exact quantum maximum in terms of commuting measurements [11,16]. On the other hand, one can use heuristic algorithms to obtain nontrivial lower bounds in some finite dimensional Hilbert spaces on Bell inequalities, recovering the explicit form of the states and measurement operators as well.…”
Section: Introductionmentioning
confidence: 99%
“…Both settings have been extensively studied in the past (see e.g. [37,93,77,42,61,60,57,56,36,62,58] for work on MIP * /QMIP and [2,20,48,49,31,21,26,14,70,32,47,75,30,80,87] for work on QMA(k)), although there are still many interesting open questions concerning them.…”
Section: Introductionmentioning
confidence: 99%
“…This can be considered as a special case of a more sophisticated SDP based on the noncommutative Positivstellensatz[60,30,57], whose general performance we will not analyse.…”
mentioning
confidence: 99%