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

Comparative study of quantum error correction strategies for the heavy-hexagonal lattice

César Benito, Esperanza López, Borja Peropadre, A. Bermúdez

Published Feb 6, 2025• 26 citations
arXivHTMLPDF

Abstract

Topological quantum error correction is a milestone in the scaling roadmap of quantum computers, which targets circuits with trillions of gates that would allow running quantum algorithms for real-world problems. The square-lattice surface code has become the workhorse to address this challenge, as it poses milder requirements on current devices both in terms of required error rates and small local connectivities. In some platforms, however, the connectivities are kept even lower in order to minimise gate errors at the hardware level, which limits the error correcting codes that can be directly implemented on them. In this work, we make a comparative study of possible strategies to overcome this limitation for the heavy-hexagonal lattice, the architecture of current IBM superconducting quantum computers. We explore two complementary strategies: the search for an efficient embedding of the surface code into the heavy-hexagonal lattice, as well as the use of codes whose connectivity requirements are naturally tailored to this architecture, such as subsystem-type and Floquet codes. Using noise models of increased complexity, we assess the performance of these strategies for IBM devices in terms of their error thresholds and qubit footprints. An optimized SWAP-based embedding of the surface code is found to be the most promising strategy towards a near-term demonstration of quantum error correction advantage.

DOI
10.22331/q-2025-02-06-1623

Related papers

Quantum Error Correction: Surface And Topological Codes

N Raji

Quantum error correction (QEC) represents a critical enabler for fault-tolerant quantum computing, protecting fragile quantum states from decoherence and operational errors. This paper provides a comprehensive analysis of leading quantum error correction schemes, focusing on surface codes and topological codes within the context of Noisy Intermediate-Scale Quantum (NISQ) era processors. We examine the theoretical foundations of stabilizer codes, compare surface code implementations with code distances ranging from d=3 to d=17, and analyze topological codes including toric codes and color codes. Our investigation encompasses syndrome extraction circuits, logical qubit encoding strategies, and threshold analysis for contemporary quantum hardware platforms. Performance metrics reveal that surface codes achieve error thresholds of approximately 1% with realistic noise models, while topological codes offer architectural advantages for specific qubit connectivity constraints. We discuss implementation challenges on current NISQ processors including IBM Quantum, Google Sycamore, and IonQ systems, addressing qubit overhead, gate fidelity requirements, and decoding algorithms. This analysis provides insights for selecting appropriate error correction schemes based on application requirements and hardware capabilities.

•Mar 12, 2026•0 citations

Creating Entangled Logical Qubits in the Heavy-Hex Lattice with Topological Codes

Bence Hetényi, James R. Wootton

Designs for quantum error correction depend strongly on the connectivity of the qubits. For solid-state qubits, the most straightforward approach is to have connectivity constrained to a planar graph. Practical considerations may also further restrict the connectivity, resulting in a relatively sparse graph such as the heavy-hexagonal (“heavy-hex”) architecture of current IBM Quantum devices. In such cases, it is hard to use all qubits to their full potential. Instead, in order to emulate the denser connectivity required to implement well-known quantum error-correcting codes, many qubits remain effectively unused. In this work, we show how this bug can be turned into a feature. By using the unused qubits of one code to execute another, two codes can be implemented on top of each other, allowing easy application of fault-tolerant entangling gates and measurements. We demonstrate this by realizing a surface code and a Bacon-Shor code on a 133-qubit IBM Quantum device. Using transversal controlled- X () gates and lattice surgery, we demonstrate entanglement between these logical qubits with code distance up to d = 4 and five rounds of stabilizer-measurement cycles. The nonplanar coupling between the qubits allows us to simultaneously measure the logical X X , Y Y , and Z Z observables. With this, we verify the violation of Bell’s inequality for both the d = 2 case with postselection featuring a fidelity of 94% and the d = 3 instance using only quantum error correction. Published by the American Physical Society 2024

arXiv:2404.15989•PRX Quantum•Dec 3, 2024•48 citations

About Implementation of Magic State Injection in Heavy-Hexagon Structure

Hansol Kim, Wonjae Choi, Younghun Kwon

