Papers for

quantum error correction developers

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Fermionic systems show surprising limits on quantum information transmission

Nonadditivity in fermionic quantum Shannon theory

Abstract: We study collective state preparation and channel encoding in fermionic systems under parity superselection and composition governed by the canonical anticommutation relations. For a two-mode Gaussian state $τ$, we obtain the exact entanglement of formation, $E_{\mathrm F}^{\mathrm{phys}}(τ^{\otimes m})=\lceil m/2\rceil\log2$ for every $m\geq1$. Two copies have the same formation value as one, violating additivity and strong superadditivity, while regularization halves the single-copy value. For an associated Gaussian channel, we determine the minimum output entropy and Holevo information at every blocklength and prove nonadditivity of both. Together, these results give exact answers to the fermionic counterparts of the four additivity questions associated with Shor and Hastings. One physical use carries no classical information, whereas two uses transmit one bit perfectly. The unassisted classical and zero-error classical capacities both equal one half bit per mode. A sharp finite-block bound gives a strong converse: the decoding success probability vanishes at every rate above capacity. These optimizations cover all physical pure-state decompositions and channel inputs, with Gaussian ensembles and classical codes attaining the optima. The formation and minimum output entropy formulas hold for every Rényi order $α\in(0,\infty]$. We also determine the unassisted quantum and zero-error quantum capacities, both equal to one half logical qubit per mode, and prove a strong converse: entanglement fidelity vanishes at every rate above capacity. For a noisy Gaussian family, we determine the one- and two-copy formation values and prove strict nonadditivity at full rank. For $τ$, Bell violation under local parity-preserving measurements first appears at three copies.

Mon 5 OctInformation Theory
The gist
This paper explores how information is stored and sent using particles called fermions, which follow special rules unlike other quantum particles. The authors discovered that using two copies of a simple quantum state can be more powerful than expected, breaking normal assumptions about how information and entanglement add up. They also found exact limits on how much information can be sent and how well it can be preserved, proving some strong no-go limits when pushing beyond these capacities. These findings give precise answers to complex questions about information handling in fermionic quantum systems.
Open → 2610.06758v1

New methods enable efficient quantum error correction codes and magic state preparation

Sipser-Spielman meets Dijkgraaf-Witten: non-Abelian qLDPC codes via twisted sheaf gauge theory and almost-constant-overhead magic state fountain

Abstract: Sipser-Spielman codes and Dijkgraaf-Witten twisted gauge theories are among the most profound ideas in the last few decades in the areas of computer science and mathematical physics respectively. This work unifies them in the same framework using the language of sheaf cohomology, and produces a new framework of twisted sheaf guage theories describing a class of quantum low-density parity-check (qLDPC) codes with non-Abelian $D_4$ topological order. The corresponding twisted qLDPC code can be obtained from gauging a new type of 0-form sub-complex $\mathbb{Z}_2^3$ symmetry from a qLDPC code defined on a sheaf complex, and can be interpreted as a topological defect network of non-Abelain $D_4$ patches glued together with proper gapped interfaces. As an application, one can use this to realize a \textit{magic state fountain} via the gauging measurement of the addressable logical CZ gates as 0-form subcomplex symmetries in a 2D hypergraph-product on a sheaf complex. This includes a scheme of subdividing an arbitrary constant-rate 2D hypergraph-product code with parameter $[[n,Θ(n), Ω(n^{1/2})]]$ into a quantum sheaf code which allows preparation of $Θ(n^{1/2})$ in parallel, equivalent to the recent geometric construction using the code-to-manifold mapping in (arXiv:2601.06736). Moreover, using the recent sheaf complex and algebraic code constructions by Golowich-Tamo-Zhu (arXiv:2609.27801) with parameter $[[n,Θ(n^{1-ε}), Ω(n^{(1-ε)/2})]]$ for arbitrary small $ε$, one can prepare $Θ(n^{1-ε})$ CZ magic states in parallel and hence achieve an almost-constant magic rate.

Fri 25 SeptInformation Theory
The gist
Quantum computers need special codes to protect information from errors. This paper connects ideas from computer science and math to create a new type of error-correcting code with more complex symmetries. These codes use a special mathematical framework called sheaf cohomology and describe new quantum systems with non-simple underlying structures. The authors show how this approach lets many essential quantum resources called magic states be prepared efficiently and in parallel. This could help build more reliable and powerful quantum computers.
Open → 2609.31541v1