The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Hardware-efficient variational quantum algorithms for time evolution
Open accessAbstract
Parameterized quantum circuits are a promising technology for achieving a quantum advantage. An important application is the variational simulation of time evolution of quantum systems. To make the most of quantum hardware, variational algorithms need to be as hardware-efficient as possible. Here we present alternatives to the time-dependent variational principle that are hardware-efficient and do not require matrix inversion. In relation to imaginary time evolution, our approach significantly reduces the hardware requirements. With regards to real time evolution, where high precision can be important, we present algorithms of systematically increasing accuracy and hardware requirements. We numerically analyze the performance of our algorithms using quantum Hamiltonians with local interactions.
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
A variational eigenvalue solver on a photonic quantum processor
Peruzzo, A., McClean, J., Shadbolt, P., Yung, M.-H., Zhou, X.-Q., Love, P. J., Aspuru-Guzik, A., & O’Brien, J. L. (2014) · Nature Communications · doi:10.1038/ncomms5213 · Cited by 4,552
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 2×
“Although significant progress has been made based on the original quantum algorithm for simulating time evolution [2], this algorithm faces obstacles on current quantum hardware which lacks quantum error correction [10–12].”
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
The theory of variational hybrid quantum-classical algorithms
McClean, J. R., Romero, J., Babbush, R., & Aspuru-Guzik, A. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/2/023023 · Cited by 2,227
Efficient Simulation of One-Dimensional Quantum Many-Body Systems
Vidal, G. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.040502 · Cited by 1,779
Quantum computational chemistry
McArdle, S., Endo, S., Aspuru-Guzik, A., Benjamin, S. C., & Yuan, X. (2020) · Reviews of Modern Physics · doi:10.1103/revmodphys.92.015003 · Cited by 1,621
Quantum Chemistry in the Age of Quantum Computing
Cao, Y., Romero, J., Olson, J. P., Degroote, M., Johnson, P. D., Kieferová, M., Kivlichan, I. D., Menke, T., Peropadre, B., Sawaya, N. P. D., et al. (2019) · Chemical Reviews · doi:10.1021/acs.chemrev.8b00803 · Cited by 1,560
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
Classical Simulation of Infinite-Size Quantum Lattice Systems in Two Spatial Dimensions
Jordan, J., Orús, R., Vidal, G., Verstraete, F., & Cirac, J. I. (2008) · Physical Review Letters · doi:10.1103/physrevlett.101.250602 · Cited by 710 · cited 2×
“A similar procedure is used in the time-evolving block decimation algorithm [24–27] as well as with projected entangled pair states [28–30].”
MethodEfficient Variational Quantum Simulator Incorporating Active Error Minimization
Li, Y., & Benjamin, S. C. (2017) · Physical Review X · doi:10.1103/physrevx.7.021050 · Cited by 686
Theory of variational quantum simulation
Yuan, X., Endo, S., Zhao, Q., Li, Y., & Benjamin, S. C. (2019) · Quantum · doi:10.22331/q-2019-10-07-191 · Cited by 458
Tang, H. L., Shkolnikov, V. O., Barron, G. S., Grimsley, H. R., Mayhall, N. J., Barnes, E., & Economou, S. E. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.020310 · Cited by 408
Tang, H. L., Shkolnikov, V. O., Barron, G. S., Grimsley, H. R., Mayhall, N. J., Barnes, E., & Economou, S. E. (2019) · arXiv · doi:10.48550/arxiv.1911.10205 · Cited by 408
Polynomial-time quantum algorithm for the simulation of chemical dynamics
Kassal, I., Jordan, S. P., Love, P. J., Mohseni, M., & Aspuru-Guzik, A. (2008) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0808245105 · Cited by 385
Simulating Chemistry Using Quantum Computers
Kassal, I., Whitfield, J. D., Perdomo-Ortiz, A., Yung, M.-H., & Aspuru-Guzik, A. (2011) · Annual Review of Physical Chemistry · doi:10.1146/annurev-physchem-032210-103512 · Cited by 352
Variational quantum algorithms for nonlinear problems
Lubasch, M., Joo, J., Moinier, P., Kiffner, M., & Jaksch, D. (2020) · Physical Review A · doi:10.1103/physreva.101.010301 · Cited by 332 · cited 2×
“[20, 43, 51] for examples).”
BackgroundSelf-citationMinimal universal two-qubit controlled-NOT-based circuits
Shende, V. V., Markov, I. L., & Bullock, S. S. (2004) · Physical Review A · doi:10.1103/physreva.69.062321 · Cited by 288
Learning the quantum algorithm for state overlap
Cincio, L., Subaşı, Y., Sornborger, A. T., & Coles, P. J. (2018) · New Journal of Physics · doi:10.1088/1367-2630/aae94a · Cited by 282
Hybrid Quantum-Classical Approach to Quantum Optimal Control
Li, J., Yang, X., Peng, X., & Sun, C.-P. (2017) · Physical Review Letters · doi:10.1103/physrevlett.118.150503 · Cited by 278 · cited 2×
“[46] and [47] to replace indirect measurements with direct ones.”
BackgroundVariational fast forwarding for quantum simulation beyond the coherence time
Cîrstoiu, C., Holmes, Z., Iosue, J., Cincio, L., Coles, P. J., & Sornborger, A. (2020) · npj Quantum Information · doi:10.1038/s41534-020-00302-0 · Cited by 232 · cited 1×
“Promising examples of quantum advantage obtained with PQCs have already been identified for time evolution [17, 18] and in other contexts such as for nonlinear partial differential equations [19, 20], dynamical mean field theory [21, 22], and machine learning [23].”
BackgroundStructure optimization for parameterized quantum circuits
Ostaszewski, M., Grant, E., & Benedetti, M. (2019) · arXiv · doi:10.48550/arxiv.1905.09692 · Cited by 214
Self-citationMethodology for replacing indirect measurements with direct measurements
Mitarai, K., & Fujii, K. (2019) · Physical Review Research · doi:10.1103/physrevresearch.1.013006 · Cited by 139
Parallel quantum simulation of large systems on small NISQ computers
Barratt, F., Dborin, J., Bal, M., Stojevic, V., Pollmann, F., & Green, A. G. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00420-3 · Cited by 111 · cited 2×
“The same concept is used in the design of noise-robust quantum circuits [34] and to simulate infinite matrix product states on a quantum computer [35].”
BackgroundHolographic quantum algorithms for simulating correlated spin systems
Foss-Feig, M., Hayes, D., Dreiling, J. M., Figgatt, C., Gaebler, J. P., Moses, S. A., Pino, J. M., & Potter, A. C. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.033002 · Cited by 100
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
The Variational Quantum Eigensolver: A review of methods and best practices
Tilly, J., Chen, H., Cao, S., Picozzi, D., Setia, K., Li, Y., Grant, E., Wossnig, L., Rungger, I., Booth, G. H., et al. (2022) · Physics Reports · doi:10.1016/j.physrep.2022.08.003 · Cited by 1,031
General parameter-shift rules for quantum gradients
Wierichs, D., Izaac, J., Wang, C., & Lin, C. Y.-Y. (2022) · Quantum · doi:10.22331/q-2022-03-30-677 · Cited by 299
Herman, D., Googin, C., Liu, X., Sun, Y., Galda, A., Safro, I., Pistoia, M., & Alexeev, Y. (2023) · Nature Reviews Physics · doi:10.1038/s42254-023-00603-1 · Cited by 284
Noisy intermediate-scale quantum (NISQ) 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. (2021) · arXiv · doi:10.48550/arxiv.2101.08448 · Cited by 166
Metadata
- Authors
- Benedetti, M., Fiorentini, M., & Lubasch, M.
- Venue
- Physical Review Research
- Publisher
- American Physical Society (APS)
- Published
- 2021-07-22
- Volume
- 3
- Issue
- 3
- ISSN
- 2643-1564 (ISSN-L)
- OpenAlex
- W3088357939
- Cited by
- 161
- References
- 24
- FWCI
- 11.03
- 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.