Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 63 of the 68 references it cites were found in a registry or an index; 28 of the 32 sources its claims cite were checked for support.

Quantum walks and Dirac cellular automata on a programmable trapped-ion quantum computer

Open access
Huerta Alderete, C., Singh, Shivani, Nguyen, Nhung H., Zhu, Daiwei, Balu, Radhakrishnan, Monroe, Christopher, Chandrashekar, C. M., Linke, Norbert M. · 2020 · Nature Communications

Abstract

The quantum walk formalism is a widely used and highly successful framework for modeling quantum systems, such as simulations of the Dirac equation, different dynamics in both the low and high energy regime, and for developing a wide range of quantum algorithms. Here we present the circuit-based implementation of a discrete-time quantum walk in position space on a five-qubit trapped-ion quantum processor. We encode the space of walker positions in particular multi-qubit states and program the system to operate with different quantum walk parameters, experimentally realizing a Dirac cellular automaton with tunable mass parameter. The quantum walk circuits and position state mapping scale favorably to a larger model and physical systems, allowing the implementation of any algorithm based on discrete-time quantum walks algorithm and the dynamics associated with the discretized version of the Dirac equation.

Overview

CoChat Summary

TL;DR

The paper implements discrete-time quantum walks and a Dirac cellular automaton on a five-qubit trapped-ion quantum processor, using a digital mapping of walker positions to multi-qubit states. It demonstrates tunable coin-bias parameters that mimic the Dirac mass term and observes characteristic relativistic spreading in the position probability distribution.

Key findings

  • A discrete-time quantum walk in one-dimensional position space was realized on five qubits within a seven-qubit programmable trapped-ion system, with evolution up to five steps and a position space of up to 15 positions.
  • A Dirac cellular automaton was experimentally realized by setting θ₁ = 0 and varying θ₂; θ₂ = π/4, π/10, and π/20 correspond to masses 1.1357, 0.3305, and 0.159 in units of ℏc⁻²s⁻¹, with small θ₂ showing bimodal/flat distributions and θ₂ = π/4 showing slow spread.
  • Gate counts after five steps were 78 R gates and 32 XX gates for the DQW, and 81 R gates and 32 XX gates for the DCA; recovering Dirac-equation evolution after five steps required 81 single-qubit gates and 32 XX gates.
  • The experimental and simulated position distributions matched closely, with a population mismatch of 0.05–0.2 after five steps, and crosstalk-induced population in unintended states was <2% for the deepest circuits.

Methods

  • Experiments used a chain of seven individual ¹⁷¹Yb⁺ ions in a Paul trap, with the middle five ions encoding qubits in the hyperfine-split ²S₁/₂ ground level; single-qubit R gates and two-qubit XX gates were driven by Raman beams, with single- and two-qubit gate fidelities of 99.5(2)% and 98–99%, respectively.
  • Position space of size 2ⁿ was mapped to n + 1 qubits, using one coin qubit and n position qubits, with a digital reordering so the last qubit corresponds to even/odd position numbers; circuits were compiled into native R and XX gates.
  • After evolution, the probability distribution was sampled 3000 times and corrected for readout errors, then compared with ideal classical simulation and, for the DCA, with the explicit time-dependent solution of the one-dimensional Dirac equation.

Limitations

  • The paper states a population mismatch of 0.05–0.2 between simulation and experiment after five steps, and notes that gate count and error grow with the number of steps.
  • The paper states that addressing crosstalk causes small population in alternate positions and in a logical encoding state not included in the mapping, with average experimental population <2% for the deepest circuits.
  • The paper states that further improvements in quantum hardware will be necessary for circuit complexity involving position-dependent coin operations; the text also makes evident that the demonstration is limited to five qubits, five steps, and a 2 × 2 Dirac representation without spin degree of freedom.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.1038/s41467-020-17519-4

Cites

63 of 63 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Figures

