2022
DOI: 10.22331/q-2022-01-03-614
|View full text |Cite
|
Sign up to set email alerts
|

Constant-sized correlations are sufficient to self-test maximally entangled states with unbounded dimension

Abstract: Let p be an odd prime and let r be the smallest generator of the multiplicative group Zp∗. We show that there exists a correlation of size Θ(r2) that self-tests a maximally entangled state of local dimension p−1. The construction of the correlation uses the embedding procedure proposed by Slofstra (Forum of Mathematics, Pi. (2019)). Since there are infinitely many prime numbers whose smallest multiplicative generator is in the set {2,3,5} (D.R. Heath-Brown The Quarterly Journal… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3
2
1

Relationship

1
5

Authors

Journals

citations
Cited by 7 publications
(4 citation statements)
references
References 25 publications
(42 reference statements)
0
4
0
Order By: Relevance
“…Our test requires constant size (1 trit) input questions for Alice, and for Bob requires O(log n) bit inputs. With a few exceptions [27][28][29][30] (in each of which robustness is either not explicitly constructed or doubly exponential in n), other works have achieved at best logarithmic input complexities (see for example [22,24]). In our protocol, one of the players need only receive questions of a constant size.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Our test requires constant size (1 trit) input questions for Alice, and for Bob requires O(log n) bit inputs. With a few exceptions [27][28][29][30] (in each of which robustness is either not explicitly constructed or doubly exponential in n), other works have achieved at best logarithmic input complexities (see for example [22,24]). In our protocol, one of the players need only receive questions of a constant size.…”
Section: Discussionmentioning
confidence: 99%
“…Work in another direction is offered by Šupić et al [27], who exhibit (without consideration of robustness) a constant-input-size parallel self-test for many copies of an arbitrary state given a self-test for a single copy. On self-testing maximally-entangled states of arbitrary local dimension d, the results of Fu [28] and Mančinska et al [29] provide robust self-tests using constant-sized questions and answers. However, the robustness of the former is exponential in d and in the latter is not constructed.…”
Section: Related Workmentioning
confidence: 99%
“…All the previous discussion eventually might give the wrong impression that to identify and classify quantum correlations is a rather straightforward task. In fact, from a technical point of view this is not usually the case [9,[32][33][34]. But perhaps more surprisingly, in certain instances even a conceptual intuition about correlations can fail in the quantum context.…”
Section: Of 17mentioning
confidence: 99%
“…The literature on this nonlocal type of self-test is vast [ ŠB20]. They address topics such as which correlations can self-test which states, e.g., [CGS17, GKW + 18, BKM19]; how efficient and robust a self-test can be, e.g., [MYS12,McK17,NV17,NV18,CRSV18,Fu22]; and how to use self-testing to, e.g., certify a quantum computer's components [SBWS18], delegate quantum computations [RUV13,CGJV19], and characterize the complexity of quantum correlations [JNV + 20].…”
Section: Introductionmentioning
confidence: 99%