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:2407.11926 · Quantum

Far from Perfect: Quantum Error Correction with (Hyperinvariant) Evenbly Codes

Matthew Steinberg, Junyu Fan, Robert J. Harris, David Elkouss, Sebastian Feld, A. Jahn

Published Aug 8, 2025• 20 citations
arXivHTMLPDF

Abstract

We introduce a new class of qubit codes that we call Evenbly codes, building on a previous proposal of hyperinvariant tensor networks. Its tensor network description consists of local, non-perfect tensors describing CSS codes interspersed with Hadamard gates, placed on a hyperbolic {p,q} geometry with even q≥4 , yielding an infinitely large class of subsystem codes. We construct an example for a {5,4} manifold and describe strategies of logical gauge fixing that lead to different rates k/n and distances d , which we calculate analytically, finding distances which range from d=2 to d∼n2/3 . Investigating threshold performance under erasure, depolarizing, and pure Pauli noise channels, we find that the code exhibits a depolarizing noise threshold of about 19.1% in the code-capacity model and 50% for pure Pauli and erasure channels under suitable gauges. We also test a constant-rate version with k/n=0.125 , finding excellent error resilience (about 40%) under the erasure channel. Recovery rates for these and other settings are studied both under an optimal decoder as well as a more efficient but non-optimal greedy decoder. We also consider generalizations beyond the CSS tensor construction, compute error rates and thresholds for other hyperbolic geometries, and discuss the relationship to holographic bulk/boundary dualities. Our work indicates that Evenbly codes may show promise for practical quantum computing applications.

DOI
10.22331/q-2025-08-08-1826

Related papers

Calderbank-Shor-Steane holographic quantum error-correcting codes

Robert J. Harris, Nathan A. McMahon, Gavin K. Brennen +1 more

We expand the class of holographic quantum error-correcting codes by developing the notion of block perfect tensors, a wider class that includes previously defined perfect tensors. The relaxation of this constraint opens up a range of other holographic codes. We demonstrate this by introducing the self-dual Calderbank-Shor-Steane (CSS) heptagon holographic code, based on the 7-qubit Steane code. Finally, we show promising thresholds for the erasure channel by applying a straightforward, optimal erasure decoder to the heptagon code and benchmark it against existing holographic codes.

arXiv:1806.06472•Physical Review A•Nov 1, 2018•61 citations

Holographic codes from hyperinvariant tensor networks

Matthew Steinberg, Sebastian Feld, A. Jahn

Holographic quantum-error correcting codes are models of bulk/boundary dualities such as the anti-de Sitter/conformal field theory (AdS/CFT) correspondence, where a higher-dimensional bulk geometry is associated with the code's logical degrees of freedom. Previous discrete holographic codes based on tensor networks have reproduced the general code properties expected from continuum AdS/CFT, such as complementary recovery. However, the boundary states of such tensor networks typically do not exhibit the expected correlation functions of CFT boundary states. In this work, we show that a new class of exact holographic codes, extending the previously proposed hyperinvariant tensor networks into quantum codes, produce the correct boundary correlation functions. This approach yields a dictionary between logical states in the bulk and the critical renormalization group flow of boundary states. Furthermore, these codes exhibit a state-dependent breakdown of complementary recovery as expected from AdS/CFT under small quantum gravity corrections.

arXiv:2304.02732•Nature Communications•Nov 11, 2023•27 citations

Heterogeneous quantum error-correcting codes

Omid Khosravani, Guillermo Escobar-Arrieta, Kenneth R. Brown +1 more

We introduce heterogeneous quantum error-correcting codes composed of qubit types with distinct error channels and study their performance in the code-capacity regime using maximum-likelihood tensor network decoding. In the regime where both qubit types share the same noise bias but differ in physical error rate, placing noisier qubits in the bulk -- where each error triggers more syndrome bits -- and cleaner qubits on the boundary yields thresholds exceeding 0.4 (compared to ~0.2 for the reverse placement) and improvements exceeding three orders of magnitude in logical error rate at high bias, with the advantage growing exponentially with code distance. In the regime where both types share the same error rate but differ in bias, the optimal strategy reverses: placing high-bias (more predictable) qubits on the boundary increases the threshold from 0.292(5) to 0.360(9) at a bias ratio of 100, and from 0.29(1) to 0.398(4) at a bias ratio of 1000. We also observe a striking bias-inversion property: the logical error channel becomes strongly XX X- and YY Y-biased despite the physical noise being ZZ Z-biased. We propose a stabilizer-ratio hypothesis that provides a unified information-theoretic explanation for both placement rules and predicts even larger advantages for code families such as color codes.

quant-pharXiv:2603.06817•Mar 10, 2026•3 citations

Systematic approach to hyperbolic quantum error correction codes

Ahmed Adel Mahmoud, Kamal Ali, Steven Rayan

