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:2312.14245 · Physical Review Research

Scalable simulation of nonequilibrium quantum dynamics via classically optimized unitary circuits

Luke Causer, F. Jung, Asimpunya Mitra, Frank Pollmann, Adam Gammon-Smith

Published Jul 15, 2024• 13 citations
arXivHTMLPDF

Abstract

The advent of near-term digital quantum computers could offer us an exciting opportunity to investigate quantum many-body phenomena beyond that of classical computing. To make the best use of the hardware available, it is paramount that we have methods that accurately simulate Hamiltonian dynamics for limited circuit depths. In this paper, we propose a method to classically optimize unitary brickwall circuits to approximate quantum time evolution operators. Our method is scalable in system size through the use of tensor networks. We demonstrate that, for various three-body Hamiltonians, our approach produces quantum circuits that can outperform trotterization in both their accuracy and the quantum circuit depth needed to implement the dynamics, with the exact details being dependent on the Hamiltonian. We also explain how to choose an optimal time step that minimizes the combined errors of the quantum device and the brickwall circuit approximation. Published by the American Physical Society 2024

DOI
10.1103/physrevresearch.6.033062

Related papers

Benchmarking Digital Quantum Simulations Above Hundreds of Qubits Using Quantum Critical Dynamics

Alexander Miessen, Daniel J. Egger, Ivano Tavernelli +1 more

The real-time simulation of large many-body quantum systems is a formidable task, that may only be achievable with a genuine quantum computational platform. Currently, quantum hardware with a number of qubits sufficient to make classical emulation challenging is available. This condition is necessary for the pursuit of a so-called quantum advantage, but it also makes verifying the results very difficult. In this paper, we flip the perspective and utilize known theoretical results about many-body quantum critical dynamics to qualitatively benchmark digital quantum hardware and various error mitigation techniques. In particular, we benchmark against known universal scaling laws in the Hamiltonian simulation of a time-dependent transverse-field Ising Hamiltonian of up to 133 qubits. Incorporating only basic error mitigation and suppression methods, our study shows reliable control up to a two-qubit gate depth of 28, featuring a maximum of 1396 two-qubit gates, before noise becomes prevalent. These results are transferable to applications such as Hamiltonian simulation, variational algorithms, optimization, or quantum machine learning. We demonstrate this on the example of digitized quantum annealing for optimization and identify an optimal working point in terms of both circuit depth and time step on a 133-site optimization problem. Published by the American Physical Society 2024

arXiv:2404.08053•PRX Quantum•Nov 6, 2024•48 citations

Correcting and Extending Trotterized Quantum Many-Body Dynamics

Gian Gentinetta, Friederike Metz, Giuseppe Carleo

A complex but important challenge in understanding quantum mechanical phenomena is the simulation of quantum many-body dynamics. Although quantum computers offer significant potential to accelerate these simulations, their practical application is currently limited by noise and restricted scalability. In this work, we address these problems by introducing a hybrid ansatz combining the strengths of quantum and classical computational methods. Using Trotterization, we propose to evolve an initial state on the quantum computer according to a simplified Hamiltonian, focusing on terms that are difficult to simulate classically. A classical model then corrects the simulation by including the terms omitted in the quantum circuit. While the classical ansatz is optimized during the time evolution, the quantum circuit has no variational parameters. Derivatives can thus be calculated purely classically, avoiding challenges arising in the optimization of parametrized quantum circuits. We demonstrate three applications of this hybrid method. First, our approach allows us to avoid gates in the quantum circuit by restricting the quantum part of the ansatz to hardware-efficient terms of the Hamiltonian. Second, we can mitigate errors arising from the Trotterization of the time-evolution unitary. Finally, we can extend the system size while keeping the number of qubits in the quantum circuit constant by including additional degrees of freedom in the classical ansatz.

arXiv:2502.13784•PRX Quantum•Aug 21, 2025•3 citations

Towards Adiabatic Quantum Computing Using Compressed Quantum Circuits

Conor Mc Keever, Michael Lubasch

We describe tensor network algorithms to optimize quantum circuits for adiabatic quantum computing. To suppress diabatic transitions, we include counterdiabatic driving in the optimization and utilize variational matrix product operators to represent adiabatic gauge potentials. Traditionally, Trotter product formulas are used to turn adiabatic time evolution into quantum circuits and the addition of counterdiabatic driving increases the circuit depth per time step. Instead, we classically optimize a parameterized quantum circuit of fixed depth to simultaneously capture adiabatic evolution together with counterdiabatic driving over many time steps. The methods are applied to the ground-state preparation of quantum Ising chains with transverse and longitudinal fields. We show that the classically optimized circuits can significantly outperform Trotter product formulas. Additionally, we discuss how the approach can be used for combinatorial optimization. Published by the American Physical Society 2024

arXiv:2311.05544•PRX Quantum•Jun 14, 2024•95 citations

Variational quantum time evolution without the quantum geometric tensor

Julien Gacon, Jannes Nys, Riccardo Rossi +2 more

