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

Architectures and Applications for Scalable Quantum Information Systems

Isaac L. Chuang

Published Jan 1, 2007• 0 citations
OpenAlex

Abstract

The goal of this project was to understand what key interchangeable elements form a scalable, fault-tolerant quantum information systems architecture. The effort was a collaboration between computer science and physical sciences involving four groups: MIT, providing experimental quantum technology parameters and fundamental expertise in quantum information theory; UC Davis, devising fault-tolerant architecture designs and implementing numerical simulations; UC Berkeley, creating quantum cryptosystems and providing distributed applications; and U Washington, focusing on languages for quantum computation and an architectural simulator. Accomplishments of project include: design of several complete quantum architectures for large-scale, reliable quantum computers; implementation of a predictive design-tool to analyze system reliability given technology parameters and constraints; evaluation of requirements and performance of Shor's factoring algorithm on a complete benchmark quantum architecture design; and design of experimental realizations of experiments to identify crucial parameters for fault-tolerant quantum architectures.

Related papers

Scalability, Complexity and Reliability in Quantum Information Processing

Dan Stamper-Kurn, Umesh V. Vazirani, David S. Weiss +1 more

This program was a theory/experiment collaboration focusing on the fundamental need for scalability in the development of quantum information processing. Theory and experiment were connected and interleaved at several levels. The theory objectives were 1) to develop new theoretical tools to enable the implementation of reliable quantum information processing in scalable systems and 2) to characterize the relations between quantum algorithms and architectures, between fault tolerance and architectures, between quantum and classical complexity classes, and to develop secure primitives for quantum cryptography. The experimental objectives were to develop scalable quantum component technology based on gas phase systems using atoms and light fields. Specific experimental goals were scalable implementation of universal quantum logic in optical lattices and achievement of deterministic control in atom/cavity systems.

•Mar 1, 2007•0 citations

Achieving reliable, scalable, fault-tolerant quantum computation

Alfred V. Aho, Krysta M. Svore

Quantum computation has the potential to solve certain mathematical and physical problems faster than a classical computer. However, one of the key challenges to realizing a quantum computing device is controlling systematic errors and maintaining the coherence of the quantum state. In addition, once a scalable quantum computer is built, we must be able to fault-tolerantly communicate a quantum algorithm to the physical device. In this dissertation, we take several significant steps towards the realization of a quantum computer. We develop a framework for use with any proposed technology to map a quantum algorithm into fault-tolerant machine instructions. Within this framework, we combat errors and decoherence by introducing quantum error correction and fault tolerance into a quantum circuit. We analyze specific fault-tolerant circuitry on two general architectures, nonlocal and nearest-neighbor, to determine failure thresholds of the physical circuit components. These failure thresholds allow physicists to evaluate technology proposals. Our goal is to provide design tools, failure thresholds, and fault-tolerant constructions to combat the faultiness of quantum computation.

•Jan 1, 2006•0 citations

Computer Science Challenges in Quantum Computing: Early Fault-Tolerance and Beyond

Jens Palsberg, Jason Cong, Yufei Ding +7 more

Quantum computing is entering a period in which progress will be shaped as much by advances in computer science as by improvements in hardware. The central thesis of this report is that early fault-tolerant quantum computing shifts many of the primary bottlenecks from device physics alone to computer-science-driven system design, integration, and evaluation. While large-scale, fully fault-tolerant quantum computers remain a long-term objective, near- and medium-term systems will support early fault-tolerant computation with small numbers of logical qubits and tight constraints on error rates, connectivity, latency, and classical control. How effectively such systems can be used will depend on advances across algorithms, error correction, software, and architecture. This report identifies key research challenges for computer scientists and organizes them around these four areas, each centered on a fundamental question.

quant-pharXiv:2601.20247•Jan 29, 2026•2 citations

Synthesis and evaluation of fault-tolerant quantum computer architectures

Andrew W. Cross

Fault-tolerance is the cornerstone of practical, large-scale quantum computing, pushed into its prominent position with heroic theoretical efforts.The fault-tolerance threshold, which is the component failure probability below which arbitrarily reliable quantum computation becomes possible, is one standard quality measure of fault-tolerant designs based on recursive simulation.However, there is a gulf between theoretical achievements and the physical reality and complexity of envisioned quantum computing systems.This thesis takes a step toward bridging that gap.We develop a new experimental method for estimating fault-tolerance thresholds that applies to realistic models of quantum computer architectures, and demonstrate this technique numerically.We clarify a central problem for experimental approaches to fault-tolerance evaluationnamely, distinguishing between potentially optimistic pseudo-thresholds and actual thresholds that determine scalability.Next, we create a system architecture model for the trapped-ion quantum computer, discuss potential layouts, and numerically estimate the fault-tolerance threshold for this system when it is constrained to a local layout.Finally, we place the problem of evaluation and synthesis of fault-tolerant quantum computers into a broader framework by considering a software architecture for quantum computer design.

