Picture-perfect Quantum Key Distribution

Abstract

We provide a new way to bound the security of quantum key distribution using only two high-level, diagrammatic features of quantum processes: the compositional behavior of complementary measurements and the essential uniqueness of purification. We begin by demonstrating a proof in the simplest case, where the eavesdropper doesn't noticeably disturb the channel at all and has no quantum memory. We then show how this approach extends straightforwardly to account for an eavesdropper with quantum memory and the presence of noise.

10 pages, many string diagrams

References in corpus (5)

• Quantum Key Distribution over 67 km with a plug & play system
• Quantum cryptography with finite resources: unconditional security bound for discrete-variable protocols with one-way post-processing
• Lower and upper bounds on the secret key rate for QKD protocols using one--way classical communication
• Security of quantum key distribution with arbitrary individual imperfections
• Paschke Dilations

Cited by in corpus (4)

• Parallel Self-Testing of the GHZ State with a Proof by Diagrams
• Dagger and Dilation in the Category of Von Neumann algebras
• Categorical composable cryptography
• Categorical composable cryptography: extended version