Impossibility of perfect cheating for single-qubit position verification

Abstract:In quantum position verification (QPV), a prover certifies her location to a set of verifiers by performing a quantum computation. One of the first QPV protocols was proposed by Kent, Munro, and Spiller in 2011: the prover receives a qubit $Q$ from one direction, receives an orthogonal basis $\{ v, v^\perp \}$ from the opposite direction, then measures $Q$ in $\{ v, v^\perp \}$ and broadcasts the result. Several variants of this protocol have been proposed and analyzed, but the question of whether the original protocol is secure has never been fully resolved. In this work we show that there is no perfect finite-dimensional cheating strategy for the single-qubit measurement protocol. Our proof uses tools from real algebraic geometry.

Quantum Physics (quant-ph); Algebraic Geometry (math.AG)

arXiv:2406.20022 [quant-ph]

(or arXiv:2406.20022v2 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2406.20022 Focus to learn more arXiv-issued DOI via DataCite

https://doi.org/10.1103/4pcn-d1yj Focus to learn more DOI(s) linking to related resources

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.