Scalable quantum computation via local control of only two qubits
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
We apply quantum control techniques to a long spin chain by acting only on two qubits at one of its ends, thereby implementing universal quantum computation by a combination of quantum gates on these qubits and indirect swap operations across the chain. It is shown that the control sequences can be computed and implemented efficiently. We discuss the application of these ideas to physical systems such as superconducting qubits in which full control of long chains is challenging.
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
Optimal Control at the Quantum Speed Limit
Caneva, T., Murphy, M., Calarco, T., Fazio, R., Montangero, S., Giovannetti, V., & Santoro, G. E. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.240501 · Cited by 509
Self-citationQuantum computations with atoms in optical lattices: Marker qubits and molecular interactions
Calarco, T., Dorner, U., Julienne, P. S., Williams, C. J., & Zoller, P. (2004) · Physical Review A · doi:10.1103/physreva.70.012306 · Cited by 172
Self-citationFrom perfect to fractal transmission in spin chains
De Chiara, G., Rossini, D., Montangero, S., & Fazio, R. (2005) · Physical Review A · doi:10.1103/physreva.72.012323 · Cited by 113
Self-citation
Cited by
Glaser, S. J., Boscain, U., Calarco, T., Koch, C. P., Köckenberger, W., Kosloff, R., Kuprov, I., Luy, B., Schirmer, S., Schulte-Herbrüggen, T., et al. (2015) · The European Physical Journal D · doi:10.1140/epjd/e2015-60464-1 · Cited by 774
Self-citationPERFECT, EFFICIENT, STATE TRANSFER AND ITS APPLICATION AS A CONSTRUCTIVE TOOL
KAY, A. (2010) · International Journal of Quantum Information · doi:10.1142/s0219749910006514 · Cited by 319
Communication at the quantum speed limit along a spin chain
Murphy, M., Montangero, S., Giovannetti, V., & Calarco, T. (2010) · Physical Review A · doi:10.1103/physreva.82.022318 · Cited by 121
Self-citationOn the Universality of the Quantum Approximate Optimization Algorithm
Morales, M. E. S., Biamonte, J., & Zimborás, Z. (2019) · arXiv · doi:10.48550/arxiv.1909.03123 · Cited by 95
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
“, with a smooth shifting of Zeeman energies,(5) via feed-forward techniques,(6) using measurement-based computation(7) or quantum control.(8,9) Most of these approaches are based on the assumption that the natural couplings are fixed by nature and not tunable, whereas local interactions can be modulated with external…”
Method
Metadata
- Authors
- Burgarth, D., Maruyama, K., Murphy, M., Montangero, S., Calarco, T., Nori, F., & Plenio, M. B.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2010-04-22
- Volume
- 81
- Issue
- 4
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2036638474
- Cited by
- 103
- References
- 3
- FWCI
- 9.18
- Type
- journal article
- Language
- en
- Open access
- bronze
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.