Quantum gate lower bounds for loss-tolerant position verification

• URL: http://arxiv.org/abs/2608.16495v1
• Date: Mon, 17 Aug 2026 12:33:57 GMT
• Title: Quantum gate lower bounds for loss-tolerant position verification
• Abstract summary: Quantum position-verification is a cryptographic task wherein a verifier attempts to establish the location in space of a prover.<n>Recent experiments have implemented a well-studied class of position-verification schemes, known as the $f$-BB84 scenario.<n>We give a new lower bound on any attack on this scheme, in particular proving nearly-linear quantum gate lower bounds on the attacker.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Quantum Decision Theory for Displacement Detection with Finite-Energy GKP States [46.2474896050764]
  We develop a framework for detecting phase-space displacements with finite-energy, $d$-level Gottesman-Kitaev-Preskill (GKP) probes.<n>For single-mode and entanglement-assisted architectures, we derive the Bayesian minimum-error probability.<n>We benchmark the resulting protocols against coherent-state, direction-matched squeezed-vacuum, and twin-beam schemes.
  arXiv  Detail & Related papers  (2026-08-08T10:32:05Z)
• Quaternary-Squeeze Quantum Identity Authentication: Direction-Scaling Security via Single-Mode Squeezed Light [4.87244033582479]
  Quantum identity authentication (QIA) has emerged as a crucial technology for secure communication systems.<n>This paper proposes a novel QIA protocol based on non-classical characteristics of squeezed light fields.
  arXiv  Detail & Related papers  (2026-07-10T07:31:27Z)
• Mistletoe: Stealthy Acceleration-Collapse Attacks on Speculative Decoding [47.771248673145614]
  Speculative decoding has become a widely adopted technique for accelerating large language model (LLM) inference.<n>We identify a new mechanism-level vulnerability in model-based speculative decoding.<n>We propose Mistletoe, a stealthy acceleration-collapse attack against speculative decoding.
  arXiv  Detail & Related papers  (2026-05-13T18:11:42Z)
• Compiling Activation Steering into Weights via Null-Space Constraints for Stealthy Backdoors [48.881343993730844]
  Safety-aligned large language models (LLMs) are increasingly deployed in real-world pipelines.<n> adversaries can distribute backdoored checkpoints that behave normally under standard evaluation but jailbreak when a hidden trigger is present.<n>Recent post-hoc weight-editing methods offer an efficient approach to injecting such backdoors.
  arXiv  Detail & Related papers  (2026-04-14T06:48:33Z)
• Adversarial Learning Game for Intrusion Detection in Quantum Key Distribution [0.0]
  This paper presents a high-fidelity simulation framework for intrusion detection in decoy-state Quantum Key Distribution (QKD)<n>The framework is modeled as a minimax game between a learning-based defender and an adaptive adversary.<n>Under adaptive attack scenarios, the system preserves $82text--92%$ of the honest finite-key rate while discarding only approximately $1.2%$ of traffic.
  arXiv  Detail & Related papers  (2026-03-03T20:21:06Z)
• Quantum Skyshield: Quantum Key Distribution and Post-Quantum Authentication for Low-Altitude Wireless Networks in Adverse Skies [36.14072181405793]
  Low-altitude wireless networks (LAWNs) have emerged as a critical backbone for supporting the low-altitude economy.<n>To meet growing data demands, some LAWN deployments incorporate free-space optical (FSO) links, which offer exceptional bandwidth and beam directivity.<n>Quantum Skyshield is proposed to enable reliable communication between the base transceiver station (BTS) and LAWN.
  arXiv  Detail & Related papers  (2025-07-20T04:43:33Z)
• On the Generalization of Adversarially Trained Quantum Classifiers [32.48879688084909]
  In adversarial training, quantum classifiers are trained by using an attack-aware, adversarial loss function.<n>This work establishes novel bounds on the generalization error of adversarially trained quantum classifiers when tested in the presence of perturbations.
  arXiv  Detail & Related papers  (2025-04-24T15:59:55Z)
• Quantum position verification in one shot: parallel repetition of the $f$-BB84 and $f$-routing protocols [0.0]
  We show that security for a one-round protocol can rely on the size of the classical information rather than quantum resources.<n>We establish parallel repetition of the $f$-BB84 and $f$-routing QPV protocols.
  arXiv  Detail & Related papers  (2025-03-12T17:00:32Z)
• Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)
• Quantum and semi-quantum sealed-bid auction: Vulnerabilities and advantages [0.0]
  Existing protocols for quantum sealed-bid auction are critically analyzed. A new protocol for sealed-bid auction is proposed which is semi-quantum in nature. The proposed protocol is free from the vulnerabilities reported here in the context of the existing protocols.
  arXiv  Detail & Related papers  (2021-08-13T20:34:50Z)
• Fault-tolerant parity readout on a shuttling-based trapped-ion quantum computer [64.47265213752996]
  We experimentally demonstrate a fault-tolerant weight-4 parity check measurement scheme. We achieve a flag-conditioned parity measurement single-shot fidelity of 93.2(2)%. The scheme is an essential building block in a broad class of stabilizer quantum error correction protocols.
  arXiv  Detail & Related papers  (2021-07-13T20:08:04Z)
• Towards practical and error-robust quantum position verification [0.0]
  Loss of inputs can be detrimental to the security of quantum position verification (QPV) protocols. We propose a new fully loss-tolerant protocol QPV$_textsfSWAP$, based on the SWAP test. We show that the protocol remains secure even if unentangled attackers are allowed to quantum communicate.
  arXiv  Detail & Related papers  (2021-06-24T11:10:44Z)
• Geometry of Banach spaces: a new route towards Position Based Cryptography [65.51757376525798]
  We study Position Based Quantum Cryptography (PBQC) from the perspective of geometric functional analysis and its connections with quantum games. The main question we are interested in asks for the optimal amount of entanglement that a coalition of attackers have to share in order to compromise the security of any PBQC protocol. We show that the understanding of the type properties of some more involved Banach spaces would allow to drop out the assumptions and lead to unconditional lower bounds on the resources used to attack our protocol.
  arXiv  Detail & Related papers  (2021-03-30T13:55:11Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.