🤖 AI Summary
This work addresses the performance limitations of traditional quantum key distribution (QKD) protocols imposed by fixed causal order, which hinder optimal exploitation of quantum resources. For the first time, indefinite causal order is introduced into QKD through a bipartite trusted protocol formulated within the process matrix framework. By leveraging causally nonseparable resources and local quantum operations, the protocol generates a shared secret key via a causal-order guessing game. This approach transcends the constraints of classical causal structures and substantially enhances the raw key matching probability, achieving a bit matching rate of 85.35% (corresponding to a quantum bit error rate of approximately 14.65%) in a noiseless channel. The scheme remains compatible with standard forward error correction techniques, thereby establishing a novel paradigm for efficient and secure quantum communication.
📝 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.