Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2603.08204

A Bipartite Quantum Key Distribution Protocol Based on Indefinite Causal Order

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

quant-phcs.CRSubmitted Mar 9, 2026• Announced Mar 10, 2026• 2 citations
arXivHTMLPDF

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

Indefinite causal key distribution

Hector Spencer-Wood

Abstract We propose a quantum key distribution (QKD) protocol that is carried out in an indefinite causal order (ICO). In QKD, one considers a setup in which two parties, Alice and Bob, share a key with one another in such a way that they can detect whether an eavesdropper, Eve, has learnt anything about the key. To our knowledge, in all QKD protocols proposed until now, Eve is detected by publicly comparing a subset of Alice and Bob’s key and checking for errors. We find that a consequence of our protocol is that it is possible to detect eavesdroppers without publicly comparing any information about the key. Indeed, we prove that it is not possible for eavesdroppers, performing any individual attack, to extract useful information about the shared key without inducing a nonzero probability of being detected. We also prove the security of this protocol against a class of individual eavesdropping attacks. The role ICO plays in causing unusual phenomena in quantum technologies is an important question. By considering it we find a two-way QKD protocol that exhibits a similar private detection feature, albeit with some interesting differences. After noting some implications of these differences and discussing some of the practicalities of our protocol, we conclude that this work is best considered as a first step in applying quantum cryptographic ideas in an ICO.

arXiv:2303.03893•Journal of Physics A Mathematical and Theoretical•Nov 11, 2025•10 citations

Proof-of-Principle Implementation of Quantum Key Distribution in an Indefinite Causal Order

Yann Valibouse, Martí Cladera-Rosselló, Michael Antesberger +6 more

In quantum physics, the order in which different operations occur can be placed in superposition. The resulting processes have an indefinite causal order, which is of fundamental interest and can be viewed as a novel quantum resource enabling new protocols. Here, we report an experimental proof-of-principle implementation of one such protocol, where we perform BB84-like quantum cryptography by placing \AB's measurement-and-preparation operations in a photonic quantum SWITCH. By embedding \AB\ within the quantum SWITCH, the protocol achieves an average eavesdropper detection probability of $0.15 \pm 0.02$ per shared qubit, with eavesdropper detection performed through measurements of the control qubit rather than comparing the key. Unlike standard BB84 and related schemes, which detect eavesdropping by publicly revealing and discarding a fraction of the raw key, our approach requires no disclosure of key material: every retained qubit can, in principle, be tested for eavesdropping while remaining available for key generation. Although the present implementation does not yet constitute a secure quantum key distribution protocol, owing to post-selection required for measurements within the quantum SWITCH, it provides a proof of principle that indefinite causal order can be exploited to detect eavesdropping without sacrificing key bits.

quant-pharXiv:2608.13561•Entropy•Aug 14, 2026•0 citations

Semi-Device-Independent Certification of Causal Nonseparability with Trusted Quantum Inputs

Hippolyte Dourdent, Alastair A. Abbott, Nicolas Brunner +2 more

While the standard formulation of quantum theory assumes a fixed background causal structure, one can relax this assumption within the so-called process matrix framework. Remarkably, some processes, termed causally nonseparable, are incompatible with a definite causal order. We explore a form of certification of causal nonseparability in a semi-device-independent scenario where the involved parties receive trusted quantum inputs, but whose operations are otherwise uncharacterized. Defining the notion of causally nonseparable distributed measurements, we show that certain causally nonseparable processes that cannot violate any causal inequality, including the canonical example of the quantum switch, can generate noncausal correlations in such a scenario. Moreover, by imposing some further natural structure to the untrusted operations, we show that all bipartite causally nonseparable process matrices can be certified with trusted quantum inputs.

arXiv:2107.10877•Physical Review Letters•Aug 24, 2022•17 citations

Shared entanglement for three-party causal order guessing game

Ryszard Kukulski, Paulina Lewandowska, Karol Życzkowski

Abstract In a variant of communication tasks, players cooperate in choosing their local strategies to compute a given task later, working separately. Utilizing quantum bits for communication and sharing entanglement between parties is a recognized method to enhance performance in these situations. In this work, we introduce the game for which three parties, Alice, Bob and Charlie, would like to discover the hidden order in which they make the moves. We show the advantage of quantum strategies that use shared entanglement and local operations over classical setups for discriminating operations’ composition order. The role of quantum resources improving the probability of successful discrimination is also investigated. Our research provides a basis for examining computational model featuring a specific gate set while examining the diverse operations achievable through permutations of its elements.

