Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2108.04258 · Physical Review Research

Quantum algorithms for quantum dynamics: A performance study on the spin-boson model

Alexander Miessen, Pauline J. Ollitrault, Ivano Tavernelli

Published Dec 23, 2021• 52 citations
arXivHTMLPDF

Abstract

Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter approximation of the time-evolution operator. This approach typically relies on deep circuits and is therefore hampered by the substantial limitations of available noisy and near-term quantum hardware. On the other hand, variational quantum algorithms (VQAs) have become an indispensable alternative, enabling small-scale simulations on present-day hardware. However, despite the recent development of VQAs for quantum dynamics, a detailed assessment of their efficiency and scalability is yet to be presented. To fill this gap, we applied a VQA based on McLachlan's principle to simulate the dynamics of a spin-boson model subject to varying levels of realistic hardware noise as well as in different physical regimes, and discuss the algorithm's accuracy and scaling behavior as a function of system size. We observe a good performance of the variational approach used in combination with a general, physically motivated wave function ansatz, and compare it to the conventional first-order Trotter evolution. Finally, based on this, we make scaling predictions for the simulation of a classically intractable system. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage for the solution of time-dependent problems.

DOI
10.1103/physrevresearch.3.043212

Related papers

Evaluating low-depth quantum algorithms for time evolution on fermion-boson systems

Nathan Fitzpatrick, Harriet Apel, David Muñoz Ramo

Simulating time evolution of quantum systems is one of the most promising applications of quantum computing and also appears as a subroutine in many applications such as Green's function methods. In the current era of NISQ machines we assess the state of algorithms for simulating time dynamics with limited resources. We propose the Jaynes-Cummings model and extensions to it as useful toy models to investigate time evolution algorithms on near-term quantum computers. Using these simple models, direct Trotterisation of the time evolution operator produces deep circuits, requiring coherence times out of reach on current NISQ hardware. Therefore we test two alternative responses to this problem: variational compilation of the time evolution operator, and variational quantum simulation of the wavefunction ansatz. We demonstrate numerically to what extent these methods are successful in time evolving this system. The costs in terms of circuit depth and number of measurements are compared quantitatively, along with other drawbacks and advantages of each method. We find that computational requirements for both methods make them suitable for performing time evolution simulations of our models on NISQ hardware. Our results also indicate that variational quantum compilation produces more accurate results than variational quantum simulation, at the cost of a larger number of measurements.

arXiv:2106.03985•Jun 7, 2021•11 citations

Numerical methods for variational quantum and quantum-inspired computing.

Jorge Abraham Gidi Chomalí

Quantum computation is a promising approach to solving problems in physics, optimization, and numerical simulation. Quantum algorithms leverage superposition and entanglement in an exponentially large Hilbert space to encode and solve problems that are intractable for classical computers. However, these algorithms require error-corrected quantum hardware, which is not yet available. This thesis explores two alternative quantum-based approaches that promise to achieve better scalability than traditional algorithms in the near-term: Hybrid variational quantum algorithms (VQAs) and fully classical, quantum-inspired algorithms. In the first part, we review and benchmark optimization methods well suited for VQAs, specifically the Simultaneous Perturbation Stochastic Approximation (SPSA). We introduce complex-variable extensions and improvements to the second-order and quantum natural implementations. Finally, we assess their performance across quantum control, quantum tomography, and the variational quantum eigensolver, providing practical guidelines for common VQA scenarios. In the second part, we apply Matrix Product States (MPS) to solve time-dependent partial differential equations (PDEs). By integrating Hermite Distributed Approximating Functionals (HDAF) into the MPS framework, we develop a novel encoding to efficiently approximate differential operators with exponential precision. We benchmark this approach against traditional schemes for simulating the expansion of a levitated nanoparticle. The quantum-inspired numerical integration schemes deliver large memory savings and adequate runtimes even in presence of moderate chirping.

•Jun 5, 2025•0 citations

Beyond Trotterization: Variational Product Formulas for Quantum Simulation

Ibsal Assi, Michael Vogl, Meenu Kumari +1 more