Quantum error correction codes defined on hyperbolic lattices leverage the unique geometric properties of the hyperbolic space to enhance the performance of quantum error correction. By embedding qubits in hyperbolic lattices, these codes achieve higher encoding rates and lower qubit overhead compared to those defined on conventional Euclidean lattices. Building on recent advances in hyperbolic crystallography, we introduce a unified framework for the systematic construction and scalable benchmarking of CSS quantum error correction codes on hyperbolic lattices. A central component of this framework is the Hyperbolic Cycle Basis algorithm, which employs graph-theoretic methods to efficiently identify all plaquette cycles (parity-check supports) and nontrivial cycles (logical operators). This enables scalable and automated benchmarking of a broad class of CSS codes defined on hyperbolic geometries. We apply this framework to construct and simulate two representative hyperbolic quantum error correction codes (HQECCs), evaluating key performance metrics such as encoding rate, error threshold, and code distance for different sublattices. While HQECCs serve as concrete examples, the framework can be adapted to a wide range of CSS codes, including those with more intricate stabilizer structures such as Floquet codes. This work establishes a foundation for systematic exploration and benchmarking of CSS codes on hyperbolic lattices, paving the way toward practical, high-performance quantum error correction.

arXiv:2504.07800•Physical Review A•Mar 13, 2026•9 citations

Tensor-Network Codes

Terry Farrelly, Robert J. Harris, Nathan A. McMahon +1 more

We introduce tensor-network stabilizer codes which come with a natural tensor-network decoder. These codes can correspond to any geometry, but, as a special case, we generalize holographic codes beyond those constructed from perfect or block-perfect isometries, and we give an example that corresponds to neither. Using the tensor-network decoder, we find a threshold of 18.8% for this code under depolarizing noise. We show that, for holographic codes, the exact tensor-network decoder (with no bond-dimension truncation) has polynomial complexity in the number of physical qubits, even for locally correlated noise, making this the first efficient decoder for holographic codes against Pauli noise and, also, a rare example of a decoder that is both efficient and exact.

arXiv:2009.10329•Physical Review Letters•Jul 23, 2021•34 citations

Biased-noise thresholds of zero-rate holographic codes with tensor-network decoding

J. Fan, Matthew Steinberg, A. Jahn +2 more

A crucial insight for practical quantum error correction is that different types of errors, such as single-qubit Pauli operators, typically occur with different probabilities. Finding an optimal quantum code under such biased noise is a challenging problem, related to the (generally unknown) maximum capacity of the corresponding noisy channel. A benchmark for this capacity is given by the hashing bound, which describes the performance of random stabilizer codes and leads to the matter of identifying codes that come close to the bound while also being efficiently decodable. In this work, we perform a comprehensive analysis of asymptotically zero-rate holographic codes under biased noise. We show that many representatives from such models of this code class fulfill both the channel optimality and efficient decoding guarantees for tensor-network codes. In fact, all tested holographic codes are found to reach the hashing bound in some bias regime, while several built from the [[ 5 , 1 , 2 ]] surface code and [[ 6 , 1 , 3 ]] code exceed state-of-the-art code performance in the 2-Pauli noise regime. Furthermore, we consider Clifford deformations which allow all considered codes to reach the hashing bound for 1-Pauli noise as well. Our results establish that holographic codes, which were previously shown to possess efficient tensor-network decoders, also exhibit competitive thresholds under biased noise.