arXiv:2409.19762•New Journal of Physics•Jan 1, 2025•1 citation

Biased Non-Causal Game

Some Sankar Bhattacharya, Manik Banik

The standard formulation of quantum theory assumes that events are ordered is a background global causal structure. Recently in Ref.[$\href{http://www.nature.com/ncomms/journal/v3/n10/full/ncomms2076.html}{Nat. Commun. {\bf3}, 1092 (2012)}$], the authors have developed a new formalism, namely, the \emph{process matrix} formalism, which is locally in agreement with quantum physics but assumes no global causal order. They have further shown that there exist \emph{non-causal} correlations originating from \emph{inseparable} process matrices that violate a \emph{causal inequality} (CI) derived under the assumption that events are ordered with respect to some global causal relation. This CI can be understood as a guessing game, where two separate parties, say Alice and Bob, generate random bits (say input bit) in their respective local laboratories. Bob generates another random bit (say decision bit) which determines their goal: whether Alice has to guess Bob's bit or vice-verse. Here we study this causal game but with biased bits and derive a biased causal inequality (BCI). We then study the possibility of violation of this BCI by inseparable process matrices. Interestingly, we show that there exist \emph{inseparable} qubit process matrices that can be used to violate the BCI for an arbitrary bias in the decision bit. In such scenario, we also derive the maximal violation of the BCI under local operations involving traceless binary observables. However, for biased input bits, we find that there is a threshold bias beyond which no valid qubit process matrix can be used to violate the causal inequality under \emph{measurement-repreparation} type operation.

arXiv:1509.02721•Sep 9, 2015•6 citations

Classical communication through quantum causal structures

Kaumudibikash Goswami, Fabio Costa

Quantum mechanics allows operations to be in indefinite causal order, leading to advantages in computational and communication tasks. However, basic notions such as communication capacity have not yet been formalized. In light of this, through the process matrix formalism, we formulate different classical capacities for a bipartite quantum process. For one-way communication, we find that general quantum processes satisfy a generalization of the Holevo bound, i.e., we can send, at most, one bit per qubit. The result also holds for processes with indefinite causal order and with shared entanglement between the sender and the receiver. We further extend known bounds to classical channel capacities, showing that general processes cannot outperform causally separable ones. Next, we study bidirectional communication through a causally separable process. Our result shows that a bidirectional protocol cannot exceed the limit of a one-way communication protocol. Finally, we generalize this result to a multiparty broadcast communication protocol through a definite ordered process.

arXiv:2007.05051•Physical Review A•Apr 12, 2021•11 citations
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 ∼14.65%\sim14.65\%∼14.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.
Abstract We propose a quantum key distribution (QKD) protocol that is carried out in an indefinite causal order (ICO). In QKD, one considers a setup in which two parties, Alice and Bob, share a key with one another in such a way that they can detect whether an eavesdropper, Eve, has learnt anything about the key. To our knowledge, in all QKD protocols proposed until now, Eve is detected by publicly comparing a subset of Alice and Bob’s key and checking for errors. We find that a consequence of our protocol is that it is possible to detect eavesdroppers without publicly comparing any information about the key. Indeed, we prove that it is not possible for eavesdroppers, performing any individual attack, to extract useful information about the shared key without inducing a nonzero probability of being detected. We also prove the security of this protocol against a class of individual eavesdropping attacks. The role ICO plays in causing unusual phenomena in quantum technologies is an important question. By considering it we find a two-way QKD protocol that exhibits a similar private detection feature, albeit with some interesting differences. After noting some implications of these differences and discussing some of the practicalities of our protocol, we conclude that this work is best considered as a first step in applying quantum cryptographic ideas in an ICO.
In quantum physics, the order in which different operations occur can be placed in superposition. The resulting processes have an indefinite causal order, which is of fundamental interest and can be viewed as a novel quantum resource enabling new protocols. Here, we report an experimental proof-of-principle implementation of one such protocol, where we perform BB84-like quantum cryptography by placing \AB's measurement-and-preparation operations in a photonic quantum SWITCH. By embedding \AB\ within the quantum SWITCH, the protocol achieves an average eavesdropper detection probability of 0.15±0.020.15 \pm 0.020.15±0.02 per shared qubit, with eavesdropper detection performed through measurements of the control qubit rather than comparing the key. Unlike standard BB84 and related schemes, which detect eavesdropping by publicly revealing and discarding a fraction of the raw key, our approach requires no disclosure of key material: every retained qubit can, in principle, be tested for eavesdropping while remaining available for key generation. Although the present implementation does not yet constitute a secure quantum key distribution protocol, owing to post-selection required for measurements within the quantum SWITCH, it provides a proof of principle that indefinite causal order can be exploited to detect eavesdropping without sacrificing key bits.
While the standard formulation of quantum theory assumes a fixed background causal structure, one can relax this assumption within the so-called process matrix framework. Remarkably, some processes, termed causally nonseparable, are incompatible with a definite causal order. We explore a form of certification of causal nonseparability in a semi-device-independent scenario where the involved parties receive trusted quantum inputs, but whose operations are otherwise uncharacterized. Defining the notion of causally nonseparable distributed measurements, we show that certain causally nonseparable processes that cannot violate any causal inequality, including the canonical example of the quantum switch, can generate noncausal correlations in such a scenario. Moreover, by imposing some further natural structure to the untrusted operations, we show that all bipartite causally nonseparable process matrices can be certified with trusted quantum inputs.
Abstract In a variant of communication tasks, players cooperate in choosing their local strategies to compute a given task later, working separately. Utilizing quantum bits for communication and sharing entanglement between parties is a recognized method to enhance performance in these situations. In this work, we introduce the game for which three parties, Alice, Bob and Charlie, would like to discover the hidden order in which they make the moves. We show the advantage of quantum strategies that use shared entanglement and local operations over classical setups for discriminating operations’ composition order. The role of quantum resources improving the probability of successful discrimination is also investigated. Our research provides a basis for examining computational model featuring a specific gate set while examining the diverse operations achievable through permutations of its elements.
The standard formulation of quantum theory assumes that events are ordered is a background global causal structure. Recently in Ref.[\href\href{http://www.nature.com/ncomms/journal/v3/n10/full/ncomms2076.html}{Nat. Commun. {\bf3}, 1092 (2012)}\href], the authors have developed a new formalism, namely, the \emph{process matrix} formalism, which is locally in agreement with quantum physics but assumes no global causal order. They have further shown that there exist \emph{non-causal} correlations originating from \emph{inseparable} process matrices that violate a \emph{causal inequality} (CI) derived under the assumption that events are ordered with respect to some global causal relation. This CI can be understood as a guessing game, where two separate parties, say Alice and Bob, generate random bits (say input bit) in their respective local laboratories. Bob generates another random bit (say decision bit) which determines their goal: whether Alice has to guess Bob's bit or vice-verse. Here we study this causal game but with biased bits and derive a biased causal inequality (BCI). We then study the possibility of violation of this BCI by inseparable process matrices. Interestingly, we show that there exist \emph{inseparable} qubit process matrices that can be used to violate the BCI for an arbitrary bias in the decision bit. In such scenario, we also derive the maximal violation of the BCI under local operations involving traceless binary observables. However, for biased input bits, we find that there is a threshold bias beyond which no valid qubit process matrix can be used to violate the causal inequality under \emph{measurement-repreparation} type operation.
Quantum mechanics allows operations to be in indefinite causal order, leading to advantages in computational and communication tasks. However, basic notions such as communication capacity have not yet been formalized. In light of this, through the process matrix formalism, we formulate different classical capacities for a bipartite quantum process. For one-way communication, we find that general quantum processes satisfy a generalization of the Holevo bound, i.e., we can send, at most, one bit per qubit. The result also holds for processes with indefinite causal order and with shared entanglement between the sender and the receiver. We further extend known bounds to classical channel capacities, showing that general processes cannot outperform causally separable ones. Next, we study bidirectional communication through a causally separable process. Our result shows that a bidirectional protocol cannot exceed the limit of a one-way communication protocol. Finally, we generalize this result to a multiparty broadcast communication protocol through a definite ordered process.