Circulant Quantum Channels

• Circulant quantum channels are completely positive trace-preserving maps exhibiting cyclic symmetry with explicit links to circulant matrix algebras and representation theory.
• Their structure allows precise characterization of quantum capacities, including zero-error capacity quantified via the Lovász theta number and semidefinite programming.
• They serve as analytical models in quantum transport, decoherence, and dissipative dynamics, offering clear insights into quantum thermodynamics and resource theories.

Circulant quantum channels are completely positive trace-preserving (CPTP) maps on finite-dimensional Hilbert spaces, distinguished by their invariance under cyclic group actions and their intimate relationship with circulant matrix algebras, representation theory, and quantum information measures. This class encompasses several central families—mixed-unitary channels generated by cyclic shifts, Weyl-diagonal channels, and block-circulant quantum Markov semigroups—each admitting explicit characterization due to the underlying group symmetry. Their applications range from quantum zero-error capacity and coherence theory to explicit models of decoherence, transport, and entropy production in open quantum systems.

1. Algebraic and Structural Definitions

A canonical circulant quantum channel $\Phi$ on $\mathbb{C}^n$ is defined by a convex combination of cyclic shifts:

$$\Phi(\rho) = \sum_{k=0}^{n-1} p_k\, U^k\, \rho\, (U^k)^\dagger\,, \qquad U = \sum_{i=1}^n |i\oplus1\rangle\langle i|$$

where $p_k \ge 0$, $\sum_k p_k = 1$, and $\oplus$ denotes addition mod $n$ (Xie et al., 23 Jan 2026). The Kraus representation is

$$K_k = \sqrt{p_k}\, U^k, \qquad \sum_{k=0}^{n-1} K_k^\dagger K_k = I\,.$$

A matrix $X\in \mathcal{M}_n(\mathbb{C})$ is circulant if $X_{i,j} = c_{j\ominus i}$ for some vector $\mathbb{C}^n$0. Every circulant matrix commutes with each $\mathbb{C}^n$1. The image of $\mathbb{C}^n$2 coincides exactly with the set of circulant matrices, and $\mathbb{C}^n$3 is idempotent ($\mathbb{C}^n$4) and unital.

For multipartite systems, the class of Weyl-diagonal channels generalizes circulant symmetry: for $\mathbb{C}^n$5,

$\mathbb{C}^n$6

where $\mathbb{C}^n$7 are the single-qudit Weyl operators and the coefficients $\mathbb{C}^n$8 encode the channel parameters; complete positivity and trace-preservation impose specific Fourier-analytic constraints (Basile et al., 2023).

2. Zero-Error Capacity and Circulant Graph-Induced Channels

In a foundational framework, the action of a circulant quantum channel can be derived from an orthonormal representation (OOR) of a circulant graph $\mathbb{C}^n$9, with $$\Phi(\rho) = \sum_{k=0}^{n-1} p_k\, U^k\, \rho\, (U^k)^\dagger\,, \qquad U = \sum_{i=1}^n |i\oplus1\rangle\langle i|$$0 specified by (equal-sized) cyclotomic cosets. The OOR is generated via a "shift" unitary $$\Phi(\rho) = \sum_{k=0}^{n-1} p_k\, U^k\, \rho\, (U^k)^\dagger\,, \qquad U = \sum_{i=1}^n |i\oplus1\rangle\langle i|$$1 and the eigenbasis of the adjacency matrix $$\Phi(\rho) = \sum_{k=0}^{n-1} p_k\, U^k\, \rho\, (U^k)^\dagger\,, \qquad U = \sum_{i=1}^n |i\oplus1\rangle\langle i|$$2. The induced classical-quantum (CQ) channel maps $$\Phi(\rho) = \sum_{k=0}^{n-1} p_k\, U^k\, \rho\, (U^k)^\dagger\,, \qquad U = \sum_{i=1}^n |i\oplus1\rangle\langle i|$$3, with $$\Phi(\rho) = \sum_{k=0}^{n-1} p_k\, U^k\, \rho\, (U^k)^\dagger\,, \qquad U = \sum_{i=1}^n |i\oplus1\rangle\langle i|$$4 obtained from $$\Phi(\rho) = \sum_{k=0}^{n-1} p_k\, U^k\, \rho\, (U^k)^\dagger\,, \qquad U = \sum_{i=1}^n |i\oplus1\rangle\langle i|$$5 acting on an initial vector dependent on the spectrum of $$\Phi(\rho) = \sum_{k=0}^{n-1} p_k\, U^k\, \rho\, (U^k)^\dagger\,, \qquad U = \sum_{i=1}^n |i\oplus1\rangle\langle i|$$6 (Lai et al., 2015).

The one-shot zero-error capacity $$\Phi(\rho) = \sum_{k=0}^{n-1} p_k\, U^k\, \rho\, (U^k)^\dagger\,, \qquad U = \sum_{i=1}^n |i\oplus1\rangle\langle i|$$7, for a CQ channel $$\Phi(\rho) = \sum_{k=0}^{n-1} p_k\, U^k\, \rho\, (U^k)^\dagger\,, \qquad U = \sum_{i=1}^n |i\oplus1\rangle\langle i|$$8 assisted by quantum nonsignalling correlations, is given by

$$\Phi(\rho) = \sum_{k=0}^{n-1} p_k\, U^k\, \rho\, (U^k)^\dagger\,, \qquad U = \sum_{i=1}^n |i\oplus1\rangle\langle i|$$9

