Cited by 91Quantum Information and CryptographyQuantum Computing Algorithms and ArchitectureCold Atom Physics and Bose-Einstein Condensates

Two-qubit entangling gates within arbitrarily long chains of trapped ions

Open access
Landsman, K. A., Wu, Y., Leung, P. H., Zhu, D., Linke, N. M., Brown, K. R., Duan, L., Monroe, C.·2019·Physical Review A

Abstract

Ion trap quantum computers are based on modulating the Coulomb interaction between atomic ion qubits using external forces. However, the spectral crowding of collective motional modes could pose a challenge to the control of such interactions for large numbers of qubits. Here, we show that high-fidelity quantum gate operations are still possible with very large trapped ion crystals by using a small and fixed number of motional modes, simplifying the scaling of ion trap quantum computers. We present analytical work that shows that gate operations need not couple to the motion of distant ions, allowing parallel entangling gates with a crosstalk error that falls off as the inverse cube of the distance between the pairs. We also experimentally demonstrate high-fidelity entangling gates on a fully connected set of seventeen $^{171}\mathrm{Yb}^{+}$ qubits using simple laser pulse shapes that primarily couple to just a few modes.

Integrity signals

Registry

Crossref · 10.1103/physreva.100.022332

Cites

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?

  • Trapped-ion systems with a single trapping zone are limited in qubit number due to challenges in individually addressing single qubits within a large ion crystal and motional mode crowding.

    “Trapped-ion systems with a single trapping zone are limited in qubit number due to challenges in individually addressing single qubits within a large ion crystal, as well as motional mode crowding, which complicates achieving high-fidelity operations in a large crystal [8,9].”

    From A Race-Track Trapped-Ion Quantum Processor (2023) · cites this paper as [9]

The citation lists haven’t been fetched yet

References 38 · Cited by 91

Authors
Landsman, K. A., Wu, Y., Leung, P. H., Zhu, D., Linke, N. M., Brown, K. R., Duan, L., & Monroe, C.
Affiliations
  • Joint Center for Quantum Information and Computer Science (US)
  • University of Michigan (US)
  • Duke University (US)
Venue
Physical Review A
Published
2019-08-26
Volume
100
Issue
2
ISSN
  • 0556-2791 (ISSN-L)
  • 2469-9926
  • 2469-9934
OpenAlex
W2946281680
Cited by
91
References
38
Citations by year
2026: 6 · 2025: 10 · 2024: 12 · 2023: 14 · 2022: 19 · 2021: 14 · 2020: 14 · 2019: 2
FWCI
5.59
Type
journal article
Language
en
Open access
Locations
  • Physical Review A (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • Army Research Office
  • Intelligence Advanced Research Projects Activity
  • Air Force Office of Scientific Research
  • National Science Foundation
  • U.S. Department of Energy
  • Advanced Scientific Computing Research
  • Basic Energy Sciences
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Cold Atom Physics and Bose-Einstein Condensates
Keywords
trapped-ion quantum computing, two-qubit entangling gates, electrostatic interactions, spectral crowding, crosstalk error, Yb3+, laser pulse shaping

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