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

TL;DR
This paper demonstrates that constant-sized correlations can robustly self-test maximally entangled states of unbounded dimension for infinitely many prime numbers, using an embedding procedure and properties of prime generators.
Contribution
It proves that constant-sized correlations suffice for robust self-testing of high-dimensional maximally entangled states, extending previous results to unbounded dimensions.
Findings
Constant-sized correlations can self-test maximally entangled states of unbounded dimension.
The construction applies to infinitely many primes with small multiplicative generators.
The embedding procedure enables robust self-testing in high-dimensional quantum systems.
Abstract
We show that for any prime odd integer , there exists a correlation of size that can robustly self-test a maximally entangled state of dimension , where is the smallest multiplicative generator of . The construction of the correlation uses the embedding procedure proposed by Slofstra (Forum of Mathematics, Pi. Vol. , ()). Since there are infinitely many prime numbers whose smallest multiplicative generator is at most (M. Murty The Mathematical Intelligencer ()), our result implies that constant-sized correlations are sufficient for robust self-testing of maximally entangled states with unbounded local dimension.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Mechanics and Applications · Computability, Logic, AI Algorithms · Quantum Information and Cryptography
