Reduced density matrix sampling: Self-consistent embedding and multiscale electronic structure on current generation quantum computers
Open accessThe DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Abstract
We investigate fully self-consistent multiscale quantum-classical algorithms on current generation superconducting quantum computers, in a unified approach to tackle the correlated electronic structure of large systems in both quantum chemistry and condensed matter physics. In both of these contexts, a strongly correlated quantum region of the extended system is isolated and self-consistently coupled to its environment via the sampling of reduced density matrices. We analyze the viability of current generation quantum devices to provide the required fidelity of these objects for a robust and efficient optimization of this subspace. We show that with a simple error mitigation strategy these self-consistent algorithms are indeed highly robust, even in the presence of significant noises on quantum hardware. Furthermore, we demonstrate the use of these density matrices for the sampling of nonenergetic properties, including dipole moments and Fermi liquid parameters in condensed phase systems, achieving a reliable accuracy with sparse sampling. It appears that uncertainties derived from the iterative optimization of these subspaces is smaller than variances in the energy for a single subspace optimization with current quantum hardware. This boosts the prospect for routine self-consistency to improve the choice of correlated subspaces in hybrid quantum-classical approaches to electronic structure for large systems in this multiscale fashion.
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 Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
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×
“In section III we consider the CASSCF optimization of carbon monoxide on IBM Quantum services (IBMQ) machines, where active space wave function are optimized on the QPU within the variational quantum eigensolver (VQE) [25].”
BackgroundMethodHardware-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
�ber das Paulische �quivalenzverbot
Jordan, P., & Wigner, E. (1928) · Zeitschrift f�r Physik · doi:10.1007/bf01331938 · Cited by 2,597 · cited 1×
“For this, we use the Jordan-Wigner mapping [27], though other mappings (e.”
MethodBarren plateaus in quantum neural network training landscapes
McClean, J. R., Boixo, S., Smelyanskiy, V. N., Babbush, R., & Neven, H. (2018) · Nature Communications · doi:10.1038/s41467-018-07090-4 · Cited by 2,329
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
Recent developments in the P y SCF program package
Sun, Q., Zhang, X., Banerjee, S., Bao, P., Barbry, M., Blunt, N. S., Bogdanov, N. A., Booth, G. H., Chen, J., Cui, Z.-H., et al. (2020) · The Journal of Chemical Physics · doi:10.1063/5.0006074 · Cited by 1,259 · cited 1×
“The optimization of R then proceeds via construction of the gradient and Hessian of the energy with respect to these parameters, which can then be updated at modest computational expense via a quasi-second order step, accelerated with iterative subspace methods as implemented in the PySCF package [17, 65, 66].”
MethodSelf-citationBravyi, S. B., & Kitaev, A. Y. (2002) · Annals of Physics · doi:10.1006/aphy.2002.6254 · Cited by 1,033
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
Elucidating 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 · cited 2×
“This limitation is a potential opportunity for NISQ computers to exhibit a quantum advantage in this keystone method in quantum chemistry, with the active-space paradigm often being touted as a near-term prospect for quantum computers [1,12] (see, e.”
BackgroundMethod
Cited by
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
Self-citationPerspective on the Current State-of-the-Art of Quantum Computing for Drug Discovery Applications
Blunt, N. S., Camps, J., Crawford, O., Izsák, R., Leontica, S., Mirani, A., Moylett, A. E., Scivier, S. A., Sünderhauf, C., Schopf, P., et al. (2022) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.2c00574 · Cited by 192
Quantum computing algorithms: getting closer to critical problems in computational biology
Marchetti, L., Nifosì, R., Martelli, P. L., Da Pozzo, E., Cappello, V., Banterle, F., Trincavelli, M. L., Martini, C., & D’Elia, M. (2022) · Briefings in Bioinformatics · doi:10.1093/bib/bbac437 · Cited by 47
Towards the simulation of large scale protein–ligand interactions on NISQ-era quantum computers
Malone, F. D., Parrish, R. M., Welden, A. R., Fox, T., Degroote, M., Kyoseva, E., Moll, N., Santagati, R., & Streif, M. (2022) · Chemical Science · doi:10.1039/d1sc05691c · Cited by 48
Singh, H., Majumder, S., & Mishra, S. (2025) · The Journal of Chemical Physics · doi:10.1063/5.0249447 · Cited by 7
Metadata
- Authors
- Tilly, J., Sriluckshmy, P. V., Patel, A., Fontana, E., Rungger, I., Grant, E., Anderson, R., Tennyson, J., & Booth, G. H.
- Venue
- Physical Review Research
- Publisher
- American Physical Society (APS)
- Published
- 2021-09-10
- Volume
- 3
- Issue
- 3
- ISSN
- 2643-1564 (ISSN-L)
- OpenAlex
- W3153160009
- Cited by
- 56
- References
- 18
- FWCI
- 3.53
- 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.