Efficient Multi-basis Quantum Position Verification Secure against Generalized Adversaries
This work advances the practicality and security of quantum position verification for experimental implementations, addressing key bottlenecks for real-world deployment.
The authors introduce a robust quantum position verification protocol that improves reliability by decoupling verifier state preparation from channel loss, refine security analysis to handle experimental imperfections, and address implicit assumptions in prior work. They also demonstrate an application of QPV for authenticating classical communication in quantum key distribution.
Quantum position verification (QPV) enables multiple verifiers to certify a prover's location using quantum communication and physical assumptions. With experimental demonstrations of QPV becoming increasingly feasible, enhancing the practicality and security of QPV protocols is more important than ever. In this work, we make three key contributions toward this goal. First, we introduce a robust QPV protocol in which the verifier's state preparation is independent of channel loss, improving reliability in real-world conditions. Second, we refine existing security analysis techniques to bolster protocol resilience against experimental imperfections. Third, we identify and address some implicit assumptions present in existing security analyses, providing a framework to eliminate such assumptions. Additionally, as an example of QPV application beyond location verification, we illustrate how QPV can be leveraged for authenticating classical communication in quantum key distribution.