Why quantum state verification cannot be both efficient and secure: a categorical approach

• URL: http://arxiv.org/abs/2411.04767v1
• Date: Thu, 07 Nov 2024 15:07:29 GMT
• Title: Why quantum state verification cannot be both efficient and secure: a categorical approach
• Authors: Fabian Wiesner, Ziad Chaoui, Diana Kessler, Anna Pappa, Martti Karvonen,
• Abstract summary: We show a fundamental limit for quantum state verification for all cut-and-choose approaches used to verify arbitrary quantum states. Our findings show that the prevailing cut-and-choose techniques cannot lead to quantum state verification protocols that are both efficient and secure.
• Score: 0.0
• License:
• Abstract: The advantage of quantum protocols lies in the inherent properties of the shared quantum states. These states are sometimes provided by sources that are not trusted, and therefore need to be verified. Finding secure and efficient quantum state verification protocols remains a big challenge, and recent works illustrate trade-offs between efficiency and security for different groups of states in restricted settings. However, whether a universal trade-off exists for all quantum states and all verification strategies remains unknown. In this work, we instantiate the categorical composable cryptography framework to show a fundamental limit for quantum state verification for all cut-and-choose approaches used to verify arbitrary quantum states. Our findings show that the prevailing cut-and-choose techniques cannot lead to quantum state verification protocols that are both efficient and secure.

Related papers

• Efficient and Device-Independent Active Quantum State Certification [0.0]
  Entangled quantum states are essential ingredients for many quantum technologies, but they must be validated before they are used. Most existing approaches are based on preparing an ensemble of nominally identical and independent (IID) quantum states, and then measuring each copy of the ensemble. We experimentally implement quantum state certification (QSC), which measures only a subset of the ensemble, certifying the fidelity of the remaining states.
  arXiv  Detail & Related papers  (2024-07-18T21:54:13Z)
• Measurement-Device-Independent Detection of Beyond-Quantum State [53.64687146666141]
  We propose a measurement-device-independent (MDI) test for beyond-quantum state detection. We discuss the importance of tomographic completeness of the input sets to the detection.
  arXiv  Detail & Related papers  (2023-12-11T06:40:13Z)
• Security of a Continuous-Variable based Quantum Position Verification Protocol [0.0]
  We present and analyze a protocol that utilizes coherent states and its properties. We prove security of the protocol against any unentangled attackers via entropic uncertainty relations. We show that attackers who pre-share one continuous-variable EPR pair can break the protocol.
  arXiv  Detail & Related papers  (2023-08-08T09:56:38Z)
• Robust and efficient verification of graph states in blind measurement-based quantum computation [52.70359447203418]
  Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
  arXiv  Detail & Related papers  (2023-05-18T06:24:45Z)
• 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)
• Commitments to Quantum States [11.217084610985674]
  A commitment to quantum messages is binding if, after the commit phase, the committed state is hidden from the sender's view. We show that hiding quantum state commitments (QSCs) are implied by any commitment scheme for classical messages. Commitments to quantum states open the door to many new cryptographic possibilities.
  arXiv  Detail & Related papers  (2022-10-11T04:34:36Z)
• 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)
• Sample-efficient device-independent quantum state verification and certification [68.8204255655161]
  Authentication of quantum sources is a crucial task in building reliable and efficient protocols for quantum-information processing. We develop a systematic approach to device-independent verification of quantum states free of IID assumptions in the finite copy regime. We show that device-independent verification can be performed with optimal sample efficiency.
  arXiv  Detail & Related papers  (2021-05-12T17:48:04Z)
• Non-Destructive Zero-Knowledge Proofs on Quantum States, and Multi-Party Generation of Authorized Hidden GHZ States [0.0]
  We provide a protocol to prove advanced properties on a received quantum state non-destructively and non-interactively. We show how to create a multi-qubits state from a single superposition. We generalize these results to a multi-party setting and prove that multiple parties can anonymously distribute a GHZ state.
  arXiv  Detail & Related papers  (2021-04-10T11:34:40Z)
• Efficient verification of entangled continuous-variable quantum states with local measurements [0.9825966924601679]
  We establish a systematic framework for verifying entangled continuous-variable quantum states by employing local measurements only. Our protocol is able to achieve the unconditionally high verification efficiency which is quadratically better than quantum tomography.
  arXiv  Detail & Related papers  (2021-03-30T11:59:03Z)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)

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.