Processor Core Model for Quantum Computing
Open accessAbstract
We describe an architecture based on a processing "core," where multiple qubits interact perpetually, and a separate "store," where qubits exist in isolation. Computation consists of single qubit operations, swaps between the store and the core, and free evolution of the core. This enables computation using physical systems where the entangling interactions are "always on." Alternatively, for switchable systems, our model constitutes a prescription for optimizing many-qubit gates. We discuss implementations of the quantum Fourier transform, Hamiltonian simulation, and quantum error correction.
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.
Integrity signals
Registry
Cites
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.
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?
Imperfect QST over a uniform spin chain is impossible for long chains.
“Imperfect QST [8, 9] over a uniform spin chain was studied numerically, showing that perfect state transfer is impossible for long chains.”
From Quantum speed limit for perfect state transfer in one dimension (2006) · cites this paper as [8]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
The citation lists haven’t been fetched yet
References 15 · Cited by 34
- Authors
- Yung, M.-H., Benjamin, S. C., & Bose, S.
- Affiliations
- University of Illinois Urbana-Champaign (US)
- University of Oxford (GB)
- University College London (GB)
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2006-06-05
- Volume
- 96
- Issue
- 22
- Pages
- 220501-220501
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W1993696486
- Cited by
- 34
- References
- 15
- Citations by year
- 2026: 1 · 2024: 3 · 2021: 1 · 2019: 1 · 2018: 3 · 2014: 1 · 2013: 2 · 2012: 3
- FWCI
- 4.57
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Physical Review Letters (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- UCL Discovery (University College London) (submittedVersion)
- arXiv (Cornell University)
- 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 many-body systems
- Keywords
- quantum processor architecture, single-qubit operations, quantum Fourier transform, Hamiltonian simulation, quantum error correction
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
