Diagrammatic security proof for 8-state encoding
Boris Skoric, Zef Wolffs

TL;DR
This paper extends diagrammatic quantum security proofs from 6-state to 8-state encoding, providing a visual and formal framework for analyzing quantum key distribution protocols beyond mutually unbiased bases.
Contribution
It introduces an extended diagrammatic security proof for 8-state quantum encoding, broadening the applicability of visual quantum security analysis.
Findings
Extended diagrammatic proof to 8-state encoding
Applicable to protocols with non-mutually unbiased bases
Supports quantum key recycling protocols
Abstract
Dirac notation is the most common way to describe quantum states and operations on states. It is very convenient and allows for quick visual distinction between vectors, scalars and operators. For quantum processes that involve interactions of multiple systems an even better visualisation has been proposed by Coecke and Kissinger, in the form of a diagrammatic formalism [CK2017]. Their notation expresses formulas in the form of diagrams, somewhat similar to Feynman diagrams, and is more general than the circuit notation for quantum computing. This document consists of two parts. (1) We give a brief summary of the diagrammatic notation of quantum processes, tailored to readers who already know quantum physics and are not interested in general process theory. For this audience our summary is less daunting than the encyclopaedic book by Coecke and Kissinger [CK2017], and on the other…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications
