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:2609.20802

Locally optimized variational evolution for quantum many-body systems

Carolin Wille, Max Marvell, Lauren Stewart, Max Murphy, Vinul Wimalaweera, Lesley Gover, Andrew G. Green

quant-phcond-mat.str-elSubmitted Sep 17, 2026• Announced Sep 18, 2026• 0 citations
v1 · Sep 17, 2026v2 · Oct 12, 2026
arXivHTMLPDF

Abstract

Conventional quantum advantage in many-body dynamics is based on avoiding the simulation cost on a classical computer that arises from the extensive exponential complexity of the global wavefunction. Local observables, however, do not inherit this extensive complexity and may instead be governed by an intrinsic local complexity that is independent of the total system size. This distinction is particularly relevant in thermalising systems, where local observables lose memory of microscopic details and relax towards equilibrium values determined by only a few parameters. Here we introduce a variational time-evolution principle that exploits this distinction by replacing global-state fidelity with a cost function defined on local reduced density matrices. The resulting evolution retains coherent short-time dynamics while exploiting the simplification produced by thermalisation at later times. The concrete algorithm we propose is based on locally optimising matrix-product states and admits closed-form equations of motion analogous to the time-dependent variational principle. We show that the same variational principle has a quantum-classical counterpart, combining quantum evaluation of the local cost with an optimisation strategy robust to both shot and hardware noise. Proof-of-principle implementations on Quantinuum H2 and IBM Heron processors recover the characteristic local dynamics.

Comments
18 pages, 12 figures

Related papers

Locally optimized variational evolution for quantum many-body systems — E8 Intelligence Research

Andrew Stewart Caldin

Conventional quantum advantage in many-body dynamics is based on avoiding the simulation cost on a classical computer that arises from the extensive exponential complexity of the global wavefunction. Local observables, however, do not inherit this extensive complexity and may instead be governed by an intrinsic local complexity that is independent of the total system size. This distinction is particularly relevant in thermalising systems, where local observables lose memory of microscopic details and relax towards equilibrium values determined by only a few parameters. Here we introduce a variational time-evolution principle that exploits this distinction by replacing global-state fidelity with a cost function defined on local reduced density matrices. The resulting evolution retains coherent short-time dynamics while exploiting the simplification produced by thermalisation at later times. The concrete algorithm we propose is based on locally optimising matrix-product states and admits Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 7, 2026•0 citations

Simulating open quantum dynamics with time-dependent variational matrix product states: Towards microscopic correlation of environment dynamics and reduced system evolution

Florian A. Y. N. Schröder, Alex W. Chin

We report the development of an efficient many-body algorithm for simulating open quantum system dynamics that utilizes a time-dependent variational principle for matrix product states to evolve large system-environment states. Capturing all system-environment correlations, we reproduce the nonperturbative, quantum-critical dynamics of the zero-temperature spin-boson model, and then exploit the many-body information to visualize the complete time-frequency spectrum of the environmental excitations. Our ``environmental spectra'' reveal correlated vibrational motion in polaronic modes which preserve their vibrational coherence during incoherent spin relaxation, demonstrating how environment information could yield valuable insights into complex quantum dissipative processes.

arXiv:1507.02202•Physical review. B./Physical review. B•Feb 2, 2016•125 citations

Classical Simulation of Short-Time Quantum Dynamics

Dominik S. Wild, Alvaro Martin Alhambra

Recent progress in the development of quantum technologies has enabled the direct investigation of the dynamics of increasingly complex quantum many-body systems.This motivates the study of the complexity of classical algorithms for this problem in order to benchmark quantum simulators and to delineate the regime of quantum advantage.Here, we present classical algorithms for approximating the dynamics of local observables and nonlocal quantities such as the Loschmidt echo, where the evolution is governed by a local Hamiltonian.For short times, their computational cost scales polynomially with the system size and the inverse of the approximation error.In the case of local observables, the proposed algorithm has a better dependence on the approximation error than algorithms based on the Lieb-Robinson bound.Our results use cluster-expansion techniques adapted to the dynamical setting, for which we give a novel proof of their convergence.This has important physical consequences besides our efficient algorithms.In particular, we establish a novel quantum speed limit, a bound on dynamical phase transitions, and a concentration bound for product states evolved for short times.

arXiv:2210.11490•PRX Quantum•Jun 12, 2023•42 citations

