Practical parallel self-testing of Bell states via magic rectangles

Abstract

Self-testing is a method to verify that one has a particular quantum state from purely classical statistics. For practical applications, such as device-independent delegated verifiable quantum computation, it is crucial that one self-tests multiple Bell states in parallel while keeping the quantum capabilities required of one side to a minimum. In this work, we use the $3\times n$ magic rectangle games (generalizations of the magic square game) to obtain a self-test for $n$ Bell states where the one side needs only to measure single-qubit Pauli observables. The protocol requires small input sizes [constant for Alice and $O(\log n)$ bits for Bob] and is robust with robustness $O(n^{5/2}\sqrt{\epsilon })$, where $\epsilon$ is the closeness of the ideal (perfect) correlations to those observed. To achieve the desired self-test, we introduce a one-side-local quantum strategy for the magic square game that wins with certainty, we generalize this strategy to the family of $3\times n$ magic rectangle games, and we supplement these nonlocal games with extra check rounds (of single and pairs of observables).

arXiv comment29 pages, 4 figures; published version

References in corpus (26)

• A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations
• Bounding the set of quantum correlations
• Fully device independent quantum key distribution
• Self-testing of quantum systems: a review
• Private Randomness Expansion With Untrusted Devices
• Unconditionally verifiable blind computation
• Verification of quantum computation: An overview of existing approaches
• Quantum Pseudo-Telepathy
• Robust and versatile black-box certification of quantum devices
• Physical characterization of quantum devices from nonlocal correlations
• Robustness and device independence of verifiable blind quantum computing
• Interactive proofs for BQP via self-tested graph states
• Device-independent parallel self-testing of two singlets
• Rigidity of quantum steering and one-sided device-independent verifiable quantum computation
• Multiparty Delegated Quantum Computing
• Robust self-testing of many-qubit states
• Self-testing in parallel
• Device-Independent Verifiable Blind Quantum Computation
• Low-degree testing for quantum states, and a quantum entangled games PCP for QMA
• Test for a large amount of entanglement, using few measurements
• The Parallel-Repeated Magic Square Game is Rigid
• Garbled Quantum Computation
• Device-independent certification of tensor products of quantum states using single-copy self-testing protocols
• Constant-sized correlations are sufficient to robustly self-test maximally entangled states with unbounded dimension
• Quantum Magic Rectangles: Characterization and Application to Certified Randomness Expansion
• Self-testing quantum systems of arbitrary local dimension with minimal number of measurements

Cited by in corpus (1)

• Parallel remote state preparation for fully device-independent verifiable blind quantum computation