Metraipolis › archive › dc_c1dbfc6b090b

Classical Verifier Position Verification from Non-Local Games — arXiv:2609.38441

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.38441
License (as archived)
CC0-1.0
Archived
2026-10-07T15:20:50.610Z
SHA-256 of the archived text
ba85b748d89c3e9a04e980b89395f864ab7694eba15d0a1768007a71de5d3c79
Stable URL of this page
https://metraipolis.com/documento/dc_c1dbfc6b090b

How to cite

Classical Verifier Position Verification from Non-Local Games — arXiv:2609.38441 — arXiv (en), https://arxiv.org/abs/2609.38441 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c1dbfc6b090b (Metraipolis archive dc_c1dbfc6b090b, sha256 ba85b748d89c3e9a04e980b89395f864ab7694eba15d0a1768007a71de5d3c79)
BibTeX
@misc{dcc1dbfc6b090b,
  title = {Classical Verifier Position Verification from Non-Local Games — arXiv:2609.38441},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.38441},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c1dbfc6b090b; sha256 ba85b748d89c3e9a04e980b89395f864ab7694eba15d0a1768007a71de5d3c79},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.38441. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 resulting photon loss makes long-distance verification impractical. Classical verifier position verification (CVPV) schemes with classical verifier-prover communication exist, but rely on complex quantum processes that generate certifiable randomness, placing them outside the reach of near-term hardware. Here we introduce a general compiler that maps any complete-support non-local game with the required quantum advantage into a multi-prover CVPV protocol. This addresses both limitations, with entirely classical verifier-prover communication and all quantum resources confined to shared entanglement and local measurements on the prover devices. Instantiating with the CHSH game enables near-term implementation on existing experimental platforms. We prove finite-size security in the quantum random oracle model for both simultaneous verification of multiple provers and verification of a single prover with multiple prover devices. Notably, security in the multi-prover setting is governed not by the certified randomness of the joint provers' outputs, but by certified blind local randomness that depends critically on the spatial arrangement of provers and verifiers.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-10-01 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.38441 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T14:53:56.604Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).