Shortcut to adiabatic gate teleportation
Open accessThe DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Abstract
We introduce a shortcut to the adiabatic gate teleportation model of quantum computation. More specifically, we determine fast local counterdiabatic Hamiltonians able to implement teleportation as a universal computational primitive. In this scenario, we provide the counterdiabatic driving for arbitrary $n$-qubit gates, which allows to achieve universality through a variety of gate sets. Remarkably, our approach maps the superadiabatic Hamiltonian ${H}_{\text{SA}}$ for an arbitrary $n$-qubit gate teleportation into the implementation of a rotated superadiabatic dynamics of an $n$-qubit state teleportation. This result is rather general, with the speed of the evolution only dictated by the quantum speed limit. In particular, we analyze the energetic cost for different Hamiltonian interpolations in the context of the energy-time complementarity.
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
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., & Wootters, W. K. (1993) · Physical Review Letters · doi:10.1103/physrevlett.70.1895 · Cited by 13,703
Elementary gates for quantum computation
Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., Sleator, T., Smolin, J. A., & Weinfurter, H. (1995) · Physical Review A · doi:10.1103/physreva.52.3457 · Cited by 4,311
Quantum information and computation
Bennett, C. H., & DiVincenzo, D. P. (2000) · Nature · doi:10.1038/35005001 · Cited by 3,263
Gottesman, D., & Chuang, I. L. (1999) · Nature · doi:10.1038/46503 · Cited by 1,860
Measurement-based quantum computation
Briegel, H. J., Browne, D. E., Dür, W., Raussendorf, R., & Van den Nest, M. (2009) · Nature Physics · doi:10.1038/nphys1157 · Cited by 1,090
The maximum speed of dynamical evolution
Margolus, N., & Levitin, L. B. (1998) · Physica D: Nonlinear Phenomena · doi:10.1016/s0167-2789(98)00054-2 · Cited by 887
Energy–time uncertainty relation for driven quantum systems
Deffner, S., & Lutz, E. (2013) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/46/33/335302 · Cited by 199
Both Toffoli and Controlled-NOT need little help to universal quantum computing
Shi, Y.-Y. (2003) · Quantum Information and Computation · doi:10.26421/qic3.1-7 · Cited by 193
Superadiabatic Controlled Evolutions and Universal Quantum Computation
Santos, A. C., & Sarandy, M. S. (2015) · Scientific Reports · doi:10.1038/srep15775 · Cited by 125
Self-citationCost of counterdiabatic driving and work output
Zheng, Y., Campbell, S., De Chiara, G., & Poletti, D. (2016) · Physical Review A · doi:10.1103/physreva.94.042132 · Cited by 103
Quantum gates with controlled adiabatic evolutions
Hen, I. (2015) · Physical Review A · doi:10.1103/physreva.91.022309 · Cited by 37
Research works printed but not linked: 22
- 10.1364/OPTICA.2.000832 · DOI · Paper page
- 10.1038/nature11472 · DOI · Paper page
- 10.1103/PhysRevLett.103.120504 · DOI
- A. Messiah, 1962, Quantum Mechanics
- 10.1021/jp030708a · DOI · Paper page
- 10.1021/jp040647w · DOI · Paper page
- 10.1088/1751-8113/42/36/365303 · DOI · Paper page
- 10.1016/B978-0-12-408090-4.00002-5 · DOI · Paper page
- L. Mandelstam, 1945, J. Phys. (USSR), 9, 249
- 10.1103/PhysRevA.67.052109 · DOI · Paper page
- J. J. Sakurai, 1994, Modern Quantum Mechanics
- 10.1098/rspa.1987.0131 · DOI · Paper page
- 10.1098/rspa.1990.0051 · DOI · Paper page
- 10.1103/PhysRevLett.109.100403 · DOI · Paper page
- 10.1103/PhysRevA.87.043402 · DOI
- 10.1103/PhysRevLett.109.115703 · DOI · Paper page
- 10.1103/PhysRevLett.111.100502 · DOI · Paper page
- 10.1103/PhysRevA.90.060301 · DOI · Paper page
- 10.1088/1367-2630/16/12/123034 · DOI
- 10.1103/PhysRevA.88.053422 · DOI
- 10.1088/1367-2630/16/5/053017 · DOI
- 10.1007/s11434-015-0727-x · DOI
Cited by
Shortcuts to adiabaticity: Concepts, methods, and applications
Guéry-Odelin, D., Ruschhaupt, A., Kiely, A., Torrontegui, E., Martínez-Garaot, S., & Muga, J. G. (2019) · Reviews of Modern Physics · doi:10.1103/revmodphys.91.045001 · Cited by 1,045
Quantum speed limits: from Heisenberg’s uncertainty principle to optimal quantum control
Deffner, S., & Campbell, S. (2017) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8121/aa86c6 · Cited by 585
Quantum speed limits: from Heisenberg's uncertainty principle to optimal quantum control
Deffner, S., & Campbell, S. (2017) · Maryland Shared Open Access Repository (USMAI Consortium) · doi:10.13016/m2heya-i4ys · Cited by 430
Trade-Off Between Speed and Cost in Shortcuts to Adiabaticity
Campbell, S., & Deffner, S. (2017) · Physical Review Letters · doi:10.1103/physrevlett.118.100601 · Cited by 235
Cost of counterdiabatic driving and work output
Zheng, Y., Campbell, S., De Chiara, G., & Poletti, D. (2016) · Physical Review A · doi:10.1103/physreva.94.042132 · Cited by 103
Metadata
- Authors
- Santos, A. C., Silva, R. D., & Sarandy, M. S.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2016-01-08
- Volume
- 93
- Issue
- 1
- ISSN
- 0556-2791 (ISSN-L)
- 2469-9926
- 2469-9934
- OpenAlex
- W2217384209
- Cited by
- 80
- References
- 11
- FWCI
- 14.94
- Type
- journal article
- Language
- en
- Open access
- green
- Funders
- Conselho Nacional de Desenvolvimento Científico e Tecnológico
- Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
- Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro
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.