Cited by 508Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum Mechanics and Applications

Experimental comparison of two quantum computing architectures

Open access
Linke, Norbert M., Maslov, Dmitri, Roetteler, Martin, Debnath, Shantanu, Figgatt, Caroline, Landsman, Kevin A., Wright, Kenneth, Monroe, Christopher·2017·Proceedings of the National Academy of Sciences

Abstract

Significance: Quantum computers are an emerging technology promising to be vastly more powerful at solving certain problems than any conventional computer. These devices are now moving out of the laboratory and becoming generally programmable. This allows identical quantum tasks or algorithms to be implemented on radically different technologies to inform further development and scaling. We run a series of algorithms on the two leading platforms: trapped atomic ions and superconducting circuits. Whereas the superconducting system offers faster gate clock speeds and a solid-state platform, the ion-trap system features superior qubits and reconfigurable connections. The performance of these systems is seen to reflect the topology of connections in the base hardware, supporting the idea that quantum computer applications and hardware should be codesigned.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1073/pnas.1618020114

Cites

40 of 40 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 3

  1. [9]Cheung D, Maslov D, Severini S (2007) Translation techniques between quantum circuit architectures in Workshop on Quantum Information Processing .
  2. [25]Zajac DM, Hazard TM, Mi X, Nielsen E, R. PJ (2016) Scalable gate architecture for densely packed semiconductor spin qubits. arXiv:1607.07025 . · arXiv
  3. [33]Roetteler M (2010) Quantum algorithms for highly nonlinear boolean functions in Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA10) . pp. 448-457.

Cited by

Sorted by citations

Authors
Linke, N. M., Maslov, D., Roetteler, M., Debnath, S., Figgatt, C., Landsman, K. A., Wright, K., & Monroe, C.
Affiliations
  • Joint Center for Quantum Information and Computer Science (US)
  • U.S. National Science Foundation (US)
  • Microsoft (United States) (US)
Venue
Proceedings of the National Academy of Sciences
Published
2017-03-21
Volume
114
Issue
13
Pages
3305-3310
ISSN
  • 0027-8424 (ISSN-L)
  • 1091-6490
OpenAlex
W2586874551
Cited by
508
References
40
Citations by year
2026: 22 · 2025: 38 · 2024: 50 · 2023: 43 · 2022: 58 · 2021: 75 · 2020: 80 · 2019: 75 · 2018: 46 · 2017: 21
FWCI
35.71
Type
journal article
Language
en
Open access
Locations
  • Proceedings of the National Academy of Sciences (publishedVersion)
  • PubMed Central (publishedVersion)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • IARPA LogiQ Program (3130638)
  • AFOSR MURI Program (5710003628)
  • NSF Physics Frontier Centers (PHY0822671)
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 Mechanics and Applications
Keywords
transmon qubits, superconducting quantum computing, trapped-ion qubits, qubit connectivity

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