Secure quantum ranging

• URL: http://arxiv.org/abs/2505.04776v1
• Date: Wed, 07 May 2025 19:51:28 GMT
• Title: Secure quantum ranging
• Authors: Yunkai Wang, Graeme Smith, Alex May,
• Abstract summary: We propose a quantum ranging protocol that combines quantum ranging with quantum position verification.<n>Our method achieves Heisenberg-limited precision in position estimation while simultaneously detecting potential cheaters.
• Score: 4.420756503340444
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Determining and verifying an object's position is a fundamental task with broad practical relevance. We propose a secure quantum ranging protocol that combines quantum ranging with quantum position verification (QPV). Our method achieves Heisenberg-limited precision in position estimation while simultaneously detecting potential cheaters. Two verifiers each send out a state that is entangled in frequency space within a single optical mode. An honest prover only needs to perform simple beam-splitter operations, whereas cheaters are allowed to use arbitrary linear optical operations, one ancillary mode, and perfect quantum memories-though without access to entanglement. Our approach considers a previously unstudied security aspect to quantum ranging. It also provides a framework to quantify the precision with which a prover's position can be verified in QPV, which previously has been assumed to be infinite.

Related papers

• 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)
• Detecting entanglement in any measurement using quantum networks [0.0]
  Entanglement in quantum states is one of the most well-explored areas in quantum physics.<n>We classify composite quantum measurements into two classes: entangled and separable measurements.<n>We show that any rank-one projective entangled quantum measurement gives a quantum advantage.
  arXiv  Detail & Related papers  (2025-02-10T19:26:02Z)
• Single-Round Proofs of Quantumness from Knowledge Assumptions [41.94295877935867]
  A proof of quantumness is an efficiently verifiable interactive test that an efficient quantum computer can pass. Existing single-round protocols require large quantum circuits, whereas multi-round ones use smaller circuits but require experimentally challenging mid-circuit measurements. We construct efficient single-round proofs of quantumness based on existing knowledge assumptions.
  arXiv  Detail & Related papers  (2024-05-24T17:33:10Z)
• A universal scheme to self-test any quantum state and extremal measurement [41.94295877935867]
  quantum network considered in this work is the simple star network, which is implementable using current technologies. For our purposes, we also construct a scheme that can be used to self-test the two-dimensional tomographically complete set of measurements with an arbitrary number of parties.
  arXiv  Detail & Related papers  (2023-12-07T16:20:28Z)
• Secure and robust randomness with sequential quantum measurements [0.0]
  We prove a Tsirelson-like boundary for sequential quantum correlations, which represents a trade-off in nonlocality shared by sequential users.<n>Our simple qubit protocol reaches this boundary, and numerical analysis shows improved robustness under realistic noise.<n>This study advances understanding of sequential quantum correlations and offers insights for efficient device-independent protocols.
  arXiv  Detail & Related papers  (2023-09-21T17:50:29Z)
• Quantum Conformal Prediction for Reliable Uncertainty Quantification in Quantum Machine Learning [47.991114317813555]
  Quantum models implement implicit probabilistic predictors that produce multiple random decisions for each input through measurement shots. This paper proposes to leverage such randomness to define prediction sets for both classification and regression that provably capture the uncertainty of the model.
  arXiv  Detail & Related papers  (2023-04-06T22:05:21Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Almost qudits in the prepare-and-measure scenario [0.0]
  We introduce and investigate quantum information encoded in carriers that nearly, but not entirely, correspond to standard qudits. We show how small higher-dimensional components can significantly compromise the conclusions of established protocols. We also consider viewing almost qubit systems as a physical resource available to the experimenter.
  arXiv  Detail & Related papers  (2022-08-16T18:00:07Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Quantum ranging with Gaussian entanglement [1.14219428942199]
  We propose a quantum ranging protocol enhanced by entanglement. We show that entanglement enables a 6-dB advantage in the error exponent against the optimal classical scheme.
  arXiv  Detail & Related papers  (2021-03-19T23:03:18Z)

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.