Skip to content
Source: Nature

🔐Quantum Position Verification Gets a Robust Protocol That Ignores Channel Loss

Your location proofs might soon be quantum-secured

TL;DR

A new QPV protocol lets verifiers certify a prover's location with quantum communication, and its state preparation doesn't depend on channel loss. It holds up better under real experimental imperfections, and it can also authenticate classical messages in quantum key distribution. Worth a look if you're building quantum networking stacks.

A new quantum position verification protocol lets several verifiers confirm where a device actually is, using quantum communication plus physical assumptions. The twist: the verifier's state preparation no longer depends on channel loss, which is exactly the thing that kills most experimental setups. If you're working on quantum networking or QKD, this one's for you. The same machinery can authenticate classical communication inside quantum key distribution, so you don't need a separate authentication layer bolted on. The authors also refined their security analysis to handle experimental imperfections, and they explicitly identified and removed hidden assumptions that earlier proofs quietly relied on. The headline result is a single-qubit position verification protocol that stays secure against multi-qubit attacks. The paper was published on April 28, 2022, and the research received no external funding. It was prepared by the Global Technology Applied Research Center of JPMorgan Chase & Co. and is informational, not investment research.

Key Points

1

The protocol's verifier state preparation is independent of channel loss, which removes a major obstacle to running QPV on lossy real-world fiber or free-space links.

Keep reading — it's free

Enter your email to keep reading — plus the best of AI & tech, daily. Free, forever.

Also get
or

Already a member? Sign in

quantum-computingquantum-key-distributionposition-verificationquantum-cryptographynetwork-security

Comments

Subscribe to join the conversation...

Be the first to comment