Certification of qubits in the prepare-and-measure scenario with large input alphabet and connections with the Grothendieck constant
arXiv:2211.17185 · doi:10.1038/s41598-023-39529-0
Abstract
We address the problem of testing the quantumness of two-dimensional systems in the prepare-and-measure (PM) scenario, using a large number of preparations and a large number of measurement settings, with binary outcome measurements. In this scenario, we introduce constants, which we relate to the Grothendieck constant of order 3. We associate them with the white noise resistance of the prepared qubits and to the critical detection efficiency of the measurements performed. Large-scale numerical tools are used to bound the constants. This allows us to obtain new bounds on the minimum detection efficiency that a setup with 70 preparations and 70 measurement settings can tolerate.
16 pages, 1 figure
References in corpus (16)
- Steering, Entanglement, Nonlocality, and the EPR Paradox
- Device-independent tests of classical and quantum dimensions
- Loopholes in Bell Inequality Tests of Local Realism
- Grothendieck's constant and local models for noisy entangled quantum states
- More efficient Bell inequalities for Werner states
- Dimension witnesses and quantum state discrimination
- Einstein-Podolsky-Rosen steering and the steering ellipsoid
- Bounding the set of finite dimensional quantum correlations
- Generalized Clauser-Horne-Shimony-Holt inequalities maximally violated by higher dimensional systems
- Qutrit witness from the Grothendieck constant of order four
- Towards Grothendieck Constants and LHV Models in Quantum Mechanics
- Mutually Unbiased Balanced Functions & Generalized Random Access Codes
- Quantum Random Access Codes for Boolean Functions
- Detection efficiency and noise in semi-device independent randomness extraction protocol
- General Method for Classicality Certification in the Prepare and Measure Scenario
- Bounds on semi-device-independent quantum random number expansion capabilities
Cited by in corpus (9)
- Semidefinite programming relaxations for quantum correlations
- Improved local models and new Bell inequalities via Frank-Wolfe algorithms
- Self-testing of semisymmetric informationally complete measurements in a qubit prepare-and-measure scenario
- Prepare-and-Magic: Semi-Device Independent Magic Certification in the Prepare-and-Measure Scenario
- Connecting XOR and XOR* games
- Certifying measurement incompatibility in prepare-and-measure and Bell scenarios
- Towards minimal self-testing of qubit states and measurements in prepare-and-measure scenarios
- Self-testing in a constrained prepare-measure scenario sans assuming quantum dimension
- Classical bounds on two-outcome bipartite Bell expressions and linear prepare-and-measure witnesses: Efficient computation in parallel environments such as graphics processing units