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.13676 · Physical Review Research

Adaptive variational low-rank dynamics for open quantum systems

Luca Gravina, Vincenzo Savona

Published Apr 19, 2024• 11 citations
arXivHTMLPDF

Abstract

We introduce a model-independent method for the efficient simulation of low-entropy systems, whose dynamics can be accurately described with a limited number of states. Our method leverages the time-dependent variational principle to efficiently integrate the Lindblad master equation, dynamically identifying and modifying the low-rank basis over which we decompose the system's evolution. By dynamically adapting the dimension of this basis, and thus the rank of the density matrix, our method maintains optimal representation of the system state, offering a substantial computational advantage over existing adaptive low-rank schemes in terms of both computational time and memory requirements. We demonstrate the efficacy of our method through extensive benchmarks on a variety of model systems, with a particular emphasis on multiqubit bosonic codes, a promising candidate for fault-tolerant quantum hardware. Our results highlight the method's versatility and efficiency, making it applicable to a wide range of systems characterized by arbitrary degrees of entanglement and moderate entropy throughout their dynamics. We provide an implementation of the method as a Julia package, making it readily available to use. Published by the American Physical Society 2024

DOI
10.1103/physrevresearch.6.023072

Related papers

Low-Rank Variational Quantum Algorithm for the Dynamics of Open Quantum Systems

Sara Diana Leal dos Santos, Xinyu Song, Vincenzo Savona

The simulation of many-body open quantum systems is key to solving numerous outstanding problems in physics, chemistry, material science, and in the development of quantum technologies. Near-term quantum computers may bring considerable advantage for the efficient simulation of their static and dynamical properties, thanks to hybrid quantum-classical variational algorithms to approximate the dynamics of the density matrix describing the quantum state in terms of an ensemble average. Here, a variational quantum algorithm is developed to simulate the real-time evolution of the density matrix governed by the Lindblad master equation, under the assumption that the quantum state has a bounded entropy along the dynamics, entailing a low-rank representation of its density matrix. The algorithm encodes each pure state of the statistical mixture as a parametrized quantum circuit, and the associated probabilities as additional variational parameters stored classically, thereby requiring a significantly lower number of qubits than algorithms where the full density matrix is encoded in the quantum memory. Two variational ansatze are proposed, and their effectiveness is assessed in the simulation of the dynamics of a 2D dissipative transverse field Ising model. The results underscore the algorithm's efficiency in simulating the dynamics of open quantum systems in the low-rank regime with limited quantum resources on a near-term quantum device.

arXiv:2403.05908•Quantum•Feb 4, 2025•7 citations

Dynamical Simulations of Schrödinger's Equation via Rank-Adaptive Tensor Decompositions

N. Anders Petersson, Chase Hodges-Heilmann, Stefanie Günther

We study low-rank tensor methods for the numerical solution of Schrödinger's equation with time-independent and explicitly time-dependent Hamiltonians, motivated by large-scale simulations of many-body quantum systems and quantum computing devices subject to time-dependent control pulses. We outline the recent application of the "basis update and Galerkin" (BUG) method for tensor trains, and describe the established TDVP and TDVP-2 algorithms based on the time-dependent variational principle. For comparison, we also consider the BUG method in the Tucker format. All these approaches enable memory efficient representations of partially entangled quantum states and thereby mitigate the exponential cost of conventional state-vector formulations. The rank-adaptivity relies on the truncated singular value decomposition, in which the rank of a matrix is reduced by setting its smallest singular values to zero, based on a threshold parameter that controls the truncation error. Numerical experiments on representative time-independent and time-dependent Hamiltonian models quantify the tradeoff between accuracy and compression across methods, with particular attention to the interplay between the time-step and the truncation threshold, and how the computational effort scales with the number of sub-systems in the quantum system.

quant-pharXiv:2603.13990•Mar 17, 2026•0 citations

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

Variational quantum algorithms for simulation of Lindblad dynamics

Tasneem Watad, Netanel H. Lindner

Abstract We introduce variational hybrid classical-quantum algorithms to simulate the Lindblad master equation and its adjoint for time-evolving Markovian open quantum systems and quantum observables. Our methods are based on a direct representation of density matrices and quantum observables as quantum superstates. We design and optimize low-depth variational quantum circuits that efficiently capture the unitary and non-unitary dynamics of the solutions. We benchmark and test the algorithms on different models and system sizes, showing their potential for utility with near-future hardware.

arXiv:2305.02815•Quantum Science and Technology•Dec 21, 2023•14 citations

Variational Quantum Simulation of Lindblad Dynamics via Quantum State Diffusion

Jianming Luo, Kaihan Lin, Xing Bao Gao

Quantum simulation of dynamics in open quantum systems is crucial but poses a significant challenge due to the non-Hermitian nature leading to nonunitary evolution and the limited quantum resources on current quantum computers. Here we introduce a variational hybrid quantum-classical algorithm designed for simulating the time evolution governed by the Lindblad master equation. Our approach involves on a stochastic unveiling of the density matrix, transforming the Lindblad equation into a wave function-based quantum state diffusion (QSD) method with the aim of reducing qubit requirements. We then apply variational quantum simulation (VQS) to efficiently capture the nonunitary evolution in QSD. We demonstrate our QSD-VQS algorithm by investigating the quantum dynamics in a two-level system subjected to an amplitude damping channel and a four-level transverse field Ising model within a dissipative environment including time-independent and periodic Hamiltonian cases. The results reveal its promising utility with upcoming hardware in the near future.

The Journal of Physical Chemistry Letters•Mar 22, 2024•21 citations

Simulation of open quantum systems via low-depth convex unitary evolutions

Joseph Peetz, Scott E. Smart, Spyros Tserkis +1 more

