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

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE

An improved architecture of a realizable quantum computer for quantum programming languages

Nan Wu, Fangmin Song, Xiangdong Li

Published Mar 30, 2009• 3 citations
Publisher

Abstract

We study a new realizable architecture for a universal quantum computer based on different optimized components and computational models. Simulation demonstrates it has a higher computing efficiency compared with others. Error correction, fault tolerance and robustness are also discussed for this architecture.
DOI
10.1117/12.823463

Related papers

Layered Architecture for Quantum Computing

N. Cody Jones, Rodney Van Meter, Austin G. Fowler +4 more

We develop a layered quantum computer architecture, which is a systematic framework for tackling the individual challenges of developing a quantum computer while constructing a cohesive device design. We discuss many of the prominent techniques for implementing circuit-model quantum computing and introduce several new methods, with an emphasis on employing surface code quantum error correction. In doing so, we propose a new quantum computer architecture based on optical control of quantum dots. The timescales of physical hardware operations and logical, error-corrected quantum gates differ by several orders of magnitude. By dividing functionality into layers, we can design and analyze subsystems independently, demonstrating the value of our layered architectural approach. Using this concrete hardware platform, we provide resource analysis for executing fault-tolerant quantum algorithms for integer factoring and quantum simulation, finding that the quantum dot architecture we study could solve such problems on the timescale of days.

arXiv:1010.5022•Physical Review X•Jul 31, 2012•376 citations

Fault-Tolerant Continuous-Variable Measurement-based Quantum Computation Architecture

Mikkel V. Larsen, Christopher Chamberland, Kyungjoo Noh +2 more

Continuous-variable measurement-based quantum computation on cluster states has in recent years shown great potential for scalable, universal, and fault-tolerant quantum computation when combined with the Gottesman-Kitaev-Preskill (GKP) code and quantum error correction.However, no complete fault-tolerant architecture exists that includes everything from cluster-state generation with finite squeezing to gate implementations with realistic noise and error correction.In this work, we propose a simple architecture for the preparation of a cluster state in three dimensions in which gates can be efficiently implemented by gate teleportation.To accommodate scalability, we propose architectures that allow both spatial and temporal multiplexing, with the temporally encoded version requiring as little as two squeezed light sources.Because of its three-dimensional structure, the architecture supports topological qubit error correction, while GKP error correction is efficiently realized within the architecture by teleportation.To validate fault tolerance, the architecture is simulated using surface-GKP codes, including noise from GKP states as well as gate noise caused by finite squeezing in the cluster state.We find a fault-tolerant squeezing threshold of 12.7 dB, with room for further improvement.

arXiv:2101.03014•PRX Quantum•Aug 11, 2021•124 citations

A new software-based architecture for quantum computer

Nan Wu, Fangmin Song, Xiangdong Li

In this paper, we study a reliable architecture of a quantum computer and a new instruction set and machine language for the architecture, which can improve the performance and reduce the cost of the quantum computing. We also try to address some key issues in detail in the software-driven universal quantum computers.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Apr 2, 2010•1 citation

Towards fault-tolerance with universal phase-error-transparent gates for high-spin cat codes

Kelvin Onggadinata, Si Yan Koh, Arghya Maity +5 more

High-dimensional nuclear spins offer a hardware-efficient route to quantum error correction (QEC), with the spin cat code providing intrinsic robustness against phase errors -- the dominant noise channel in donor-in-silicon architectures. However, realizing the full potential of this encoding requires gate operations that preserve its error-correcting properties. In this work, we construct a universal logical gate set that is error-transparent (ET) to phase errors, and discuss its practical implementations and challenges. The ET gates ensure that phase errors occurring stochastically during gate operations are propagated in a systematically traceable manner and remain correctable in a subsequent QEC step. Among the universal gate set constructed, we identify the logical $X$ gate as the primary challenge and discuss potential realization schemes. In addition, to fully leverage the spin cat code's advantage over an unencoded qubit, multi-tone microwave driving of the logical $CZ$ gate is essential. Our simulations show that ET gates significantly outperform non-ET gates and may be necessary to surpass the break-even point. We further show how logical measurement and recovery can be constructed from ET operations, and explain why state-preparation cannot be made ET. In particular, ET measurement in the computational basis is realizable via spin parity measurement, and that error correction circuits constructed from ET operations achieve optimal error correction capacity. Our work charts a concrete path toward full fault-tolerant quantum computation with high-dimensional nuclear spin systems.

quant-pharXiv:2608.05992•Aug 7, 2026•0 citations

Experimental validation of a compact fault-tolerant architecture for trapped ions

Noah Berthusen, Ali Lavasani, Asmae Benhemou +11 more

