Arbitrarily Loss-Tolerant Quantum Position Verification in a Single Execution
Summarize this article with:
Quantum Physics arXiv:2606.25037 (quant-ph) [Submitted on 23 Jun 2026] Title:Arbitrarily Loss-Tolerant Quantum Position Verification in a Single Execution Authors:Llorenç Escolà-Farràs, Boris Škorić, Florian Speelman View a PDF of the paper titled Arbitrarily Loss-Tolerant Quantum Position Verification in a Single Execution, by Lloren\c{c} Escol\`a-Farr\`as and 2 other authors View PDF Abstract:Quantum position verification (QPV) seeks to certify the spatial location of an untrusted prover, but is challenged fundamentally by entanglement-based attacks and experimentally by photon loss. Both issues were addressed separately in different works and were simultaneously resolved for sequentially repeated protocols in \textit{Phys.\ Rev.\ Lett.}\ \textbf{135},~260801 via a commitment-based modification that renders security independent of transmission losses. However, single-execution protocols are preferable in practice, and the original techniques do not extend to the parallel setting due to their reliance on sequential structure. We overcome this by utilizing different techniques based on no-signalling correlations, lifting the commitment modification to the parallel regime while preserving the security guarantees of the underlying QPV protocol. Applying this to a BB84-based QPV protocol suitable for near-term implementation and secure against bounded-entanglement adversaries, we prove that fixing a threshold~$k$ on the number of successfully committed qubits yields an adversarial acceptance probability that decays exponentially in~$k$. The resulting protocol maintains robustness to noise levels of up to~$3.7\%$ and remains secure under arbitrarily slow quantum communication, as does the original protocol. This yields the first fully loss-tolerant single-shot QPV protocol secure against entangled attackers, making QPV feasible over arbitrary distances. Finally, we refine the sequential analysis and obtain improved quantitative parameters for experimental implementations. Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2606.25037 [quant-ph] (or arXiv:2606.25037v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2606.25037 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Llorenç Escolà-Farràs [view email] [v1] Tue, 23 Jun 2026 18:00:18 UTC (49 KB) Full-text links: Access Paper: View a PDF of the paper titled Arbitrarily Loss-Tolerant Quantum Position Verification in a Single Execution, by Lloren\c{c} Escol\`a-Farr\`as and 2 other authorsView PDFTeX Source view license Current browse context: quant-ph new | recent | 2026-06 References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)