pith. sign in

arxiv: 2509.19709 · v1 · submitted 2025-09-24 · ⚛️ physics.chem-ph · quant-ph

Quantum Computing Beyond Ground State Electronic Structure: A Review of Progress Toward Quantum Chemistry Out of the Ground State

Alan Bidart , Prateek Vaish , Tilas Kabengele , Yaoqi Pang , Yuan Liu , Brenda M. Rubenstein This is my paper

Pith reviewed 2026-05-18 15:05 UTC · model grok-4.3

classification ⚛️ physics.chem-ph quant-ph
keywords quantum computingquantum chemistryreaction dynamicsfinite temperatureexcited statesreaction mechanismsquantum algorithms
0
0 comments X p. Extension

The pith

Quantum computing extends to reaction mechanisms, dynamics, and finite-temperature chemistry beyond ground-state energies.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This review surveys algorithmic progress and hardware requirements for applying quantum computers to quantum chemistry problems that involve states other than the electronic ground state. It examines three main areas: predicting reaction mechanisms, simulating time-dependent reaction dynamics, and computing properties at finite temperatures. A sympathetic reader would care because ground-state energies alone do not explain how reactions proceed, how rates depend on temperature, or how molecules behave under realistic conditions. The paper compares shared algorithmic features across these applications with the distinct challenges each one presents. It also notes possible computational speedups and the obstacles that must be overcome before these methods become practical.

Core claim

The central claim is that quantum computation can be applied to reaction mechanisms, reaction dynamics, and finite-temperature quantum chemistry, with the review detailing algorithmic approaches, potential advantages over classical methods, and specific challenges arising from hardware noise and scalability.

What carries the argument

Hybrid quantum-classical algorithms and state-preparation techniques for excited states, real-time evolution, and thermal ensembles.

If this is right

  • Quantum methods could predict reaction pathways and rates for molecules too large for accurate classical treatment.
  • Finite-temperature effects in catalysis and biological systems could be modeled with reduced computational scaling.
  • Real-time dynamics simulations may capture non-equilibrium processes that static ground-state calculations miss.
  • Shared error-mitigation strategies could improve reliability across dynamics and thermal applications.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Practical success would let quantum simulations guide experimental choices in catalyst design and materials discovery.
  • New error-correction needs may arise specifically for time-dependent or open-system simulations.
  • These techniques could be combined with classical sampling methods to study larger reaction networks.

Load-bearing premise

Current and near-term quantum hardware, together with the reviewed algorithms, can deliver practical advantages for reaction dynamics and finite-temperature problems despite noise and scalability limits.

What would settle it

A demonstration that a quantum algorithm computes the time evolution or thermal properties of a chemically relevant system more accurately or faster than the best available classical method on hardware where both approaches can be run to completion.

Figures

Figures reproduced from arXiv: 2509.19709 by Alan Bidart, Brenda M. Rubenstein, Prateek Vaish, Tilas Kabengele, Yaoqi Pang, Yuan Liu.