arXiv:2408.06232•Physical Review A•Jul 1, 2026•8 citations
We introduce a new class of qubit codes that we call Evenbly codes, building on a previous proposal of hyperinvariant tensor networks. Its tensor network description consists of local, non-perfect tensors describing CSS codes interspersed with Hadamard gates, placed on a hyperbolic {p,q} geometry with even q≥4 , yielding an infinitely large class of subsystem codes. We construct an example for a {5,4} manifold and describe strategies of logical gauge fixing that lead to different rates k/n and distances d , which we calculate analytically, finding distances which range from d=2 to d∼n2/3 . Investigating threshold performance under erasure, depolarizing, and pure Pauli noise channels, we find that the code exhibits a depolarizing noise threshold of about 19.1% in the code-capacity model and 50% for pure Pauli and erasure channels under suitable gauges. We also test a constant-rate version with k/n=0.125 , finding excellent error resilience (about 40%) under the erasure channel. Recovery rates for these and other settings are studied both under an optimal decoder as well as a more efficient but non-optimal greedy decoder. We also consider generalizations beyond the CSS tensor construction, compute error rates and thresholds for other hyperbolic geometries, and discuss the relationship to holographic bulk/boundary dualities. Our work indicates that Evenbly codes may show promise for practical quantum computing applications.
We expand the class of holographic quantum error-correcting codes by developing the notion of block perfect tensors, a wider class that includes previously defined perfect tensors. The relaxation of this constraint opens up a range of other holographic codes. We demonstrate this by introducing the self-dual Calderbank-Shor-Steane (CSS) heptagon holographic code, based on the 7-qubit Steane code. Finally, we show promising thresholds for the erasure channel by applying a straightforward, optimal erasure decoder to the heptagon code and benchmark it against existing holographic codes.
Holographic quantum-error correcting codes are models of bulk/boundary dualities such as the anti-de Sitter/conformal field theory (AdS/CFT) correspondence, where a higher-dimensional bulk geometry is associated with the code's logical degrees of freedom. Previous discrete holographic codes based on tensor networks have reproduced the general code properties expected from continuum AdS/CFT, such as complementary recovery. However, the boundary states of such tensor networks typically do not exhibit the expected correlation functions of CFT boundary states. In this work, we show that a new class of exact holographic codes, extending the previously proposed hyperinvariant tensor networks into quantum codes, produce the correct boundary correlation functions. This approach yields a dictionary between logical states in the bulk and the critical renormalization group flow of boundary states. Furthermore, these codes exhibit a state-dependent breakdown of complementary recovery as expected from AdS/CFT under small quantum gravity corrections.
We introduce heterogeneous quantum error-correcting codes composed of qubit types with distinct error channels and study their performance in the code-capacity regime using maximum-likelihood tensor network decoding. In the regime where both qubit types share the same noise bias but differ in physical error rate, placing noisier qubits in the bulk -- where each error triggers more syndrome bits -- and cleaner qubits on the boundary yields thresholds exceeding 0.4 (compared to ~0.2 for the reverse placement) and improvements exceeding three orders of magnitude in logical error rate at high bias, with the advantage growing exponentially with code distance. In the regime where both types share the same error rate but differ in bias, the optimal strategy reverses: placing high-bias (more predictable) qubits on the boundary increases the threshold from 0.292(5) to 0.360(9) at a bias ratio of 100, and from 0.29(1) to 0.398(4) at a bias ratio of 1000. We also observe a striking bias-inversion property: the logical error channel becomes strongly XX X- and YY Y-biased despite the physical noise being ZZ Z-biased. We propose a stabilizer-ratio hypothesis that provides a unified information-theoretic explanation for both placement rules and predicts even larger advantages for code families such as color codes.
Quantum error correction codes defined on hyperbolic lattices leverage the unique geometric properties of the hyperbolic space to enhance the performance of quantum error correction. By embedding qubits in hyperbolic lattices, these codes achieve higher encoding rates and lower qubit overhead compared to those defined on conventional Euclidean lattices. Building on recent advances in hyperbolic crystallography, we introduce a unified framework for the systematic construction and scalable benchmarking of CSS quantum error correction codes on hyperbolic lattices. A central component of this framework is the Hyperbolic Cycle Basis algorithm, which employs graph-theoretic methods to efficiently identify all plaquette cycles (parity-check supports) and nontrivial cycles (logical operators). This enables scalable and automated benchmarking of a broad class of CSS codes defined on hyperbolic geometries. We apply this framework to construct and simulate two representative hyperbolic quantum error correction codes (HQECCs), evaluating key performance metrics such as encoding rate, error threshold, and code distance for different sublattices. While HQECCs serve as concrete examples, the framework can be adapted to a wide range of CSS codes, including those with more intricate stabilizer structures such as Floquet codes. This work establishes a foundation for systematic exploration and benchmarking of CSS codes on hyperbolic lattices, paving the way toward practical, high-performance quantum error correction.
We introduce tensor-network stabilizer codes which come with a natural tensor-network decoder. These codes can correspond to any geometry, but, as a special case, we generalize holographic codes beyond those constructed from perfect or block-perfect isometries, and we give an example that corresponds to neither. Using the tensor-network decoder, we find a threshold of 18.8% for this code under depolarizing noise. We show that, for holographic codes, the exact tensor-network decoder (with no bond-dimension truncation) has polynomial complexity in the number of physical qubits, even for locally correlated noise, making this the first efficient decoder for holographic codes against Pauli noise and, also, a rare example of a decoder that is both efficient and exact.
A crucial insight for practical quantum error correction is that different types of errors, such as single-qubit Pauli operators, typically occur with different probabilities. Finding an optimal quantum code under such biased noise is a challenging problem, related to the (generally unknown) maximum capacity of the corresponding noisy channel. A benchmark for this capacity is given by the hashing bound, which describes the performance of random stabilizer codes and leads to the matter of identifying codes that come close to the bound while also being efficiently decodable. In this work, we perform a comprehensive analysis of asymptotically zero-rate holographic codes under biased noise. We show that many representatives from such models of this code class fulfill both the channel optimality and efficient decoding guarantees for tensor-network codes. In fact, all tested holographic codes are found to reach the hashing bound in some bias regime, while several built from the [[ 5 , 1 , 2 ]] surface code and [[ 6 , 1 , 3 ]] code exceed state-of-the-art code performance in the 2-Pauli noise regime. Furthermore, we consider Clifford deformations which allow all considered codes to reach the hashing bound for 1-Pauli noise as well. Our results establish that holographic codes, which were previously shown to possess efficient tensor-network decoders, also exhibit competitive thresholds under biased noise.