Quantum Computing with an Always-On Heisenberg Interaction
Open accessAbstract
Many promising schemes for quantum computing (QC) involve switching "on" and "off" a physical coupling between qubits. This may prove extremely difficult to achieve experimentally. Here we show that systems with a constant Heisenberg coupling can be employed for QC if we actively "tune" the transition energies of individual qubits. Moreover, we can collectively tune the qubits to obtain an exceptionally simple scheme: computations are controlled via a single "switch" of only six settings. Our schemes are applicable to a wide range of physical implementations, from excitons and spins in quantum dots through to bulk magnets.
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?
The spin-chain channel does not require the ability to switch interactions on and off, nor does it require modulation by external fields.
“neither does the spin chain channel require the ability to switch interactions 'on' and 'off' (often a problem in quantum computer implementations [4, 5]), nor does it require any modulation by external fields (essential for quantum computation).”
From Quantum Communication through an Unmodulated Spin Chain (2003) · cites this paper as [5]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cites
Quantum computation with quantum dots
Loss, D., & DiVincenzo, D. P. (1998) · Physical Review A · doi:10.1103/physreva.57.120 · Cited by 6,840 · see citing works
A silicon-based nuclear spin quantum computer
Kane, B. E. (1998) · Nature · doi:10.1038/30156 · Cited by 3,779 · see citing works
Universal quantum computation with the exchange interaction
DiVincenzo, D. P., Bacon, D., Kempe, J., Burkard, G., & Whaley, K. B. (2000) · Nature · doi:10.1038/35042541 · Cited by 924 · see citing works
Electron-spin-resonance transistors for quantum computing in silicon-germanium heterostructures
Vrijen, R. B., Yablonovitch, E., Wang, K., Jiang, H. W., Balandin, A. A., Roychowdhury, V., Mor, T., & Divincenzo, D. P. (2000) · Physical Review A · doi:10.1103/physreva.62.012306 · Cited by 836 · see citing works
A Potentially Realizable Quantum Computer
Lloyd, S. (1993) · Science · doi:10.1126/science.261.5128.1569 · Cited by 649 · see citing works
Dynamics of Coupled Quantum Spin Chains
Schulz, H. J. (1996) · Physical Review Letters · doi:10.1103/physrevlett.77.2790 · Cited by 341 · see citing works
From the Quantum Zeno to the Inverse Quantum Zeno Effect
(2001) · doi:10.1103/physrevlett.86.2699 · Cited by 335 · see citing works
Anderson, P. W. (1963) · Medical Entomology and Zoology · Cited by 161 · see citing works
Universal quantum computation and simulation using any entangling Hamiltonian and local unitaries
Dodd, J. L., Nielsen, M. A., Bremner, M. J., & Thew, R. T. (2002) · Physical Review A · doi:10.1103/physreva.65.040301 · Cited by 156 · see citing works
Efficient Refocusing of One-Spin and Two-Spin Interactions for NMR Quantum Computation
Jones, J. A., & Knill, E. H. (1999) · Journal of Magnetic Resonance · doi:10.1006/jmre.1999.1890 · Cited by 110 · see citing works
Anomalous Quantum-Confined Stark Effects in Stacked InAs/GaAs Self-Assembled Quantum Dots
Sheng, W., & Leburton, J. (2002) · Physical Review Letters · doi:10.1103/physrevlett.88.167401 · Cited by 97 · see citing works
Quantum Computing Without Local Control of Qubit-Qubit Interactions
Benjamin, S. C. (2001) · Physical Review Letters · doi:10.1103/physrevlett.88.017904 · Cited by 80 · see citing works
Self-citationQuantum Computation with Untunable Couplings
Zhou, X., Zhou, Z.-W., Guo, G.-C., & Feldman, M. J. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.197903 · Cited by 76 · see citing works
Anderson, P. W. (1997) · World Scientific lecture notes in physics · doi:10.1142/3528 · Cited by 51 · see citing works
Benjamin, S. C. (2001) · Physical Review A · doi:10.1103/physreva.64.054303 · Cited by 49 · see citing works
Self-citation
Flagged first, then by citations
Cited by
Sorted by citations
Ultracold atomic gases in optical lattices: mimicking condensed matter physics and beyond
Lewenstein, M., Sanpera, A., Ahufinger, V., Damski, B., Sen(De), A., & Sen, U. (2007) · Advances in Physics · doi:10.1080/00018730701223200 · Cited by 2,104 · see citing works
Perfect State Transfer in Quantum Spin Networks
Christandl, M., Datta, N., Ekert, A., & Landahl, A. J. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.187902 · Cited by 1,179 · see citing works
Jaksch, D., & Zoller, P. (2005) · Annals of Physics · doi:10.1016/j.aop.2004.09.010 · Cited by 976 · see citing works
A Survey on quantum computing technology
Gyongyosi, L., & Imre, S. (2019) · Computer Science Review · doi:10.1016/j.cosrev.2018.11.002 · Cited by 646 · see citing works
Universal variational quantum computation
Biamonte, J. (2021) · Physical Review A · doi:10.1103/physreva.103.l030401 · Cited by 102 · see citing works
Quantum gate learning in qubit networks: Toffoli gate without time-dependent control
Banchi, L., Pancotti, N., & Bose, S. (2016) · npj Quantum Information · doi:10.1038/npjqi.2016.19 · Cited by 74 · see citing works
Self-citationAn exact effective two-qubit gate in a chain of three spins
Yung, M.-H., Leung, D. W., & Bose, S. (2004) · Quantum Information and Computation · doi:10.26421/qic4.3-2 · Cited by 39 · see citing works
Self-citationProcessor 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 · see citing works
Self-citation
- Authors
- Benjamin, S. C., & Bose, S.
- Affiliations
- University of Oxford (GB)
- California Institute of Technology (US)
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2003-06-19
- Volume
- 90
- Issue
- 24
- Pages
- 247901-247901
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2064057781
- Cited by
- 190
- References
- 15
- Citations by year
- 2026: 3 · 2025: 5 · 2024: 2 · 2023: 2 · 2022: 3 · 2021: 8 · 2020: 6 · 2019: 3 · 2018: 4 · 2017: 3 · 2016: 3 · 2015: 5 · 2014: 1 · 2013: 4 · 2012: 11
- FWCI
- 23.08
- 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 and electron transport phenomena
- Keywords
- quantum computing, Heisenberg exchange interaction, excitons, quantum dots, spin systems, bulk magnets, quantum gates
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