Quantum error correction (QEC) is beginning to enable logical operations that outperform their unencoded physical counterparts, but useful fault-tolerant computation will require more than low-error quantum memory. An effective architecture must orchestrate efficient logical encoding, low-overhead logical operations, and access to the non-Clifford resources required for universal computation. Here, we introduce and experimentally validate such an architecture based on the $[[20,2,6]]$ $C_4$-Helix code, designed for the early fault-tolerant regime. Using Quantinuum Helios, a 98-qubit trapped-ion quantum processor, we experimentally demonstrate the principal components of this architecture: we perform repeated quantum error correction with an error of $4.6^{+6.2}_{-2.6}\times10^{-5}$ per logical qubit per QEC cycle. We benchmark the complete Clifford group on the two logical qubits of a single codeblock under active error correction, obtaining an error of $2.8^{+1.0}_{-1.6}\times 10^{-4}$ per two-qubit logical Clifford. We further demonstrate a fault-tolerant chain-map interface between $C_4$-Helix and a distance-5 surface code, preparing a heterogeneous three-logical-qubit GHZ state with a fidelity lower bound of $99.925^{+0.068}_{-0.245}\%$. In each case, the encoded implementation outperforms its corresponding unencoded physical baseline without relying on postselection. Circuit-level simulations indicate that improvements in physical fidelity bring the same architecture into the $10^{-6}$-$10^{-8}$ logical-error regime targeted for early fault-tolerant computation. Together, these results establish $C_4$-Helix as a hardware-validated fault-tolerant architecture rather than a bare quantum memory.

quant-pharXiv:2609.03194•Sep 4, 2026•8 citations

Fault-tolerant quantum computer architectures using hierarchies of quantum error-correcting codes

Isaac L. Chuang, Andrew W. Cross

Quantum computers have been shown to efficiently solve a class of problems for which no efficient solution is otherwise known. Physical systems can implement quantum computation, but devising realistic schemes is an extremely challenging problem largely due to the effect of noise. A quantum computer that is capable of correctly solving problems more rapidly than modern digital computers requires some use of so-called fault-tolerant components. Code-based fault-tolerance using quantum error-correcting codes is one of the most promising and versatile of the known routes for fault-tolerant quantum computation. This dissertation presents three main, new results about code-based fault-tolerant quantum computer architectures. The first result is a large new family of quantum codes that go beyond stabilizer codes, the most well-studied family of quantum codes. Our new family of codeword stabilized codes contains all known codes with optimal parameters. Furthermore, we show how to systematically find, construct, and understand such codes as a pair of codes: an additive quantum code and a classical (nonlinear) code. Second, we resolve an open question about universality of so-called transversal gates acting on stabilizer codes. Such gates are universal for classical fault-tolerant computation, but they were conjectured to be insufficient for universal fault-tolerant quantum computation. We show that transversal gates have a restricted form and prove that some important families of them cannot be quantum universal. This is strong evidence that so-called quantum software is necessary to achieve universality, and, therefore, fault-tolerant quantum computer architecture is fundamentally different from classical computer architecture. Finally, we partition the fault-tolerant design problem into levels of a hierarchy of concatenated codes and present methods, compatible with rigorous threshold theorems, for numerically evaluating these codes. The methods are applied to measure inner error-correcting code performance, as a first step toward elucidation of an effective fault-tolerant quantum computer architecture that uses no more than a physical, inner, and outer level of coding. Of the inner codes, the Golay code gives the highest pseudothreshold of 2 × 10-3. A comparison of logical error rate and overhead shows that the Bacon-Shor codes are competitive with Knill's C 4/C6 scheme at a base error rate of 10 -4. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)

