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

Bulletin of the American Physical Society

Progress in analytical investigations of the achievement of fault tolerance in quantum computing

Gerald N. Gilbert, Yaakov S. Weinstein

Published Mar 19, 2013• 0 citations
OpenAlex

Related papers

Advances in Logical Qubits and Quantum Error Correction: Progress Toward Fault-Tolerant Quantum Computing

Mirza Adnan Mohtashim

Quantum computing has reached a pivotal inflection point with the recent demonstration ofbelow-threshold quantum error correction and the emergence of logical qubits that outperformtheir physical counterparts. This review synthesizes the remarkable progress achieved between2024 and 2026 across multiple quantum hardware platforms, including superconducting circuits,trapped ions, and neutral atom arrays. We examine the theoretical foundations of quantumerror correction codes, with particular emphasis on surface codes and the rapidly advancingquantum low-density parity-check (qLDPC) codes. Key experimental milestones are analyzed,including Google’s Willow chip demonstration of exponential error suppression, IBM’s modularfault-tolerant roadmap culminating in the Starling system, IonQ’s achievement of 48 logicalqubits with a 2:1 encoding ratio, and QuEra’s record-efficiency neutral atom error correctionapproaching the Teraquop regime. The review further explores critical enabling technologiessuch as real-time decoding architectures, magic state distillation protocols, and fault-tolerant gateimplementations. We discuss the remaining challenges in scaling to hundreds of logical qubits,achieving practical logical error rates of 10−10 to 10−15, and realizing end-to-end fault-tolerantalgorithms. By synthesizing these developments, this article provides a comprehensive assessmentof the field’s trajectory toward practical fault-tolerant quantum computing and identifies the keymilestones that will define the next phase of progress.

•May 12, 2026•0 citations

Assessing Finite Scalability in Early Fault-Tolerant Quantum Computing for Homogeneous Catalysts

Yanbing Zhou, Athena Caesura, Corneliu Buda +3 more

As quantum hardware advances toward fault-tolerant operation, an intermediate stage known as early fault-tolerant quantum computing (EFTQC) is emerging, where partial error correction enables meaningful computation. In this regime, the ability of quantum processors to scale in size and depth has become a crucial factor shaping their achievable performance. This study investigates how finite scalability influences resource requirements for simulating open-shell catalytic systems using Quantum Phase Estimation (QPE). The analysis compares hardware archetypes distinguished by fidelity or operation speed under two representative scalability models. Finite scalability increases qubit and runtime demands yet leaves overall scaling behavior intact, with high-fidelity architectures requiring lower minimum scalability to solve equally sized problems. These effects are largely independent of the chosen scalability model. Extending this framework, we examine runtime competitiveness across hardware and code configurations, incorporating surface-code and quantum Low-Density Parity-Check (LDPC)-based fault tolerance under finite scalability. The results identify operating regimes where high-fidelity architectures remain competitive despite slower gate speeds and show that LDPC codes further expand this regime by reducing space-time overhead. Together, these findings highlight the central role of scalability in quantifying performance and guiding the design of next-generation quantum hardware. Continued progress in scalable architectures will be essential for extending quantum computing to increasingly complex scientific and industrial applications.

quant-pharXiv:2511.10388•Nov 14, 2025•0 citations

Study of quantum error correction and fault tolerant quantum computing

Saurabh Mehta

•Jul 1, 2017•0 citations

Practicality of Fault-Tolerant Quantum Computation

Simon J. Devitt, Austin G. Fowler, Lloyd C. L. Hollenberg

•Jan 1, 2005•0 citations

Towards fault-tolerant distributed quantum computation (FT-DQC): Taxonomy, recent progress, and challenges

Harashta Tatimma Larasati, Byung-Soo Choi

As the works on quantum computing have seen substantial development in recent years, we are on the verge of seeing the fruitful result of the preliminary, early version of quantum computers. Nevertheless, in order to achieve full-fledged, large-scale quantum computers, two aspects still lacking in the existing quantum computers, i.e., scalability and reliability, will need to be more carefully considered and investigated. In this survey, we present a review of existing literature that aims to alleviate the scalability and reliability issues in quantum computers. In particular, we discuss how existing research leads to two main solutions: for advancing scalability, a distributed quantum computing (DQC) paradigm will be the primary direction instead of the general centralized quantum computing (CQC), whereas for attaining reliability, a fault-tolerant quantum computation (FTQC) approach would need to be leveraged instead of the existing noisy intermediate-scale quantum computers (NISQ). Combining both solutions, we highlight the essentiality of fault-tolerant distributed quantum computation (FT-DQC) and present related progress in the field. Furthermore, from the papers that we have gathered, we provide the taxonomy of the works to give a clearer landscape of the field and discuss the key issues in realizing FT-DQC.

