Cited by 334Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum and electron transport phenomena

Layered architecture for quantum computing

Open access
Jones, N. Cody, Van Meter, Rodney, Fowler, Austin G., McMahon, Peter L., Kim, Jungsang, Ladd, Thaddeus D., Yamamoto, Yoshihisa·2012·Physical Review X

Abstract

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.

Integrity signals

Registry

Crossref · 10.1103/physrevx.2.031007

Cites

110 of 110 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The construction improves on estimates by Jones et al., Fowler et al., and Gheorghiu et al. by over 100x when accounting for slight remaining differences in the cost model.

    “We improve on their estimates by over 100x (see Table 2) when accounting for slight remaining differences in the cost model.”
  • Production or preparation of T gates is hardware-dependent, whereas the number of Toffoli gates is machine-independent but depends only on the algorithm.

    “Production or preparation of T gates is hardware-dependent, whereas the number of Toffoli gates (which consists of several T gates) is machine-independent but rather depends only on the algorithm, justifying the choice for the resource unit.”

Cites

Flagged first, then by citations

1 of the 111 references couldn’t be matched to a known paper.

Cited by

Sorted by citations

Authors
Jones, N. C., Van Meter, R., Fowler, A. G., McMahon, P. L., Kim, J., Ladd, T. D., & Yamamoto, Y.
Affiliations
  • Stanford University (US)
  • The University of Melbourne (AU)
  • Duke University (US)
  • National Institute of Informatics (JP)
Venue
Physical Review X
Published
2012-07-31
Volume
2
Issue
3
ISSN
2160-3308 (ISSN-L)
OpenAlex
W2016318583
Cited by
332
References
111
Citations by year
2026: 7 · 2025: 17 · 2024: 23 · 2023: 29 · 2022: 25 · 2021: 32 · 2020: 27 · 2019: 20 · 2018: 16 · 2017: 35 · 2016: 22 · 2015: 20 · 2014: 24 · 2013: 27 · 2012: 8
FWCI
24.88
Type
journal article
Language
en
Open access
Locations
  • Physical Review X (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • arXiv (Cornell University)
Funders
  • National Science Foundation
  • Army Research Office
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum and electron transport phenomena
Keywords
quantum computing architecture, layered architecture, surface code, quantum error correction, quantum dot qubits, fault-tolerant quantum computing, resource analysis, integer factorization, quantum simulation

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review