Cited by 52Quantum Computing Algorithms and ArchitectureQuantum many-body systemsAdvanced Chemical Physics Studies

Mutual information-assisted adaptive variational quantum eigensolver

Open access
Zhang, Zi-Jian, Kyaw, Thi Ha, Kottmann, Jakob S, Degroote, Matthias, Aspuru-Guzik, Alán·2021·Quantum Science and Technology

Abstract

Adaptive construction of ansatz circuits offers a promising route towards applicable variational quantum eigensolvers on near-term quantum hardware. Those algorithms aim to build up optimal circuits for a certain problem and ansatz circuits are adaptively constructed by selecting and adding entanglers from a predefined pool. In this work, we propose a way to construct entangler pools with reduced size by leveraging classical algorithms. Our method uses mutual information between the qubits in classically approximated ground state to rank and screen the entanglers. The density matrix renormalization group method is employed for classical precomputation in this work. We corroborate our method numerically on small molecules. Our numerical experiments show that a reduced entangler pool with a small portion of the original entangler pool can achieve same numerical accuracy. We believe that our method paves a new way for adaptive construction of ansatz circuits for variational quantum algorithms.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1088/2058-9565/abdca4

Cites

47 of 47 references verified0 citation errors · 0 not checkable

Statistics

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.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 7

  1. [8]8. P. W. Atkins and R. S. Friedman, Molecular quantum mechan- ics (Oxford university press, 2011).
  2. [9]9. T. Helgaker, P. Jorgensen, and J. Olsen, Molecular electronic- structure theory (John Wiley & Sons, 2014).
  3. [22]22. H. L. Tang, V. Shkolnikov, G. S. Barron, H. R. Grimsley, N. J. Mayhall, E. Barnes, and S. E. Economou, "qubit- adapt-vqe: An adaptive algorithm for constructing hardware- efficient ansatze on a quantum processor," arXiv preprint arXiv:1911.10205 (2019). · arXiv
  4. [29]29. E. P. Wigner and P. Jordan, " Über das paulische äquivalenzver- bot," Z. Phys 47, 631 (1928).
  5. [30]30. S. B. Bravyi and A. Y. Kitaev, "Fermionic quantum computa- tion," Ann. Phys. 298, 210 (2002).
  6. [36]36. Q. Sun, T. C. Berkelbach, N. S. Blunt, G. H. Booth, S. Guo, Z. Li, J. Liu, J. D. McClain, E. R. Sayfutyarova, S. Sharma, et al., "PySCF: the Python-based simulations of chemistry framework," Wiley Interdiscip. Rev. Comput. Mol. Sci. 8, e1340 (2018).
  7. [43]43. N. V. Tkachenko, J. Sud, Y. Zhang, S. Tretiak, P. M. Anisi- mov, A. T. Arrasmith, P. J. Coles, L. Cincio, and P. A. Dub, "Correlation-informed permutation of qubits for reducing ansatz depth in vqe," arXiv preprint arXiv:2009.04996 (2020). · arXiv

Cited by

Sorted by citations

Authors
Zhang, Z.-J., Kyaw, T. H., Kottmann, J. S., Degroote, M., & Aspuru-Guzik, A.
Affiliations
University of Toronto (CA)
Venue
Quantum Science and Technology
Published
2021-07-01
Volume
6
Issue
3
Pages
035001
ISSN
2058-9565 (ISSN-L)
OpenAlex
W3121441853
Cited by
52
References
47
Citations by year
2026: 3 · 2025: 10 · 2024: 9 · 2023: 11 · 2022: 11 · 2021: 8
FWCI
3.45
Type
journal article
Language
en
Open access
Locations
  • Quantum Science and Technology (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) (submittedVersion)
  • OPUS (Augsburg University) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • Office of Science (Quantum Algorithms Teams Program)
  • Google (Google Focused Award)
  • Canada 150 Research Chairs Program
  • Anders G. Frøseth
  • U.S. Department of Energy (DE-SC0019374)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Advanced Chemical Physics Studies
Keywords
variational quantum eigensolver, mutual information, density matrix renormalization group, ground state approximation, small molecules, variational quantum algorithms

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