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:2101.04579 · Quantum

An efficient quantum algorithm for the time evolution of parameterized circuits

Stefano Barison, Filippo Vicentini, Giuseppe Carleo

Published Jul 28, 2021• 110 citations
arXivHTMLPDF

Abstract

We introduce a novel hybrid algorithm to simulate the real-time evolution of quantum systems using parameterized quantum circuits. The method, named "projected – Variational Quantum Dynamics" (p-VQD) realizes an iterative, global projection of the exact time evolution onto the parameterized manifold. In the small time-step limit, this is equivalent to the McLachlan's variational principle. Our approach is efficient in the sense that it exhibits an optimal linear scaling with the total number of variational parameters. Furthermore, it is global in the sense that it uses the variational principle to optimize all parameters at once. The global nature of our approach then significantly extends the scope of existing efficient variational methods, that instead typically rely on the iterative optimization of a restricted subset of variational parameters. Through numerical experiments, we also show that our approach is particularly advantageous over existing global optimization algorithms based on the time-dependent variational principle that, due to a demanding quadratic scaling with parameter numbers, are unsuitable for large parameterized quantum circuits.

DOI
10.22331/q-2021-07-28-512

Related papers

Adaptive projected variational quantum dynamics

David Linteau, Stefano Barison, Netanel H. Lindner +1 more

We propose an adaptive quantum algorithm to prepare accurate variational time evolved wave functions. The method is based on the projected variational quantum dynamics (pVQD) algorithm, that performs a global optimization with linear scaling in the number of variational parameters. Instead of fixing a variational ansatz at the beginning of the simulation, the circuit is grown systematically during the time evolution. Moreover, the adaptive step does not require auxiliary qubits and the gate search can be performed in parallel on different quantum devices. We apply the algorithm, named adaptive pVQD, to the simulation of driven spin models and fermionic systems, where it shows an advantage when compared to both Trotterized circuits and nonadaptive variational methods. Finally, we use the shallower circuits prepared using the adaptive pVQD algorithm to obtain more accurate measurements of physical properties of quantum systems on hardware. Published by the American Physical Society 2024

arXiv:2307.03229•Physical Review Research•May 6, 2024•11 citations

Blockwise optimization for projective variational quantum dynamics (BLOP-VQD): Algorithm and implementation for lattice systems

Harshdeep Singh, Sonjoy Majumder, Sabyashachi Mishra

We present an efficient approach to simulate real-time quantum dynamics using projected variational quantum dynamics, where the computational cost is reduced by strategically optimizing only a subset of the variational parameters at each time step. Typically, the variational Ansatz consists of repeated blocks of parameterized quantum circuits, where all parameters are updated in a standard optimization procedure. In contrast, our method selectively optimizes one block at a time while keeping the others fixed, allowing for significant reductions in computational overhead. This semi-global optimization strategy ensures that all qubits are still involved in the evolution, but the optimization is localized to specific blocks, thus avoiding the need to update all parameters simultaneously. We propose different approaches for choosing the next block for optimization, including sequential, random, and fidelity-based updation. We demonstrate the performance of the proposed methods in a series of spin-lattice models with varying sizes and complexity. Our method preserves the accuracy of the time evolution with a much lower computational cost. This new optimization strategy provides a promising path toward high-fidelity simulation of the time evolution of complex quantum systems with reduced computational resources.

arXiv:2503.18279•The Journal of Chemical Physics•Sep 22, 2025•1 citation

Hybrid quantum variational algorithm for simulating open quantum systems with near-term devices

M. Mahdian, H Davoodi Yeganeh

Abstract Hybrid quantum-classical (HQC) algorithms make it possible to use near-term quantum devices supported by classical computational resources by useful control schemes. In this paper, we develop an HQC algorithm using an efficient variational optimization approach to simulate open system dynamics under the Noisy-Intermediate Scale Quantum computer. Using the time-dependent variational principle (TDVP) method and extending it to McLachlan TDVP for density matrix which involves minimization of Frobenius norm of the error, we apply the unitary quantum circuit to obtain the time evolution of the open quantum system in the Lindblad formalism. Finally, we illustrate the use of our methods with detailed examples which are in good agreement with analytical calculations.

