Metraipolis › archive › dc_e397b883c8c2

Quantum gate lower bounds for loss-tolerant position verification — arXiv:2608.16495

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.16495
License (as archived)
CC0-1.0
Archived
2026-10-19T01:02:58.080Z
SHA-256 of the archived text
9d1db163367d5beadb44eb51d4d1d728d39206bf00a2a46fe38a49b0c8d7a5bb
Stable URL of this page
https://metraipolis.com/documento/dc_e397b883c8c2

How to cite

Quantum gate lower bounds for loss-tolerant position verification — arXiv:2608.16495 — arXiv (en), https://arxiv.org/abs/2608.16495 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e397b883c8c2 (Metraipolis archive dc_e397b883c8c2, sha256 9d1db163367d5beadb44eb51d4d1d728d39206bf00a2a46fe38a49b0c8d7a5bb)
BibTeX
@misc{dce397b883c8c2,
  title = {Quantum gate lower bounds for loss-tolerant position verification — arXiv:2608.16495},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.16495},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e397b883c8c2; sha256 9d1db163367d5beadb44eb51d4d1d728d39206bf00a2a46fe38a49b0c8d7a5bb},
  year = {2026}
}

Archived text

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

Quantum position-verification is a cryptographic task wherein a verifier attempts to establish the location in space of a prover. Recent experiments have implemented a well-studied class of position-verification schemes, known as the $f$-BB84 scenario, but their security under realistic loss and imperfect state preparation remains incompletely understood. We give a new lower bound 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 used in the protocol to be arbitrarily slow. Our results are applicable to recent and upcoming experimental implementations of $f$-BB84, and in particular establish their security under a bounded quantum gate assumption on the attacker. The key ingredient is a tight analytic tradeoff for a lossy BB84 monogamy-of-entanglement game, valid without requiring the attackers' outputs to agree, which replaces observations previously made numerically.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-08-18 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2608.16495 — 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-19T00:29:15.411Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-08-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).