Simulating physical systems on quantum devices is one of the most promising applications of quantum technology. Current quantum approaches to simulating open quantum systems are still practically challenging on NISQ-era devices, because they typically require ancilla qubits and extensive controlled sequences. In this work, we propose a hybrid quantum-classical approach for simulating a class of open system dynamics called random-unitary channels. These channels naturally decompose into a series of convex unitary evolutions, which can then be efficiently sampled and run as independent circuits. The method does not require deep ancilla frameworks and thus can be implemented with lower noise costs. We implement simulations of open quantum systems up to dozens of qubits and with large channel ranks. Published by the American Physical Society 2024

arXiv:2307.14325•Physical Review Research•Jun 10, 2024•12 citations
We introduce a model-independent method for the efficient simulation of low-entropy systems, whose dynamics can be accurately described with a limited number of states. Our method leverages the time-dependent variational principle to efficiently integrate the Lindblad master equation, dynamically identifying and modifying the low-rank basis over which we decompose the system's evolution. By dynamically adapting the dimension of this basis, and thus the rank of the density matrix, our method maintains optimal representation of the system state, offering a substantial computational advantage over existing adaptive low-rank schemes in terms of both computational time and memory requirements. We demonstrate the efficacy of our method through extensive benchmarks on a variety of model systems, with a particular emphasis on multiqubit bosonic codes, a promising candidate for fault-tolerant quantum hardware. Our results highlight the method's versatility and efficiency, making it applicable to a wide range of systems characterized by arbitrary degrees of entanglement and moderate entropy throughout their dynamics. We provide an implementation of the method as a Julia package, making it readily available to use. Published by the American Physical Society 2024
The simulation of many-body open quantum systems is key to solving numerous outstanding problems in physics, chemistry, material science, and in the development of quantum technologies. Near-term quantum computers may bring considerable advantage for the efficient simulation of their static and dynamical properties, thanks to hybrid quantum-classical variational algorithms to approximate the dynamics of the density matrix describing the quantum state in terms of an ensemble average. Here, a variational quantum algorithm is developed to simulate the real-time evolution of the density matrix governed by the Lindblad master equation, under the assumption that the quantum state has a bounded entropy along the dynamics, entailing a low-rank representation of its density matrix. The algorithm encodes each pure state of the statistical mixture as a parametrized quantum circuit, and the associated probabilities as additional variational parameters stored classically, thereby requiring a significantly lower number of qubits than algorithms where the full density matrix is encoded in the quantum memory. Two variational ansatze are proposed, and their effectiveness is assessed in the simulation of the dynamics of a 2D dissipative transverse field Ising model. The results underscore the algorithm's efficiency in simulating the dynamics of open quantum systems in the low-rank regime with limited quantum resources on a near-term quantum device.
We study low-rank tensor methods for the numerical solution of Schrödinger's equation with time-independent and explicitly time-dependent Hamiltonians, motivated by large-scale simulations of many-body quantum systems and quantum computing devices subject to time-dependent control pulses. We outline the recent application of the "basis update and Galerkin" (BUG) method for tensor trains, and describe the established TDVP and TDVP-2 algorithms based on the time-dependent variational principle. For comparison, we also consider the BUG method in the Tucker format. All these approaches enable memory efficient representations of partially entangled quantum states and thereby mitigate the exponential cost of conventional state-vector formulations. The rank-adaptivity relies on the truncated singular value decomposition, in which the rank of a matrix is reduced by setting its smallest singular values to zero, based on a threshold parameter that controls the truncation error. Numerical experiments on representative time-independent and time-dependent Hamiltonian models quantify the tradeoff between accuracy and compression across methods, with particular attention to the interplay between the time-step and the truncation threshold, and how the computational effort scales with the number of sub-systems in the quantum system.
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
Abstract We introduce variational hybrid classical-quantum algorithms to simulate the Lindblad master equation and its adjoint for time-evolving Markovian open quantum systems and quantum observables. Our methods are based on a direct representation of density matrices and quantum observables as quantum superstates. We design and optimize low-depth variational quantum circuits that efficiently capture the unitary and non-unitary dynamics of the solutions. We benchmark and test the algorithms on different models and system sizes, showing their potential for utility with near-future hardware.
Quantum simulation of dynamics in open quantum systems is crucial but poses a significant challenge due to the non-Hermitian nature leading to nonunitary evolution and the limited quantum resources on current quantum computers. Here we introduce a variational hybrid quantum-classical algorithm designed for simulating the time evolution governed by the Lindblad master equation. Our approach involves on a stochastic unveiling of the density matrix, transforming the Lindblad equation into a wave function-based quantum state diffusion (QSD) method with the aim of reducing qubit requirements. We then apply variational quantum simulation (VQS) to efficiently capture the nonunitary evolution in QSD. We demonstrate our QSD-VQS algorithm by investigating the quantum dynamics in a two-level system subjected to an amplitude damping channel and a four-level transverse field Ising model within a dissipative environment including time-independent and periodic Hamiltonian cases. The results reveal its promising utility with upcoming hardware in the near future.
Simulating physical systems on quantum devices is one of the most promising applications of quantum technology. Current quantum approaches to simulating open quantum systems are still practically challenging on NISQ-era devices, because they typically require ancilla qubits and extensive controlled sequences. In this work, we propose a hybrid quantum-classical approach for simulating a class of open system dynamics called random-unitary channels. These channels naturally decompose into a series of convex unitary evolutions, which can then be efficiently sampled and run as independent circuits. The method does not require deep ancilla frameworks and thus can be implemented with lower noise costs. We implement simulations of open quantum systems up to dozens of qubits and with large channel ranks. Published by the American Physical Society 2024