Optimal Verification of the Bell State and Greenberger-Horne-Zeilinger States in Untrusted Quantum Networks

• URL: http://arxiv.org/abs/2111.02800v2
• Date: Mon, 27 Dec 2021 12:33:08 GMT
• Title: Optimal Verification of the Bell State and Greenberger-Horne-Zeilinger States in Untrusted Quantum Networks
• Abstract summary: We propose a simple approach for verifying the Bell state in an untrusted quantum network. It turns out each verification protocol is tied to a probability distribution on the Bloch sphere. We show that our protocols can achieve almost the same sample efficiencies as protocols tailored to standard quantum state verification.
• Score: 2.9983889642113253
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Bipartite and multipartite entangled states are basic ingredients for constructing quantum networks and their accurate verification is crucial to the functioning of the networks, especially for untrusted networks. Here we propose a simple approach for verifying the Bell state in an untrusted quantum network in which one party is not honest. Only local projective measurements are required for the honest party. It turns out each verification protocol is tied to a probability distribution on the Bloch sphere and its performance has an intuitive geometric meaning. This geometric picture enables us to construct the optimal and simplest verification protocols, which are also very useful to detecting entanglement in the untrusted network. Moreover, we show that our verification protocols can achieve almost the same sample efficiencies as protocols tailored to standard quantum state verification. Furthermore, we establish an intimate connection between the verification of Greenberger-Horne-Zeilinger states and the verification of the Bell state. By virtue of this connection we construct the optimal protocol for verifying Greenberger-Horne-Zeilinger states and for detecting genuine multipartite entanglement.

Related papers

• Efficient Verification of Entangled Measurements with Local States [41.58226483686176]
  We develop a framework for quantum measurement verification using only local state preparations.<n>We prove that symmetry reduces locality constrained QMV to quantum state verification of a single basis state.<n>We derive explicit local protocols together with closed form verification operators, success probabilities, and sample complexities.
  arXiv  Detail & Related papers  (2026-06-19T11:55:21Z)
• Near-projective GHZ certification from disjoint Bell measurements [5.706918315850497]
  We introduce a single-copy verification protocol for the (n)-qubit Greenberger--Horne--Zeilinger state using only disjoint two-qubit measurements.<n>Surprisingly, a simple effect yields perfect completeness and a verification spectral gap (_mathrmBM(n)=1O (1/n)), so the protocol approaches the ideal projective verificationally as (n) grows.
  arXiv  Detail & Related papers  (2026-06-08T07:23:17Z)
• Verifier-initiated quantum message-authentication via quantum zero-knowledge proofs [38.81686642226027]
  We introduce a new method where the verifier can request authentication only when needed, improving efficiency for quantum networks and blockchain applications.<n>Our approach adapts the concept of zero-knowledge widely used in classical cryptography to quantum settings, ensuring that verification reveals nothing about secret keys.<n>This work delivers the first general verifier-initiated quantum signature scheme with formal security, paving the way for scalable, secure authentication in future quantum infrastructures and decentralized systems.
  arXiv  Detail & Related papers  (2025-12-05T04:40:34Z)
• Piecemaker: a resource-efficient entanglement distribution protocol [8.247751457673331]
  We introduce multipartite entanglement distribution protocols that use a quantum switch to deliver stabilizer states to a number of remote end users.<n>Unlike existing schemes that wait for all Bell pairs to be established before distributing the desired state, our approach stores only a minimal subset of Bell pairs.<n>Our protocols can achieve the critical fidelity threshold of 1/2 for multipartite entanglement in a wider range of depolarization rates and success probabilities of Bell-pair generation.
  arXiv  Detail & Related papers  (2025-08-20T14:33:40Z)
• A Fully Device-Independent Ternary Quantum Key Distribution Protocol Based on the Impossible Colouring Game [0.59374762912328]
  We propose a quantum key distribution protocol based on the two-party Impossible Colouring pseudo-telepathy game.<n>The protocol harnesses Bell inequality violations that arise from contextuality in the Kochen-Specker theorem.<n>It operates within an adequate security framework and demonstrates an improved key generation rate compared to standard quantum key distribution schemes.
  arXiv  Detail & Related papers  (2025-05-21T14:52:31Z)
