Arbitrarily Loss-Tolerant Quantum Position Verification in a Single Execution

• URL: http://arxiv.org/abs/2606.25037v1
• Date: Tue, 23 Jun 2026 18:00:18 GMT
• Title: Arbitrarily Loss-Tolerant Quantum Position Verification in a Single Execution
• Abstract summary: Quantum position verification (QPV) seeks to certify the spatial location of an untrusted prover.<n>Quantum position verification (QPV) seeks to certify the spatial location of an untrusted prover.
• Score: 0.8921166277011348
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum position verification (QPV) seeks to certify the spatial location of an untrusted prover, but is challenged fundamentally by entanglement-based attacks and experimentally by photon loss. Both issues were addressed separately in different works and were simultaneously resolved for sequentially repeated protocols in \textit{Phys.\ Rev.\ Lett.}\ \textbf{135},~260801 via a commitment-based modification that renders security independent of transmission losses. However, single-execution protocols are preferable in practice, and the original techniques do not extend to the parallel setting due to their reliance on sequential structure. We overcome this by utilizing different techniques based on no-signalling correlations, lifting the commitment modification to the parallel regime while preserving the security guarantees of the underlying QPV protocol. Applying this to a BB84-based QPV protocol suitable for near-term implementation and secure against bounded-entanglement adversaries, we prove that fixing a threshold~$k$ on the number of successfully committed qubits yields an adversarial acceptance probability that decays exponentially in~$k$. The resulting protocol maintains robustness to noise levels of up to~$3.7\%$ and remains secure under arbitrarily slow quantum communication, as does the original protocol. This yields the first fully loss-tolerant single-shot QPV protocol secure against entangled attackers, making QPV feasible over arbitrary distances. Finally, we refine the sequential analysis and obtain improved quantitative parameters for experimental implementations.

Related papers

• Unsupervised Conformal Inference: Bootstrapping and Alignment to Control LLM Uncertainty [49.19257648205146]
  We propose an unsupervised conformal inference framework for generation.<n>Our gates achieve close-to-nominal coverage and provide tighter, more stable thresholds than split UCP.<n>The result is a label-free, API-compatible gate for test-time filtering.
  arXiv  Detail & Related papers  (2025-09-26T23:40:47Z)
• 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)
• Distributed Conformal Prediction via Message Passing [33.306901198295016]
  Conformal Prediction (CP) offers a robust post-hoc calibration framework.<n>We propose two message-passing-based approaches for achieving reliable inference via CP.
  arXiv  Detail & Related papers  (2025-01-24T14:47:42Z)
• Orthogonal-state-based Measurement Device Independent Quantum Communication [32.244698777387995]
  We propose a new protocol of measurement-device-independent quantum secure direct communication and quantum dialogue employing single basis, i.e., Bell basis as decoy qubits for eavesdropping detection. Our protocols leverage fundamentally distinct resources to close the security loopholes linked to measurement devices, while also effectively doubling the distance for secure direct message transmission.
  arXiv  Detail & Related papers  (2024-09-30T15:57:17Z)
• Making Existing Quantum Position Verification Protocols Secure Against Arbitrary Transmission Loss [0.889974344676093]
  In quantum position verification (QPV) protocols, even relatively small loss rates can compromise security. We modify the usual structure of QPV protocols and prove that this modification makes the potentially high transmission loss between the verifiers security-irrelevant. We show possible implementations of the required photon presence detection, making c-$mathrmQPV_mathrmBB84f$ a protocol that solves all major practical issues in QPV.
  arXiv  Detail & Related papers  (2023-12-19T21:38:10Z)
• Finite-Size Security for Discrete-Modulated Continuous-Variable Quantum Key Distribution Protocols [4.58733012283457]
  We present a composable finite-size security proof against independently and identically distributed collective attacks for a general DM CV-QKD protocol. We extend and apply a numerical security proof technique to calculate tight lower bounds on the secure key rate. Results show that our security proof method yields secure finitesize key rates under experimentally viable conditions up to at least 72km transmission distance.
  arXiv  Detail & Related papers  (2023-01-20T17:16:21Z)
• Single-qubit loss-tolerant quantum position verification protocol secure against entangled attackers [0.0]
  We study the exact loss-tolerance of the most popular protocol for QPV, which is based on BB84 states.<n>We show how these results transfer to the variant protocol which combines $n$ bits of classical information with a single qubit.
  arXiv  Detail & Related papers  (2022-12-07T14:39:56Z)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• 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)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)
• Round-robin differential phase-time-shifting protocol for quantum key distribution: theory and experiment [58.03659958248968]
  Quantum key distribution (QKD) allows the establishment of common cryptographic keys among distant parties. Recently, a QKD protocol that circumvents the need for monitoring signal disturbance, has been proposed and demonstrated in initial experiments. We derive the security proofs of the round-robin differential phase-time-shifting protocol in the collective attack scenario. Our results show that the RRDPTS protocol can achieve higher secret key rate in comparison with the RRDPS, in the condition of high quantum bit error rate.
  arXiv  Detail & Related papers  (2021-03-15T15:20:09Z)

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.