Local, expressive, quantum-number-preserving VQE ansätze for fermionic systems
Open accessThe DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Abstract
We propose VQE circuit fabrics with advantageous properties for the simulation of strongly correlated ground and excited states of molecules and materials under the Jordan–Wigner mapping that can be implemented linearly locally and preserve all relevant quantum numbers: the number of spin up (α) and down (β) electrons and the total spin squared. We demonstrate that our entangler circuits are expressive already at low depth and parameter count, appear to become universal, and may be trainable without having to cross regions of vanishing gradient, when the number of parameters becomes sufficiently large and when these parameters are suitably initialized. One particularly appealing construction achieves this with just orbital rotations and pair exchange gates. We derive optimal four-term parameter shift rules for and provide explicit decompositions of our quantum number preserving gates and perform numerical demonstrations on highly correlated molecules on up to 20 qubits.
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
Hardware-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
Barren 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
Experimental realization of any discrete unitary operator
Reck, M., Zeilinger, A., Bernstein, H. J., & Bertani, P. (1994) · Physical Review Letters · doi:10.1103/physrevlett.73.58 · Cited by 2,155
Mitarai, K., Negoro, M., Kitagawa, M., & Fujii, K. (2018) · Physical Review A · doi:10.1103/physreva.98.032309 · Cited by 1,639 · cited 1×
“In addition to the original concept, multiple efforts have been made to analyze and generalize the parameter-shift rule [33, 35, 38, 52, 53].”
BackgroundEvaluating analytic gradients on quantum hardware
Schuld, M., Bergholm, V., Gogolin, C., Izaac, J., & Killoran, N. (2019) · Physical Review A · doi:10.1103/physreva.99.032331 · Cited by 1,072 · cited 1×
“In addition to the original concept, multiple efforts have been made to analyze and generalize the parameter-shift rule [33, 35, 38, 52, 53].”
BackgroundSelf-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
An adaptive variational algorithm for exact molecular simulations on a quantum computer
Grimsley, H. R., Economou, S. E., Barnes, E., & Mayhall, N. J. (2019) · Nature Communications · doi:10.1038/s41467-019-10988-2 · Cited by 1,033 · cited 3×
“For instance, UCCSD [1, 14, 15], (here referring to the Trotterized version thereof) and its sparse and/or low-rank cousins k-UpCCGSD [9, 16], ADAPT-VQE [21], and Jastrow-factor VQE [18] all may have the power to achieve universality at sufficient depth, e.g. as proved in a recent analysis of distangled UCC [23] and h…”
BackgroundMethodPennyLane: Automatic differentiation of hybrid quantum-classical computations
Bergholm, V., Izaac, J., Schuld, M., Gogolin, C., Ahmed, S., Ajith, V., Alam, M. S., Alonso-Linaje, G., AkashNarayanan, B., Asadi, A., et al. (2018) · arXiv · doi:10.48550/arxiv.1811.04968 · Cited by 732
Self-citationClassification with Quantum Neural Networks on Near Term Processors
Farhi, E., & Neven, H. (2018) · arXiv · doi:10.48550/arxiv.1802.06002 · Cited by 598
Hybrid quantum-classical hierarchy for mitigation of decoherence and determination of excited states
McClean, J. R., Kimchi-Schwartz, M. E., Carter, J., & de Jong, W. A. (2017) · Physical Review A · doi:10.1103/physreva.95.042308 · Cited by 516
Generalized Unitary Coupled Cluster Wave functions for Quantum Computation
Lee, J., Huggins, W. J., Head-Gordon, M., & Whaley, K. B. (2019) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.8b01004 · Cited by 432 · cited 3×
“For instance, UCCSD [1, 14, 15], (here referring to the Trotterized version thereof) and its sparse and/or low-rank cousins k-UpCCGSD [9, 16], ADAPT-VQE [21], and Jastrow-factor VQE [18] all may have the power to achieve universality at sufficient depth, e.”
BackgroundMethodAn initialization strategy for addressing barren plateaus in parametrized quantum circuits
Grant, E., Wossnig, L., Ostaszewski, M., & Benedetti, M. (2019) · Quantum · doi:10.22331/q-2019-12-09-214 · Cited by 406 · cited 1×
“On the topic of initialization strategies: a different strategy for mitigating barren plateaus was recently presented in the literature [48], and works by creating blocks of identity operators in the ansatz to limit the effective depth and reduce the issue of vanishing gradients.”
BackgroundLocal Random Quantum Circuits are Approximate Polynomial-Designs
Brandão, F. G. S. L., Harrow, A. W., & Horodecki, M. (2016) · Communications in Mathematical Physics · doi:10.1007/s00220-016-2706-8 · Cited by 404
Subspace-search variational quantum eigensolver for excited states
Nakanishi, K. M., Mitarai, K., & Fujii, K. (2019) · Physical Review Research · doi:10.1103/physrevresearch.1.033062 · Cited by 337
Solving strongly correlated electron models on a quantum computer
Wecker, D., Hastings, M. B., Wiebe, N., Clark, B. K., Nayak, C., & Troyer, M. (2015) · Physical Review A · doi:10.1103/physreva.92.062318 · Cited by 285
Quantum Computation of Electronic Transitions Using a Variational Quantum Eigensolver
Parrish, R. M., Hohenstein, E. G., McMahon, P. L., & Martínez, T. J. (2019) · Physical Review Letters · doi:10.1103/physrevlett.122.230401 · Cited by 282
Self-citationHybrid 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 1×
“In order to compute the derivative of expectation values with respect to quantum gate parameters, the so-called parameter-shift rule has been established as a tool to avoid finite difference derivatives, which become unstable under the influence of noise from both, measurements and circuit imperfections [51].”
MethodGard, B. T., Zhu, L., Barron, G. S., Mayhall, N. J., Economou, S. E., & Barnes, E. (2020) · npj Quantum Information · doi:10.1038/s41534-019-0240-1 · Cited by 266
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
Estimating the gradient and higher-order derivatives on quantum hardware
Mari, A., Bromley, T. R., & Killoran, N. (2021) · Physical Review A · doi:10.1103/physreva.103.012405 · Cited by 159 · cited 5×
“We note that the concept of shift-tuning was independently discovered in [38] and introduced in the quantum computing software package PennyLane [36].”
BackgroundMethodInfluentialA non-orthogonal variational quantum eigensolver
Huggins, W. J., Lee, J., Baek, U., O’Gorman, B., & Whaley, K. B. (2020) · New Journal of Physics · doi:10.1088/1367-2630/ab867b · Cited by 148
Measuring Analytic Gradients of General Quantum Evolution with the Stochastic Parameter Shift Rule
Banchi, L., & Crooks, G. E. (2020) · arXiv · doi:10.48550/arxiv.2005.10299 · Cited by 107
Preserving Symmetries for Variational Quantum Eigensolvers in the Presence of Noise
Barron, G. S., Gard, B. T., Altman, O. J., Mayhall, N. J., Barnes, E., & Economou, S. E. (2020) · arXiv · doi:10.48550/arxiv.2003.00171 · Cited by 32
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
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
Self-citationOrbital-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
Singh, H., Majumder, S., & Mishra, S. (2023) · The Journal of Chemical Physics · doi:10.1063/5.0161057 · Cited by 51
Metadata
- Authors
- Anselmetti, G.-L. R., Wierichs, D., Gogolin, C., & Parrish, R. M.
- Venue
- New Journal of Physics
- Publisher
- IOP Publishing
- Published
- 2021-11-01
- Volume
- 23
- Issue
- 11
- Pages
- 113010
- ISSN
- 2331-8422 (ISSN-L)
- 1367-2630
- OpenAlex
- W3201794453
- Cited by
- 96
- References
- 26
- Type
- posted content
- Open access
- green
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.