A Bipartite Quantum Key Distribution Protocol Based on Indefinite Causal Order

• URL: http://arxiv.org/abs/2603.08204v1
• Date: Mon, 09 Mar 2026 10:32:56 GMT
• Title: A Bipartite Quantum Key Distribution Protocol Based on Indefinite Causal Order
• Abstract summary: We propose a bipartite quantum key distribution (QKD) protocol based on causal nonseparability.<n>We discuss the practical construction of the QKD protocol using indefinite causal order.
• Score: 1.8716489049729736
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: We propose a bipartite quantum key distribution (QKD) protocol based on causal nonseparability: the presence of a resource -- a process matrix -- that does not correspond to any definite causal order between two parties. In our protocol, Alice and Bob perform local operations arranged in a ``causal-order guessing game,'' whereby each round yields an 85.35\% probability of matching bits when the communication is undisturbed. This raw matching probability (or equivalently, a $\sim14.65\%$ error rate) is amenable to standard forward error-correction strategies. We further discuss the practical construction of the QKD protocol using indefinite causal order, where several different scenarios are deeply analyzed.

Related papers

• Probabilistic Error Cancellation for Single-Mode Gottesman-Kitaev-Preskill Codes [45.91504150103373]
  We study a quantum error mitigation method known as probabilistic error cancellation in the context of the Gottesman-Kitaev-Preskill code.<n>We employ the stabilizer subsystem decomposition for GKP codes to obtain an effective logical channel for noisy operations.
  arXiv  Detail & Related papers  (2026-09-15T12:29:45Z)
• Quantum Key Distribution Without Shared Reference Frame Under Unital Noise [42.7789646649633]
  We consider a general and practical scenario of quantum key distribution (QKD) over an unknown, stationary, unital qubit channel.<n>We propose two methods to overcome the physical qubit noise and the lack of shared reference frame.
  arXiv  Detail & Related papers  (2026-06-22T12:24:11Z)
• Quantum Compression for Distributed Entanglement [42.24731280472663]
  We show that a joint design of the resource state and a family of compression schemes can increase the entanglement across partitions under a fixed transmission budget.<n>In the bipartite case, we propose practical constructions that closely approach the derived upper bound.
  arXiv  Detail & Related papers  (2026-05-05T20:06:25Z)
• Entanglement is not sufficient for most practical entanglement-based QKD protocols [0.1223474232275842]
  A central problem in entanglement-based QKD (EB-QKD) is whether every entangled state can be used to extract a key.<n>We identify a class of two-qubit isotropic states that are entangled but cannot be used to distil the key under such protocols.
  arXiv  Detail & Related papers  (2026-03-06T15:43:28Z)
• Variational Secret Common Randomness Extraction [38.319927578257726]
  We study the problem of extracting common randomness (CR) or secret keys from correlated random sources observed by two legitimate parties, Alice and Bob, through public discussion in the presence of an eavesdropper, Eve.<n>We propose a practical two-stage CR extraction framework. In the first stage, Alice and Bob employ probabilistic neural network (NN) encoders to map their observations into discrete, nearly uniform random variables (RVs) with high agreement probability.<n>In the second stage, a secure sketch using code-offset construction reconciles the encoder outputs into identical secret keys, whose secrecy is guaranteed by the VPQ objective
  arXiv  Detail & Related papers  (2025-10-02T14:22:21Z)
• Computational Monogamy of Entanglement and Non-Interactive Quantum Key Distribution [21.219588497290115]
  Quantum key distribution (QKD) enables Alice and Bob to exchange a secret key over a public, untrusted quantum channel.<n>Compared to classical key exchange, QKD achieves everlasting security: after the protocol execution the key is secure against adversaries.<n>No non-interactive protocol is known that provides everlasting security, even using quantum information.
  arXiv  Detail & Related papers  (2025-10-01T11:41:04Z)
• Phase-Matching Quantum Key Distribution without Intensity Modulation [25.004151934190965]
  We propose a phase-matching quantum key distribution protocol without intensity modulation. Simulation results show that the transmission distance of our protocol could reach 305 km in telecommunication fiber. Our protocol provides a promising solution for constructing quantum networks.
  arXiv  Detail & Related papers  (2023-03-21T04:32:01Z)
• 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)
• A novel two-party semiquantum key distribution protocol based on GHZ-like states [0.0]
  The proposed SQKD protocol can create a private key shared between one quantum party with unlimited quantum abilities and one classical party with limited quantum abilities without the existence of a third party. Detailed security analysis turns out that the proposed SQKD protocol can resist various famous attacks from an outside eavesdropper.
  arXiv  Detail & Related papers  (2022-04-21T13:25:53Z)
• Finite-key analysis for quantum key distribution with discrete phase randomization [21.561489948824274]
  We develop a technique based on conjugate measurement and quantum state distinguishment to ana-lyze the security. Our result shows that TF-QKD with reasonable number of discrete random phases, e.g. 8 phases from 0, pi/4, pi/2,..., 7pi/4, can achieve satisfactory performance.
  arXiv  Detail & Related papers  (2022-01-09T15:45: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)
• Composable security for practical quantum key distribution with two way classical communication [0.9749560288448115]
  We show that simply applying Chernoff bound in the calculation gives correct key rate, but the failure probability changes a little bit. We show that simply applying Chernoff bound in the calculation gives correct key rate, but the failure probability changes a little bit.
  arXiv  Detail & Related papers  (2021-02-01T10:11:42Z)
• Quantum Key-Distribution Protocols Based on a Quantum Version of the Monty Hall Game [0.0]
  The study proposed two quantum key-distribution protocols based on the quantum version of the Monty Hall game devised by Flitney and Abbott. The motivation behind the second proposal is to simplify a possible physical implementation by adapting the formalism of the qutrit protocol to use qubits and simple logical quantum gates.
  arXiv  Detail & Related papers  (2020-05-11T22:06:30Z)

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.