•Jan 1, 2005•14 citations

Quantum information engineering: concepts to quantum technologies

Simon J. Devitt

This thesis investigates several broad areas related to the effective implementation of quantum information processing, from large scale quantum algorithms and error correction, through to system identification and characterization techniques, efficient designs for quantum computing architectures and the design of small devices which utilize quantum effects. The discussion begins with the introduction of a quantum circuit appropriate for implementing Shor’s factoring algorithm on Linear Nearest Neighbor qubit arrays such as the Kane phosphorus in silicon system. Detailed numerical sim- ulations are then presented, demonstrating the sensitivity of the circuit under coherent quantum errors. The concepts of Quantum Error Correction and Fault-tolerant computation are reviewed with original work carried out to show the relative robustness and practicality of Fault-tolerant computation for logical state preparation. Methods of intrinsic system identification and characterization are proposed. Protocols for characterizing both the confinement of a multi-level system to the qubit subspace and the Hamiltonian dynamics governing two-qubit interactions are presented as well as a brief review of characterization techniques already developed for single qubit dynamics. (For complete abstract open document)

•Nov 1, 2007•0 citations

Architectures

Jacob M. Taylor

The principles of fault tolerance In this chapter we will consider some of the practical difficulties in building a large-scale quantum computing device. This discussion relies heavily upon the prior chapters that introduced faulttolerant quantum computation. Assuming that fault tolerance is possible allows us to focus on the physical realization of these ideas with a few specific examples. Before going into detail, we review the governing ideas behind any fault-tolerant architecture. These are the necessary components that we analyze in this chapter: good quantum memory, high-fidelity quantum operations, long-range quantum gates, and highly parallel operation, such that error correction in different sections of the device can be accomplished at the same time. While a wide variety of potential implementations may be possible, the goal of a fault-tolerant architecture is not only to be scalable, i.e., to be able to run an arbitrarily large computation with at most polynomial overhead [S95, S96e], but also to be as efficient as possible. Efficiency in this context means using the fewest physical resources (quantum bits, time, control operations) necessary to accomplish the desired computation [S03b]. From this perspective, the recipe for fault tolerance is well established. First, we need to identify what quantum operations are available for the various quantum bits at our disposal. Developing error models for these operations forms the bulk of this chapter. Important questions about operations include noise, implementation time, and bandwidth (how many such operations may be performed in parallel).