•Jan 1, 2008•7 citations
We develop a layered quantum computer architecture, which is a systematic framework for tackling the individual challenges of developing a quantum computer while constructing a cohesive device design. We discuss many of the prominent techniques for implementing circuit-model quantum computing and introduce several new methods, with an emphasis on employing surface code quantum error correction. In doing so, we propose a new quantum computer architecture based on optical control of quantum dots. The timescales of physical hardware operations and logical, error-corrected quantum gates differ by several orders of magnitude. By dividing functionality into layers, we can design and analyze subsystems independently, demonstrating the value of our layered architectural approach. Using this concrete hardware platform, we provide resource analysis for executing fault-tolerant quantum algorithms for integer factoring and quantum simulation, finding that the quantum dot architecture we study could solve such problems on the timescale of days.
Continuous-variable measurement-based quantum computation on cluster states has in recent years shown great potential for scalable, universal, and fault-tolerant quantum computation when combined with the Gottesman-Kitaev-Preskill (GKP) code and quantum error correction.However, no complete fault-tolerant architecture exists that includes everything from cluster-state generation with finite squeezing to gate implementations with realistic noise and error correction.In this work, we propose a simple architecture for the preparation of a cluster state in three dimensions in which gates can be efficiently implemented by gate teleportation.To accommodate scalability, we propose architectures that allow both spatial and temporal multiplexing, with the temporally encoded version requiring as little as two squeezed light sources.Because of its three-dimensional structure, the architecture supports topological qubit error correction, while GKP error correction is efficiently realized within the architecture by teleportation.To validate fault tolerance, the architecture is simulated using surface-GKP codes, including noise from GKP states as well as gate noise caused by finite squeezing in the cluster state.We find a fault-tolerant squeezing threshold of 12.7 dB, with room for further improvement.
High-dimensional nuclear spins offer a hardware-efficient route to quantum error correction (QEC), with the spin cat code providing intrinsic robustness against phase errors -- the dominant noise channel in donor-in-silicon architectures. However, realizing the full potential of this encoding requires gate operations that preserve its error-correcting properties. In this work, we construct a universal logical gate set that is error-transparent (ET) to phase errors, and discuss its practical implementations and challenges. The ET gates ensure that phase errors occurring stochastically during gate operations are propagated in a systematically traceable manner and remain correctable in a subsequent QEC step. Among the universal gate set constructed, we identify the logical XXX gate as the primary challenge and discuss potential realization schemes. In addition, to fully leverage the spin cat code's advantage over an unencoded qubit, multi-tone microwave driving of the logical CZCZCZ gate is essential. Our simulations show that ET gates significantly outperform non-ET gates and may be necessary to surpass the break-even point. We further show how logical measurement and recovery can be constructed from ET operations, and explain why state-preparation cannot be made ET. In particular, ET measurement in the computational basis is realizable via spin parity measurement, and that error correction circuits constructed from ET operations achieve optimal error correction capacity. Our work charts a concrete path toward full fault-tolerant quantum computation with high-dimensional nuclear spin systems.
Quantum error correction (QEC) is beginning to enable logical operations that outperform their unencoded physical counterparts, but useful fault-tolerant computation will require more than low-error quantum memory. An effective architecture must orchestrate efficient logical encoding, low-overhead logical operations, and access to the non-Clifford resources required for universal computation. Here, we introduce and experimentally validate such an architecture based on the [[20,2,6]][[20,2,6]][[20,2,6]] C4C_4C4​-Helix code, designed for the early fault-tolerant regime. Using Quantinuum Helios, a 98-qubit trapped-ion quantum processor, we experimentally demonstrate the principal components of this architecture: we perform repeated quantum error correction with an error of 4.6−2.6+6.2×10−54.6^{+6.2}_{-2.6}\times10^{-5}4.6−2.6+6.2​×10−5 per logical qubit per QEC cycle. We benchmark the complete Clifford group on the two logical qubits of a single codeblock under active error correction, obtaining an error of 2.8−1.6+1.0×10−42.8^{+1.0}_{-1.6}\times 10^{-4}2.8−1.6+1.0​×10−4 per two-qubit logical Clifford. We further demonstrate a fault-tolerant chain-map interface between C4C_4C4​-Helix and a distance-5 surface code, preparing a heterogeneous three-logical-qubit GHZ state with a fidelity lower bound of 99.925−0.245+0.068%99.925^{+0.068}_{-0.245}\%99.925−0.245+0.068​%. In each case, the encoded implementation outperforms its corresponding unencoded physical baseline without relying on postselection. Circuit-level simulations indicate that improvements in physical fidelity bring the same architecture into the 10−610^{-6}10−6-10−810^{-8}10−8 logical-error regime targeted for early fault-tolerant computation. Together, these results establish C4C_4C4​-Helix as a hardware-validated fault-tolerant architecture rather than a bare quantum memory.
Quantum computers have been shown to efficiently solve a class of problems for which no efficient solution is otherwise known. Physical systems can implement quantum computation, but devising realistic schemes is an extremely challenging problem largely due to the effect of noise. A quantum computer that is capable of correctly solving problems more rapidly than modern digital computers requires some use of so-called fault-tolerant components. Code-based fault-tolerance using quantum error-correcting codes is one of the most promising and versatile of the known routes for fault-tolerant quantum computation. This dissertation presents three main, new results about code-based fault-tolerant quantum computer architectures. The first result is a large new family of quantum codes that go beyond stabilizer codes, the most well-studied family of quantum codes. Our new family of codeword stabilized codes contains all known codes with optimal parameters. Furthermore, we show how to systematically find, construct, and understand such codes as a pair of codes: an additive quantum code and a classical (nonlinear) code. Second, we resolve an open question about universality of so-called transversal gates acting on stabilizer codes. Such gates are universal for classical fault-tolerant computation, but they were conjectured to be insufficient for universal fault-tolerant quantum computation. We show that transversal gates have a restricted form and prove that some important families of them cannot be quantum universal. This is strong evidence that so-called quantum software is necessary to achieve universality, and, therefore, fault-tolerant quantum computer architecture is fundamentally different from classical computer architecture. Finally, we partition the fault-tolerant design problem into levels of a hierarchy of concatenated codes and present methods, compatible with rigorous threshold theorems, for numerically evaluating these codes. The methods are applied to measure inner error-correcting code performance, as a first step toward elucidation of an effective fault-tolerant quantum computer architecture that uses no more than a physical, inner, and outer level of coding. Of the inner codes, the Golay code gives the highest pseudothreshold of 2 × 10-3. A comparison of logical error rate and overhead shows that the Bacon-Shor codes are competitive with Knill's C 4/C6 scheme at a base error rate of 10 -4. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)