arXiv:2008.05321•Journal of Physics A Mathematical and Theoretical•Aug 7, 2020•14 citations

Hardware-efficient variational quantum algorithms for time evolution

Marcello Benedetti, Mattia Fiorentini, Michael Lubasch

Parameterized quantum circuits are a promising technology for achieving a quantum advantage. An important application is the variational simulation of time evolution of quantum systems. To make the most of quantum hardware, variational algorithms need to be as hardware-efficient as possible. Here we present alternatives to the time-dependent variational principle that are hardware-efficient and do not require matrix inversion. In relation to imaginary time evolution, our approach significantly reduces the hardware requirements. With regards to real time evolution, where high precision can be important, we present algorithms of systematically increasing accuracy and hardware requirements. We numerically analyze the performance of our algorithms using quantum Hamiltonians with local interactions.

arXiv:2009.12361•Physical Review Research•Jul 22, 2021•176 citations

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

Alexander Miessen, Pauline J. Ollitrault, Ivano Tavernelli

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.

arXiv:2108.04258•Physical Review Research•Dec 23, 2021•48 citations

Quantum circuit simulation with a local time-dependent variational principle

Jens Eisert, Aaron Sander, Maximilian Fröhlich +6 more

Abstract Classical simulations of quantum circuits are vital for assessing potential quantum advantage and benchmarking devices, yet they require sophisticated methods to avoid the exponential growth of resources. Tensor network approaches, in particular matrix product states (MPS) combined with the time-evolving block decimation (TEBD) algorithm, currently dominate large-scale circuit simulations. These methods scale efficiently when entanglement is limited but suffer rapid bond dimension growth with increasing entanglement and handle long-range gates via costly SWAP insertions. Motivated by the success of the time-dependent variational principle (TDVP) in many-body physics, we reinterpret quantum circuits as series of discrete time evolutions, using gate generators to construct an MPS-based circuit simulation via a local TDVP formulation. This addresses TEBD's key limitations by (1) naturally accommodating long-range gates and (2) optimally representing states on the MPS manifold. By diffusing entanglement more globally, the method suppresses local bond growth and reduces memory and runtime costs. We benchmark the approach on five 49-qubit circuits: three Hamiltonian circuits (1D open and periodic Heisenberg, 2D 7x7 Ising) and two algorithmic ones (quantum approximate optimization, hardware-efficient ansatz). Across all cases, our method yields substantial resource reductions over standard tools, establishing a new state-of-the-art for circuit simulation and enabling advances across quantum computing, condensed matter, and beyond.