ICT Express•Mar 27, 2025•12 citations

The Future of Fault-Tolerant Quantum Computing

Prabhat Mishra

Springer eBooks•Jan 1, 2026•0 citations
Quantum computing has reached a pivotal inflection point with the recent demonstration ofbelow-threshold quantum error correction and the emergence of logical qubits that outperformtheir physical counterparts. This review synthesizes the remarkable progress achieved between2024 and 2026 across multiple quantum hardware platforms, including superconducting circuits,trapped ions, and neutral atom arrays. We examine the theoretical foundations of quantumerror correction codes, with particular emphasis on surface codes and the rapidly advancingquantum low-density parity-check (qLDPC) codes. Key experimental milestones are analyzed,including Google’s Willow chip demonstration of exponential error suppression, IBM’s modularfault-tolerant roadmap culminating in the Starling system, IonQ’s achievement of 48 logicalqubits with a 2:1 encoding ratio, and QuEra’s record-efficiency neutral atom error correctionapproaching the Teraquop regime. The review further explores critical enabling technologiessuch as real-time decoding architectures, magic state distillation protocols, and fault-tolerant gateimplementations. We discuss the remaining challenges in scaling to hundreds of logical qubits,achieving practical logical error rates of 10−10 to 10−15, and realizing end-to-end fault-tolerantalgorithms. By synthesizing these developments, this article provides a comprehensive assessmentof the field’s trajectory toward practical fault-tolerant quantum computing and identifies the keymilestones that will define the next phase of progress.
As quantum hardware advances toward fault-tolerant operation, an intermediate stage known as early fault-tolerant quantum computing (EFTQC) is emerging, where partial error correction enables meaningful computation. In this regime, the ability of quantum processors to scale in size and depth has become a crucial factor shaping their achievable performance. This study investigates how finite scalability influences resource requirements for simulating open-shell catalytic systems using Quantum Phase Estimation (QPE). The analysis compares hardware archetypes distinguished by fidelity or operation speed under two representative scalability models. Finite scalability increases qubit and runtime demands yet leaves overall scaling behavior intact, with high-fidelity architectures requiring lower minimum scalability to solve equally sized problems. These effects are largely independent of the chosen scalability model. Extending this framework, we examine runtime competitiveness across hardware and code configurations, incorporating surface-code and quantum Low-Density Parity-Check (LDPC)-based fault tolerance under finite scalability. The results identify operating regimes where high-fidelity architectures remain competitive despite slower gate speeds and show that LDPC codes further expand this regime by reducing space-time overhead. Together, these findings highlight the central role of scalability in quantifying performance and guiding the design of next-generation quantum hardware. Continued progress in scalable architectures will be essential for extending quantum computing to increasingly complex scientific and industrial applications.
As the works on quantum computing have seen substantial development in recent years, we are on the verge of seeing the fruitful result of the preliminary, early version of quantum computers. Nevertheless, in order to achieve full-fledged, large-scale quantum computers, two aspects still lacking in the existing quantum computers, i.e., scalability and reliability, will need to be more carefully considered and investigated. In this survey, we present a review of existing literature that aims to alleviate the scalability and reliability issues in quantum computers. In particular, we discuss how existing research leads to two main solutions: for advancing scalability, a distributed quantum computing (DQC) paradigm will be the primary direction instead of the general centralized quantum computing (CQC), whereas for attaining reliability, a fault-tolerant quantum computation (FTQC) approach would need to be leveraged instead of the existing noisy intermediate-scale quantum computers (NISQ). Combining both solutions, we highlight the essentiality of fault-tolerant distributed quantum computation (FT-DQC) and present related progress in the field. Furthermore, from the papers that we have gathered, we provide the taxonomy of the works to give a clearer landscape of the field and discuss the key issues in realizing FT-DQC.