Quantum computation via translation-invariant operations on a chain of qubits
Open accessThe DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Abstract
A scheme of universal quantum computation is described that does not require local control. All the required operations, an Ising-type interaction and spatially uniform simultaneous one-qubit gates, are translation invariant.
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.
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
Cold Bosonic Atoms in Optical Lattices
Jaksch, D., Bruder, C., Cirac, J. I., Gardiner, C. W., & Zoller, P. (1998) · Physical Review Letters · doi:10.1103/physrevlett.81.3108 · Cited by 3,685
Quantum Communication through an Unmodulated Spin Chain
Bose, S. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.207901 · Cited by 1,407
Stabilizer Codes and Quantum Error Correction
Gottesman, D. (1997) · arXiv · doi:10.48550/arxiv.quant-ph/9705052 · Cited by 753
A Potentially Realizable Quantum Computer
Lloyd, S. (1993) · Science · doi:10.1126/science.261.5128.1569 · Cited by 649
A new universal and fault-tolerant quantum basis
Boykin, P. O., Mor, T., Pulver, M., Roychowdhury, V., & Vatan, F. (2000) · Information Processing Letters · doi:10.1016/s0020-0190(00)00084-3 · Cited by 194
Clifford group, stabilizer states, and linear and quadratic operations over GF(2)
Dehaene, J., & De Moor, B. (2003) · Physical Review A · doi:10.1103/physreva.68.042318 · Cited by 183
Reversible quantum cellular automata
Schumacher, B., & Werner, R. F. (2004) · arXiv · doi:10.48550/arxiv.quant-ph/0405174 · Cited by 113
Reversible universal quantum computation within translation-invariant systems
Vollbrecht, K. G. H., & Cirac, J. I. (2006) · Physical Review A · doi:10.1103/physreva.73.012324 · Cited by 33
Cited by
Quantum communication through spin chain dynamics: an introductory overview
Bose, S. (2007) · Contemporary Physics · doi:10.1080/00107510701342313 · Cited by 484
Entropy Scaling and Simulability by Matrix Product States
Schuch, N., Wolf, M. M., Verstraete, F., & Cirac, J. I. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.030504 · Cited by 409
Spin-based quantum computers made by chemistry: hows and whys
Stamp, P. C. E., & Gaita-Ariño, A. (2009) · J. Mater. Chem. · doi:10.1039/b811778k · Cited by 277
Large gradients via correlation in random parameterized quantum circuits
Volkoff, T., & Coles, P. J. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abd891 · Cited by 143
“[35] Robert Raussendorf, “Quantum computation via translation-invariant operations on a chain of qubits,” Phys.”
BackgroundA review of Quantum Cellular Automata
Farrelly, T. (2020) · Quantum · doi:10.22331/q-2020-11-30-368 · Cited by 138
“rs only on the end qubits of the line. Later it was shown in [80] that two species in an :::ABAB:::pattern suces for universal quantum computation. (In fact, even a single species should be sucient [73, 81].) These kinds of models are what some authors mean by the name quantum cellular automata (e.g., in [82]), wherea…”
BackgroundOn entropy growth and the hardness of simulating time evolution
Schuch, N., Wolf, M. M., Vollbrecht, K. G. H., & Cirac, J. I. (2008) · New Journal of Physics · doi:10.1088/1367-2630/10/3/033032 · Cited by 113
Processor Core Model for Quantum Computing
Yung, M.-H., Benjamin, S. C., & Bose, S. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.220501 · Cited by 34
Metadata
- Authors
- Raussendorf, R.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2005-11-01
- Volume
- 72
- Issue
- 5
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2114101207
- Cited by
- 55
- References
- 8
- FWCI
- 6.18
- Type
- journal article
- Language
- en
- Open access
- green
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.