where $p_k \ge 0$0 is the optimal value of a semidefinite program (SDP) depending only on the Kraus operators. For these circulant CQ channels, $p_k \ge 0$1 equals the Lovász $p_k \ge 0$2 number of the underlying graph. Thus, the asymptotic zero-error capacity is

$p_k \ge 0$3

imparting an operational meaning to the Lovász number as the ultimate classical-quantum zero-error capacity under maximally permissive (nonsignalling) assistance.

Table: Zero-Error Capacity for Selected Circulant Graphs

Graph Type	$p_k \ge 0$4	Asymptotic Capacity $p_k \ge 0$5
Cycle $p_k \ge 0$6 (odd $p_k \ge 0$7)	$p_k \ge 0$8	$p_k \ge 0$9
Paley $\sum_k p_k = 1$0 ($\sum_k p_k = 1$1)	$\sum_k p_k = 1$2	$\sum_k p_k = 1$3
Cubic-residue $\sum_k p_k = 1$4 ($\sum_k p_k = 1$5)	see main text	$\sum_k p_k = 1$6 (no closed form)

These results apply for graphs including cycle, Paley, and cubic-residue graphs arising from cyclotomic coset constructions (Lai et al., 2015).

3. Circulant Quantum Markov Semigroups and Dissipation

A circulant quantum Markov semigroup (qms) on $\sum_k p_k = 1$7 is generated by a Gorini–Kossakowski–Sudarshan–Lindblad (GKSL) form with Lindblad operators $\sum_k p_k = 1$8, $\sum_k p_k = 1$9, $\oplus$0, and $\oplus$1 the primary shift unitaries (Bolaños-Servín et al., 2012).

The generator $\oplus$2, with

$\oplus$3

is block-circulant with circulant blocks. This structure enables explicit diagonalization and a cycle decomposition directly analogous to Markov chains. The entropy production rate (QEPR) for the stationary state $\oplus$4 is

$\oplus$5

The vanishing of QEPR characterizes quantum detailed balance ($\oplus$6 for all $\oplus$7), while positive QEPR quantifies nonequilibrium dissipation.

A plausible implication is that circulant qms, due to their analytical tractability, serve as minimal models for quantum transport, heat engines, and decoherence phenomena exhibiting periodic symmetries.

4. Weyl-Diagonal and Component-Erasing Channels

Weyl-diagonal channels, defined on $\oplus$8 as

$\oplus$9

admit full characterization via their Choi matrices, which are block-circulant and diagonalized by the discrete Fourier transform. Complete positivity requires the Fourier transforms of the $n$0 coefficients be non-negative (Basile et al., 2023). The set of such channels is convex, and its extreme points are precisely the conjugations by Weyl operators.

A subclass, "component-erasing channels" (Editor's term), erase all but a specified subgroup of Weyl components, and are fully classified by additive subgroups of the label group $n$1 and associated group homomorphisms. The set of component-erasing channels forms a semigroup under composition, and minimal generating sets correspond to codimension-one subgroups with linear characters.

5. Entanglement-Breaking Property and Operational Implications

Among all mixed-unitary circulant channels $n$2, only the uniform twirl ($n$3) is entanglement-breaking (Xie et al., 23 Jan 2026). Its Choi matrix is separable and, in low dimensions, positive under partial transpose (PPT). The uniform circulant channel projects any input to a convex combination of basis projectors, completely erasing quantum correlations.

In quantum resource theories, $n$4 is an incoherent operation in the computational basis, and the $n$5-norm coherence of a state satisfies

$n$6

with explicit closed-form expressions for the output. Further, the circulant channel attains extremal values of high-order Bargmann invariants, connecting matrix symmetries to phases in quantum interference.

6. Connections to Perfect State Transfer and Circulant Spin Networks

Circulant graphs arise in spin network models supporting perfect state transfer (PST). For a weighted circulant on $n$7 vertices, PST exists if and only if $n$8 is even and special conditions on the weights hold, reducible to a statement about integrality of the eigenvalues: all eigenvalues must be integers, and odd weights must occur at divisors $n$9 or $$K_k = \sqrt{p_k}\, U^k, \qquad \sum_{k=0}^{n-1} K_k^\dagger K_k = I\,.$$0, all others divisible by $$K_k = \sqrt{p_k}\, U^k, \qquad \sum_{k=0}^{n-1} K_k^\dagger K_k = I\,.$$1 (Bašić, 2011). This spectral rigidity reflects the high symmetry and algebraic structure underlying circulant quantum channels, constraining dynamical and information-theoretic capacities.

7. Physical Interpretations and Future Perspectives

Circulant quantum channels serve as prototypical models in quantum information theory—both as idealizations capturing maximal symmetry (e.g., uniform mixing, decoherence, symmetry reduction) and as analytically tractable systems for exploring fundamental limits (such as zero-error capacity or entropy production). Their explicit connection to the Lovász theta number provides a precise graph-theoretic measure of quantum channel capacity under optimal correlations, yielding direct operational meaning to previously abstract parameters (Lai et al., 2015).

A plausible implication is that further generalization to inhomogeneous or higher-dimensional cyclic group actions, as well as their interplay with local and global invariants, will yield deeper insight into robust quantum communication and error correction in symmetric environments, with potential applications to networked quantum systems, dissipative engineering, and quantum thermodynamics.