Figure 1
Figure 1. Figure 1: FIG. 1. The three stages of a quantum circuit. A computational bottleneck in any of these three [PITH_FULL_IMAGE:figures/full_fig_p006_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: FIG. 2. Optimistic logical-depth estimates for representative quantum chemistry algorithms versus [PITH_FULL_IMAGE:figures/full_fig_p028_2.png] view at source ↗
read the original abstract

Quantum computing offers the promise of revolutionizing quantum chemistry by enabling the solution of chemical problems for substantially less computational cost. While most demonstrations of quantum computation to date have focused on resolving the energies of the electronic ground states of small molecules, the field of quantum chemistry is far broader than ground state chemistry; equally important to practicing chemists are chemical reaction dynamics and reaction mechanism prediction. Here, we review progress toward and the potential of quantum computation for understanding quantum chemistry beyond the ground state, including for reaction mechanisms, reaction dynamics, and finite temperature quantum chemistry. We discuss algorithmic and other considerations these applications share, as well as differences that make them unique. We also highlight the potential speedups these applications may realize and challenges they may face. We hope that this discussion stimulates further research into how quantum computation may better inform experimental chemistry in the future.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. This manuscript is a review summarizing progress toward and the potential of quantum computation for quantum chemistry problems beyond the electronic ground state. It covers reaction mechanisms, reaction dynamics, and finite-temperature quantum chemistry, while discussing shared algorithmic considerations with ground-state methods, unique differences, potential speedups, and challenges, with the aim of stimulating further research to better inform experimental chemistry.

Significance. If the review accurately and comprehensively captures the cited literature on non-ground-state applications, it could provide a useful synthesis for the field by identifying where quantum advantages might extend beyond ground-state energy calculations to more chemically relevant problems like dynamics and thermal effects. The explicit framing of open challenges and the call for further research adds value in directing community efforts.

minor comments (2)
  1. The abstract and introduction would benefit from a brief explicit statement of the review's scope boundaries (e.g., which classes of methods or hardware platforms are excluded) to help readers quickly assess coverage.
  2. Ensure that all cited algorithmic speedups are accompanied by the specific references and any stated assumptions (e.g., fault-tolerant vs. NISQ regimes) in the relevant sections to avoid ambiguity for non-expert readers.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their constructive review and recommendation of minor revision. We appreciate the positive assessment of the manuscript's scope in covering reaction mechanisms, dynamics, and finite-temperature quantum chemistry, as well as its framing of open challenges to stimulate further research.

Circularity Check

0 steps flagged

Review paper with no derivation chain or self-referential claims

full rationale

This is a review article that summarizes existing literature on quantum computing applications beyond ground-state electronic structure, including reaction mechanisms, dynamics, and finite-temperature problems. The abstract and structure explicitly frame the content as a discussion of progress, shared algorithmic considerations, differences, potential speedups, and challenges drawn from prior external work. No original equations, fitted parameters, predictions, or uniqueness theorems are derived within the paper itself. Any self-citations (if present) are not load-bearing for new claims, as the central contribution is organizational synthesis rather than a closed derivation that reduces to its own inputs by construction. The paper positions the topic as an area for further research without asserting solved capabilities on near-term hardware.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

As a review article the paper does not introduce or rely on new free parameters, axioms, or invented entities of its own; it aggregates and discusses work from the existing literature.

pith-pipeline@v0.9.0 · 5694 in / 1043 out tokens · 50799 ms · 2026-05-18T15:05:42.025904+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. An Oracle-Free Quantum Algorithm for Nonadiabatic Quantum Molecular Dynamics

    quant-ph 2026-04 unverdicted novelty 6.0

    An oracle-free Trotter-based quantum algorithm for nonadiabatic molecular dynamics achieves circuit depth advantages over QROM architectures and retains T-gate scalability compared to quantum signal processing.

Reference graph

Works this paper leans on

168 extracted references · 168 canonical work pages · cited by 1 Pith paper · 4 internal anchors

  1. [1]

    Trotterization As in classical methods, product formulas are a common technique for approximating the time-evolution operator. Given a Hamiltonian ˆH expressed as the sum of P = poly(n) k-local terms and its associated time-evolution operator ˆUt, a first-order Trotter formula can be used to generate an approximation ˆVt: ˆH = PX j=0 ˆHj − → ˆUt = e−i( PP...

    work page

  2. [2]

    LCU enables the encoding of the sum of unitary operators, which normally is non-unitary, into a unitary matrix acting on a larger system

    Linear Combination of Unitaries More recent methods approximate the time evolution operator by making use of the Linear Combination of Unitaries (LCU) algorithm [65]. LCU enables the encoding of the sum of unitary operators, which normally is non-unitary, into a unitary matrix acting on a larger system. If our matrix of interest can be expressed as ˆH = P...

    work page

  3. [3]

    Quantum Signal Processing and Qubitization Modern algorithms based on Quantum Signal Processing (QSP) and qubitization [66– 68] provide another way to perform general-purpose quantum computation from the lens of functional approximation. The idea is that, given a Hermitian matrix A (||A|| < 1) encoded inside a unitary U =  A ∗ ∗ ∗   13 such that A = Π...

    work page 2020

  4. [4]

    [21] that a polylog(n) size cir- cuit can be constructed to block-encode n-orbital free-fermionic Hamiltonians with sparse one-electron integrals

    Non-Interacting Free Fermions For non-interacting free fermions, it was shown in Ref. [21] that a polylog(n) size cir- cuit can be constructed to block-encode n-orbital free-fermionic Hamiltonians with sparse one-electron integrals. This circuit can be combined with QSP to give rise to exponential speedups on quantum hardware relative to classical hardwar...

    work page

  5. [5]

    Interacting Electrons in First Quantization The situation is much more complicated for interacting electrons. Early works [20, 101] showed that an exponential speedup is possible in first quantization by simply performing Trotter time-evolution of the kinetic and potential operators interpreted by a quantum Fourier transform, which effectively makes the k...

    work page

  6. [6]

    Initial State Preparation in First Quantization One of the important issues in the first-quantized simulation of electronic dynamics is the preparation of an initial state that satisfies fermionic statistics, i.e., the total wave function has to change sign under a permutation of two electrons. Refs. [109, 110] constructed such anti-symmetrized Slater det...

    work page

  7. [7]

    This method also allowed parallel quan- tum simulation of multiple symmetric sectors in one-go

    overcame these challenges by providing a way to prepare anti-symmetrized, correlated, and spinful electronic wave functions in first-quantization, as demonstrated on real quantum hardware for the H2 molecule in the STO-3G basis. This method also allowed parallel quan- tum simulation of multiple symmetric sectors in one-go. Such techniques may be transfera...

    work page

  8. [8]

    [116, 117] proposed new time-dependent Hamiltonian simulation algorithms based on a truncated Dyson series

    The Interaction Picture, Time-Dependent Hamiltonian Simulation, and Beyond Ref. [116, 117] proposed new time-dependent Hamiltonian simulation algorithms based on a truncated Dyson series. Ref. [116] moreover showed that it is possible to first transform the Hamiltonian into the interaction picture and then use the truncated Dyson series to perform the tim...

    work page

  9. [9]

    one-shot

    Interacting Electrons in Second Quantization In second-quantization, Ref. [102] proposed a low-rank recursive block encoding strategy to implement a single Trotter step using qubitization, and then multiplied all Trotterized steps together. This gives an improved gate count for simulating the uniform electron gas as O((n5/3/η2/3 + n4/3η1/3)no(1)). In thes...

    work page

  10. [10]

    have demonstrated improved performance for simple systems including the jellium model, H3 molecule, and Heisenberg spin models [128]

    work page

  11. [11]

    While our review mostly focused on asymptotic scaling, there are concrete gate counts estimated for many of the algorithms in the above (for example, Ref

    Summary As one of the most promising quantum chemistry applications of quantum computers beyond the ground state, we emphasize the need for developing quantum computing methods 23 that can simulate spinful electronic dynamics, possibly with relativistic effects [129]. While our review mostly focused on asymptotic scaling, there are concrete gate counts es...

    work page 2029

  12. [12]

    Modern quantum chemistry: introduction to advanced electronic structure theory, 1996

    Attila Szabo and Neil S Ostlund. Modern quantum chemistry: introduction to advanced electronic structure theory, 1996

    work page 1996

  13. [13]

    Ab initio quantum chemistry: Methodology and applications

    Richard A Friesner. Ab initio quantum chemistry: Methodology and applications. Proceed- ings of the National Academy of Sciences , 102(19):6648–6653, 2005

    work page 2005

  14. [14]

    Theoretical bioinorganic chemistry: the electronic structure makes a difference

    Barbara Kirchner, Frank Wennmohs, Shengfa Ye, and Frank Neese. Theoretical bioinorganic chemistry: the electronic structure makes a difference. Current opinion in chemical biology , 11(2):134–141, 2007. 29

    work page 2007

  15. [15]

    Density functional theory in surface chemistry and catalysis

    Jens K Nørskov, Frank Abild-Pedersen, Felix Studt, and Thomas Bligaard. Density functional theory in surface chemistry and catalysis. Proceedings of the National Academy of Sciences , 108(3):937–943, 2011

    work page 2011

  16. [16]

    Electronic-structure methods for materials design

    Nicola Marzari, Andrea Ferretti, and Chris Wolverton. Electronic-structure methods for materials design. Nature materials, 20(6):736–749, 2021

    work page 2021

  17. [17]

    Superconducting qubits: Current state of play

    Morten Kjaergaard, Mollie E Schwartz, Jochen Braum¨ uller, Philip Krantz, Joel I-J Wang, Simon Gustavsson, and William D Oliver. Superconducting qubits: Current state of play. Annual Review of Condensed Matter Physics , 11(1):369–395, 2020

    work page 2020

  18. [18]

    Trapped-ion quantum computing: Progress and challenges

    Colin D Bruzewicz, John Chiaverini, Robert McConnell, and Jeremy M Sage. Trapped-ion quantum computing: Progress and challenges. Applied physics reviews, 6(2), 2019

    work page 2019

  19. [19]

    Richard P. Feynman. Simulating physics with computers. Int. J. Theor. Phys, 21(6/7), 1982

    work page 1982

  20. [20]

    Is there evidence for exponential quantum advantage in quantum chemistry? 2022

    Seunghoon Lee, Joonho Lee, Huanchen Zhai, Yu Tong, Alexander M Dalzell, Ashutosh Kumar, Phillip Helms, Johnnie Gray, Zhi-Hao Cui, Wenyuan Liu, et al. Is there evidence for exponential quantum advantage in quantum chemistry? 2022

    work page 2022

  21. [21]

    Quantum Computation and Quantum Information

    Michael A Nielsen and Isaac L Chuang. Quantum Computation and Quantum Information . Cambridge University Press, 2010

    work page 2010

  22. [22]

    Quantum algorithms for quantum chemistry and quantum materials science

    Bela Bauer, Sergey Bravyi, Mario Motta, and Garnet Kin-Lic Chan. Quantum algorithms for quantum chemistry and quantum materials science. Chemical reviews, 120(22):12685–12717, 2020

    work page 2020

  23. [23]

    Quantum chemistry in the age of quantum computing

    Yudong Cao, Jonathan Romero, Jonathan P Olson, Matthias Degroote, Peter D Johnson, M´ aria Kieferov´ a, Ian D Kivlichan, Tim Menke, Borja Peropadre, Nicolas PD Sawaya, et al. Quantum chemistry in the age of quantum computing. Chemical reviews, 119(19):10856– 10915, 2019

    work page 2019

  24. [24]

    Benjamin, and Xiao Yuan

    Sam McArdle, Suguru Endo, Al´ an Aspuru-Guzik, Simon C. Benjamin, and Xiao Yuan. Quantum computational chemistry. Rev. Mod. Phys., 92:015003, Mar 2020

    work page 2020

  25. [25]

    Love, Al´ an Aspuru-Guzik, and Jeremy L

    Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man-Hong Yung, Xiao-Qi Zhou, Peter J. Love, Al´ an Aspuru-Guzik, and Jeremy L. O’Brien. A variational eigenvalue solver on a photonic quantum processor. Nature Communications , 5(1):4213, July 2014. Publisher: Nature Publishing Group

    work page 2014

  26. [26]

    The variational quantum 30 eigensolver: a review of methods and best practices

    Jules Tilly, Hongxiang Chen, Shuxiang Cao, Dario Picozzi, Kanav Setia, Ying Li, Edward Grant, Leonard Wossnig, Ivan Rungger, George H Booth, et al. The variational quantum 30 eigensolver: a review of methods and best practices. Physics Reports, 986:1–128, 2022

    work page 2022

  27. [27]

    Krylov diagonal- ization of large many-body hamiltonians on a quantum processor

    Nobuyuki Yoshioka, Mirko Amico, William Kirby, Petar Jurcevic, Arkopal Dutt, Bryce Fuller, Shelly Garion, Holger Haas, Ikko Hamamura, Alexander Ivrii, et al. Krylov diagonal- ization of large many-body hamiltonians on a quantum processor. Nature Communications, 16(1):1–8, 2025

    work page 2025

  28. [28]

    Cortes and Stephen K

    Cristian L. Cortes and Stephen K. Gray. Quantum Krylov subspace algorithms for ground- and excited-state energy estimation. Physical Review A, 105(2):022417, February 2022. Pub- lisher: American Physical Society

    work page 2022

  29. [29]

    Unbiasing fermionic quantum monte carlo with a quantum computer

    William J Huggins, Bryan A O’Gorman, Nicholas C Rubin, David R Reichman, Ryan Bab- bush, and Joonho Lee. Unbiasing fermionic quantum monte carlo with a quantum computer. Nature, 603(7901):416–420, 2022

    work page 2022

  30. [30]

    Quantum computing in the nisq era and beyond

    John Preskill. Quantum computing in the nisq era and beyond. Quantum, 2:79, 2018

    work page 2018

  31. [31]

    Polynomial-time quantum algorithm for the simulation of chemical dynamics

    Ivan Kassal, Stephen P Jordan, Peter J Love, Masoud Mohseni, and Al´ an Aspuru-Guzik. Polynomial-time quantum algorithm for the simulation of chemical dynamics. Proceedings of the National Academy of Sciences , 105(48):18681–18686, 2008

    work page 2008

  32. [32]

    Solving free fermion problems on a quantum computer

    Maarten Stroeks, Daan Lenterman, Barbara Terhal, and Yaroslav Herasymenko. Solving free fermion problems on a quantum computer. arXiv preprint arXiv:2409.04550 , 2024

    work page arXiv 2024

  33. [33]

    Quantum computational complexity

    John Watrous. Quantum computational complexity. In Computational Complexity , pages 2361–2387. Springer, 2012

    work page 2012

  34. [34]

    Classical and quantum computa- tion

    Alexei Yu Kitaev, Alexander Shen, and Mikhail N Vyalyi. Classical and quantum computa- tion. Number 47. American Mathematical Soc., 2002

    work page 2002

  35. [35]

    Quantum information science

    Riccardo Manenti and Mario Motta. Quantum information science. Oxford University Press, 2023

    work page 2023

  36. [36]

    Robert Raussendorf and Hans J. Briegel. A one-way quantum computer. Phys. Rev. Lett. , 86:5188–5191, May 2001

    work page 2001

  37. [37]

    Nonlinear feedforward enabling quantum computation

    Atsushi Sakaguchi, Shunya Konno, Fumiya Hanamura, Warit Asavanant, Kan Takase, Hisashi Ogawa, Petr Marek, Radim Filip, Jun-ichi Yoshikawa, Elanor Huntington, et al. Nonlinear feedforward enabling quantum computation. Nature Communications, 14(1):3817, 2023

    work page 2023

  38. [38]

    A quantum adiabatic evolution algorithm applied to random instances of an 31 np-complete problem

    Edward Farhi, Jeffrey Goldstone, Sam Gutmann, Joshua Lapan, Andrew Lundgren, and Daniel Preda. A quantum adiabatic evolution algorithm applied to random instances of an 31 np-complete problem. Science, 292(5516):472–475, 2001

    work page 2001

  39. [39]

    Scaling advantage over path-integral monte carlo in quantum simulation of geometrically frustrated magnets

    Andrew D King, Jack Raymond, Trevor Lanting, Sergei V Isakov, Masoud Mohseni, Gabriel Poulin-Lamarre, Sara Ejtemaee, William Bernoudy, Isil Ozfidan, Anatoly Yu Smirnov, et al. Scaling advantage over path-integral monte carlo in quantum simulation of geometrically frustrated magnets. Nature communications, 12(1):1113, 2021

    work page 2021

  40. [40]

    Elementary gates for quantum computation

    Adriano Barenco, Charles H Bennett, Richard Cleve, David P DiVincenzo, Norman Margo- lus, Peter Shor, Tycho Sleator, John A Smolin, and Harald Weinfurter. Elementary gates for quantum computation. Physical review A, 52(5):3457, 1995

    work page 1995

  41. [41]

    Quantum computations: algorithms and error correction

    A Yu Kitaev. Quantum computations: algorithms and error correction. Russian Mathemat- ical Surveys, 52(6):1191, 1997

    work page 1997

  42. [42]

    Correlated decoding of logical algorithms with transversal gates

    Madelyn Cain, Chen Zhao, Hengyun Zhou, Nadine Meister, J Pablo Bonilla Ataides, Arthur Jaffe, Dolev Bluvstein, and Mikhail D Lukin. Correlated decoding of logical algorithms with transversal gates. Physical Review Letters, 133(24):240602, 2024

    work page 2024

  43. [43]

    Molecular electronic-structure theory

    Trygve Helgaker, Poul Jorgensen, and Jeppe Olsen. Molecular electronic-structure theory. John Wiley & Sons, 2013

    work page 2013

  44. [44]

    Hohenberg and W

    P. Hohenberg and W. Kohn. Inhomogeneous Electron Gas. Physical Review, 136(3B):B864– B871, November 1964. Publisher: American Physical Society

    work page 1964

  45. [45]

    On the Correlation Problem in Atomic and Molecular Systems

    Jiˇ r´ ıˇC´ ıˇ zek. On the Correlation Problem in Atomic and Molecular Systems. Calculation of Wavefunction Components in Ursell-Type Expansion Using Quantum-Field Theoretical Methods. The Journal of Chemical Physics , 45(11):4256–4266, December 1966

    work page 1966

  46. [46]

    Paldus, J

    J. Paldus, J. ˇC´ ıˇ zek, and I. Shavitt. Correlation Problems in Atomic and Molecular Systems. IV. Extended Coupled-Pair Many-Electron Theory and Its Application to the B${\mathrm{H}} {3}$ Molecule. Physical Review A, 5(1):50–67, January 1972. Publisher: American Physical Society

    work page 1972

  47. [47]

    Multireference fock-space coupled-cluster and equation-of-motion coupled-cluster theories: The detailed interconnections

    Monika Musial and Rodney J Bartlett. Multireference fock-space coupled-cluster and equation-of-motion coupled-cluster theories: The detailed interconnections. The Journal of chemical physics , 129(13), 2008

    work page 2008

  48. [48]

    ¨Uber das paulische ¨ aquivalenzverbot

    Pascual Jordan and Eugene Paul Wigner. ¨Uber das paulische ¨ aquivalenzverbot. In The Collected Works of Eugene Paul Wigner , pages 109–129. Springer, 1993

    work page 1993

  49. [49]

    The bravyi-kitaev transformation for quantum computation of electronic structure

    Jacob T Seeley, Martin J Richard, and Peter J Love. The bravyi-kitaev transformation for quantum computation of electronic structure. The Journal of chemical physics , 137(22), 32 2012

    work page 2012

  50. [50]

    Bravyi and Alexei Yu

    Sergey B. Bravyi and Alexei Yu. Kitaev. Fermionic Quantum Computation. Annals of Physics, 298(1):210–226, May 2002

    work page 2002

  51. [51]

    Large-scale sparse wave function circuit simulator for applications with the variational quantum eigensolver

    J Wayne Mullinax and Norm M Tubman. Large-scale sparse wave function circuit simulator for applications with the variational quantum eigensolver. The Journal of Chemical Physics , 162(7), 2025

    work page 2025

  52. [52]

    Grimsley, Sophia E

    Harper R. Grimsley, Sophia E. Economou, Edwin Barnes, and Nicholas J. Mayhall. An adap- tive variational algorithm for exact molecular simulations on a quantum computer. Nature Communications, 10(1):3007, July 2019. Publisher: Nature Publishing Group

    work page 2019

  53. [53]

    Variational Quantum Computation of Excited States

    Oscar Higgott, Daochen Wang, and Stephen Brierley. Variational Quantum Computation of Excited States. Quantum, 3:156, July 2019. Publisher: Verein zur F¨ orderung des Open Access Publizierens in den Quantenwissenschaften

    work page 2019

  54. [54]

    Quantum measurements and the Abelian Stabilizer Problem

    A. Yu Kitaev. Quantum measurements and the Abelian Stabilizer Problem, November 1995. arXiv:quant-ph/9511026

    work page internal anchor Pith review Pith/arXiv arXiv 1995

  55. [55]

    Variational ansatz-based quantum simulation of imaginary time evolution

    Sam McArdle, Tyson Jones, Suguru Endo, Ying Li, Simon C Benjamin, and Xiao Yuan. Variational ansatz-based quantum simulation of imaginary time evolution. npj Quantum Information, 5(1):75, 2019

    work page 2019

  56. [56]

    Mario Motta, Chong Sun, Adrian T. K. Tan, Matthew J. O’Rourke, Erika Ye, Austin J. Minnich, Fernando G. S. L. Brand˜ ao, and Garnet Kin-Lic Chan. Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution. Nature Physics, 16(2):205–210, February 2020. Publisher: Nature Publishing Group

    work page 2020

  57. [57]

    Implementation of quantum imaginary-time evolution method on nisq devices by introducing nonlocal approximation

    Hirofumi Nishi, Taichi Kosugi, and Yu-ichiro Matsushita. Implementation of quantum imaginary-time evolution method on nisq devices by introducing nonlocal approximation. npj Quantum Information , 7(1):85, 2021

    work page 2021

  58. [58]

    Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution

    Mario Motta, Chong Sun, Adrian TK Tan, Matthew J O’Rourke, Erika Ye, Austin J Minnich, Fernando GSL Brandao, and Garnet Kin-Lic Chan. Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution. Nature Physics, 16(2):205–210, 2020

    work page 2020

  59. [59]

    Fragmented imaginary-time evolution for early-stage quantum signal processors

    Thais L Silva, M´ arcio M Taddei, Stefano Carrazza, and Leandro Aolita. Fragmented imaginary-time evolution for early-stage quantum signal processors. Scientific Reports , 13(1):18258, 2023. 33

    work page 2023

  60. [60]

    Generalising quantum imaginary time evolution to solve linear partial differential equations

    Swagat Kumar and Colin Michael Wilmott. Generalising quantum imaginary time evolution to solve linear partial differential equations. Scientific Reports, 14(1):20156, 2024

    work page 2024

  61. [61]

    Symmetry enhanced variational quantum imaginary time evolution

    Xiaoyang Wang, Yahui Chai, Maria Demidik, Xu Feng, Karl Jansen, and Cenk T¨ uys¨ uz. Symmetry enhanced variational quantum imaginary time evolution. arXiv preprint arXiv:2307.13598, 2023

    work page arXiv 2023

  62. [62]

    Sokolov, Ke Liao, Pablo L´ opez R´ ıos, Martin Rahm, Ali Alavi, and Ivano Tavernelli

    Werner Dobrautz, Igor O. Sokolov, Ke Liao, Pablo L´ opez R´ ıos, Martin Rahm, Ali Alavi, and Ivano Tavernelli. Ab Initio Transcorrelated Method enabling accurate Quantum Chemistry on near-term Quantum Hardware, April 2024. arXiv:2303.02007 [quant-ph]

    work page arXiv 2024

  63. [63]

    Wood, Ali Javadi-Abhari, and Antonio Mezzacapo

    Nobuyuki Yoshioka, Mirko Amico, William Kirby, Petar Jurcevic, Arkopal Dutt, Bryce Fuller, Shelly Garion, Holger Haas, Ikko Hamamura, Alexander Ivrii, Ritajit Majumdar, Zlatko Minev, Mario Motta, Bibek Pokharel, Pedro Rivero, Kunal Sharma, Christopher J. Wood, Ali Javadi-Abhari, and Antonio Mezzacapo. Krylov diagonalization of large many- body Hamiltonian...

    work page 2025

  64. [64]

    Dreiling, Dan Gresh, Cameron Foltz, Michael Mills, Steven A

    Kentaro Yamamoto, Yuta Kikuchi, David Amaro, Ben Criger, Silas Dilkes, Ciar´ an Ryan- Anderson, Andrew Tranter, Joan M. Dreiling, Dan Gresh, Cameron Foltz, Michael Mills, Steven A. Moses, Peter E. Siegfried, Maxwell D. Urmey, Justin J. Burau, Aaron Han- kin, Dominic Lucchetti, John P. Gaebler, Natalie C. Brown, Brian Neyenhuis, and David Mu˜ noz Ramo. Qua...

    work page

  65. [65]

    arXiv:2505.09133 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv

  66. [66]

    Fuks, June-Koo Kevin Rhee, Young Min Rhee, Kenneth Wright, Jason Nguyen, Jungsang Kim, and Sonika Johri

    Luning Zhao, Joshua Goings, Kyujin Shin, Woomin Kyoung, Johanna I. Fuks, June-Koo Kevin Rhee, Young Min Rhee, Kenneth Wright, Jason Nguyen, Jungsang Kim, and Sonika Johri. Orbital-optimized pair-correlated electron simulations on trapped-ion quantum com- puters. npj Quantum Information , 9(1):60, June 2023. Publisher: Nature Publishing Group

    work page 2023

  67. [67]

    Qudit-based variational quantum eigensolver using photonic orbital angular momentum states

    Byungjoo Kim, Kang-Min Hu, Myung-Hyun Sohn, Yosep Kim, Yong-Su Kim, Seung-Woo Lee, and Hyang-Tag Lim. Qudit-based variational quantum eigensolver using photonic orbital angular momentum states. Science Advances, 10(43):eado3472, October 2024. Publisher: American Association for the Advancement of Science

    work page 2024

  68. [68]

    BenchQC: A Benchmarking Toolkit for Quantum Com- putation, February 2025

    Nia Pollard and Kamal Choudhary. BenchQC: A Benchmarking Toolkit for Quantum Com- putation, February 2025. arXiv:2502.09595 [quant-ph] version: 1

    work page arXiv 2025

  69. [69]

    C´ orcoles, Antonio Mezzacapo, Jerry M

    Abhinav Kandala, Kristan Temme, Antonio D. C´ orcoles, Antonio Mezzacapo, Jerry M. 34 Chow, and Jay M. Gambetta. Error mitigation extends the computational reach of a noisy quantum processor. Nature, 567(7749):491–495, March 2019. Publisher: Nature Publishing Group

    work page 2019

  70. [70]

    Gambetta

    Kristan Temme, Sergey Bravyi, and Jay M. Gambetta. Error Mitigation for Short-Depth Quantum Circuits. Physical Review Letters , 119(18):180509, November 2017. Publisher: American Physical Society

    work page 2017

  71. [71]

    Bonet-Monroig, R

    X. Bonet-Monroig, R. Sagastizabal, M. Singh, and T. E. O’Brien. Low-cost error mitigation by symmetry verification. Physical Review A , 98(6):062339, December 2018. Publisher: American Physical Society

    work page 2018

  72. [72]

    Universal quantum simulators

    Seth Lloyd. Universal quantum simulators. Science, 273(5278):1073–1078, 1996

    work page 1996

  73. [73]

    General theory of fractal path integrals with applications to many-body theories and statistical physics

    Masuo Suzuki. General theory of fractal path integrals with applications to many-body theories and statistical physics. Journal of Mathematical Physics , 32(2):400–407, 1991

    work page 1991

  74. [74]

    Faster quantum simulation by random- ization

    Andrew M Childs, Aaron Ostrander, and Yuan Su. Faster quantum simulation by random- ization. Quantum, 3:182, 2019

    work page 2019

  75. [75]

    Efficient quantum algorithms for simulating sparse hamiltonians

    Dominic W Berry, Graeme Ahokas, Richard Cleve, and Barry C Sanders. Efficient quantum algorithms for simulating sparse hamiltonians. Communications in Mathematical Physics , 270:359–371, 2007

    work page 2007

  76. [76]

    Higher order decomposi- tions of ordered operator exponentials

    Nathan Wiebe, Dominic Berry, Peter Høyer, and Barry C Sanders. Higher order decomposi- tions of ordered operator exponentials. Journal of Physics A: Mathematical and Theoretical , 43(6):065203, 2010

    work page 2010

  77. [77]

    Hamiltonian simulation using linear combinations of unitary operations

    Andrew M Childs and Nathan Wiebe. Hamiltonian simulation using linear combinations of unitary operations. Quantum Information & Computation , 12(11-12):901–924, 2012

    work page 2012

  78. [78]

    Guang Hao Low and Isaac L. Chuang. Optimal hamiltonian simulation by quantum signal processing. Physical Review Letters, 118(1), Jan 2017

    work page 2017

  79. [79]

    Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics

    Andr´ as Gily´ en, Yuan Su, Guang Hao Low, and Nathan Wiebe. Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics. Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing , Jun 2019

    work page 2019

  80. [80]

    Generalized quantum signal processing

    Danial Motlagh and Nathan Wiebe. Generalized quantum signal processing. PRX Quantum, 5(2):020368, 2024

    work page 2024

Showing first 80 references.