Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.25213

LiftDiff: Guided Discrete Diffusion for Quantum Code Construction

Yotam Peled, Eliya Nachmani

quant-phcs.ITcs.LGSubmitted Oct 18, 2026• Announced Oct 20, 2026• 0 citations
arXivHTMLPDF

Abstract

The realization of fault-tolerant quantum computation relies on Quantum Error-Correcting Codes (QECC). Of particular interest are codes that combine a high encoding rate with sufficient distance. Existing algebraic constructions, such as lifted product (LP) codes, build a large quantum low-density parity-check (qLDPC) code from a classical base matrix. In this work we introduce LiftDiff, a generative approach to the discovery of QECC. A discrete denoising diffusion model is trained to generate base matrices over the group algebra $\mathbb{F}_2[\mathbb{Z}_\ell]$, which are then expanded into LP codes. The reverse diffusion process is guided by an energy function that evaluates quantum code properties, including girth, degree, sparsity and decoding performance, steering the sampler toward matrices that yield LP codes with favorable parameters. Our method discovers codes with parameters such as $[[169,13,11]]$, $[[143,15,9]]$, and $[[260,24,10]]$, including a $[[247,19,14]]$ code that achieves the highest ${kd^2}/{n}$ among the baselines. Moreover, several discovered codes outperform the Gross code across a broad range of the tested physical error rates under both code-capacity and circuit-level noise.

AI Summary

LiftDiff addresses the search for finite-size lifted-product (LP) quantum LDPC codes with favorable rate, distance, check weight, and decoding performance. It generates base matrices over $\mathbb{F}_2[\mathbb{Z}_\ell]$ and uses the self-product construction $LP(M,M)$ to enforce CSS commutation. A discrete denoising diffusion model is trained on progressive-edge-growth supports with random polynomial entries. During sampling, gradients through a continuous relaxation of the LP construction guide generation using penalties for short cycles, degree, sparsity, spectral properties, rank loss, check weight, and error-reconstruction loss from an unrolled belief-propagation decoder. Candidates are screened using exact binary ranks and distance upper bounds; the paper reports MILP certification of final candidates’ distances. The reported set contains 32 codes with $65\le n\le730$, $5\le d\le14$, rates up to $0.310$, and maximum check weights from 5 to 12. Examples include $[[143,15,9]]$, $[[169,13,11]]$, and $[[260,24,10]]$. The $[[247,19,14]]$ code has $kd^2/n\approx15.1$, the largest among the compared codes with check weight at most 8. Under independent-$X$ code-capacity noise and BP-OSD decoding, the $[[260,24,10]]$ code has about twentyfold lower block logical error rate than the $[[144,12,12]]$ baseline at $p=0.01$. Circuit-level tests find $[[247,19,14]]$ below that baseline for $p=0.001$–$0.003$, while $[[260,24,10]]$ remains within its confidence intervals. The spectral distance proxy is explicitly heuristic for continuous, potentially irregular matrices. Guidance weights are tuned per run, analysis plots use distance upper bounds, and exact distance computation is acknowledged to be NP-hard in general.

Little sign of AI-generated textMissing comparisonOverclaims

Error found: The abstract claims several discovered codes outperform the Gross code under both noise models, but the circuit-level results establish an advantage for only one generated code over part of the tested range; the other tested generated code is statistically indistinguishable from the baseline.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

Large-Language-Model Discovery of Quantum LDPC Codes through Structured Concept Evolution

Zidu Liu, Florian Marquardt

