Graphical Methods in Device-Independent Quantum Cryptography
arXiv:1705.09213 · doi:10.22331/q-2019-05-27-146
Abstract
We introduce a framework for graphical security proofs in device-independent quantum cryptography using the methods of categorical quantum mechanics. We are optimistic that this approach will make some of the highly complex proofs in quantum cryptography more accessible, facilitate the discovery of new proofs, and enable automated proof verification. As an example of our framework, we reprove a previous result from device-independent quantum cryptography: any linear randomness expansion protocol can be converted into an unbounded randomness expansion protocol. We give a graphical proof of this result, and implement part of it in the Globular proof assistant.
arXiv commentPublishable version. Diagrams have been polished, minor revisions to the text, and an appendix added with supplementary proofs
References in corpus (11)
- Random Numbers Certified by Bell's Theorem
- A survey of graphical languages for monoidal categories
- Experimentally Generated Randomness Certified by the Impossibility of Superluminal Signals
- Security of practical private randomness generation
- Trevisan's extractor in the presence of quantum side information
- Simple and tight device-independent security proofs
- Security and Composability of Randomness Expansion from Bell Inequalities
- The Topology of Quantum Algorithms
- Superdense Coding with GHZ and Quantum Key Distribution with W in the ZX-calculus
- Chasing diagrams in cryptography
- Compactly accessible categories and quantum key distribution