aiqbench analysis
This paper advances hardware-efficient fault tolerance by formalizing multimode symmetric bosonic codes through a representation-theoretic framework, specifically utilizing finite subgroups of SU(2). By treating quantum error correction matrices as morphisms of group representations, the authors demonstrate how Schur's lemma can eliminate entire irreducible representation blocks to optimize seed state fidelity. These findings provide a rigorous mathematical foundation for improving error protection in bosonic systems like cat-codes and GKP codes.
Error Correction Properties of Covariant Bosonic Encodings
arXiv:2609.26660v1 Announce Type: new Abstract: Bosonic codes offer a promising approach towards hardware-efficient fault tolerance, with many leading examples such as the cat-code and the GKP code organized by an underlying symmetry. We build on a representation-theoretic framework of quantum error correction to formalize the construction and analysis of multimode symmetric bosonic codes, focusing on finite groups. Here, a physical, logical representation and an initial seed state together define the codewords via a covariant encoding. A central observation is that QEC matrices can be viewed as morphisms of group representations, so that Schur's lemma forces entire irreducible representations blocks to vanish. We recover several known single- and two-mode bosonic codes and build and analyze the error protection capabilities of three codes based on finite subgroups of SU(2). We analyze the impact of reducibility of the logical representation and optimize the seed state using the near-optimal fidelity.
Abstract:Bosonic codes offer a promising approach towards hardware-efficient fault tolerance, with many leading examples such as the cat-code and the GKP code organized by an underlying symmetry. We build on a representation-theoretic framework of quantum error correction to formalize the construction and analysis of multimode symmetric bosonic codes, focusing on finite groups. Here, a physical, logical representation and an initial seed state together define the codewords via a covariant encoding. A central observation is that QEC matrices can be viewed as morphisms of group representations, so that Schur's lemma forces entire irreducible representations blocks to vanish. We recover several known single- and two-mode bosonic codes and build and analyze the error protection capabilities of three codes based on finite subgroups of SU(2). We analyze the impact of reducibility of the logical representation and optimize the seed state using the near-optimal fidelity.
arXiv:2609.26660 [quant-ph]
(or arXiv:2609.26660v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2609.26660 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 232 words
Related coverage
Bias-Preserving Gates and Quantum Error Correction With Dual-Rail Cat Codes
arXiv · Sep 1, 2026

How Do Photonic Quantum Computers Work?
Quantum Zeitgeist · Sep 5, 2026

Fast Bosonic Control via Multiphoton Qubit-Oscillator Interactions
Quantum Journal · Oct 1, 2026

Researchers Propose Dense Qubits Using Spin Nonlinearities
Quantum Zeitgeist · Aug 17, 2026