Table of Contents
Fetching ...

A Bipartite Quantum Key Distribution Protocol Based on Indefinite Causal Order

Mateusz Leśniak, Ryszard Kukulski, Paulina Lewandowska, Grzegorz Rajchel-Mieldzioć, Michał Wroński

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.

A Bipartite Quantum Key Distribution Protocol Based on Indefinite Causal Order

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 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.
Paper Structure (21 sections, 28 equations, 2 figures, 3 tables)

This paper contains 21 sections, 28 equations, 2 figures, 3 tables.

Figures (2)

  • Figure 1: The figure shows the results of SDP optimization. On the $x$ axis we have the acceptance level as a parameter $Q$ and on the $y$ axis we have the probability $\mathbb{P}$ of key compliance for Alice and Bob (dashed red line) and for Eve and Alice (or Bob) (solid blue line).
  • Figure 2: Binary symmetric channel scheme.