Real- and imaginary-time quantum state evolutions are crucial in physics and chemistry for exploring quantum dynamics, preparing ground states, and computing thermodynamic observables. On near-term devices, variational quantum time evolution is a promising candidate for these tasks, as the required circuit model can be tailored to the available devices' capabilities. Due to the evaluation of the quantum geometric tensor (QGT), however, this approach quickly becomes infeasible for relevant system sizes. Here, we propose a dual formulation for variational time evolution, which replaces the calculation of the QGT by solving a fidelity-based optimization to compute updates to the dynamics in each time step. We demonstrate our algorithm for the time evolution of the Heisenberg Hamiltonian and show that it accurately reproduces the system dynamics at a fraction of the cost of standard variational quantum time evolution algorithms. Published by the American Physical Society 2024

arXiv:2303.12839•Physical Review Research•Feb 5, 2024•40 citations

Optimal compression of quantum many-body time evolution operators into brickwall circuits

Maurits S. J. Tepaske, Dominik Hahn, David J. Luitz

Near term quantum computers suffer from a degree of decoherence which is prohibitive for high fidelity simulations with deep circuits. An economical use of circuit depth is therefore paramount. For digital quantum simulation of quantum many-body systems, real time evolution is typically achieved by a Trotter decomposition of the time evolution operator into circuits consisting only of two qubit gates. To match the geometry of the physical system and the CNOT connectivity of the quantum processor, additional SWAP gates are needed. We show that optimal fidelity, beyond what is achievable by simple Trotter decompositions for a fixed gate count, can be obtained by compiling the evolution operator into optimal brickwall circuits for the S=1/2 S = 1 / 2 quantum Heisenberg model on chains and ladders, when mapped to one dimensional quantum processors without the need of additional SWAP gates.

arXiv:2205.03445•SciPost Physics•Apr 17, 2023•38 citations

Characterising many-body systems via quantum dynamics simulations

Lucia Vilchez-Estevez

Simulating quantum many-body systems is essential for understanding complex phenomena in condensed matter, chemistry, and materials science. Quantum computing offers a way to overcome the limitations of classical methods by operating directly in exponentially large Hilbert spaces. In particular, classical methods often fail to capture the dynamics of strongly correlated systems, which makes quantum algorithms a promising alternative for exploring these challenging regimes. This thesis uses quantum dynamics simulations to probe the behaviour of many-body systems. We first introduce a spectroscopy-based protocol to extract excitation spectra from the time evolution of observables and analyse its performance on near-term quantum devices. We show that the protocol requires only short evolution times and is resilient to errors, facilitating its implementation on real hardware. Building on this, we simulate fermionic excitation spectra using current quantum devices, introducing resource optimisations - including an approximate free-fermion initial state, a unitary quench without ancillae, and reduced Trotter steps - that significantly lower circuit depth. These improvements enable simulations at system sizes competitive with the state of the art, yielding results that match classical benchmarks. While most studies focus on unitary dynamics of isolated systems, open quantum dynamics is increasingly relevant for describing non-equilibrium processes across biology, materials science, and quantum control. We extend our scope to systems coupled to an environment and governed by Lindbladian evolution. By studying simulation complexity through physically meaningful quantities - such as correlation length and mixing time - we explore whether open-system dynamics can be as tractable as their unitary counterparts. These findings provide insights into the computational complexity landscape of open-system simulation and highlight regimes where quantum methods offer a clear advantage.