•Dec 5, 2025•0 citations
We introduce a novel hybrid algorithm to simulate the real-time evolution of quantum systems using parameterized quantum circuits. The method, named "projected – Variational Quantum Dynamics" (p-VQD) realizes an iterative, global projection of the exact time evolution onto the parameterized manifold. In the small time-step limit, this is equivalent to the McLachlan's variational principle. Our approach is efficient in the sense that it exhibits an optimal linear scaling with the total number of variational parameters. Furthermore, it is global in the sense that it uses the variational principle to optimize all parameters at once. The global nature of our approach then significantly extends the scope of existing efficient variational methods, that instead typically rely on the iterative optimization of a restricted subset of variational parameters. Through numerical experiments, we also show that our approach is particularly advantageous over existing global optimization algorithms based on the time-dependent variational principle that, due to a demanding quadratic scaling with parameter numbers, are unsuitable for large parameterized quantum circuits.
We propose an adaptive quantum algorithm to prepare accurate variational time evolved wave functions. The method is based on the projected variational quantum dynamics (pVQD) algorithm, that performs a global optimization with linear scaling in the number of variational parameters. Instead of fixing a variational ansatz at the beginning of the simulation, the circuit is grown systematically during the time evolution. Moreover, the adaptive step does not require auxiliary qubits and the gate search can be performed in parallel on different quantum devices. We apply the algorithm, named adaptive pVQD, to the simulation of driven spin models and fermionic systems, where it shows an advantage when compared to both Trotterized circuits and nonadaptive variational methods. Finally, we use the shallower circuits prepared using the adaptive pVQD algorithm to obtain more accurate measurements of physical properties of quantum systems on hardware. Published by the American Physical Society 2024
We present an efficient approach to simulate real-time quantum dynamics using projected variational quantum dynamics, where the computational cost is reduced by strategically optimizing only a subset of the variational parameters at each time step. Typically, the variational Ansatz consists of repeated blocks of parameterized quantum circuits, where all parameters are updated in a standard optimization procedure. In contrast, our method selectively optimizes one block at a time while keeping the others fixed, allowing for significant reductions in computational overhead. This semi-global optimization strategy ensures that all qubits are still involved in the evolution, but the optimization is localized to specific blocks, thus avoiding the need to update all parameters simultaneously. We propose different approaches for choosing the next block for optimization, including sequential, random, and fidelity-based updation. We demonstrate the performance of the proposed methods in a series of spin-lattice models with varying sizes and complexity. Our method preserves the accuracy of the time evolution with a much lower computational cost. This new optimization strategy provides a promising path toward high-fidelity simulation of the time evolution of complex quantum systems with reduced computational resources.
Abstract Hybrid quantum-classical (HQC) algorithms make it possible to use near-term quantum devices supported by classical computational resources by useful control schemes. In this paper, we develop an HQC algorithm using an efficient variational optimization approach to simulate open system dynamics under the Noisy-Intermediate Scale Quantum computer. Using the time-dependent variational principle (TDVP) method and extending it to McLachlan TDVP for density matrix which involves minimization of Frobenius norm of the error, we apply the unitary quantum circuit to obtain the time evolution of the open quantum system in the Lindblad formalism. Finally, we illustrate the use of our methods with detailed examples which are in good agreement with analytical calculations.
Parameterized quantum circuits are a promising technology for achieving a quantum advantage. An important application is the variational simulation of time evolution of quantum systems. To make the most of quantum hardware, variational algorithms need to be as hardware-efficient as possible. Here we present alternatives to the time-dependent variational principle that are hardware-efficient and do not require matrix inversion. In relation to imaginary time evolution, our approach significantly reduces the hardware requirements. With regards to real time evolution, where high precision can be important, we present algorithms of systematically increasing accuracy and hardware requirements. We numerically analyze the performance of our algorithms using quantum Hamiltonians with local interactions.
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.
Abstract Classical simulations of quantum circuits are vital for assessing potential quantum advantage and benchmarking devices, yet they require sophisticated methods to avoid the exponential growth of resources. Tensor network approaches, in particular matrix product states (MPS) combined with the time-evolving block decimation (TEBD) algorithm, currently dominate large-scale circuit simulations. These methods scale efficiently when entanglement is limited but suffer rapid bond dimension growth with increasing entanglement and handle long-range gates via costly SWAP insertions. Motivated by the success of the time-dependent variational principle (TDVP) in many-body physics, we reinterpret quantum circuits as series of discrete time evolutions, using gate generators to construct an MPS-based circuit simulation via a local TDVP formulation. This addresses TEBD's key limitations by (1) naturally accommodating long-range gates and (2) optimally representing states on the MPS manifold. By diffusing entanglement more globally, the method suppresses local bond growth and reduces memory and runtime costs. We benchmark the approach on five 49-qubit circuits: three Hamiltonian circuits (1D open and periodic Heisenberg, 2D 7x7 Ising) and two algorithmic ones (quantum approximate optimization, hardware-efficient ansatz). Across all cases, our method yields substantial resource reductions over standard tools, establishing a new state-of-the-art for circuit simulation and enabling advances across quantum computing, condensed matter, and beyond.