
TL;DR
This paper introduces a unified framework for quantum relations, including noncommutative graphs, to interpret quantum error correction and channel confusability, encompassing classical, quantum, and mixed systems with superselection rules.
Contribution
It provides a new perspective on quantum relations, characterizes quantum error correction conditions, and extends the theory to systems with superselection rules.
Findings
Interprets Knill-Laflamme conditions via graph-theoretic independence
Characterizes noncommutative graph homomorphisms and bipartite graphs
Defines noncommutative confusability graphs for systems with superselection rules
Abstract
The "noncommutative graphs" which arise in quantum error correction are a special case of the quantum relations introduced in [N. Weaver, Quantum relations, Mem. Amer. Math. Soc. 215 (2012), v-vi, 81-140]. We use this perspective to interpret the Knill-Laflamme error-correction conditions [E. Knill and R. Laflamme, Theory of quantum error-correcting codes, Phys. Rev. A 55 (1997), 900-911] in terms of graph-theoretic independence, to give intrinsic characterizations of Stahlke's noncommutative graph homomorphisms [D. Stahlke, Quantum source-channel coding and non-commutative graph theory, arXiv:1405.5254] and Duan, Severini, and Winter's noncommutative bipartite graphs [R. Duan, S. Severini, and A. Winter, Zero-error communication via quantum channels, noncommutative graphs, and a quantum Lovasz number, IEEE Trans. Inform. Theory 59 (2013), 1164-1174], and to realize the noncommutative…
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.
