Digital-analog quantum algorithm for the quantum Fourier transform
Open accessThe DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Abstract
The authors introduce an efficient digital-analog quantum algorithm to compute the quantum Fourier transform, a subroutine widely employed in several relevant quantum algorithms. The paper shows that, under sensible assumptions about noise sources, the fidelity of the quantum Fourier transformation improves considerably with this approach when compared against digital quantum computing. This suggests that hybrid protocols combining digital and analog quantum computing could be a sensible approach to reach quantum advantage in the Noisy Intermediate-Scale Quantum era.
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
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1999) · SIAM Review · doi:10.1137/s0036144598347011 · Cited by 3,904
Quantum Algorithm for Linear Systems of Equations
Harrow, A. W., Hassidim, A., & Lloyd, S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.150502 · Cited by 3,325 · cited 2×
“eus ear systems of equations [9] or the quantum principal component analysis algorithm [10].”
BackgroundHardware-efficient variational quantum eigensolver for small molecules and quantum magnets
Kandala, A., Mezzacapo, A., Temme, K., Takita, M., Brink, M., Chow, J. M., & Gambetta, J. M. (2017) · Nature · doi:10.1038/nature23879 · Cited by 2,982
Quantum principal component analysis
Lloyd, S., Mohseni, M., & Rebentrost, P. (2014) · Nature Physics · doi:10.1038/nphys3029 · Cited by 1,385 · cited 1×
“The latter additionally appears as a subroutine of other algorithms, such as the Harrow-Hassidim-Lloyd (HHL) algorithm for lin-∗ Corresponding authors: mikel.sanz@ehu.es , ana.martinf@ehu.eus ear systems of equations [9] or the quantum principal component analysis algorithm [10].”
MethodError Mitigation for Short-Depth Quantum Circuits
Temme, K., Bravyi, S., & Gambetta, J. M. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.180509 · Cited by 1,379
Universal Digital Quantum Simulation with Trapped Ions
Lanyon, B. P., Hempel, C., Nigg, D., Müller, M., Gerritsma, R., Zähringer, F., Schindler, P., Barreiro, J. T., Rambach, M., Kirchmair, G., et al. (2011) · Science · doi:10.1126/science.1208001 · Cited by 613 · cited 1×
“A digital quantum computer, which is based on quantum circuits and the quantum gate model, is a physical platform, such as trapped ions [11, 12] or superconducting circuits [13–16], which can be programmed to e ffi ciently simulate another dynamics of interest.”
MethodPractical Quantum Error Mitigation for Near-Future Applications
Endo, S., Benjamin, S. C., & Li, Y. (2018) · Physical Review X · doi:10.1103/physrevx.8.031027 · Cited by 562
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
Digital Quantum Rabi and Dicke Models in Superconducting Circuits
Mezzacapo, A., Las Heras, U., Pedernales, J. S., DiCarlo, L., Solano, E., & Lamata, L. (2014) · Scientific Reports · doi:10.1038/srep07482 · Cited by 111
Self-citation
Cited by
Noisy intermediate-scale quantum algorithms
Bharti, K., Cervera-Lierta, A., Kyaw, T. H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J. S., Menke, T., et al. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.015004 · Cited by 2,231
Quantum Algorithms for Quantum Chemistry and Quantum Materials Science
Bauer, B., Bravyi, S., Motta, M., & Chan, G. K.-L. (2020) · Chemical Reviews · doi:10.1021/acs.chemrev.9b00829 · Cited by 848
Mitigating Realistic Noise in Practical Noisy Intermediate-Scale Quantum Devices
Sun, J., Yuan, X., Tsunoda, T., Vedral, V., Benjamin, S. C., & Endo, S. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.15.034026 · Cited by 105
Digital-analog quantum computation
Parra-Rodriguez, A., Lougovski, P., Lamata, L., Solano, E., & Sanz, M. (2020) · Physical Review A · doi:10.1103/physreva.101.022305 · Cited by 104
Self-citationDigital-Analog Quantum Simulations Using the Cross-Resonance Effect
Gonzalez-Raya, T., Asensio-Perea, R., Martin, A., Céleri, L. C., Sanz, M., Lougovski, P., & Dumitrescu, E. F. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.020328 · Cited by 27
Self-citationEnhanced connectivity of quantum hardware with digital-analog control
Galicia, A., Ramon, B., Solano, E., & Sanz, M. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033103 · Cited by 22
“It has also been given a decomposition of the quantum Fourier transform (QFT) using the DAQC paradigm [17].”
MethodSelf-citationApproximating the quantum approximate optimization algorithm with digital-analog interactions
Headley, D., Müller, T., Martin, A., Solano, E., Sanz, M., & Wilhelm, F. K. (2020) · arXiv · doi:10.48550/arxiv.2002.12215 · Cited by 21
Self-citation
Metadata
- Authors
- Martin, A., Lamata, L., Solano, E., & Sanz, M.
- Venue
- Physical Review Research
- Publisher
- American Physical Society (APS)
- Published
- 2020-01-06
- Volume
- 2
- Issue
- 1
- ISSN
- 2643-1564 (ISSN-L)
- OpenAlex
- W2949573886
- Cited by
- 41
- References
- 11
- FWCI
- 1.89
- Type
- journal article
- Language
- en
- Open access
- gold
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.