Efficient Quantum Optimization via Dynamical Simulation

Ahmet Burak Çatlı, Sophia Simon, Nathan Wiebe

We provide several quantum algorithms for continuous optimization that do not require gradient estimation. Instead, we encode the optimization problem into the dynamics of a physical system and coherently simulate the time evolution. We focus on the setting where the objective function can be accessed via a phase oracle. Our first two algorithms can find local optima of a differentiable function f : R N → R by simulating either classical or quantum dynamics with friction via a time-dependent Hamiltonian. We show that for the benchmark problem of optimizing a locally quadratic objective function, these methods require a total of O ( N 2 κ 2 / h x 2 ϵ ) queries to a phase oracle to find an ϵ -approximate local optimum, where κ is the condition number of the Hessian matrix and h x is the discretization spacing. In contrast, we show that methods based on gradient descent require O ( N 3 / 2 ( 1 / ϵ ) κ log ( 3 ) / 4 ) queries. This corresponds to an exponential separation between the query upper bounds for the benchmark problem. Our third algorithm can find the global optimum of f by preparing a classical low-temperature thermal state via simulation of the classical Liouvillian operator associated with the Nosé Hamiltonian. We use results from the quantum thermodynamics literature to bound the thermalization time for the discrete system. Additionally, we analyze barren plateau effects that commonly plague quantum optimization algorithms and observe that our approach is vastly less sensitive to this problem than standard gradient-based optimization. Our results suggest that these dynamical optimization approaches may be far more scalable for future quantum machine learning, optimization and variational experiments than was widely believed.

arXiv:2502.04285•PRX Quantum•May 14, 2026•22 citations

Compressed minimum-purity time evolution for late-time quantum dynamics

Moksh Bhateja, Jonas B. Rigo, Markus Schmitt

Unitary time evolution of initially simple quantum many-body states rapidly generates entanglement and complex correlations, which limits direct numerical simulations. The late-time dynamics of physical observables, however, typically exhibits an effective simplicity in the form of hydrodynamics or kinetic theory. This leads to the question whether microscopic equations of motion can remain accurate and tractable up to long time scales by discarding irrelevant information in a controlled manner. Here, we introduce compressed minimum-purity time evolution (CoMPuTE) as an approach to keep track of a consistent set of reduced local density matrices, closing the hierarchical equations of motion using a minimum-purity principle. In benchmark applications we demonstrate (i) accurate description of energy diffusion in the one-dimensional mixed-field Ising model, (ii) the applicability to genuinely out-of-equilibrium Floquet dynamics starting from a pure state, and (iii) the limitations of the local reduced density matrix approximation when describing transport in the XXZ chain at $Δ=1$ that is governed by increasingly non-local integrals of motion. The CoMPuTE method enhances computational efficiency in comparison to the closely related local-information time evolution algorithm, opening a possible route towards an extension to systems in higher spatial dimensions.