Implementing fault-tolerant quantum computing necessitates the realization of logical non-Clifford gates, which requires the preparation of specific quantum states known as magic states. However, IBM’s heavy-hexagon structure, which has limited qubit connectivity, presents challenges in adapting quantum error correction codes such as the surface code. Several methods have been proposed to address these challenges by adapting the surface code to the heavy-hexagon architecture. In this study, we implement the magic state injection process within two distinct implementations of surface codes (standard and rotated methods) suitable for the heavy-hexagon structure and compare their logical error rates. Furthermore, we propose initialization methods to enhance the performance of magic state injection in the heavy-hexagon structure, thereby efficiently achieving logical non-Clifford gates with reduced error rates.

Mathematics•Dec 3, 2025•1 citation

Directional Codes for Quantum LDPC Error Correction on Square and Hexagonal Grid Architectures

György P. Gehér, David Byfield, Archibald Ruban

Utility-scale quantum computing requires quantum error correction (QEC) to protect quantum information against noise. Currently, superconducting hardware is a promising candidate for achieving fault tolerance due to its fast gate times and feasible scalability. However, it is often restricted to two-dimensional nearest-neighbour connectivity, and therefore the variety of quantum low-density parity-check (qLDPC) codes that can be implemented on it without sacrificing QEC performance is believed to be greatly restricted. In this paper we construct a new family of qLDPC codes, which we call ``directional codes'', that outperforms the rotated toric code (RTC) while satisfying the connectivity requirements of the widely adopted square-grid, and some even the sparser hexagonal-grid, on a torus. The key idea is to utilise the iSWAP gate -- a native gate demonstrated on superconducting qubits -- to construct circuits that measure the stabilisers of these qLDPC codes without the need for additional connections. We numerically evaluate the performance of directional codes, encoding four, six, twelve and eighteen logical qubits, using a common superconducting-inspired circuit-level Pauli noise model. We also compare them to the RTC and to the bivariate bicycle (BB) codes, currently the two most popular quantum LDPC code families. As a concrete example, when evaluated with the Tesseract decoder with short beam setting, the best directional code family investigated achieves the same logical error rate as the RTC at physical error rate $p=10^{-3}$ but requires only a quarter to a third of the number of physical qubits to encode a given number of logical qubits. Our discovery opens a novel direction in QEC code design, suggesting that complex high-connectivity hardware may not be necessary for low-overhead fault-tolerant quantum computation.

quant-pharXiv:2507.19430•Jul 28, 2025•22 citations

Logical Qubit Initialization and Measurement in the Heavy-Hexagonal Lattice

Aziz Kerem Özkan, Muhammet Talha Kakız, Erkan Güler +1 more

Improvements in quality of life and technological advancement are often accompanied by increasingly complex societal challenges. When formulated as computational problems, these challenges can exceed the processing capacity of classical computing. Quantum algorithms can solve these problems more efficiently by leveraging the principles of superposition and entanglement. However, in practice, quantum computation is highly susceptible to qubit errors, which can compromise the results. Various quantum error correction methods were proposed to eliminate these errors. In this paper, the application of one such method-the surface code-to the heavy-hexagonal quantum processor layout is studied and the future research directions are highlighted.

•Oct 22, 2025•0 citations

Quantum Error Correction and Fault-Tolerant Computing: Recent Progress in Codes, Decoders, and Architectures

Volkan Erol

Quantum error correction (QEC) represents the cornerstone technology for realizing fault-tolerant quantum computing, addressing the fundamental challenge of quantum state decoherence in noisy intermediate-scale quantum (NISQ) devices. This comprehensive review examines recent advances in QEC implementations from 2020-2024, spanning theoretical foundations to practical hardware demonstrations. We analyze the evolution from pioneering stabilizer codes to modern topological approaches, with particular emphasis on surface codes and low-density parity-check (LDPC) codes that have demonstrated below-threshold error correction in superconducting and trapped-ion systems. The paper provides a comparative analysis of classical and machine learning-based decoder algorithms, evaluating their performance through complexity analysis and threshold comparisons in real-time error correction scenarios. Through examination of breakthrough experiments by Google, IBM, Quantinuum, and emerging platforms, we assess the current state of fault-tolerant quantum computing and identify critical engineering challenges including correlated noise models, cryogenic control systems, and scalable logical gate implementations. Our quantitative analysis reveals that while significant progress has been made toward practical fault-tolerance thresholds, achieving the resource efficiency and reliability required for large-scale quantum computation remains challenging. We provide detailed resource estimates for key applications including Shor's algorithm and optimization problems, along with analysis of industry roadmaps toward thousand-logical-qubit systems. This review serves as a comprehensive guide for researchers and engineers working toward the next generation of fault-tolerant quantum computers, with particular focus on information-theoretic perspectives relevant to quantum information entropy and syndrome processing.

