QPV - A retroprospective

• Adrian Kent (University of Cambridge)

Room: PI/4-405 - Bob Room Quantum position verification (QPV) was first introduced, under the name quantum tagging, in a patent filed in 2004. It was first discussed in the academic literature in 2009-10. The schemes proposed to that point were shown to be breakable by teleportation attacks in 2010, and a general no-go theorem showing all schemes in this class are breakable was subsequently proved. However, in an alternative standard cryptographic security scenario, in which the tag is assumed to be able to keep classical data secret, unconditionally secure schemes were presented in 2010. The various terminologies and security scenarios highlight important points whose theoretical and practical implications still remain underexplored. In practice, one normally wants to verify the location of a person or valuable object, not of an easily replaceable tagging device, for at least two reasons: (i) the device itself is not so valuable, (ii) adversaries can easily construct a replacement device and thereby potentially spoof the scheme. This requires physical assumptions about the integrity of the tag and its attachment, and bounds on the speed with which the tag may be displaced or destroyed and replaced. QPV schemes that do not rely on such assumptions are breakable without teleportation or non-local computation attacks. In the other direction, when such significant physical assumptions are necessary, it may generally be reasonable to include tag security among them. In this overview I review the early history of QPV and describe various security scenarios and their potential applications. I give versions of the secure 2010 scheme designed for efficient practical implementation and discuss the frequency, accuracy and security of position verification attainable for these schemes with present technology. I also discuss the implied constraints on what may be attainable for QPV schemes involving real-time quantum measurement and/or quantum information processing.

QPV: An Overview and Reflections

• Harry Buhrman (Centrum Wiskunde & Informatica)

Room: PI/4-405 - Bob Room

Popescu-Rohrlich correlations imply efficient instantaneous nonlocal quantum computation

• Anne Broadbent (University of Ottawa)

Room: PI/4-405 - Bob Room

Non-local quantum computation meets quantum gravity

• Alex May (Perimeter Institute)

Room: PI/4-405 - Bob Room

Quantum Error-Correction and Holographic Task

• Beni Yoshida (Perimeter Institute)

Room: PI/4-405 - Bob Room

On the road to extracting QPV from holography: building a universal quantum computer in a simple QFT

• Kfir Dolev (Stanford University)

Room: PI/4-405 - Bob Room

Protocols and Implementations of Quantum Position Verification

• Eric Chitamber (University of Illinois)
• Paul Kwiat (University of Illinois)

Room: PI/4-405 - Bob Room

Long distance quantum communications: Quantum Experiments using Satellite Technologies (QUEST)

• Urbasi Sinha (Raman Research Institute)

Room: PI/4-405 - Bob Room

Towards experimental quantum position verification with true single photons by quantum dot cavity-QED

• Wolfgang Loeffler (Leiden University)

Room: PI/4-405 - Bob Room

Attacking QPV with instantaneous non-local computation of low T-depth quantum circuits

• Florian Speelman (Centrum Wiskunde & Informatica)

Room: PI/4-405 - Bob Room

Making Existing Quantum Position Verification Protocols Secure Against Arbitrary Transmission Loss

• Andreas Bluhm (LIG, Grenoble)

Room: PI/4-405 - Bob Room

QPV and Geometry of Banach spaces

• David Perez-Garcia (Universidad Complutense de Madrid)

Room: PI/4-405 - Bob Room