Skip to content
Preprint

Loss-Tolerant Quantum Position Verification for Metropolitan Area Networks

Sep 2026 · 1 citation · 60 references
Physics

TL;DR

This work introduces and experimentally demonstrate a loss-tolerant QPV (LT-QPV) protocol whose security is independent of channel loss, and proves finite-size security against quantum polynomial-time entangled adversaries in the quantum random oracle model instantiated with cryptographically secure hash functions.

Abstract

A spacetime seal, a cryptographic guarantee that a digital event has occurred at an approved location and time, can augment a digital signature with location attestation for legal, financial, and regulatory use cases. In adversarial settings any purely classical realization of such a seal can be spoofed. Quantum position verification (QPV) offers a physics-based solution, exploiting the no-cloning theorem and the no-signaling principle to certify a party's spacetime coordinates. While the feasibility of QPV has been recently shown via entanglement- and coherent light-based protocols, achieving loss tolerance for these schemes substantially increases implementation complexity at metropolitan scales. Here, we introduce and experimentally demonstrate a loss-tolerant QPV (LT-QPV) protocol whose security is independent of channel loss. We prove finite-size security against quantum polynomial-time entangled adversaries in the quantum random oracle model instantiated with cryptographically secure hash functions. Implemented entirely with commercial off-the-shelf components, our system certifies position within 22 minutes of net data collection time against a restricted adversary, with a clear path to real-time certification (<1s) with upgraded hardware. Our architecture, requiring only a single quantum verifier node alongside classical infrastructure, is naturally compatible with metropolitan-area quantum networks, establishing the foundations for scalable, physics-backed spacetime certification as a deployable service.

View source

Similar papers

Preprint Aug 2026

Quantum gate lower bounds for loss-tolerant position verification

A new lower bound is given on any attack on this scheme, in particular proving nearly-linear quantum gate lower bounds on the attacker, even when allowing the attacker to declare a transmission loss of up to $50\%$, allowing for the challenges prepared by the referee to be imperfect, and allowing the quantum messages u...

Alexander May, P. Lunel · 2 citations
Preprint Sep 2026

Breaking the Bounded Entanglement Barrier for Quantum Position Verification

Position verification, introduced by Chandran et al. (SIAM J. Computing 2014), allows verifiers to test a prover's claimed position by an interactive protocol. Classical position verification is impossible. Even for Quantum Position Verification (QPV), there always exists an LOCC (Local Operations and Classical Communi...

Amit Behera, Vipul Goyal · 0 citations
Preprint Aug 2026

A Loss-Robust Disturbance Certificate for Minimal-Receiver Quantum Key Distribution

By endowing the minimal-detector receiver of polarization QKD with a conclusive, loss-robust disturbance alarm, the solution lowers the hardware entry cost of security-monitored QKD, hence fostering its adoption at the cost-sensitive network edge.

R. Di Pietro · 0 citations
Preprint Sep 2026

Classical Verifier Position Verification from Non-Local Games

Secure position verification certifies that a remote prover occupies a claimed location, a task that is provably impossible with classical resources alone against colluding adversaries. Most existing quantum position verification schemes require transmitting quantum states between verifiers and provers, and the resulti...

Wen Yu Kon, Fatih Kaleoglu, Kaushik Chakraborty · 0 citations
Review Open access Sep 2026

On a Grover-Based Quantum Signature Scheme and a Teleportation-Based Design

Quantum computation, with tools including Grover’s algorithm, quantum walks, and quantum teleportation, plays an important role in quantum signature designs. Although such designs offer signature functionality, they sometimes come at the cost of security. This paper first reviews a Grover-based scheme and shows how man...

Guo-Liang Xu, Song Xue, Xiang-Fu Zou et al. · 0 citations
Open access Aug 2026

Beyond encryption: post-quantum cryptography and the future of quantum-safe networks

This analysis demonstrates that while hybrid PQC-QKD models reduce long-term key compromise probabilities to near 0%, they introduce a 15% to 40% increase in bandwidth overhead during initial cryptographic handshakes during initial cryptographic handshakes.

R. Delhibabu · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.