Quantum computers could outperform classical machines on important problems, but only if the errors that pervade quantum hardware can be corrected at scale. Quantum low-density parity-check (qLDPC) codes offer a promising route to this goal by combining sparse parity checks with finite encoding rate and growing distance, but their construction remains a challenging discrete design problem. Here we introduce structured concept evolution (SCE), a search framework that pairs a large language model with a structured algebraic mutation grammar to discover lifted-product code families, a class of CSS qLDPC codes. Instead of asking the LLM to design codes from first principles, SCE evolves structured concepts consisting of algebraic specifications paired with executable programs that realize them, using hierarchical mutations that modify the group algebra, protograph geometry, or base space. Running SCE, we discover a diverse set of competitive code families, ranging from abelian constructions to families over non-abelian groups beyond those underlying standard designs such as bivariate-bicycle codes, and characterize them under code-capacity depolarizing noise with BP+OSD decoding. These results are obtained with lightweight models (GPT-5.4-mini and GPT-5.4-nano).

quant-pharXiv:2606.24808•Jun 24, 2026•13 citations

On the Minimum Distances of Finite-Length Lifted Product Quantum LDPC Codes

Nithin Raveendran, David Declercq, Bane V. Vasic

Quantum error correction (QEC) is critical for the practical realization of fault-tolerant quantum computing and quantum communication systems. Recently proposed families of quantum low-density parity-check (QLDPC) codes are prime candidates for advanced QEC hardware architectures. This paper focuses on finite-length QLDPC code design criteria, specifically aimed at constructing degenerate quasi-cyclic symmetric lifted-product (LP-QLDPC) codes with high minimum distances. We describe necessary conditions to ensure that the designed LP-QLDPC codes have a minimum distance strictly greater than the minimum weight stabilizer generators, thus ensuring superior error correction performance. The focus of the paper is on LP-QLDPC codes built from quasi-cyclic base codes belonging to the class of type-1 protographs, and the necessary constraints are efficiently expressed in terms of row and column indices of the base parity check matrix. This gives us combinatorial constraints - termed as Row-Column Partition Constraints (RCPC) - on classical quasi-cyclic base matrices to construct degenerate LP-QLDPC codes. For type-1 protographs, RCPC constraints provide an efficient certification approach to designing good codes, and we also give exhaustive search evidence on small base matrices. Simulations with BP+OSD decoding demonstrate significant logical error-rate gains when RCPC is avoided. We discuss extensions to circuit-level noise and outline sufficient conditions and research directions for exact distance preservation.

International Conference on Communications•May 24, 2026•1 citation

Lifting Lifted Product Codes

Yuta Hirasaki, Jong Yeon Lee

Lifted product (LP) codes form an important class of quantum error correcting codes with favorable code parameters. We introduce a systematic construction of LP code families based on group extensions and graph lifts. The construction increases the code size while preserving the local structure of the Tanner graph, and relates code parameters, logical operators, and fault-tolerant logical-operation gadgets within the families through chain and cochain maps. As a first application, we obtain LP codes with better code parameters than previously reported ones. We then demonstrate that code-surgery gadgets can be transferred across the selected finite lifts through chain maps and, in several cases, implemented with lower space overhead. We also develop parallel product surgery for lifted clustered cyclic codes. Finally, we propose lifting as a systematic first step toward defining thermodynamic families for algebraically defined qLDPC codes without an underlying Euclidean lattice. For several base codes and selected lifts, coherent information exhibits finite-size crossings, while our results also indicate that additional conditions are needed to determine a unique family.

quant-pharXiv:2607.28621•Jul 31, 2026•7 citations

Quantum Low-Density Parity-Check Codes

Bane V. Vasic, Valentin Savin, Michele Pacenti +2 more

Quantum error correction (QEC) is a cornerstone of quantum computing, enabling reliable information processing in the presence of noise. Sparse stabilizer codes -- referred to generally as quantum low-density parity-check (QLDPC) codes -- have risen to the forefront of QEC research in recent years. This can be attributed to several key factors. First, classical LDPC codes admit low-complexity belief propagation iterative decoding and near-capacity performance, which contributed to the early interest in QLDPC codes. Then, the result promising constant overhead fault tolerance using QLDPC codes led to the search for code families that go beyond the long-holding $\sqrt{n}$ scaling barrier of minimum distance for codelength $n$. This resulted in recent breakthroughs in the construction of QLDPC codes, which, combined with efficient decoding algorithms and the development of fault-tolerant protocols operating on QLDPC-encoded quantum information, provide a promising pathway to low-overhead, fault-tolerant quantum computation. However, despite their potential, challenges remain, particularly in constructing and decoding finite-length codes that account for, or efficiently leverage, specific characteristics of quantum hardware, such as connectivity, topology, native gate sets, and noise models. This article provides an in-depth examination of QLDPC codes and their iterative decoders, catering to an information theory audience with no or limited background in quantum mechanics. We discuss the theoretical underpinnings, explore unique characteristics of quantum channels, and delineate key code constructions and decoding algorithms, ultimately highlighting the impact and future prospects of QLDPC codes in quantum information science.

arXiv:2510.14090•IEEE BITS the Information Theory Magazine•Dec 1, 2025•17 citations

Multi-agent discovery of practical quantum LDPC codes

Dongheng Qian, Tianyi Li

Quantum low-density parity-check (qLDPC) codes can encode multiple logical qubits using sparse parity checks, yet searching for useful finite-length instances remains a challenging design problem because code performance must be optimized while satisfying practical constraints. Motivated by recent advances in artificial-intelligence agents for scientific discovery, we develop a multi-agent framework for discovering practical qLDPC codes. The framework combines specialist proposal and review, persistent scientific memory, long-horizon evolution of executable programs, and deterministic construction and evaluation within a closed-loop search. These programs instantiate coset-orbit balanced-product codes, providing a search space that includes bicycle and lifted-product constructions as well as non-normal subgroup actions. To incorporate practical constraints, we restrict the search to binary CSS codes with block length $n\leq400$ and overall weight $w\leq10$. Within this regime, the framework discovers codes with leading or competitive rate--distance performance in every weight class considered, with representative instances including $[[288,16,18]]$ at $w=7$, $[[288,18,18]]$ at $w=9$, and $[[234,28,18]]$ at $w=10$. The search also uncovers structurally distinct, high-performing constructions, including a $[[336,12,\leq24]]$ candidate and a $[[368,18,16]]$ code, both of which are genuine balanced-product constructions with non-normal subgroup actions. When evaluated under code-capacity depolarizing noise using a common BP-OSD decoding protocol, the discovered codes also exhibit low logical failure rates. Together, these results provide hardware-relevant finite-length candidates for further experimental evaluation and show how structured agentic search can contribute to scientific discovery.

quant-pharXiv:2608.08996•Aug 11, 2026•8 citations

Mirror codes: High-threshold quantum LDPC codes beyond the CSS regime

Andrey Boris Khesin, Jonathan Z. Lu

The realization of quantum error correction protocols whose logical error rates are suppressed far below physical error rates relies on an intricate combination: the error-correcting code's efficiency, the syndrome extraction circuit's fault tolerance and overhead, the decoder's quality, and the device's constraints, such as physical qubit count and connectivity. This work makes two contributions towards error-corrected quantum devices. First, we introduce mirror codes, a simple yet flexible construction of LDPC stabilizer codes parameterized by a group $G$ and two subsets of $G$ whose total size bounds the check weight. These codes contain all abelian two-block group algebra codes, such as bivariate bicycle (BB) codes. At the same time, they are manifestly not CSS in general, thus deviating substantially from most prior constructions. Fixing a check weight of 6, we find $[[ 60, 4, 10 ]], [[ 36, 6, 6 ]], [[ 48, 8, 6 ]]$, and $[[ 85, 8, 9 ]]$ codes, all of which are not CSS; we also find several weight-7 codes with $kd > n$. Next, we construct syndrome extraction circuits that trade overhead for provable fault tolerance. These circuits use 1-2, 3, and 6 ancillae per check, and respectively are partially fault-tolerant (FT), provably FT on weight-6 CSS codes, and provably FT on \emph{all} weight-6 stabilizer codes. Using our constructions, we perform end-to-end quantum memory experiments on several representative mirror codes under circuit-level noise. We achieve an error pseudothreshold on the order of $0.2\%$, approximately matching that of the $[[ 144, 12, 12 ]]$ BB code under the same model. These findings position mirror codes as a versatile candidate for fault-tolerant quantum memory, especially on smaller-scale devices in the near term.

quant-pharXiv:2603.05496•Mar 6, 2026•9 citations
The realization of fault-tolerant quantum computation relies on Quantum Error-Correcting Codes (QECC). Of particular interest are codes that combine a high encoding rate with sufficient distance. Existing algebraic constructions, such as lifted product (LP) codes, build a large quantum low-density parity-check (qLDPC) code from a classical base matrix. In this work we introduce LiftDiff, a generative approach to the discovery of QECC. A discrete denoising diffusion model is trained to generate base matrices over the group algebra F2[Zℓ]\mathbb{F}_2[\mathbb{Z}_\ell]F2​[Zℓ​], which are then expanded into LP codes. The reverse diffusion process is guided by an energy function that evaluates quantum code properties, including girth, degree, sparsity and decoding performance, steering the sampler toward matrices that yield LP codes with favorable parameters. Our method discovers codes with parameters such as [[169,13,11]][[169,13,11]][[169,13,11]], [[143,15,9]][[143,15,9]][[143,15,9]], and [[260,24,10]][[260,24,10]][[260,24,10]], including a [[247,19,14]][[247,19,14]][[247,19,14]] code that achieves the highest kd2/n{kd^2}/{n}kd2/n among the baselines. Moreover, several discovered codes outperform the Gross code across a broad range of the tested physical error rates under both code-capacity and circuit-level noise.
LiftDiff addresses the search for finite-size lifted-product (LP) quantum LDPC codes with favorable rate, distance, check weight, and decoding performance. It generates base matrices over F2[Zℓ]\mathbb{F}_2[\mathbb{Z}_\ell]F2​[Zℓ​] and uses the self-product construction LP(M,M)LP(M,M)LP(M,M) to enforce CSS commutation.
A discrete denoising diffusion model is trained on progressive-edge-growth supports with random polynomial entries. During sampling, gradients through a continuous relaxation of the LP construction guide generation using penalties for short cycles, degree, sparsity, spectral properties, rank loss, check weight, and error-reconstruction loss from an unrolled belief-propagation decoder. Candidates are screened using exact binary ranks and distance upper bounds; the paper reports MILP certification of final candidates’ distances.
The reported set contains 32 codes with 65≤n≤73065\le n\le73065≤n≤730, 5≤d≤145\le d\le145≤d≤14, rates up to 0.3100.3100.310, and maximum check weights from 5 to 12. Examples include [[143,15,9]][[143,15,9]][[143,15,9]], [[169,13,11]][[169,13,11]][[169,13,11]], and [[260,24,10]][[260,24,10]][[260,24,10]]. The [[247,19,14]][[247,19,14]][[247,19,14]] code has kd2/n≈15.1kd^2/n\approx15.1kd2/n≈15.1, the largest among the compared codes with check weight at most 8. Under independent-XXX code-capacity noise and BP-OSD decoding, the [[260,24,10]][[260,24,10]][[260,24,10]] code has about twentyfold lower block logical error rate than the [[144,12,12]][[144,12,12]][[144,12,12]] baseline at p=0.01p=0.01p=0.01. Circuit-level tests find [[247,19,14]][[247,19,14]][[247,19,14]] below that baseline for p=0.001p=0.001p=0.001–0.0030.0030.003, while [[260,24,10]][[260,24,10]][[260,24,10]] remains within its confidence intervals.
The spectral distance proxy is explicitly heuristic for continuous, potentially irregular matrices. Guidance weights are tuned per run, analysis plots use distance upper bounds, and exact distance computation is acknowledged to be NP-hard in general.
Quantum computers could outperform classical machines on important problems, but only if the errors that pervade quantum hardware can be corrected at scale. Quantum low-density parity-check (qLDPC) codes offer a promising route to this goal by combining sparse parity checks with finite encoding rate and growing distance, but their construction remains a challenging discrete design problem. Here we introduce structured concept evolution (SCE), a search framework that pairs a large language model with a structured algebraic mutation grammar to discover lifted-product code families, a class of CSS qLDPC codes. Instead of asking the LLM to design codes from first principles, SCE evolves structured concepts consisting of algebraic specifications paired with executable programs that realize them, using hierarchical mutations that modify the group algebra, protograph geometry, or base space. Running SCE, we discover a diverse set of competitive code families, ranging from abelian constructions to families over non-abelian groups beyond those underlying standard designs such as bivariate-bicycle codes, and characterize them under code-capacity depolarizing noise with BP+OSD decoding. These results are obtained with lightweight models (GPT-5.4-mini and GPT-5.4-nano).
Quantum error correction (QEC) is critical for the practical realization of fault-tolerant quantum computing and quantum communication systems. Recently proposed families of quantum low-density parity-check (QLDPC) codes are prime candidates for advanced QEC hardware architectures. This paper focuses on finite-length QLDPC code design criteria, specifically aimed at constructing degenerate quasi-cyclic symmetric lifted-product (LP-QLDPC) codes with high minimum distances. We describe necessary conditions to ensure that the designed LP-QLDPC codes have a minimum distance strictly greater than the minimum weight stabilizer generators, thus ensuring superior error correction performance. The focus of the paper is on LP-QLDPC codes built from quasi-cyclic base codes belonging to the class of type-1 protographs, and the necessary constraints are efficiently expressed in terms of row and column indices of the base parity check matrix. This gives us combinatorial constraints - termed as Row-Column Partition Constraints (RCPC) - on classical quasi-cyclic base matrices to construct degenerate LP-QLDPC codes. For type-1 protographs, RCPC constraints provide an efficient certification approach to designing good codes, and we also give exhaustive search evidence on small base matrices. Simulations with BP+OSD decoding demonstrate significant logical error-rate gains when RCPC is avoided. We discuss extensions to circuit-level noise and outline sufficient conditions and research directions for exact distance preservation.
Lifted product (LP) codes form an important class of quantum error correcting codes with favorable code parameters. We introduce a systematic construction of LP code families based on group extensions and graph lifts. The construction increases the code size while preserving the local structure of the Tanner graph, and relates code parameters, logical operators, and fault-tolerant logical-operation gadgets within the families through chain and cochain maps. As a first application, we obtain LP codes with better code parameters than previously reported ones. We then demonstrate that code-surgery gadgets can be transferred across the selected finite lifts through chain maps and, in several cases, implemented with lower space overhead. We also develop parallel product surgery for lifted clustered cyclic codes. Finally, we propose lifting as a systematic first step toward defining thermodynamic families for algebraically defined qLDPC codes without an underlying Euclidean lattice. For several base codes and selected lifts, coherent information exhibits finite-size crossings, while our results also indicate that additional conditions are needed to determine a unique family.
Quantum error correction (QEC) is a cornerstone of quantum computing, enabling reliable information processing in the presence of noise. Sparse stabilizer codes -- referred to generally as quantum low-density parity-check (QLDPC) codes -- have risen to the forefront of QEC research in recent years. This can be attributed to several key factors. First, classical LDPC codes admit low-complexity belief propagation iterative decoding and near-capacity performance, which contributed to the early interest in QLDPC codes. Then, the result promising constant overhead fault tolerance using QLDPC codes led to the search for code families that go beyond the long-holding n\sqrt{n}n​ scaling barrier of minimum distance for codelength nnn. This resulted in recent breakthroughs in the construction of QLDPC codes, which, combined with efficient decoding algorithms and the development of fault-tolerant protocols operating on QLDPC-encoded quantum information, provide a promising pathway to low-overhead, fault-tolerant quantum computation. However, despite their potential, challenges remain, particularly in constructing and decoding finite-length codes that account for, or efficiently leverage, specific characteristics of quantum hardware, such as connectivity, topology, native gate sets, and noise models. This article provides an in-depth examination of QLDPC codes and their iterative decoders, catering to an information theory audience with no or limited background in quantum mechanics. We discuss the theoretical underpinnings, explore unique characteristics of quantum channels, and delineate key code constructions and decoding algorithms, ultimately highlighting the impact and future prospects of QLDPC codes in quantum information science.
Quantum low-density parity-check (qLDPC) codes can encode multiple logical qubits using sparse parity checks, yet searching for useful finite-length instances remains a challenging design problem because code performance must be optimized while satisfying practical constraints. Motivated by recent advances in artificial-intelligence agents for scientific discovery, we develop a multi-agent framework for discovering practical qLDPC codes. The framework combines specialist proposal and review, persistent scientific memory, long-horizon evolution of executable programs, and deterministic construction and evaluation within a closed-loop search. These programs instantiate coset-orbit balanced-product codes, providing a search space that includes bicycle and lifted-product constructions as well as non-normal subgroup actions. To incorporate practical constraints, we restrict the search to binary CSS codes with block length n≤400n\leq400n≤400 and overall weight w≤10w\leq10w≤10. Within this regime, the framework discovers codes with leading or competitive rate--distance performance in every weight class considered, with representative instances including [[288,16,18]][[288,16,18]][[288,16,18]] at w=7w=7w=7, [[288,18,18]][[288,18,18]][[288,18,18]] at w=9w=9w=9, and [[234,28,18]][[234,28,18]][[234,28,18]] at w=10w=10w=10. The search also uncovers structurally distinct, high-performing constructions, including a [[336,12,≤24]][[336,12,\leq24]][[336,12,≤24]] candidate and a [[368,18,16]][[368,18,16]][[368,18,16]] code, both of which are genuine balanced-product constructions with non-normal subgroup actions. When evaluated under code-capacity depolarizing noise using a common BP-OSD decoding protocol, the discovered codes also exhibit low logical failure rates. Together, these results provide hardware-relevant finite-length candidates for further experimental evaluation and show how structured agentic search can contribute to scientific discovery.
The realization of quantum error correction protocols whose logical error rates are suppressed far below physical error rates relies on an intricate combination: the error-correcting code's efficiency, the syndrome extraction circuit's fault tolerance and overhead, the decoder's quality, and the device's constraints, such as physical qubit count and connectivity. This work makes two contributions towards error-corrected quantum devices. First, we introduce mirror codes, a simple yet flexible construction of LDPC stabilizer codes parameterized by a group GGG and two subsets of GGG whose total size bounds the check weight. These codes contain all abelian two-block group algebra codes, such as bivariate bicycle (BB) codes. At the same time, they are manifestly not CSS in general, thus deviating substantially from most prior constructions. Fixing a check weight of 6, we find [[60,4,10]],[[36,6,6]],[[48,8,6]][[ 60, 4, 10 ]], [[ 36, 6, 6 ]], [[ 48, 8, 6 ]][[60,4,10]],[[36,6,6]],[[48,8,6]], and [[85,8,9]][[ 85, 8, 9 ]][[85,8,9]] codes, all of which are not CSS; we also find several weight-7 codes with kd>nkd > nkd>n. Next, we construct syndrome extraction circuits that trade overhead for provable fault tolerance. These circuits use 1-2, 3, and 6 ancillae per check, and respectively are partially fault-tolerant (FT), provably FT on weight-6 CSS codes, and provably FT on \emph{all} weight-6 stabilizer codes. Using our constructions, we perform end-to-end quantum memory experiments on several representative mirror codes under circuit-level noise. We achieve an error pseudothreshold on the order of 0.2%0.2\%0.2%, approximately matching that of the [[144,12,12]][[ 144, 12, 12 ]][[144,12,12]] BB code under the same model. These findings position mirror codes as a versatile candidate for fault-tolerant quantum memory, especially on smaller-scale devices in the near term.