•Sep 30, 2025•3 citations
Topological quantum error correction is a milestone in the scaling roadmap of quantum computers, which targets circuits with trillions of gates that would allow running quantum algorithms for real-world problems. The square-lattice surface code has become the workhorse to address this challenge, as it poses milder requirements on current devices both in terms of required error rates and small local connectivities. In some platforms, however, the connectivities are kept even lower in order to minimise gate errors at the hardware level, which limits the error correcting codes that can be directly implemented on them. In this work, we make a comparative study of possible strategies to overcome this limitation for the heavy-hexagonal lattice, the architecture of current IBM superconducting quantum computers. We explore two complementary strategies: the search for an efficient embedding of the surface code into the heavy-hexagonal lattice, as well as the use of codes whose connectivity requirements are naturally tailored to this architecture, such as subsystem-type and Floquet codes. Using noise models of increased complexity, we assess the performance of these strategies for IBM devices in terms of their error thresholds and qubit footprints. An optimized SWAP-based embedding of the surface code is found to be the most promising strategy towards a near-term demonstration of quantum error correction advantage.
Quantum error correction (QEC) represents a critical enabler for fault-tolerant quantum computing, protecting fragile quantum states from decoherence and operational errors. This paper provides a comprehensive analysis of leading quantum error correction schemes, focusing on surface codes and topological codes within the context of Noisy Intermediate-Scale Quantum (NISQ) era processors. We examine the theoretical foundations of stabilizer codes, compare surface code implementations with code distances ranging from d=3 to d=17, and analyze topological codes including toric codes and color codes. Our investigation encompasses syndrome extraction circuits, logical qubit encoding strategies, and threshold analysis for contemporary quantum hardware platforms. Performance metrics reveal that surface codes achieve error thresholds of approximately 1% with realistic noise models, while topological codes offer architectural advantages for specific qubit connectivity constraints. We discuss implementation challenges on current NISQ processors including IBM Quantum, Google Sycamore, and IonQ systems, addressing qubit overhead, gate fidelity requirements, and decoding algorithms. This analysis provides insights for selecting appropriate error correction schemes based on application requirements and hardware capabilities.
Designs for quantum error correction depend strongly on the connectivity of the qubits. For solid-state qubits, the most straightforward approach is to have connectivity constrained to a planar graph. Practical considerations may also further restrict the connectivity, resulting in a relatively sparse graph such as the heavy-hexagonal (“heavy-hex”) architecture of current IBM Quantum devices. In such cases, it is hard to use all qubits to their full potential. Instead, in order to emulate the denser connectivity required to implement well-known quantum error-correcting codes, many qubits remain effectively unused. In this work, we show how this bug can be turned into a feature. By using the unused qubits of one code to execute another, two codes can be implemented on top of each other, allowing easy application of fault-tolerant entangling gates and measurements. We demonstrate this by realizing a surface code and a Bacon-Shor code on a 133-qubit IBM Quantum device. Using transversal controlled- X () gates and lattice surgery, we demonstrate entanglement between these logical qubits with code distance up to d = 4 and five rounds of stabilizer-measurement cycles. The nonplanar coupling between the qubits allows us to simultaneously measure the logical X X , Y Y , and Z Z observables. With this, we verify the violation of Bell’s inequality for both the d = 2 case with postselection featuring a fidelity of 94% and the d = 3 instance using only quantum error correction. Published by the American Physical Society 2024
Implementing fault-tolerant quantum computing necessitates the realization of logical non-Clifford gates, which requires the preparation of specific quantum states known as magic states. However, IBM’s heavy-hexagon structure, which has limited qubit connectivity, presents challenges in adapting quantum error correction codes such as the surface code. Several methods have been proposed to address these challenges by adapting the surface code to the heavy-hexagon architecture. In this study, we implement the magic state injection process within two distinct implementations of surface codes (standard and rotated methods) suitable for the heavy-hexagon structure and compare their logical error rates. Furthermore, we propose initialization methods to enhance the performance of magic state injection in the heavy-hexagon structure, thereby efficiently achieving logical non-Clifford gates with reduced error rates.
Utility-scale quantum computing requires quantum error correction (QEC) to protect quantum information against noise. Currently, superconducting hardware is a promising candidate for achieving fault tolerance due to its fast gate times and feasible scalability. However, it is often restricted to two-dimensional nearest-neighbour connectivity, and therefore the variety of quantum low-density parity-check (qLDPC) codes that can be implemented on it without sacrificing QEC performance is believed to be greatly restricted. In this paper we construct a new family of qLDPC codes, which we call ``directional codes'', that outperforms the rotated toric code (RTC) while satisfying the connectivity requirements of the widely adopted square-grid, and some even the sparser hexagonal-grid, on a torus. The key idea is to utilise the iSWAP gate -- a native gate demonstrated on superconducting qubits -- to construct circuits that measure the stabilisers of these qLDPC codes without the need for additional connections. We numerically evaluate the performance of directional codes, encoding four, six, twelve and eighteen logical qubits, using a common superconducting-inspired circuit-level Pauli noise model. We also compare them to the RTC and to the bivariate bicycle (BB) codes, currently the two most popular quantum LDPC code families. As a concrete example, when evaluated with the Tesseract decoder with short beam setting, the best directional code family investigated achieves the same logical error rate as the RTC at physical error rate p=10−3p=10^{-3}p=10−3 but requires only a quarter to a third of the number of physical qubits to encode a given number of logical qubits. Our discovery opens a novel direction in QEC code design, suggesting that complex high-connectivity hardware may not be necessary for low-overhead fault-tolerant quantum computation.
Improvements in quality of life and technological advancement are often accompanied by increasingly complex societal challenges. When formulated as computational problems, these challenges can exceed the processing capacity of classical computing. Quantum algorithms can solve these problems more efficiently by leveraging the principles of superposition and entanglement. However, in practice, quantum computation is highly susceptible to qubit errors, which can compromise the results. Various quantum error correction methods were proposed to eliminate these errors. In this paper, the application of one such method-the surface code-to the heavy-hexagonal quantum processor layout is studied and the future research directions are highlighted.
Quantum error correction (QEC) represents the cornerstone technology for realizing fault-tolerant quantum computing, addressing the fundamental challenge of quantum state decoherence in noisy intermediate-scale quantum (NISQ) devices. This comprehensive review examines recent advances in QEC implementations from 2020-2024, spanning theoretical foundations to practical hardware demonstrations. We analyze the evolution from pioneering stabilizer codes to modern topological approaches, with particular emphasis on surface codes and low-density parity-check (LDPC) codes that have demonstrated below-threshold error correction in superconducting and trapped-ion systems. The paper provides a comparative analysis of classical and machine learning-based decoder algorithms, evaluating their performance through complexity analysis and threshold comparisons in real-time error correction scenarios. Through examination of breakthrough experiments by Google, IBM, Quantinuum, and emerging platforms, we assess the current state of fault-tolerant quantum computing and identify critical engineering challenges including correlated noise models, cryogenic control systems, and scalable logical gate implementations. Our quantitative analysis reveals that while significant progress has been made toward practical fault-tolerance thresholds, achieving the resource efficiency and reliability required for large-scale quantum computation remains challenging. We provide detailed resource estimates for key applications including Shor's algorithm and optimization problems, along with analysis of industry roadmaps toward thousand-logical-qubit systems. This review serves as a comprehensive guide for researchers and engineers working toward the next generation of fault-tolerant quantum computers, with particular focus on information-theoretic perspectives relevant to quantum information entropy and syndrome processing.