Exponential lower bounds for low-degree strategies in position-based quantum cryptography

arXiv:2609.35592 · quant-ph · Submitted 2026-09-28 · Read on arXiv

quant-ph

Submitted: 2026-09-28

Updated: 2026-09-28

Comments: 28 pages, 1 figure. No artificial intelligence tools were used in the preparation of this manuscript

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Verifier — 13× in this paper · explained in 2 episodes
• Verification — 8× in this paper · explained in 2 episodes
• Entanglement — 6× in this paper · explained in 3 episodes
• Accuracy — 5× in this paper · explained in 1 episode
• Query Complexity — 5× in this paper · explained in 2 episodes
• Trace — 5× in this paper · explained in 2 episodes
• Hilbert Space — 3× in this paper · explained in 2 episodes
• Fidelity — 2× in this paper · explained in 2 episodes
• Embeddings — 1× in this paper · explained in 2 episodes
• Quantum Circuits — 1× in this paper · explained in 2 episodes

Sources

• Quantum Position Verification with Remote Untrusted Devices
• Entanglement cost in non-local quantum computation

Related papers

• Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
• Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
• Polynomial-time classical and quantum simulation of quantum impurity models
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
• Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity