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:2510.15223 · Physical Review A

Game-theoretic discovery of quantum error-correcting codes through Nash equilibria

Anonymous

Published Jul 13, 2026• 4 citations
arXivHTMLPDF

Abstract

Quantum error correction code discovery has relied on algebraic constructions with predetermined structure or computational search lacking equilibrium-topology analysis. We introduce a game-theoretic framework recasting code optimization as strategic interactions between competing objectives, where Nash equilibria systematically generate codes with desired properties. We validate the framework by demonstrating it rediscovers the optimal $[\![15,7,3]\!]$ quantum Hamming code in 20\% of independent runs (Calderbank-Shor-Steane 1996) from competing objectives without predetermined algebraic structure, with equilibrium analysis providing transparent mechanistic insights into why this topology emerges. Applied across seven objectives -- distance maximization, hardware adaptation, rate-distance optimization, cluster-state generation, surface-like topologies, connectivity enhancement, and maximization of the quantum Fisher information $\mathcal{F}_Q$ (which quantifies, via the Cramér--Rao bound, the metrological sensitivity of the encoded codespace) -- the framework generates distinct code families through objective reconfiguration rather than algorithm redesign. Scalability to hardware-relevant sizes is demonstrated at $n=100$ qubits, discovering codes including $[\![100,50,4]\!]$ with distance-4 protection and 50\% encoding rate, with tractable $O(n^3)$ per-iteration complexity enabling discovery in under one hour. This work opens research avenues at the intersection of game theory and quantum information, providing systematic, interpretable frameworks for quantum system design.

DOI
10.1103/x1ph-v78g

Related papers

Discovery of optimal quantum codes via reinforcement learning

Vincent Paul Su, ChunJun Cao, Hong-Ye Hu +3 more

The design and optimization of quantum codes is generally hard because of the prohibitive computational cost. The recently introduced quantum lego framework provides a powerful method for generating complex quantum error-correcting codes (QECCs) out of simple ones. We gamify this process and unlock a new avenue for code design and discovery using reinforcement learning (RL). Already for simple code measures and modest qubit numbers, we produce codes that are both optimal and novel. Moreover, we argue that this framework is both scalable, when combined with efficient tensor contraction methods, and flexible, since we can specify arbitrary properties of the code to be optimized. We train on two such properties, maximizing the code distance, and minimizing the probability of logical error under biased Pauli noise. For the first, we show that the trained agent identifies ways to increase code distance beyond naive concatenation, saturating the linear programming bound for CSS (Calderbank, Shor, Steane) codes on 13 qubits. With a learning objective to minimize the logical error probability under biased Pauli noise, we find the best-known CSS code at this task for $\ensuremath{\lesssim}20$ qubits. Compared to other (locally deformed) CSS codes, including Surface, XZZX, and two-dimensional Color codes, our $[[17,1,3]]$ code construction actually has lower adversarial distance, yet better protects the logical information, highlighting the importance of QECC desiderata. Lastly, we comment on how this RL framework can be used in conjunction with physical quantum devices to tailor a code without explicit characterization of the noise model.

arXiv:2305.06378•Physical Review Applied•Mar 20, 2025•36 citations

Bayesian Optimization for Quantum Error-Correcting Code Discovery

Yihua Chengyu, Richard Meister, Conor Carty +2 more

Quantum error-correcting codes protect fragile quantum information by encoding it redundantly, but identifying codes that perform well in practice with minimal overhead remains difficult due to the combinatorial search space and the high cost of logical error rate evaluation. We propose a Bayesian optimization framework to discover quantum error-correcting codes that improves data efficiency and scalability with respect to previous machine learning approaches to this task. Our main contribution is a multi-view chain-complex neural embedding that allows us to predict the logical error rate of quantum LDPC codes without performing expensive simulations. Using bivariate bicycle codes and code capacity noise as a testbed, our algorithm discovers a high-rate code [[144,36]] that achieves competitive per-qubit error rate compared to the gross code, as well as a low-error code [[144,16]] that outperforms the gross code in terms of error rate per qubit. These results highlight the ability of our pipeline to automatically discover codes balancing rate and noise suppression, while the generality of the framework enables application across diverse code families, decoders, and noise models.

quant-pharXiv:2601.18562•Jan 27, 2026•9 citations

Quantum Error Correction Codes: Topological Optimization

Jincheng Zhang

This paper investigates the application of topological optimization techniques to quantum error correction codes. The core claim is that optimizing the topological structure of quantum error correction codes can significantly reduce error correction resource consumption and enhance the resilience of quantum computations. This is achieved through the utilization of topological optimization algorithms to identify optimal sub-graph structures within the topological network of a quantum error correction code, minimizing resource usage while maintaining sufficient error correction capability. We present a novel approach to quantum error correction design, moving beyond traditional code selection and offering a framework for dynamic code adaptation. The theoretical framework incorporates concepts from graph theory, linear algebra, and quantum information theory. The primary objective is to demonstrate a method for systematically reducing the overhead associated with quantum error correction, a critical step towards building fault-tolerant quantum computers. Our approach focuses on minimizing the number of physical qubits required to encode a logical qubit, a key metric for evaluating the efficiency of any quantum error correction scheme. The results indicate a substantial potential for optimization, suggesting a path toward more practical and scalable quantum computation.

•Sep 5, 2026•0 citations

Towards Quantum Error Correction via Information Geometry

Jincheng Zhang

Quantum error correction (QEC) is a cornerstone of quantum computing, vital for mitigating the detrimental effects of noise on quantum information. Traditional QEC approaches often rely on iterative optimization techniques or exhaustive searches, which can be computationally expensive and may not always yield optimal solutions. This work introduces a novel framework for QEC leveraging the principles of information geometry. We formulate the QEC problem as an optimization task within the geometric space defined by the quantum state space, aiming to minimize the information-theoretic distance between the encoded and original states. Specifically, we employ the concept of the Fisher Information Metric to characterize the geometry of the quantum state space and utilize gradient-based optimization algorithms to find the most efficient quantum codes. The presented approach offers a geometric perspective on QEC, potentially leading to improved code design, enhanced error correction performance, and increased coding efficiency. This research contributes a new methodology for QEC, offering a promising avenue for tackling the challenges in building robust and scalable quantum computers.

•Aug 28, 2026•0 citations

A Framework for Efficient Search of High-Distance Quantum Stabilizer Codes

Utsav Karia

Abstract Quantum stabilizer codes are essential for protecting quantum information, but systematic searches for high-distance codes become computationally prohibitive as code length increases. Existing code constructions exhibit structural regularities, yet no general framework quantifies how such constraints reduce the stabilizer-code search space or incorporates them into code searches. This project asks whether structural properties of known quantum codes can be formulated as mathematical constraints that quantitatively reduce search spaces while remaining useful for discovering high-distance codes. We develop a unified framework based on $q$-Galois matrices and define the search-space retention factor as the asymptotic fraction of logarithmic search space retained after imposing a constraint. We derive retention factors for weight-spectrum, qudit-participation, overlap, support, Pauli-distribution, local non-commutation, graph-theoretic, and symmetry constraints, including combinations. We introduce finite-size correction factors $C$ and $C'$ and find empirically that they decay approximately as $\log n/n$ and $1/n$, respectively. The framework is evaluated using 58,902 quantum-code parameter sets, including 34,775 codes with usable matrix data across $q=2,3,4,5,7,8$; 1,909 semi-perfect quantum codes are analyzed. We develop a general method to empirically estimate the weight-spectrum and average-weight for unresolved semi-perfect quantum codes, achieving runtime speedups ranging from $10^{8.3608}$ to $10^{193.9298}$ across 4 distinct unresolved codes. Runtime analysis validates that these reductions translate into substantial computational savings. Applying the framework to a $(14,3)$ qubit search produced a code detecting 91,765 of 91,770 errors of weight at most 4 and achieving 99.9999933% and 99.9733% of the theoretically optimal performance of $[[14,3,5]]_2$ code at $p=0.01$. Thus, the framework converts structural properties into explicit candidate-space reductions that can be imposed during code enumeration, providing a quantitative basis for reducing the computational cost of high-distance stabilizer-code searches.

•Aug 22, 2026•0 citations

Dynamic Topological Quantum Error Correction Code

Jincheng Zhang

This paper investigates a novel approach to quantum error correction, termed the Dynamic Topological Quantum Error Correction Code. The core claim posits that the topological structure of quantum error correction codes is not static, but rather adaptable to the dynamic evolution of quantum information encoding. This adaptability is achieved through a programmable topological network that utilizes controlled topological transformations of entangled states. The mechanism involves dynamically altering topological connections between qubits during quantum information transmission, optimizing error correction rates and efficiency. The research addresses the limitations of traditional topological quantum error correction codes, which assume a fixed topological structure, by introducing a real-time responsive network capable of adapting and optimizing its correction performance. We propose a framework for designing such a system, focusing on the control and manipulation of entangled states to achieve dynamic topological reconfiguration. The key innovation lies in the ability to shift from a static, pre-determined topology to a topology optimized for the current state of the encoded quantum information. This approach offers a significant potential improvement in the robustness and efficiency of quantum communication and computation. The theoretical framework presented outlines the fundamental principles and considerations for implementing this dynamic code, paving the way for future advancements in quantum error correction.

•Aug 31, 2026•0 citations
Quantum error correction code discovery has relied on algebraic constructions with predetermined structure or computational search lacking equilibrium-topology analysis. We introduce a game-theoretic framework recasting code optimization as strategic interactions between competing objectives, where Nash equilibria systematically generate codes with desired properties. We validate the framework by demonstrating it rediscovers the optimal [ ⁣[15,7,3] ⁣][\![15,7,3]\!][[15,7,3]] quantum Hamming code in 20% of independent runs (Calderbank-Shor-Steane 1996) from competing objectives without predetermined algebraic structure, with equilibrium analysis providing transparent mechanistic insights into why this topology emerges. Applied across seven objectives -- distance maximization, hardware adaptation, rate-distance optimization, cluster-state generation, surface-like topologies, connectivity enhancement, and maximization of the quantum Fisher information FQ\mathcal{F}_QFQ​ (which quantifies, via the Cramér--Rao bound, the metrological sensitivity of the encoded codespace) -- the framework generates distinct code families through objective reconfiguration rather than algorithm redesign. Scalability to hardware-relevant sizes is demonstrated at n=100n=100n=100 qubits, discovering codes including [ ⁣[100,50,4] ⁣][\![100,50,4]\!][[100,50,4]] with distance-4 protection and 50% encoding rate, with tractable O(n3)O(n^3)O(n3) per-iteration complexity enabling discovery in under one hour. This work opens research avenues at the intersection of game theory and quantum information, providing systematic, interpretable frameworks for quantum system design.
The design and optimization of quantum codes is generally hard because of the prohibitive computational cost. The recently introduced quantum lego framework provides a powerful method for generating complex quantum error-correcting codes (QECCs) out of simple ones. We gamify this process and unlock a new avenue for code design and discovery using reinforcement learning (RL). Already for simple code measures and modest qubit numbers, we produce codes that are both optimal and novel. Moreover, we argue that this framework is both scalable, when combined with efficient tensor contraction methods, and flexible, since we can specify arbitrary properties of the code to be optimized. We train on two such properties, maximizing the code distance, and minimizing the probability of logical error under biased Pauli noise. For the first, we show that the trained agent identifies ways to increase code distance beyond naive concatenation, saturating the linear programming bound for CSS (Calderbank, Shor, Steane) codes on 13 qubits. With a learning objective to minimize the logical error probability under biased Pauli noise, we find the best-known CSS code at this task for $\ensuremath{\lesssim}20$ qubits. Compared to other (locally deformed) CSS codes, including Surface, XZZX, and two-dimensional Color codes, our [[17,1,3]][[17,1,3]][[17,1,3]] code construction actually has lower adversarial distance, yet better protects the logical information, highlighting the importance of QECC desiderata. Lastly, we comment on how this RL framework can be used in conjunction with physical quantum devices to tailor a code without explicit characterization of the noise model.
Quantum error-correcting codes protect fragile quantum information by encoding it redundantly, but identifying codes that perform well in practice with minimal overhead remains difficult due to the combinatorial search space and the high cost of logical error rate evaluation. We propose a Bayesian optimization framework to discover quantum error-correcting codes that improves data efficiency and scalability with respect to previous machine learning approaches to this task. Our main contribution is a multi-view chain-complex neural embedding that allows us to predict the logical error rate of quantum LDPC codes without performing expensive simulations. Using bivariate bicycle codes and code capacity noise as a testbed, our algorithm discovers a high-rate code [[144,36]] that achieves competitive per-qubit error rate compared to the gross code, as well as a low-error code [[144,16]] that outperforms the gross code in terms of error rate per qubit. These results highlight the ability of our pipeline to automatically discover codes balancing rate and noise suppression, while the generality of the framework enables application across diverse code families, decoders, and noise models.
This paper investigates the application of topological optimization techniques to quantum error correction codes. The core claim is that optimizing the topological structure of quantum error correction codes can significantly reduce error correction resource consumption and enhance the resilience of quantum computations. This is achieved through the utilization of topological optimization algorithms to identify optimal sub-graph structures within the topological network of a quantum error correction code, minimizing resource usage while maintaining sufficient error correction capability. We present a novel approach to quantum error correction design, moving beyond traditional code selection and offering a framework for dynamic code adaptation. The theoretical framework incorporates concepts from graph theory, linear algebra, and quantum information theory. The primary objective is to demonstrate a method for systematically reducing the overhead associated with quantum error correction, a critical step towards building fault-tolerant quantum computers. Our approach focuses on minimizing the number of physical qubits required to encode a logical qubit, a key metric for evaluating the efficiency of any quantum error correction scheme. The results indicate a substantial potential for optimization, suggesting a path toward more practical and scalable quantum computation.
Quantum error correction (QEC) is a cornerstone of quantum computing, vital for mitigating the detrimental effects of noise on quantum information. Traditional QEC approaches often rely on iterative optimization techniques or exhaustive searches, which can be computationally expensive and may not always yield optimal solutions. This work introduces a novel framework for QEC leveraging the principles of information geometry. We formulate the QEC problem as an optimization task within the geometric space defined by the quantum state space, aiming to minimize the information-theoretic distance between the encoded and original states. Specifically, we employ the concept of the Fisher Information Metric to characterize the geometry of the quantum state space and utilize gradient-based optimization algorithms to find the most efficient quantum codes. The presented approach offers a geometric perspective on QEC, potentially leading to improved code design, enhanced error correction performance, and increased coding efficiency. This research contributes a new methodology for QEC, offering a promising avenue for tackling the challenges in building robust and scalable quantum computers.
Abstract Quantum stabilizer codes are essential for protecting quantum information, but systematic searches for high-distance codes become computationally prohibitive as code length increases. Existing code constructions exhibit structural regularities, yet no general framework quantifies how such constraints reduce the stabilizer-code search space or incorporates them into code searches. This project asks whether structural properties of known quantum codes can be formulated as mathematical constraints that quantitatively reduce search spaces while remaining useful for discovering high-distance codes. We develop a unified framework based on qqq-Galois matrices and define the search-space retention factor as the asymptotic fraction of logarithmic search space retained after imposing a constraint. We derive retention factors for weight-spectrum, qudit-participation, overlap, support, Pauli-distribution, local non-commutation, graph-theoretic, and symmetry constraints, including combinations. We introduce finite-size correction factors CCC and C′C'C′ and find empirically that they decay approximately as log⁡n/n\log n/nlogn/n and 1/n1/n1/n, respectively. The framework is evaluated using 58,902 quantum-code parameter sets, including 34,775 codes with usable matrix data across q=2,3,4,5,7,8q=2,3,4,5,7,8q=2,3,4,5,7,8; 1,909 semi-perfect quantum codes are analyzed. We develop a general method to empirically estimate the weight-spectrum and average-weight for unresolved semi-perfect quantum codes, achieving runtime speedups ranging from 108.360810^{8.3608}108.3608 to 10193.929810^{193.9298}10193.9298 across 4 distinct unresolved codes. Runtime analysis validates that these reductions translate into substantial computational savings. Applying the framework to a (14,3)(14,3)(14,3) qubit search produced a code detecting 91,765 of 91,770 errors of weight at most 4 and achieving 99.9999933% and 99.9733% of the theoretically optimal performance of [[14,3,5]]2[[14,3,5]]_2[[14,3,5]]2​ code at p=0.01p=0.01p=0.01. Thus, the framework converts structural properties into explicit candidate-space reductions that can be imposed during code enumeration, providing a quantitative basis for reducing the computational cost of high-distance stabilizer-code searches.
This paper investigates a novel approach to quantum error correction, termed the Dynamic Topological Quantum Error Correction Code. The core claim posits that the topological structure of quantum error correction codes is not static, but rather adaptable to the dynamic evolution of quantum information encoding. This adaptability is achieved through a programmable topological network that utilizes controlled topological transformations of entangled states. The mechanism involves dynamically altering topological connections between qubits during quantum information transmission, optimizing error correction rates and efficiency. The research addresses the limitations of traditional topological quantum error correction codes, which assume a fixed topological structure, by introducing a real-time responsive network capable of adapting and optimizing its correction performance. We propose a framework for designing such a system, focusing on the control and manipulation of entangled states to achieve dynamic topological reconfiguration. The key innovation lies in the ability to shift from a static, pre-determined topology to a topology optimized for the current state of the encoded quantum information. This approach offers a significant potential improvement in the robustness and efficiency of quantum communication and computation. The theoretical framework presented outlines the fundamental principles and considerations for implementing this dynamic code, paving the way for future advancements in quantum error correction.