Cambridge University Press eBooks•Sep 5, 2013•0 citations
The goal of this project was to understand what key interchangeable elements form a scalable, fault-tolerant quantum information systems architecture. The effort was a collaboration between computer science and physical sciences involving four groups: MIT, providing experimental quantum technology parameters and fundamental expertise in quantum information theory; UC Davis, devising fault-tolerant architecture designs and implementing numerical simulations; UC Berkeley, creating quantum cryptosystems and providing distributed applications; and U Washington, focusing on languages for quantum computation and an architectural simulator. Accomplishments of project include: design of several complete quantum architectures for large-scale, reliable quantum computers; implementation of a predictive design-tool to analyze system reliability given technology parameters and constraints; evaluation of requirements and performance of Shor's factoring algorithm on a complete benchmark quantum architecture design; and design of experimental realizations of experiments to identify crucial parameters for fault-tolerant quantum architectures.
This program was a theory/experiment collaboration focusing on the fundamental need for scalability in the development of quantum information processing. Theory and experiment were connected and interleaved at several levels. The theory objectives were 1) to develop new theoretical tools to enable the implementation of reliable quantum information processing in scalable systems and 2) to characterize the relations between quantum algorithms and architectures, between fault tolerance and architectures, between quantum and classical complexity classes, and to develop secure primitives for quantum cryptography. The experimental objectives were to develop scalable quantum component technology based on gas phase systems using atoms and light fields. Specific experimental goals were scalable implementation of universal quantum logic in optical lattices and achievement of deterministic control in atom/cavity systems.
Quantum computation has the potential to solve certain mathematical and physical problems faster than a classical computer. However, one of the key challenges to realizing a quantum computing device is controlling systematic errors and maintaining the coherence of the quantum state. In addition, once a scalable quantum computer is built, we must be able to fault-tolerantly communicate a quantum algorithm to the physical device. In this dissertation, we take several significant steps towards the realization of a quantum computer. We develop a framework for use with any proposed technology to map a quantum algorithm into fault-tolerant machine instructions. Within this framework, we combat errors and decoherence by introducing quantum error correction and fault tolerance into a quantum circuit. We analyze specific fault-tolerant circuitry on two general architectures, nonlocal and nearest-neighbor, to determine failure thresholds of the physical circuit components. These failure thresholds allow physicists to evaluate technology proposals. Our goal is to provide design tools, failure thresholds, and fault-tolerant constructions to combat the faultiness of quantum computation.
Quantum computing is entering a period in which progress will be shaped as much by advances in computer science as by improvements in hardware. The central thesis of this report is that early fault-tolerant quantum computing shifts many of the primary bottlenecks from device physics alone to computer-science-driven system design, integration, and evaluation. While large-scale, fully fault-tolerant quantum computers remain a long-term objective, near- and medium-term systems will support early fault-tolerant computation with small numbers of logical qubits and tight constraints on error rates, connectivity, latency, and classical control. How effectively such systems can be used will depend on advances across algorithms, error correction, software, and architecture. This report identifies key research challenges for computer scientists and organizes them around these four areas, each centered on a fundamental question.
Fault-tolerance is the cornerstone of practical, large-scale quantum computing, pushed into its prominent position with heroic theoretical efforts.The fault-tolerance threshold, which is the component failure probability below which arbitrarily reliable quantum computation becomes possible, is one standard quality measure of fault-tolerant designs based on recursive simulation.However, there is a gulf between theoretical achievements and the physical reality and complexity of envisioned quantum computing systems.This thesis takes a step toward bridging that gap.We develop a new experimental method for estimating fault-tolerance thresholds that applies to realistic models of quantum computer architectures, and demonstrate this technique numerically.We clarify a central problem for experimental approaches to fault-tolerance evaluationnamely, distinguishing between potentially optimistic pseudo-thresholds and actual thresholds that determine scalability.Next, we create a system architecture model for the trapped-ion quantum computer, discuss potential layouts, and numerically estimate the fault-tolerance threshold for this system when it is constrained to a local layout.Finally, we place the problem of evaluation and synthesis of fault-tolerant quantum computers into a broader framework by considering a software architecture for quantum computer design.
This thesis investigates several broad areas related to the effective implementation of quantum information processing, from large scale quantum algorithms and error correction, through to system identification and characterization techniques, efficient designs for quantum computing architectures and the design of small devices which utilize quantum effects. The discussion begins with the introduction of a quantum circuit appropriate for implementing Shor’s factoring algorithm on Linear Nearest Neighbor qubit arrays such as the Kane phosphorus in silicon system. Detailed numerical sim- ulations are then presented, demonstrating the sensitivity of the circuit under coherent quantum errors. The concepts of Quantum Error Correction and Fault-tolerant computation are reviewed with original work carried out to show the relative robustness and practicality of Fault-tolerant computation for logical state preparation. Methods of intrinsic system identification and characterization are proposed. Protocols for characterizing both the confinement of a multi-level system to the qubit subspace and the Hamiltonian dynamics governing two-qubit interactions are presented as well as a brief review of characterization techniques already developed for single qubit dynamics. (For complete abstract open document)
The principles of fault tolerance In this chapter we will consider some of the practical difficulties in building a large-scale quantum computing device. This discussion relies heavily upon the prior chapters that introduced faulttolerant quantum computation. Assuming that fault tolerance is possible allows us to focus on the physical realization of these ideas with a few specific examples. Before going into detail, we review the governing ideas behind any fault-tolerant architecture. These are the necessary components that we analyze in this chapter: good quantum memory, high-fidelity quantum operations, long-range quantum gates, and highly parallel operation, such that error correction in different sections of the device can be accomplished at the same time. While a wide variety of potential implementations may be possible, the goal of a fault-tolerant architecture is not only to be scalable, i.e., to be able to run an arbitrarily large computation with at most polynomial overhead [S95, S96e], but also to be as efficient as possible. Efficiency in this context means using the fewest physical resources (quantum bits, time, control operations) necessary to accomplish the desired computation [S03b]. From this perspective, the recipe for fault tolerance is well established. First, we need to identify what quantum operations are available for the various quantum bits at our disposal. Developing error models for these operations forms the bulk of this chapter. Important questions about operations include noise, implementation time, and bandwidth (how many such operations may be performed in parallel).