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

Federal Grants & Contracts

INnovations in Qubit Science for Fault Tolerant Quantum Computing Program (DOD)

Published Feb 17, 2025• 0 citations
Publisher
DOI
10.1002/fgc.34228

Related papers

New and Emerging Qubit Science and Technology (DOD)

Federal Grants & Contracts•May 5, 2021•0 citations

Architecting a Full-Stack Superconducting Fault-Tolerant Quantum Computer

Jangwoo Kim, Junpyo Kim, Junhyuk Choi +7 more

To run a practical size of quantum program, computer architects have been making tremendous efforts to realize fault-tolerant quantum computing (FTQC) which constructs a fault-tolerant logical qubit by correcting many erroneous physical qubits during runtime. However, it is extremely challenging to build a full-stack FTQC system consisting of heterogeneous stacks, where each stack incurs unique challenges regarding the fault tolerance and the interplay of the challenges incurs very complicated overall design choice problem. Therefore, computer architects must fully understand stack-specific optimizations and their system-level trade-offs, and resolve all the challenges together. In this article, we first introduce critical design challenges in architecting an FTQC system built on the superconducting technology, and then present our research outcomes to resolve the challenges to build an FTQC system realizing thousands of logical qubits. We also outline near-future directions to resolve the remaining challenges and provide insights toward realizing more scalable future FTQC systems.

IEEE Micro•Feb 23, 2026•0 citations

TraceQ: Trace-Based Reconstruction of Quantum Circuit Dataflow in Surface-Code Fault-Tolerant Quantum Computing

Theodoros Trochatos, Christopher Kang, Andrew Wang +2 more

Practical applications of quantum computing depend on fault-tolerant devices that employ error correction. A promising quantum error-correcting code for large-scale quantum computing is the surface code. For this code, Fault-Tolerant Quantum Computing (FTQC) can be performed via lattice surgery, i.e. merging and splitting of encoded qubit patches on a 2D grid. Lattice surgery operations result in space-time patterns of activity that are defined in this work as access traces. This work demonstrates that the access traces reveal when, where, and how logical qubits interact. Leveraging this formulation, this work further introduces TraceQ, a tracebased reconstruction framework that is able to reconstruct the quantum circuit dataflow just by observing the patch activity at each trace entry. The framework is supported by heuristics for handling inherent ambiguity in the traces, and demonstrates its effectiveness on a range of synthetic fault-tolerant quantum benchmarks. The access traces can have applications in a wide range of scenarios, enabling analysis and profiling of execution of quantum programs and the hardware they run on. As one example use of TraceQ, this work investigates whether such traces can act as a side channel through which an observer can recover the circuit's structure and identify known subroutines in a larger program or even whole programs. The findings show that indeed the minimal access traces can be used to recover subroutines or even whole quantum programs with very high accuracy. Only a single trace per program execution is needed and the processing can be done fully offline. Along with the custom heuristics, advanced subgraph matching algorithms used in this work enable a high rate of locating the subroutines while executing in minimal time.

IEEE International Symposium on High-Performance Computer Architecture (HPCA)•Jan 31, 2026•1 citation

Development of Quantum Algorithms (DOD)

Federal Grants & Contracts•May 14, 2019•0 citations

Trapped Ion Quantum Computing Systems (DOD)

Federal Grants & Contracts•May 14, 2019•0 citations

Fault-tolerant operation and materials science with neutral atom logical qubits

Woo Chang Chung, Daniel C. Cole, Pranav Gokhale +27 more

Abstract We report on the fault-tolerant operation of logical qubits on a neutral atom quantum computer, with logical performance surpassing physical performance for multiple circuits including Bell state preparation (12x error reduction), random circuits (15x), and a prototype Anderson Impurity Model ground state solver for materials science applications (up to 6x, non-fault-tolerantly). The logical qubits are implemented via the [[4, 2, 2]] code (C 4 ). Our work constitutes the first complete realization of the benchmarking protocol proposed by Gottesman 2016 demonstrating results consistent with fault tolerance. In light of recent advances on applying concatenated C 4 /C 6 detection codes to achieve error correction with high code rates and thresholds, our work can be regarded as a building block towards a practical scheme for fault tolerant quantum computation. Our demonstration of a materials science application with logical qubits particularly demonstrates the immediate value of these techniques on current experiments.

npj Quantum Information•Dec 5, 2025•8 citations
To run a practical size of quantum program, computer architects have been making tremendous efforts to realize fault-tolerant quantum computing (FTQC) which constructs a fault-tolerant logical qubit by correcting many erroneous physical qubits during runtime. However, it is extremely challenging to build a full-stack FTQC system consisting of heterogeneous stacks, where each stack incurs unique challenges regarding the fault tolerance and the interplay of the challenges incurs very complicated overall design choice problem. Therefore, computer architects must fully understand stack-specific optimizations and their system-level trade-offs, and resolve all the challenges together. In this article, we first introduce critical design challenges in architecting an FTQC system built on the superconducting technology, and then present our research outcomes to resolve the challenges to build an FTQC system realizing thousands of logical qubits. We also outline near-future directions to resolve the remaining challenges and provide insights toward realizing more scalable future FTQC systems.
Practical applications of quantum computing depend on fault-tolerant devices that employ error correction. A promising quantum error-correcting code for large-scale quantum computing is the surface code. For this code, Fault-Tolerant Quantum Computing (FTQC) can be performed via lattice surgery, i.e. merging and splitting of encoded qubit patches on a 2D grid. Lattice surgery operations result in space-time patterns of activity that are defined in this work as access traces. This work demonstrates that the access traces reveal when, where, and how logical qubits interact. Leveraging this formulation, this work further introduces TraceQ, a tracebased reconstruction framework that is able to reconstruct the quantum circuit dataflow just by observing the patch activity at each trace entry. The framework is supported by heuristics for handling inherent ambiguity in the traces, and demonstrates its effectiveness on a range of synthetic fault-tolerant quantum benchmarks. The access traces can have applications in a wide range of scenarios, enabling analysis and profiling of execution of quantum programs and the hardware they run on. As one example use of TraceQ, this work investigates whether such traces can act as a side channel through which an observer can recover the circuit's structure and identify known subroutines in a larger program or even whole programs. The findings show that indeed the minimal access traces can be used to recover subroutines or even whole quantum programs with very high accuracy. Only a single trace per program execution is needed and the processing can be done fully offline. Along with the custom heuristics, advanced subgraph matching algorithms used in this work enable a high rate of locating the subroutines while executing in minimal time.
Abstract We report on the fault-tolerant operation of logical qubits on a neutral atom quantum computer, with logical performance surpassing physical performance for multiple circuits including Bell state preparation (12x error reduction), random circuits (15x), and a prototype Anderson Impurity Model ground state solver for materials science applications (up to 6x, non-fault-tolerantly). The logical qubits are implemented via the [[4, 2, 2]] code (C 4 ). Our work constitutes the first complete realization of the benchmarking protocol proposed by Gottesman 2016 demonstrating results consistent with fault tolerance. In light of recent advances on applying concatenated C 4 /C 6 detection codes to achieve error correction with high code rates and thresholds, our work can be regarded as a building block towards a practical scheme for fault tolerant quantum computation. Our demonstration of a materials science application with logical qubits particularly demonstrates the immediate value of these techniques on current experiments.