Metraipolis › archive › dc_03b143265652

Fermionic quantum error correction is never free — arXiv:2609.15059

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.15059
License (as archived)
CC0-1.0
Archived
2026-10-16T02:24:33.051Z
SHA-256 of the archived text
f9ed7f13c80a7d3c1f808c19e3b5ccb14bfcc93803c28d0ced211005f1bfa297
Stable URL of this page
https://metraipolis.com/documento/dc_03b143265652

How to cite

Fermionic quantum error correction is never free — arXiv:2609.15059 — arXiv (en), https://arxiv.org/abs/2609.15059 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_03b143265652 (Metraipolis archive dc_03b143265652, sha256 f9ed7f13c80a7d3c1f808c19e3b5ccb14bfcc93803c28d0ced211005f1bfa297)
BibTeX
@misc{dc03b143265652,
  title = {Fermionic quantum error correction is never free — arXiv:2609.15059},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.15059},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_03b143265652; sha256 f9ed7f13c80a7d3c1f808c19e3b5ccb14bfcc93803c28d0ced211005f1bfa297},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.15059. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Fermionic platforms offer compelling architectures for quantum computing, ranging from topologically protected Majorana-based qubits to fermionic cold atoms. To achieve scalability, however, they require quantum error correction. In this work, we prove that any exact and sufficiently accurate approximate fermionic quantum error correction necessarily requires non-Gaussian operations, beyond the free-fermion regime of quadratic dynamics. This is in sharp contrast to the qubit setting, where the efficiently classically simulable stabilizer operations form the standard framework for quantum error correction. Specifically, we show that the logical space of any non-trivial fermionic error-correcting code contains no pure fermionic Gaussian state, utilizing a fundamental incompatibility between fermionic error correction and Wick's theorem. We further show that the required number of bounded-weight non-Gaussian gates for unitary codeword preparation grows at least linearly with both the code distance and the number of encoded modes, revealing an intrinsic resource overhead that increases simultaneously with error-protection strength and logical capacity. Furthermore, we analyze the performance of fermionic Gaussian operations in entanglement distillation, revealing a distinction from their bosonic counterparts. Our results reveal fundamental difficulties for fermionic error correction from the perspectives of both physical implementation and classical simulation, suggesting connections to fermionic phases of matter and state preparation complexity.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-15 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.15059 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T01:57:57.066Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).