Fig. 1 Discrete-time quantum walk scheme. Each step is composed of a quantum coin operation, C^θ, with tunable effective coin bias parameters, θi, followed by a shift operation, S^.
Fig. 1 Discrete-time quantum walk scheme. Each step is composed of a quantum coin operation, C^θ, with tunable effective coin bias parameters, θi, followed by a shift operation, S^.CC BY · PubMed Central
Fig. 2 Mapping of multi-qubit states to position states. Multi-qubit states are re-ordered in such a way that the state ∣0⟩(∣1⟩) of the last qubit corresponds to even (odd) position numbers and its correspondence in the position space.
Fig. 2 Mapping of multi-qubit states to position states. Multi-qubit states are re-ordered in such a way that the state ∣0⟩(∣1⟩) of the last qubit corresponds to even (odd) position numbers and its correspondence in the position space.CC BY · PubMed Central
Fig. 3 Circuit implementation of quantum walks on a trapped-ion processor and its time evolution. a Circuit diagram for a DQW and DCA. Each dashed block describes one step in the quantum walk. b Discrete-time Quantum Walk. Comparison of the experimental results (left) and the theoretical quantum-walk probability distribution (right) for the first five steps with initial particle state b i and b iv ∣ψ⟩c=∣0⟩c, b ii and b iv ∣ψ⟩c=∣1⟩c, b iii and b vi ∣ψ⟩c=∣0⟩c+i∣1⟩c, and position state ∣x=0⟩. c Output of a step-5 Dirac Cellular Automaton for θ1 = 0 and, c i and c iv θ2 = π/4, c ii and c v θ2 = π/10 and c iii and c vi θ2 = π/20 with the initial state ∣Ψin⟩=(∣0⟩c+i∣1⟩c)⊗∣x=0⟩.
Fig. 3 Circuit implementation of quantum walks on a trapped-ion processor and its time evolution. a Circuit diagram for a DQW and DCA. Each dashed block describes one step in the quantum walk. b Discrete-time Quantum Walk. Comparison of the experimental results (left) and the theoretical quantum-walk probability distribution (right) for the first five steps with initial particle state b i and b iv ∣ψ⟩c=∣0⟩c, b ii and b iv ∣ψ⟩c=∣1⟩c, b iii and b vi ∣ψ⟩c=∣0⟩c+i∣1⟩c, and position state ∣x=0⟩. c Output of a step-5 Dirac Cellular Automaton for θ1 = 0 and, c i and c iv θ2 = π/4, c ii and c v θ2 = π/10 and c iii and c vi θ2 = π/20 with the initial state ∣Ψin⟩=(∣0⟩c+i∣1⟩c)⊗∣x=0⟩.CC BY · PubMed Central
Fig. 4 Experimental errors. Experimental error distribution for DQW (left) and DCA (right).
Fig. 4 Experimental errors. Experimental error distribution for DQW (left) and DCA (right).CC BY · PubMed Central
Fig. 5 Dirac kinematics and DCA. Numerical simulation of the explicit time-dependent solution of the one-dimensional Dirac equation (solid blue) and DCA (yellow bars) at (a) t = 3 and (b) t = 5 with a = 0.4 and θ2 = π/20.
Fig. 5 Dirac kinematics and DCA. Numerical simulation of the explicit time-dependent solution of the one-dimensional Dirac equation (solid blue) and DCA (yellow bars) at (a) t = 3 and (b) t = 5 with a = 0.4 and θ2 = π/20.CC BY · PubMed Central
Fig. 6 Gate block. a Toffoli 4--CNOT and b Toffoli 4--CNOT.
Fig. 6 Gate block. a Toffoli 4--CNOT and b Toffoli 4--CNOT.CC BY · PubMed Central

Verification

Claims the paper makes

15 Valid · 4 Not valid · 1 Not checked · 31 Own results and interpretations

18 more claims · 4 with their cited sources checked

Create a free account to see all 51 claims and every source verdict.

See all claims — free account
  • Probably not a substantial claim. 20
  • It may state two separate claims as one. 14

Create a free account to see these claims.

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.

Each contradiction between two passages listed here was confirmed by an independent check.

2 of 2

Citations

Cites

Show all 68 references

Research works printed but not linked: 1

  1. Thaller, B. The Dirac equation (Springer Science & Business Media, 2013).

Cited by

See all 50

Metadata

Authors
Huerta Alderete, C., Singh, S., Nguyen, N. H., Zhu, D., Balu, R., Monroe, C., Chandrashekar, C. M., & Linke, N. M.
Affiliations
  • Homi Bhabha National Institute (IN)
  • Joint Quantum Institute (US)
  • DEVCOM Army Research Laboratory (US)
Venue
Nature Communications
Published
2020-07-24
Volume
11
Issue
1
Pages
3720-3720
ISSN
2041-1723 (ISSN-L)
OpenAlex
W3004833681
Cited by
48
References
68
Citations by year
2026: 4 · 2025: 4 · 2024: 12 · 2023: 9 · 2022: 9 · 2021: 7 · 2020: 3
FWCI
2.75
Type
journal article
Language
en
Open access
Licence
Locations
  • Nature Communications (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • arXiv (Cornell University)
Funders
  • DST | Science and Engineering Research Board (SB/S2/RJN-192/2014)
  • NSF | Directorate for Mathematical & Physical Sciences | Division of Physics (PHY-1430094)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
Keywords
discrete-time quantum walks, trapped-ion quantum computer, quantum algorithms

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.

The claim verdicts this report counts are experimental: their accuracy is not yet measured.

A language model drew the claims from the paper on 2026-10-13, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

A second model labelled each claim on 2026-10-13 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).

Cited sources are checked with a language model’s help (gpt-6-sol).

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Quantum walks and Dirac cellular automata on a programmable trapped-ion quantum computer. https://app.cochat.ai/papers/10.1038/s41467-020-17519-4
The paper
Huerta Alderete, C., Singh, S., Nguyen, N. H., Zhu, D., Balu, R., Monroe, C., Chandrashekar, C. M., & Linke, N. M. (2020). Quantum walks and Dirac cellular automata on a programmable trapped-ion quantum computer. Nature Communications. https://doi.org/10.1038/s41467-020-17519-4

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.