We propose a variational alternative to the Trotter-Suzuki decomposition that provides greater control over errors while preserving the unitary structure of time evolution. The variational parameters in our ansatz are derived from a global action principle, where Euler-Lagrange equations govern their optimal dynamics. Unlike conventional wavefunction-based variational methods, our approach specifically targets the time evolution operation and this allows a single set of optimized parameters to be applied to any initial state for a fixed Hamiltonian avoiding costly optimization procedures. Our method outperforms the standard Trotter-Suzuki formulas, typically achieving higher accuracy than higher-order Suzuki schemes. This translates directly to quantum computing applications, where it enables the design of quantum circuits with fewer gates which reduces noise and improves precision. Although we focus on quantum dynamics, the method is broadly applicable to problems involving general time-evolution operators. Applied to various model Hamiltonians, our approach reduces errors by factors of 2 to 5 compared to Trotter-Suzuki decompositions, demonstrating its promise for accurate quantum simulation with improved efficiency. In certain cases, the variational ansatz achieves higher accuracy than more complex higher-order Suzuki formulas while reducing the gate count by nearly half within a single circuit layer. Furthermore, we derive approximate analytical expressions for the variational parameters up to cubic order in time, valid for generic Hamiltonians. These approximations enable long-time quantum simulations with improved accuracy over equivalent Suzuki decompositions, providing ready-to-use evolution formulas that match Suzuki's gate complexity while delivering better performance.

quant-pharXiv:2511.15124•Physical review. B./Physical review. B•Nov 20, 2025•1 citation

Scalable Quantum Algorithms for Noisy Quantum Computers

Julien Gacon

Quantum computing not only holds the potential to solve long-standing problems in quantum physics, but also to offer speed-ups across a broad spectrum of other fields. Access to a computational space that incorporates quantum effects, such as superposition and entanglement, enables the derivation of promising quantum algorithms for important tasks, including preparing the ground state of a quantum system or predicting its evolution over time. Successfully tackling these tasks promises insights into significant theoretical and technological questions, such as superconductivity and the design of new materials. The aim of quantum algorithms is to use a series of quantum operations in a quantum circuit to solve a problem beyond the reach of classical computers. However, the noise and limited scale of current quantum computers restricts these circuits to moderate sizes and depths. As a result, many prominent algorithms are currently infeasible to run for problem sizes of practical interest. In response, recent research focused on variational quantum algorithms, which allow the selection of circuits that act within a quantum device's capabilities. Yet, these algorithms can require the execution of a large number of circuits, leading to prohibitively long computation times. This doctoral thesis develops two main techniques to reduce these quantum computational resource requirements, with the goal of scaling up application sizes on current quantum processors. The first approach is based on stochastic approximations of computationally costly quantities, such as quantum circuit gradients or the quantum geometric tensor (QGT). The second method takes a different perspective on the QGT, leading to a potentially more efficient description of time evolution on current quantum computers. Both techniques rely on maintaining available information and only computing necessary corrections, instead of re-computing possibly redundant data. The main focus of application for our algorithms is the simulation of quantum systems, broadly defined as including the preparation of ground and thermal states, and the real- and imaginary-time propagation of a system. The developed subroutines, however, can further be utilized in the fields of optimization or machine learning. Our algorithms are benchmarked on a range of representative models, such as Ising or Heisenberg spin models, both in numerical simulations and experiments on the hardware. In combination with error mitigation techniques, the latter is scaled up to 27 qubits; into a regime that variational quantum algorithms are challenging to scale to on noisy quantum computers without our algorithms.

arXiv:2403.00940•Jan 1, 2024•7 citations

Variational Optimization of the Time Evolution Operator in Correlated Systems

Kaelyn Ferris, Sergio E. Ulloa

Simulating the time evolution of quantum systems is a classically challenging and often intractable task due to the exponential scaling of its constituent operators. This scaling makes it a promising application for quantum computation, especially for correlated systems. Constructing an approximate time evolution operator can be done using the Trotter-Suzuki decomposition with an error that scales at most polynomially in the target simulation time and can be decreased at the cost of longer circuit depth. Variational approaches to classically optimize this approximation have shown significant improvement in accuracy for large quantum systems in both gate count and accuracy by several orders of magnitude. However, it is unclear if a similar improvement can be obtained for strongly correlated systems. We extend this variational approach to two example systems with strong correlations: a one-dimensional Fermi-Hubbard chain and an extended Fermi-Hubbard chain. The encoding between qubits and fermionic modes in these systems is generally nonlocal and so we propose an encoding scheme for these Hamiltonians with minimal overall operator distance between nearest neighbor connected qubits. We demonstrate that this variational method grants a similarly strong improvement in both gate count and accuracy and examine the performance of these optimized gate sequences using realistic noise models to estimate their performance on noisy quantum hardware. Finally, we discuss an approach to combine the optimized nonlocal gates of small chains to larger systems without the need for additional computational resources.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 1, 2022•1 citation

Variational Quantum Algorithms: From Theory to NISQ-Era Applications Challenges and Opportunities

Hicham Benamer

