Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This research establishes a fundamental no-go theorem for bosonic quantum error-correcting codes on Riemann surfaces with genus greater than one, proving that non-amenable stabilizer groups preclude normalizable states. The findings contrast sharply with standard GKP codes by demonstrating that topological constraints inherently limit the precision achievable in these specific geometric configurations. This theoretical advance clarifies the boundaries of fault tolerance for continuous-variable quantum computing architectures based on complex manifold geometries.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Bosonic codes from compact phase spaces

arXiv2 min read

arXiv:2608.31156v1 Announce Type: new Abstract: We present the algebraic structure of bosonic quantum error-correcting codes on genus-two Riemann surfaces. We explicitly construct the code words as automorphic forms and analytically generate the full tower of code spaces at all weights. We prove a fundamental no-go theorem: for any genus greater than one, the stabilizer group is non-amenable, forcing a strictly positive spectral gap in the stabilizer Hamiltonian. Consequently, no normalizable quantum state can satisfy all stabilizer conditions. This sharply contrasts with standard Gottesman-Kitaev-Preskill (GKP) codes, where the amenability of the stabilizer group $\mathbb{Z}^2$ permits approximate code words with arbitrary precision.

Abstract:We present the algebraic structure of bosonic quantum error-correcting codes on genus-two Riemann surfaces. We explicitly construct the code words as automorphic forms and analytically generate the full tower of code spaces at all weights. We prove a fundamental no-go theorem: for any genus greater than one, the stabilizer group is non-amenable, forcing a strictly positive spectral gap in the stabilizer Hamiltonian. Consequently, no normalizable quantum state can satisfy all stabilizer conditions. This sharply contrasts with standard Gottesman-Kitaev-Preskill (GKP) codes, where the amenability of the stabilizer group $\mathbb{Z}^2$ permits approximate code words with arbitrary precision.

7 pages, 3 figures + Supplemental Material (30 pages, 4 figures). Code, notebooks, and data at this https URL

Quantum Physics (quant-ph); Mathematical Physics (math-ph); Algebraic Geometry (math.AG)

arXiv:2608.31156 [quant-ph]

(or arXiv:2608.31156v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2608.31156 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 · 214 words

Related coverage