Universal Digital Quantum Simulation with Trapped Ions
Open accessThe DOI matches its Crossref record; 37 of the 39 references it cites were found in a registry or an index.
Abstract
A series of trapped calcium ions was used to simulate the complex dynamics of an interacting spin system.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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 source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Note that for bounded Hamiltonians, the Trotter expansion associated with the exponential of the polynomial sum of efficiently implementable nonlocal terms is also efficient [2, 29, 30], i.e., it only requires polynomial resources [35].”
From Quantum Simulation of Interacting Fermion Lattice Models in Trapped Ions (2012) · cites this paper as [35]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“One salient example is the use of a 6-qubit ion trap system 68 to implement general digital quantum simulation”
From Quantum algorithms: an overview (2016) · cites this paper as [68]
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“Our protocol consists of three steps, gathering techniques that have not been previously considered for quantum simulators of fermionic lattice models [35]:”
From Quantum Simulation of Interacting Fermion Lattice Models in Trapped Ions (2012) · cites this paper as [35]
Experimental — accuracy not yet measuredIn the citing paper
“Up to 100 quantum logic gates have been realized for six qubits with trapped ions22”
From From transistor to trapped-ion computers for quantum chemistry (2014) · cites this paper as [22]
In the citing paper
“In the general case, it would require a number of elementary gates of 2 20 ≃ 10 6 [2]. With our method, the number of gates can be as small as 10 per Trotter step, consisting of Mølmer-Sørensen gates (dark blue and green), local exp( iφ ′ σ y 2 ) gates (red), exp[ ± i ( π/ 4) ∑ i σ y i ] (yellow) and exp[ ± i ( π/ 4) ∑ i σ x i ] (cyan) gates (see Fig. 1b) [35].”
From Quantum Simulation of Interacting Fermion Lattice Models in Trapped Ions (2012) · cites this paper as [35]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Quantum computation and quantum information
Law, J. (2001) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/505482.505499 · Cited by 18,842
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Non-Abelian anyons and topological quantum computation
Nayak, C., Simon, S. H., Stern, A., Freedman, M., & Das Sarma, S. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1083 · Cited by 6,861
Quantum phase transition from a superfluid to a Mott insulator in a gas of ultracold atoms
Greiner, M., Mandel, O., Esslinger, T., Hänsch, T. W., & Bloch, I. (2002) · Nature · doi:10.1038/415039a · Cited by 5,935
Three qubits can be entangled in two inequivalent ways
Dür, W., Vidal, G., & Cirac, J. I. (2000) · Physical Review A · doi:10.1103/physreva.62.062314 · Cited by 3,384
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088
On the product of semi-groups of operators
Trotter, H. F. (1959) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1959-0108732-6 · Cited by 2,282
Interacting Electrons and Quantum Magnetism
Auerbach, A. (1994) · Graduate Texts in Contemporary Physics · doi:10.1007/978-1-4612-0869-3 · Cited by 1,738
Quantum Computation with Ions in Thermal Motion
Sørensen, A., & Mølmer, K. (1999) · Physical Review Letters · doi:10.1103/physrevlett.82.1971 · Cited by 1,112
An open-system quantum simulator with trapped ions
Barreiro, J. T., Müller, M., Schindler, P., Nigg, D., Monz, T., Chwalla, M., Hennrich, M., Roos, C. F., Zoller, P., & Blatt, R. (2011) · Nature · doi:10.1038/nature09801 · Cited by 1,100
Self-citation
Cited by
Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets
Kandala, A., Mezzacapo, A., Temme, K., Takita, M., Brink, M., Chow, J. M., & Gambetta, J. M. (2017) · Nature · doi:10.1038/nature23879 · Cited by 2,982
Georgescu, I. M., Ashhab, S., & Nori, F. (2014) · Reviews of Modern Physics · doi:10.1103/revmodphys.86.153 · Cited by 2,932
“trapped ions have resulted in the most advanced implementations of DQS to date (Barreiro et al., 2011; Lanyon et al., 2011).”
BackgroundInfluentialQuantum simulations with trapped ions
Blatt, R., & Roos, C. F. (2012) · Nature Physics · doi:10.1038/nphys2252 · Cited by 1,629
Self-citationTrapped-ion quantum computing: Progress and challenges
Bruzewicz, C. D., Chiaverini, J., McConnell, R., & Sage, J. M. (2019) · Applied Physics Reviews · doi:10.1063/1.5088164 · Cited by 1,483
Quantum algorithms: an overview
Montanaro, A. (2016) · npj Quantum Information · doi:10.1038/npjqi.2015.23 · Cited by 1,071
“One salient example is the use of a 6-qubit ion trap system [60] to implement general digital quantum simulation; we defer to survey papers [24, 44, 15, 7] for many further references.”
Metadata
- Authors
- Lanyon, B. P., Hempel, C., Nigg, D., Müller, M., Gerritsma, R., Zähringer, F., Schindler, P., Barreiro, J. T., Rambach, M., Kirchmair, G., Hennrich, M., Zoller, P., Blatt, R., & Roos, C. F.
- Affiliations
- Austrian Academy of Sciences (AT)
- Universität Innsbruck (AT)
- Corresponding author
- Lanyon, B. P.
- ORCID
- Venue
- Science
- Published
- 2011-10-07
- Volume
- 334
- Issue
- 6052
- Pages
- 57-61
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W2089867976
- Cited by
- 613
- References
- 39
- Citations by year
- 2026: 14 · 2025: 18 · 2024: 36 · 2023: 28 · 2022: 49 · 2021: 49 · 2020: 52 · 2019: 39 · 2018: 34 · 2017: 43 · 2016: 44 · 2015: 46 · 2014: 57 · 2013: 62 · 2012: 36
- FWCI
- 47.09
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Science (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Topics
- 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
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- digital quantum simulation, trapped ions, quantum simulation, spin systems, time evolution simulation, quantum control
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
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.