Variational Quantum Algorithms are a major method of harnessing Noisy Intermediate-Scale Quantum devices to solve classically intractable problems in physics, chemistry, optimization, and machine learning. The current review offers a critical overview of VQAs, with special emphasis on their theoretical backgrounds, algorithmic structures, and application performance within realistic models of noise. Several key variants, such as the Variational Quantum Eigensolver, Quantum Approximate Optimization Algorithm, and Quantum Neural Networks, are compared in terms of noise robustness, ansatz archi- tecture, and hybrid quantum-classical methods of optimization. Benchmarks in fields such as quantum chemistry, finance modeling, and particles and nuclei physics reveal the poten- tial of VQAs in achieving practical quantum advantage. Fundamentally limiting factors 1such as barren plateaus, optimization overhead, and hardware constraints are considered in addition to mitigation strategies, including adaptive construction of ansatz, informed training in the presence of noise, and quantum error correction using QVECTOR. The paper is concluded with an overview of the scalability and future of VQAs in the direction of transitioning toward fault-tolerant quantum computing.

•Aug 20, 2025•2 citations
Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter approximation of the time-evolution operator. This approach typically relies on deep circuits and is therefore hampered by the substantial limitations of available noisy and near-term quantum hardware. On the other hand, variational quantum algorithms (VQAs) have become an indispensable alternative, enabling small-scale simulations on present-day hardware. However, despite the recent development of VQAs for quantum dynamics, a detailed assessment of their efficiency and scalability is yet to be presented. To fill this gap, we applied a VQA based on McLachlan's principle to simulate the dynamics of a spin-boson model subject to varying levels of realistic hardware noise as well as in different physical regimes, and discuss the algorithm's accuracy and scaling behavior as a function of system size. We observe a good performance of the variational approach used in combination with a general, physically motivated wave function ansatz, and compare it to the conventional first-order Trotter evolution. Finally, based on this, we make scaling predictions for the simulation of a classically intractable system. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage for the solution of time-dependent problems.
Simulating time evolution of quantum systems is one of the most promising applications of quantum computing and also appears as a subroutine in many applications such as Green's function methods. In the current era of NISQ machines we assess the state of algorithms for simulating time dynamics with limited resources. We propose the Jaynes-Cummings model and extensions to it as useful toy models to investigate time evolution algorithms on near-term quantum computers. Using these simple models, direct Trotterisation of the time evolution operator produces deep circuits, requiring coherence times out of reach on current NISQ hardware. Therefore we test two alternative responses to this problem: variational compilation of the time evolution operator, and variational quantum simulation of the wavefunction ansatz. We demonstrate numerically to what extent these methods are successful in time evolving this system. The costs in terms of circuit depth and number of measurements are compared quantitatively, along with other drawbacks and advantages of each method. We find that computational requirements for both methods make them suitable for performing time evolution simulations of our models on NISQ hardware. Our results also indicate that variational quantum compilation produces more accurate results than variational quantum simulation, at the cost of a larger number of measurements.
Quantum computation is a promising approach to solving problems in physics, optimization, and numerical simulation. Quantum algorithms leverage superposition and entanglement in an exponentially large Hilbert space to encode and solve problems that are intractable for classical computers. However, these algorithms require error-corrected quantum hardware, which is not yet available. This thesis explores two alternative quantum-based approaches that promise to achieve better scalability than traditional algorithms in the near-term: Hybrid variational quantum algorithms (VQAs) and fully classical, quantum-inspired algorithms. In the first part, we review and benchmark optimization methods well suited for VQAs, specifically the Simultaneous Perturbation Stochastic Approximation (SPSA). We introduce complex-variable extensions and improvements to the second-order and quantum natural implementations. Finally, we assess their performance across quantum control, quantum tomography, and the variational quantum eigensolver, providing practical guidelines for common VQA scenarios. In the second part, we apply Matrix Product States (MPS) to solve time-dependent partial differential equations (PDEs). By integrating Hermite Distributed Approximating Functionals (HDAF) into the MPS framework, we develop a novel encoding to efficiently approximate differential operators with exponential precision. We benchmark this approach against traditional schemes for simulating the expansion of a levitated nanoparticle. The quantum-inspired numerical integration schemes deliver large memory savings and adequate runtimes even in presence of moderate chirping.
We propose a variational alternative to the Trotter-Suzuki decomposition that provides greater control over errors while preserving the unitary structure of time evolution. The variational parameters in our ansatz are derived from a global action principle, where Euler-Lagrange equations govern their optimal dynamics. Unlike conventional wavefunction-based variational methods, our approach specifically targets the time evolution operation and this allows a single set of optimized parameters to be applied to any initial state for a fixed Hamiltonian avoiding costly optimization procedures. Our method outperforms the standard Trotter-Suzuki formulas, typically achieving higher accuracy than higher-order Suzuki schemes. This translates directly to quantum computing applications, where it enables the design of quantum circuits with fewer gates which reduces noise and improves precision. Although we focus on quantum dynamics, the method is broadly applicable to problems involving general time-evolution operators. Applied to various model Hamiltonians, our approach reduces errors by factors of 2 to 5 compared to Trotter-Suzuki decompositions, demonstrating its promise for accurate quantum simulation with improved efficiency. In certain cases, the variational ansatz achieves higher accuracy than more complex higher-order Suzuki formulas while reducing the gate count by nearly half within a single circuit layer. Furthermore, we derive approximate analytical expressions for the variational parameters up to cubic order in time, valid for generic Hamiltonians. These approximations enable long-time quantum simulations with improved accuracy over equivalent Suzuki decompositions, providing ready-to-use evolution formulas that match Suzuki's gate complexity while delivering better performance.
Quantum computing not only holds the potential to solve long-standing problems in quantum physics, but also to offer speed-ups across a broad spectrum of other fields. Access to a computational space that incorporates quantum effects, such as superposition and entanglement, enables the derivation of promising quantum algorithms for important tasks, including preparing the ground state of a quantum system or predicting its evolution over time. Successfully tackling these tasks promises insights into significant theoretical and technological questions, such as superconductivity and the design of new materials. The aim of quantum algorithms is to use a series of quantum operations in a quantum circuit to solve a problem beyond the reach of classical computers. However, the noise and limited scale of current quantum computers restricts these circuits to moderate sizes and depths. As a result, many prominent algorithms are currently infeasible to run for problem sizes of practical interest. In response, recent research focused on variational quantum algorithms, which allow the selection of circuits that act within a quantum device's capabilities. Yet, these algorithms can require the execution of a large number of circuits, leading to prohibitively long computation times. This doctoral thesis develops two main techniques to reduce these quantum computational resource requirements, with the goal of scaling up application sizes on current quantum processors. The first approach is based on stochastic approximations of computationally costly quantities, such as quantum circuit gradients or the quantum geometric tensor (QGT). The second method takes a different perspective on the QGT, leading to a potentially more efficient description of time evolution on current quantum computers. Both techniques rely on maintaining available information and only computing necessary corrections, instead of re-computing possibly redundant data. The main focus of application for our algorithms is the simulation of quantum systems, broadly defined as including the preparation of ground and thermal states, and the real- and imaginary-time propagation of a system. The developed subroutines, however, can further be utilized in the fields of optimization or machine learning. Our algorithms are benchmarked on a range of representative models, such as Ising or Heisenberg spin models, both in numerical simulations and experiments on the hardware. In combination with error mitigation techniques, the latter is scaled up to 27 qubits; into a regime that variational quantum algorithms are challenging to scale to on noisy quantum computers without our algorithms.
Simulating the time evolution of quantum systems is a classically challenging and often intractable task due to the exponential scaling of its constituent operators. This scaling makes it a promising application for quantum computation, especially for correlated systems. Constructing an approximate time evolution operator can be done using the Trotter-Suzuki decomposition with an error that scales at most polynomially in the target simulation time and can be decreased at the cost of longer circuit depth. Variational approaches to classically optimize this approximation have shown significant improvement in accuracy for large quantum systems in both gate count and accuracy by several orders of magnitude. However, it is unclear if a similar improvement can be obtained for strongly correlated systems. We extend this variational approach to two example systems with strong correlations: a one-dimensional Fermi-Hubbard chain and an extended Fermi-Hubbard chain. The encoding between qubits and fermionic modes in these systems is generally nonlocal and so we propose an encoding scheme for these Hamiltonians with minimal overall operator distance between nearest neighbor connected qubits. We demonstrate that this variational method grants a similarly strong improvement in both gate count and accuracy and examine the performance of these optimized gate sequences using realistic noise models to estimate their performance on noisy quantum hardware. Finally, we discuss an approach to combine the optimized nonlocal gates of small chains to larger systems without the need for additional computational resources.
Variational Quantum Algorithms are a major method of harnessing Noisy Intermediate-Scale Quantum devices to solve classically intractable problems in physics, chemistry, optimization, and machine learning. The current review offers a critical overview of VQAs, with special emphasis on their theoretical backgrounds, algorithmic structures, and application performance within realistic models of noise. Several key variants, such as the Variational Quantum Eigensolver, Quantum Approximate Optimization Algorithm, and Quantum Neural Networks, are compared in terms of noise robustness, ansatz archi- tecture, and hybrid quantum-classical methods of optimization. Benchmarks in fields such as quantum chemistry, finance modeling, and particles and nuclei physics reveal the poten- tial of VQAs in achieving practical quantum advantage. Fundamentally limiting factors 1such as barren plateaus, optimization overhead, and hardware constraints are considered in addition to mitigation strategies, including adaptive construction of ansatz, informed training in the presence of noise, and quantum error correction using QVECTOR. The paper is concluded with an overview of the scalability and future of VQAs in the direction of transitioning toward fault-tolerant quantum computing.