• 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. We establish parallel repetition of the $f$-BB84 and $f$-routing QPV protocols.
  arXiv  Detail & Related papers  (2025-03-12T17:00:32Z)
• An efficient quantum state verification framework and its application to bosonic systems [0.0]
  We introduce a general framework for the efficient verification of large quantum systems. Our framework combines robust fidelity witnesses with efficient classical post-processing to implement measurement back-propagation.
  arXiv  Detail & Related papers  (2024-11-07T13:19:22Z)
• Quantum Advantage in Distributed Sensing with Noisy Quantum Networks [37.23288214515363]
  It is critically important to analyze the achievability of quantum advantage under realistic imperfections.<n>We show that quantum advantage in distributed sensing can be achieved with noisy quantum networks which can only distribute noisy entangled states.
  arXiv  Detail & Related papers  (2024-09-25T16:55:07Z)
• 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)
• Experimental anonymous quantum conferencing [72.27323884094953]
  We experimentally implement the AQCKA task in a six-user quantum network using Greenberger-Horne-Zeilinger (GHZ)-state entanglement. We also demonstrate that the protocol retains an advantage in a four-user scenario with finite key effects taken into account.
  arXiv  Detail & Related papers  (2023-11-23T19:00:01Z)
• 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)
• Quantum-enhanced metrology with network states [8.515162179098382]
  We prove a general bound that limits the performance of using quantum network states to estimate a global parameter. Our work establishes both the limitation and the possibility of quantum metrology within quantum networks.
  arXiv  Detail & Related papers  (2023-07-15T09:46:35Z)
• Semi-device independent nonlocality certification for near-term quantum networks [46.37108901286964]
  Bell tests are the most rigorous method for verifying entanglement in quantum networks. If there is any signaling between the parties, then the violation of Bell inequalities can no longer be used. We propose a semi-device independent protocol that allows us to numerically correct for effects of correlations in experimental probability distributions.
  arXiv  Detail & Related papers  (2023-05-23T14:39:08Z)
• 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)
• Conference key agreement in a quantum network [67.410870290301]
  Quantum conference key agreement (QCKA) allows multiple users to establish a secure key from a shared multi-partite entangled state. In a quantum network, this protocol can be efficiently implemented using a single copy of a N-qubit Greenberger-Horne-Zeilinger (GHZ) state to distil a secure N-user conference key bit.
  arXiv  Detail & Related papers  (2022-07-04T18:00:07Z)
• Learning Quantum Entanglement Distillation with Noisy Classical Communications [39.000858564696856]
  entanglement distillation aims to enhance the fidelity of entangled qubits through local operations and classical communication. Existing distillation protocols assume the availability of ideal, noiseless, communication channels. In this paper, we study the case in which communication takes place over noisy binary symmetric channels.
  arXiv  Detail & Related papers  (2022-05-17T18:10: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)
• Protocols for creating and distilling multipartite GHZ states with Bell pairs [0.0]
  distribution of high-quality Greenberger-Horne-Zeilinger (GHZ) states is at the heart of many quantum communication tasks. We introduce a dynamic programming algorithm to optimize over a large class of protocols that create and purify GHZ states.
  arXiv  Detail & Related papers  (2020-10-23T09:40:01Z)
• Composable Security for Multipartite Entanglement Verification [3.4806267677524896]
  We present a composably secure protocol allowing $n$ parties to test an entanglement generation resource controlled by a possibly dishonest party. The test consists only in local quantum operations and authenticated classical communication once a state is shared among them. Our protocol can typically be used as a subroutine in a Quantum Internet, to securely share a GHZ state among the network before performing a communication or computation protocol.
  arXiv  Detail & Related papers  (2020-04-16T14:33:17Z)
• Experimental quantum conference key agreement [55.41644538483948]
  Quantum networks will provide multi-node entanglement over long distances to enable secure communication on a global scale. Here we demonstrate quantum conference key agreement, a quantum communication protocol that exploits multi-partite entanglement. We distribute four-photon Greenberger-Horne-Zeilinger (GHZ) states generated by high-brightness, telecom photon-pair sources across up to 50 km of fibre.
  arXiv  Detail & Related papers  (2020-02-04T19:00:31Z)

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.