•Jan 1, 2025•0 citations
The advent of near-term digital quantum computers could offer us an exciting opportunity to investigate quantum many-body phenomena beyond that of classical computing. To make the best use of the hardware available, it is paramount that we have methods that accurately simulate Hamiltonian dynamics for limited circuit depths. In this paper, we propose a method to classically optimize unitary brickwall circuits to approximate quantum time evolution operators. Our method is scalable in system size through the use of tensor networks. We demonstrate that, for various three-body Hamiltonians, our approach produces quantum circuits that can outperform trotterization in both their accuracy and the quantum circuit depth needed to implement the dynamics, with the exact details being dependent on the Hamiltonian. We also explain how to choose an optimal time step that minimizes the combined errors of the quantum device and the brickwall circuit approximation. Published by the American Physical Society 2024
The real-time simulation of large many-body quantum systems is a formidable task, that may only be achievable with a genuine quantum computational platform. Currently, quantum hardware with a number of qubits sufficient to make classical emulation challenging is available. This condition is necessary for the pursuit of a so-called quantum advantage, but it also makes verifying the results very difficult. In this paper, we flip the perspective and utilize known theoretical results about many-body quantum critical dynamics to qualitatively benchmark digital quantum hardware and various error mitigation techniques. In particular, we benchmark against known universal scaling laws in the Hamiltonian simulation of a time-dependent transverse-field Ising Hamiltonian of up to 133 qubits. Incorporating only basic error mitigation and suppression methods, our study shows reliable control up to a two-qubit gate depth of 28, featuring a maximum of 1396 two-qubit gates, before noise becomes prevalent. These results are transferable to applications such as Hamiltonian simulation, variational algorithms, optimization, or quantum machine learning. We demonstrate this on the example of digitized quantum annealing for optimization and identify an optimal working point in terms of both circuit depth and time step on a 133-site optimization problem. Published by the American Physical Society 2024
A complex but important challenge in understanding quantum mechanical phenomena is the simulation of quantum many-body dynamics. Although quantum computers offer significant potential to accelerate these simulations, their practical application is currently limited by noise and restricted scalability. In this work, we address these problems by introducing a hybrid ansatz combining the strengths of quantum and classical computational methods. Using Trotterization, we propose to evolve an initial state on the quantum computer according to a simplified Hamiltonian, focusing on terms that are difficult to simulate classically. A classical model then corrects the simulation by including the terms omitted in the quantum circuit. While the classical ansatz is optimized during the time evolution, the quantum circuit has no variational parameters. Derivatives can thus be calculated purely classically, avoiding challenges arising in the optimization of parametrized quantum circuits. We demonstrate three applications of this hybrid method. First, our approach allows us to avoid gates in the quantum circuit by restricting the quantum part of the ansatz to hardware-efficient terms of the Hamiltonian. Second, we can mitigate errors arising from the Trotterization of the time-evolution unitary. Finally, we can extend the system size while keeping the number of qubits in the quantum circuit constant by including additional degrees of freedom in the classical ansatz.
We describe tensor network algorithms to optimize quantum circuits for adiabatic quantum computing. To suppress diabatic transitions, we include counterdiabatic driving in the optimization and utilize variational matrix product operators to represent adiabatic gauge potentials. Traditionally, Trotter product formulas are used to turn adiabatic time evolution into quantum circuits and the addition of counterdiabatic driving increases the circuit depth per time step. Instead, we classically optimize a parameterized quantum circuit of fixed depth to simultaneously capture adiabatic evolution together with counterdiabatic driving over many time steps. The methods are applied to the ground-state preparation of quantum Ising chains with transverse and longitudinal fields. We show that the classically optimized circuits can significantly outperform Trotter product formulas. Additionally, we discuss how the approach can be used for combinatorial optimization. Published by the American Physical Society 2024
Real- and imaginary-time quantum state evolutions are crucial in physics and chemistry for exploring quantum dynamics, preparing ground states, and computing thermodynamic observables. On near-term devices, variational quantum time evolution is a promising candidate for these tasks, as the required circuit model can be tailored to the available devices' capabilities. Due to the evaluation of the quantum geometric tensor (QGT), however, this approach quickly becomes infeasible for relevant system sizes. Here, we propose a dual formulation for variational time evolution, which replaces the calculation of the QGT by solving a fidelity-based optimization to compute updates to the dynamics in each time step. We demonstrate our algorithm for the time evolution of the Heisenberg Hamiltonian and show that it accurately reproduces the system dynamics at a fraction of the cost of standard variational quantum time evolution algorithms. Published by the American Physical Society 2024
Near term quantum computers suffer from a degree of decoherence which is prohibitive for high fidelity simulations with deep circuits. An economical use of circuit depth is therefore paramount. For digital quantum simulation of quantum many-body systems, real time evolution is typically achieved by a Trotter decomposition of the time evolution operator into circuits consisting only of two qubit gates. To match the geometry of the physical system and the CNOT connectivity of the quantum processor, additional SWAP gates are needed. We show that optimal fidelity, beyond what is achievable by simple Trotter decompositions for a fixed gate count, can be obtained by compiling the evolution operator into optimal brickwall circuits for the S=1/2 S = 1 / 2 quantum Heisenberg model on chains and ladders, when mapped to one dimensional quantum processors without the need of additional SWAP gates.
Simulating quantum many-body systems is essential for understanding complex phenomena in condensed matter, chemistry, and materials science. Quantum computing offers a way to overcome the limitations of classical methods by operating directly in exponentially large Hilbert spaces. In particular, classical methods often fail to capture the dynamics of strongly correlated systems, which makes quantum algorithms a promising alternative for exploring these challenging regimes. This thesis uses quantum dynamics simulations to probe the behaviour of many-body systems. We first introduce a spectroscopy-based protocol to extract excitation spectra from the time evolution of observables and analyse its performance on near-term quantum devices. We show that the protocol requires only short evolution times and is resilient to errors, facilitating its implementation on real hardware. Building on this, we simulate fermionic excitation spectra using current quantum devices, introducing resource optimisations - including an approximate free-fermion initial state, a unitary quench without ancillae, and reduced Trotter steps - that significantly lower circuit depth. These improvements enable simulations at system sizes competitive with the state of the art, yielding results that match classical benchmarks. While most studies focus on unitary dynamics of isolated systems, open quantum dynamics is increasingly relevant for describing non-equilibrium processes across biology, materials science, and quantum control. We extend our scope to systems coupled to an environment and governed by Lindbladian evolution. By studying simulation complexity through physically meaningful quantities - such as correlation length and mixing time - we explore whether open-system dynamics can be as tractable as their unitary counterparts. These findings provide insights into the computational complexity landscape of open-system simulation and highlight regimes where quantum methods offer a clear advantage.