QPV - A retroprospective

          @misc{ scivideos_PIRSA:23090011,
            doi = {10.48660/23090011},
            url = {https://pirsa.org/23090011},
            author = {Kent, Adrian},
            keywords = {Quantum Information},
            language = {en},
            title = {QPV - A retroprospective},
            publisher = {Perimeter Institute for Theoretical Physics},
            year = {2023},
            month = {sep},
            note = {PIRSA:23090011 see, \url{https://scivideos.org/index.php/pirsa/23090011}}
          }
          

Abstract

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.