cond-mat.stat-mechCross-listedarXiv:2606.11392•Jun 11, 2026•1 citation

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•2 citations
Conventional quantum advantage in many-body dynamics is based on avoiding the simulation cost on a classical computer that arises from the extensive exponential complexity of the global wavefunction. Local observables, however, do not inherit this extensive complexity and may instead be governed by an intrinsic local complexity that is independent of the total system size. This distinction is particularly relevant in thermalising systems, where local observables lose memory of microscopic details and relax towards equilibrium values determined by only a few parameters. Here we introduce a variational time-evolution principle that exploits this distinction by replacing global-state fidelity with a cost function defined on local reduced density matrices. The resulting evolution retains coherent short-time dynamics while exploiting the simplification produced by thermalisation at later times. The concrete algorithm we propose is based on locally optimising matrix-product states and admits closed-form equations of motion analogous to the time-dependent variational principle. We show that the same variational principle has a quantum-classical counterpart, combining quantum evaluation of the local cost with an optimisation strategy robust to both shot and hardware noise. Proof-of-principle implementations on Quantinuum H2 and IBM Heron processors recover the characteristic local dynamics.
Conventional quantum advantage in many-body dynamics is based on avoiding the simulation cost on a classical computer that arises from the extensive exponential complexity of the global wavefunction. Local observables, however, do not inherit this extensive complexity and may instead be governed by an intrinsic local complexity that is independent of the total system size. This distinction is particularly relevant in thermalising systems, where local observables lose memory of microscopic details and relax towards equilibrium values determined by only a few parameters. Here we introduce a variational time-evolution principle that exploits this distinction by replacing global-state fidelity with a cost function defined on local reduced density matrices. The resulting evolution retains coherent short-time dynamics while exploiting the simplification produced by thermalisation at later times. The concrete algorithm we propose is based on locally optimising matrix-product states and admits Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
We report the development of an efficient many-body algorithm for simulating open quantum system dynamics that utilizes a time-dependent variational principle for matrix product states to evolve large system-environment states. Capturing all system-environment correlations, we reproduce the nonperturbative, quantum-critical dynamics of the zero-temperature spin-boson model, and then exploit the many-body information to visualize the complete time-frequency spectrum of the environmental excitations. Our ``environmental spectra'' reveal correlated vibrational motion in polaronic modes which preserve their vibrational coherence during incoherent spin relaxation, demonstrating how environment information could yield valuable insights into complex quantum dissipative processes.
Recent progress in the development of quantum technologies has enabled the direct investigation of the dynamics of increasingly complex quantum many-body systems.This motivates the study of the complexity of classical algorithms for this problem in order to benchmark quantum simulators and to delineate the regime of quantum advantage.Here, we present classical algorithms for approximating the dynamics of local observables and nonlocal quantities such as the Loschmidt echo, where the evolution is governed by a local Hamiltonian.For short times, their computational cost scales polynomially with the system size and the inverse of the approximation error.In the case of local observables, the proposed algorithm has a better dependence on the approximation error than algorithms based on the Lieb-Robinson bound.Our results use cluster-expansion techniques adapted to the dynamical setting, for which we give a novel proof of their convergence.This has important physical consequences besides our efficient algorithms.In particular, we establish a novel quantum speed limit, a bound on dynamical phase transitions, and a concentration bound for product states evolved for short times.
We provide several quantum algorithms for continuous optimization that do not require gradient estimation. Instead, we encode the optimization problem into the dynamics of a physical system and coherently simulate the time evolution. We focus on the setting where the objective function can be accessed via a phase oracle. Our first two algorithms can find local optima of a differentiable function f : R N → R by simulating either classical or quantum dynamics with friction via a time-dependent Hamiltonian. We show that for the benchmark problem of optimizing a locally quadratic objective function, these methods require a total of O ( N 2 κ 2 / h x 2 ϵ ) queries to a phase oracle to find an ϵ -approximate local optimum, where κ is the condition number of the Hessian matrix and h x is the discretization spacing. In contrast, we show that methods based on gradient descent require O ( N 3 / 2 ( 1 / ϵ ) κ log ( 3 ) / 4 ) queries. This corresponds to an exponential separation between the query upper bounds for the benchmark problem. Our third algorithm can find the global optimum of f by preparing a classical low-temperature thermal state via simulation of the classical Liouvillian operator associated with the Nosé Hamiltonian. We use results from the quantum thermodynamics literature to bound the thermalization time for the discrete system. Additionally, we analyze barren plateau effects that commonly plague quantum optimization algorithms and observe that our approach is vastly less sensitive to this problem than standard gradient-based optimization. Our results suggest that these dynamical optimization approaches may be far more scalable for future quantum machine learning, optimization and variational experiments than was widely believed.
Unitary time evolution of initially simple quantum many-body states rapidly generates entanglement and complex correlations, which limits direct numerical simulations. The late-time dynamics of physical observables, however, typically exhibits an effective simplicity in the form of hydrodynamics or kinetic theory. This leads to the question whether microscopic equations of motion can remain accurate and tractable up to long time scales by discarding irrelevant information in a controlled manner. Here, we introduce compressed minimum-purity time evolution (CoMPuTE) as an approach to keep track of a consistent set of reduced local density matrices, closing the hierarchical equations of motion using a minimum-purity principle. In benchmark applications we demonstrate (i) accurate description of energy diffusion in the one-dimensional mixed-field Ising model, (ii) the applicability to genuinely out-of-equilibrium Floquet dynamics starting from a pure state, and (iii) the limitations of the local reduced density matrix approximation when describing transport in the XXZ chain at Δ=1Δ=1Δ=1 that is governed by increasingly non-local integrals of motion. The CoMPuTE method enhances computational efficiency in comparison to the closely related local-information time evolution algorithm, opening a possible route towards an extension to systems in higher spatial dimensions.
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.