Back to News
quantum-computing

Quantum low-density lattice codes

Timo Hillmann, Jens Eisert, Francesco Arzani
Loading...
4 min read
0 likes
⚡ Quantum Brief
Concretely, we introduce quantum versions of classical, randomly constructed LDLCs. --> Quantum Physics arXiv:2609.03021 (quant-ph) [Submitted on 2 Sep 2026] Title:Quantum low-density lattice codes Authors:Timo Hillmann, Jens Eisert, Francesco Arzani View a PDF of the paper titled Quantum low-density lattice codes, by Timo Hillmann and 2 other authors View PDF HTML (experimental) Abstract:Gottesman-Kitaev-Preskill (GKP) codes provide a family of promising schemes for encoding discrete quantum information (qudits) into infinite-dimensional bosonic modes based on mathematical lattices. We show that after suitable dimensionality reduction these codes have code properties comparable to or better than concatenated GKP-surface codes of equal number of modes.
AI Audio Summary
0:00 / 0:00
Click to play
page-050-object-064.webp
Quantum News · Media Library

Quantum Physics arXiv:2609.03021 (quant-ph) [Submitted on 2 Sep 2026] Title:Quantum low-density lattice codes Authors:Timo Hillmann, Jens Eisert, Francesco Arzani View a PDF of the paper titled Quantum low-density lattice codes, by Timo Hillmann and 2 other authors View PDF HTML (experimental) Abstract:Gottesman-Kitaev-Preskill (GKP) codes provide a family of promising schemes for encoding discrete quantum information (qudits) into infinite-dimensional bosonic modes based on mathematical lattices. While such codes, when concatenated with discrete-variable codes, are relatively well studied, the construction and decoding of native GKP codes has largely remained open due to the computationally hard problems encountered. To address this challenge, we advocate a strategy of co-designing the decoder and the quantum error-correcting code itself by constructing lattices for which decoding is feasible: The requirement of efficient decoding effectively determines the quantum error-correcting code. This construction is built on classical low-density lattice codes (LDLCs), a lattice analogue of low-density parity-check codes, here lifted to families of GKP codes. Concretely, we introduce quantum versions of classical, randomly constructed LDLCs. We show that after suitable dimensionality reduction these codes have code properties comparable to or better than concatenated GKP-surface codes of equal number of modes. However, the GKP-LDLCs constructed here do not have a strictly sparse parity check matrix, which motivates our study of the performance of natively analog message-passing decoders originally developed for LDLCs when applied to concatenated GKP-LDPC codes. We show that the fully analog, linear-time decoder achieves performances close to state-of-the-art hybrid qubit-analog decoders. To facilitate future research on the structure and performance of general GKP codes, the relevant source code will be released in open-source Julia packages this http URL and this http URL. Comments: Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2609.03021 [quant-ph] (or arXiv:2609.03021v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2609.03021 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Francesco Arzani [view email] [v1] Wed, 2 Sep 2026 18:00:19 UTC (2,545 KB) Full-text links: Access Paper: View a PDF of the paper titled Quantum low-density lattice codes, by Timo Hillmann and 2 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-09 References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators 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. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Read Original

Tags

quantum-hardware
quantum-error-correction

Source Information

Source: arXiv Quantum Physics

Discussion

0 professional contributions

Sign in to join this professional discussion.

Be the first to add a constructive contribution.