Quantum channels as a categorical completion
Mathieu Huot, Sam Staton

TL;DR
This paper establishes a categorical framework connecting pure and mixed quantum states using distributive monoidal categories, showing that quantum channels form a canonical completion of pure quantum operations, and extends this to topological settings.
Contribution
It introduces a categorical foundation for quantum channels as a completion of pure operations and generalizes it to topological contexts.
Findings
Quantum channels form a canonical completion of pure quantum operations.
The category of completely positive trace-preserving maps is a completion of vector spaces and isometries.
The operator norm topology on quantum channels is induced by the norm topology on isometries.
Abstract
We propose a categorical foundation for the connection between pure and mixed states in quantum information and quantum computation. The foundation is based on distributive monoidal categories. First, we prove that the category of all quantum channels is a canonical completion of the category of pure quantum operations (with ancilla preparations). More precisely, we prove that the category of completely positive trace-preserving maps between finite-dimensional C*-algebras is a canonical completion of the category of finite-dimensional vector spaces and isometries. Second, we extend our result to give a foundation to the topological relationships between quantum channels. We do this by generalizing our categorical foundation to the topologically-enriched setting. In particular, we show that the operator norm topology on quantum channels is the canonical topology induced by the norm…
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
TopicsAdvanced Operator Algebra Research · Homotopy and Cohomology in Algebraic Topology · Algebraic structures and combinatorial models
Quantum channels as a categorical completion
Mathieu Huot
University of Oxford, UK
Sam Staton
University of Oxford, UK
Abstract
We propose a categorical foundation for the connection between pure and mixed states in quantum information and quantum computation. The foundation is based on distributive monoidal categories.
First, we prove that the category of all quantum channels is a canonical completion of the category of pure quantum operations (with ancilla preparations). More precisely, we prove that the category of completely positive trace-preserving maps between finite-dimensional C*-algebras is a canonical completion of the category of finite-dimensional vector spaces and isometries.
Second, we extend our result to give a foundation to the topological relationships between quantum channels. We do this by generalizing our categorical foundation to the topologically-enriched setting. In particular, we show that the operator norm topology on quantum channels is the canonical topology induced by the norm topology on isometries.
I Introduction
A popular explanation of quantum theory says that, in reality, everything is reversible (“pure quantum”), but conceptually we can hide and prepare things, and this is what leads to classical data, randomness and perceived irreversibility (“full quantum”). In this paper we explain the passage from theories of pure quantum to theories of full quantum in terms of categorical completions.
We test this passage in several ways:
- •
Starting from pure quantum with preparations (isometries), we recover quantum channels (completely positive maps between C*-algebras) as a completion with hiding — this is our main result (Thm. V.6);
- •
Starting from pure quantum (unitaries), we recover preparation of ancillas (isometries) as a completion with preparations (Thm. III.3);
- •
Also starting from pure quantum (unitaries), we recover finite non-commutative geometry (finite-dimensional C*-algebras and -homomorphisms) as a different completion (Thm. IV.10);
- •
Starting from topologies on the isometries, we recover topologies on quantum channels as a completion (Thm. VI.8).
All these require slightly different kinds of completion, and in this introduction we discuss the kinds of categories and completion at hand. First we consider the pure situation (§I-A), then preparation of states (§I-B), and finally hiding of states (§I-C) and topology (§I-D). In what follows we use categorical terminology, but the casual reader may prefer the following informal picture of our main result.
admit **hidingPure quantum + preparationsQuantum channels\forall$$\exists!
Informally, the outer ellipse contains all the possible theories, including pure quantum theory with preparations. The inner circle contains the theories that admit hiding. Our main result is that of all the theories that admit hiding, quantum channels are the ‘closest’ to pure quantum with preparations. This notion of ‘closeness’ will be made precise using category theory.
In [21] we presented a similar paradigm for the restricted version of quantum channels between matrix algebras. We proved that those quantum channels are the affine completion of the category of isometries, both seen as monoidal categories. We go further here by considering all finite dimensional C*-algebras which amounts to handling classical data.
I-A Rudiments of pure / reversible computing
Before moving to categorical side, we recall some rudiments of reversible computing, which is one perspective on pure quantum theory. The basic idea is that a classical reversible operation on an -level system is a bijection on the natural number considered as a finite set. A quantum reversible operation is an complex matrix that is unitary. But the reader unfamiliar with quantum theory can focus on the classical setting for now, because every bijection can be thought of as a unitary matrix valued in . For example, there are two reversible classical operations on bits , identity and negation, and a reversible 2-bit operation is a bijection . The natural numbers form a rig (aka semiring) under addition and multiplication, and we find a simple calculus for building reversible operations by noticing that the bijections and unitaries can be composed but also they can be combined according to these rig operations. Here we write and instead of and to emphasise their categorical nature.
- •
The multiplication of numbers corresponds to spatial juxtaposition of systems. For example, given two bijections on a bit, , we have a bijection on on two bits. In terms of matrices, this is the Kronecker product.
- •
The addition of numbers allows for conditional operations. Recall that most of the traditional logical operations are not reversible, however, it is possible to perform reversible controlled operations if the condition is kept. In terms of matrices, this is the block diagonal matrix. For example, the controlled-not gate is a bijection . Generally, given two unitaries , we can build a unitary . Since , we can think of as an operation that will either apply or to depending on the state of the first qubit, which is retained.
The unit represents a system with no levels. There is only one classical bijection , but in quantum computation, the unitaries correspond to angles in the interval , known as ‘global phase’. Here the addition plays a further role, since the unitary is called the -gate. The controlled gates can be used to induce quantum entanglement in the product . For example, consider the following circuit, which is a quantum Fourier transform on three qubits. It is a graphical notation for a unitary . Vertical juxtaposition is ; horizontal juxtaposition is composition of unitaries. The first gate is the Hadamard unitary gate, the next is a controlled gate ; the final gate is the swap gate which amounts to the symmetry of .
[TABLE]
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] S. Abramsky and B. Coecke, “A categorical semantics of quantum protocols,” in Proc. LICS 2004 , 2004.
- 2[2] S. Abramsky and C. Heunen, “H*-algebras and nonunital Frobenius algebras: first steps in infinite-dimensional categorical quantum mechanics,” in Proc. Clifford Lectures . AMS, 2008.
- 3[3] R. Adams, “QPEL: Quantum programming and effect language,” in Proc. QPL 2014 , 2014.
- 4[4] M. Amini, G. A. Elliott, and N. Golestani, “The category of Bratteli diagrams,” Can. J. Math.–J. Can. Math. 67 , vol. 67, pp. 990–1023, 2015.
- 5[5] M. Backens, “The ZX-calculus is complete for stabilizer quantum mechanics,” New Journal of Physics , vol. 16, no. 9, p. 093021, 2014.
- 6[6] O. Bratteli, “Inductive limits of finite dimensional C*-algebras,” Transactions of the American Mathematical Society , vol. 171, pp. 195–234, 1972.
- 7[7] T. Carette, E. Jeandel, S. Perdrix, and R. Vilmart, “Completeness of graphical languages for mixed states quantum mechanics,” ar Xiv preprint ar Xiv:1902.07143 , 2019.
- 8[8] G. Chiribella, G. M. D’Ariano, and P. Perinotti, “Probabilistic theories with purification,” Phys. Rev. A , vol. 81, 2010.
