The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Increasing the Representation Accuracy of Quantum Simulations of Chemistry without Extra Quantum Resources
Open accessAbstract
Proposals for experiments in quantum chemistry on quantum computers leverage the ability to target a subset of degrees of freedom containing the essential quantum behavior, sometimes called the active space.This approximation allows one to treat more difficult problems using fewer qubits and lower gate depths than would otherwise be possible.However, while this approximation captures many important qualitative features, it may leave the results wanting in terms of absolute accuracy (basis error) of the representation.In traditional approaches, increasing this accuracy requires increasing the number of qubits and an appropriate increase in circuit depth as well.Here we explore two techniques requiring no additional qubits or circuit depth that are able to remove much of this approximation in favor of additional measurements.The techniques are constructed and analyzed theoretically, and some numerical proof-of-concept calculations are shown.As an example, we show how to achieve the accuracy of a 20-qubit representation using only four qubits and a modest number of additional measurements for a hydrogen molecule.We close with an outlook on the impact such techniques may have on both near-term and fault-tolerant quantum simulations.
Overview
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
Verification
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.
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
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
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 · cited 2×
“Prime candidates for this possibility have been variational algorithms, such as the variational quantum eigensolver (VQE) [22,23] or the quantum approximation optimization algorithm [24].”
BackgroundMethodSelf-citationHardware-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
Molecular Electronic‐Structure Theory
Helgaker, T., Jørgensen, P., & Olsen, J. (2000) · doi:10.1002/9781119019572 · Cited by 2,594
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
Self-citationMitarai, K., Negoro, M., Kitagawa, M., & Fujii, K. (2018) · Physical Review A · doi:10.1103/physreva.98.032309 · Cited by 1,639
Characterizing quantum supremacy in near-term devices
Boixo, S., Isakov, S. V., Smelyanskiy, V. N., Babbush, R., Ding, N., Jiang, Z., Bremner, M. J., Martinis, J. M., & Neven, H. (2018) · Nature Physics · doi:10.1038/s41567-018-0124-x · Cited by 1,175
Self-citationScalable Quantum Simulation of Molecular Energies
O’Malley, P. J. J., Babbush, R., Kivlichan, I. D., Romero, J., McClean, J. R., Barends, R., Kelly, J., Roushan, P., Tranter, A., Ding, N., et al. (2016) · Physical Review X · doi:10.1103/physrevx.6.031007 · Cited by 1,059
Self-citationElucidating reaction mechanisms on quantum computers
Reiher, M., Wiebe, N., Svore, K. M., Wecker, D., & Troyer, M. (2017) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1619152114 · Cited by 745
Classification with Quantum Neural Networks on Near Term Processors
Farhi, E., & Neven, H. (2018) · arXiv · doi:10.48550/arxiv.1802.06002 · Cited by 598
Cited by
Variational quantum algorithms
Cerezo, M., Arrasmith, A., Babbush, R., Benjamin, S. C., Endo, S., Fujii, K., McClean, J. R., Mitarai, K., Yuan, X., Cincio, L., et al. (2021) · Nature Reviews Physics · doi:10.1038/s42254-021-00348-9 · Cited by 3,385
“For instance, in quantum chemistry one can exploit the classical simulability of free fermion dynamics to apply quantum operations via classical post-processing [38–43].”
BackgroundSelf-citationNoisy 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 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
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
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
Hartree-Fock on a superconducting qubit quantum computer
Collaborators, G. A. Q. A., Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Boixo, S., Broughton, M., Buckley, B. B., et al. (2020) · Science · doi:10.1126/science.abb9811 · Cited by 729
Self-citationCai, Z., Babbush, R., Benjamin, S. C., Endo, S., Huggins, W. J., Li, Y., McClean, J. R., & O’Brien, T. E. (2023) · Reviews of Modern Physics · doi:10.1103/revmodphys.95.045005 · Cited by 591
Self-citationCompact Ion-Trap Quantum Computing Demonstrator
Pogorelov, I., Feldker, T., Marciniak, C. D., Postler, L., Jacob, G., Krieglsteiner, O., Podlesnic, V., Meth, M., Negnevitsky, V., Stadler, M., et al. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.020343 · Cited by 387
Layerwise learning for quantum neural networks
Skolik, A., McClean, J. R., Mohseni, M., van der Smagt, P., & Leib, M. (2021) · Quantum Machine Intelligence · doi:10.1007/s42484-020-00036-4 · Cited by 324
Self-citationVQE method: a short survey and recent developments
Fedorov, D. A., Peng, B., Govind, N., & Alexeev, Y. (2022) · Materials Theory · doi:10.1186/s41313-021-00032-6 · Cited by 224
A Multireference Quantum Krylov Algorithm for Strongly Correlated Electrons
Stair, N. H., Huang, R., & Evangelista, F. A. (2020) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.9b01125 · Cited by 183
Sokolov, I. O., Barkoutsos, P. K., Ollitrault, P. J., Greenberg, D., Rice, J., Pistoia, M., & Tavernelli, I. (2020) · The Journal of Chemical Physics · doi:10.1063/1.5141835 · Cited by 164
Fault-tolerant quantum simulations of chemistry in first quantization
Su, Y., Berry, D. W., Wiebe, N., Rubin, N., & Babbush, R. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040332 · Cited by 123
Self-citationOrbital optimized unitary coupled cluster theory for quantum computer
Mizukami, W., Mitarai, K., Nakagawa, Y. O., Yamamoto, T., Yan, T., & Ohnishi, Y.-Y. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033421 · Cited by 116
Quantum simulation with hybrid tensor networks
Yuan, X., Sun, J., Liu, J., Zhao, Q., & Zhou, Y. (2020) · arXiv · doi:10.48550/arxiv.2007.00958 · Cited by 79
Orbital-optimized pair-correlated electron simulations on trapped-ion quantum computers
Zhao, L., Goings, J., Shin, K., Kyoung, W., Fuks, J. I., Kevin Rhee, J.-K., Rhee, Y. M., Wright, K., Nguyen, J., Kim, J., et al. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00730-8 · Cited by 73
Tkachenko, N. V., Sud, J., Zhang, Y., Tretiak, S., Anisimov, P. M., Arrasmith, A. T., Coles, P. J., Cincio, L., & Dub, P. A. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.020337 · Cited by 73
Fujii, K., Mizuta, K., Ueda, H., Mitarai, K., Mizukami, W., & Nakagawa, Y. O. (2020) · arXiv · doi:10.48550/arxiv.2007.10917 · Cited by 66
Variational quantum eigensolver for frustrated quantum systems
Uvarov, A., Biamonte, J. D., & Yudin, D. (2020) · Physical Review B · doi:10.1103/physrevb.102.075104 · Cited by 61
Metadata
- Authors
- Takeshita, T., Rubin, N. C., Jiang, Z., Lee, E., Babbush, R., & McClean, J. R.
- Venue
- Physical Review X
- Publisher
- American Physical Society (APS)
- Published
- 2020-01-07
- Volume
- 10
- Issue
- 1
- ISSN
- 2160-3308 (ISSN-L)
- OpenAlex
- W2999682805
- Cited by
- 165
- References
- 23
- FWCI
- 9.38
- 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.