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

Simulation numérique de systèmes quantiques ouverts en grande dimension

Roussel, Julien

Published Jun 30, 2015• 0 citations
OpenAlex

Abstract

Solving exactely the Lindblad equations, that model the evolution of open quantum systems, is only possible for small sizes. This is why we wish to have a range of methods enabling us to compute approximate solutions. We presente a deterministic low-rank method that is based upon a reduced approximate form of the density matrix, then a stochastic method of Monte-Carlo that gives the solution up to a statistical noise. We will first introduce an extension of the low-rank method, allowing us to use an adaptive rank while enforcing an upper bound on the error, and then a new variance reduction method. This new method speeds a lot the Monte-Carlo simulations by using the approximate solution given by the low-rank method as a control variate.

Related papers

Adaptive low-rank approximation and denoised Monte Carlo approach for high-dimensional Lindblad equations

Claude Le Bris, Pierre Rouchon, J. Roussel

We present a twofold contribution to the numerical simulation of Lindblad equations. First, an adaptive numerical approach to approximate Lindblad equations using low-rank dynamics is described: a deterministic low-rank approximation of the density operator is computed, and its rank is adjusted dynamically, using an on-the-fly estimator of the error committed when reducing the dimension. On the other hand, when the intrinsic dimension of the Lindblad equation is too high to allow for such a deterministic approximation, we combine classical ensemble averages of quantum Monte Carlo trajectories and a denoising technique. Specifically, a variance reduction method based on the consideration of a low-rank dynamics as a control variate is developed. Numerical tests for quantum collapse and revivals show the efficiency of each approach, along with the complementarity of the two approaches.

arXiv:1509.07960•Physical Review A•Dec 22, 2015•8 citations

Simulation numérique de systèmes quantiques ouverts en grande dimension

Julien Roussel

Resoudre exactement l'equation de Lindblad, qui modelise l'evolution des systemes quantiques ouverts, n'est possible que pour des tailles petites. C'est pourquoi on souhaite disposer d'une gamme de methodes permettant de calculer des solutions approchees. On presentera une methode deterministe dite de rang reduit, qui repose sur une forme reduite approchee de la matrice densite, puis une methode stochastique de Monte-Carlo qui donne la solution a une erreur statistique pres. On exposera d'une part une extension de la methode de rang reduit qui permet d'utiliser un rang adaptatif en majorant l'erreur commise, et d'autre part une nouvelle methode de reduction de variance. Cette nouvelle methode permet d'accelerer considerablement les simulations de Monte-Carlo en utilisant la solution approchee fournie par la methode rang reduit comme variable de controle.

•Jun 30, 2015•0 citations

Adaptive variational low-rank dynamics for open quantum systems

Luca Gravina, Vincenzo Savona

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

arXiv:2312.13676•Physical Review Research•Apr 19, 2024•14 citations

Low-rank propagation for tridiagonalizable open quantum systems: near-linear scaling with system size

Roman Ovsiannikov, Kurt Jacobs, Andrii G. Sotnikov +1 more

The quadratic growth of the density matrix with Hilbert-space dimension D is the central obstacle to simulating large open quantum systems. We introduce a deterministic algorithm that eliminates it for Lindblad dynamics whose Hamiltonian consists of a time-dependent diagonal part plus terms that are tridiagonal after reordering the basis. The state is a low-rank ensemble of vectors, propagated by tridiagonal split-operator steps and ensemble rank truncation of short-time Kraus branches, so that memory and cost per step are linear in D at fixed rank. For a driven nitrogen-vacancy-cavity model, rank 16 reproduces full density-matrix observables to relative error below $10^{-5}$, the method is up to two orders of magnitude faster than QuTiP already at $D \approx 500$, and its runtime scales nearly linearly.

quant-pharXiv:2609.25368•Sep 23, 2026•0 citations

A posteriori error estimates for the Lindblad master equation

Paul-Louis Etienney, Rémi Robin, Pierre Rouchon

We are interested in the simulation of open quantum systems governed by the Lindblad master equation in an infinite-dimensional Hilbert space. To simulate the solution of this equation, the standard approach involves two sequential approximations: first, we truncate the Hilbert space to derive a differential equation in a finite-dimensional subspace. Then, we use discrete time-step to obtain a numerical solution to the finite-dimensional evolution. In this paper, we establish bounds for these two approximations that can be explicitly computed to guarantee the accuracy of the numerical results. Through numerical examples, we demonstrate the efficiency of our method, empirically highlighting the tightness of the upper bound. While adaptive time-stepping is already a common practice in the time discretization of the Lindblad equation, we extend this approach by showing how to dynamically adjust the truncation of the Hilbert space. This enables fully adaptive simulations of the density matrix. For large-scale simulations, this approach can significantly reduce computational time and relieves users of the challenge of selecting an appropriate truncation. Furthermore, as a special case, our method naturally applies to Hamiltonian (unitary) dynamics.

arXiv:2501.09607•Quantum•Mar 16, 2026•5 citations

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•9 citations
Solving exactely the Lindblad equations, that model the evolution of open quantum systems, is only possible for small sizes. This is why we wish to have a range of methods enabling us to compute approximate solutions. We presente a deterministic low-rank method that is based upon a reduced approximate form of the density matrix, then a stochastic method of Monte-Carlo that gives the solution up to a statistical noise. We will first introduce an extension of the low-rank method, allowing us to use an adaptive rank while enforcing an upper bound on the error, and then a new variance reduction method. This new method speeds a lot the Monte-Carlo simulations by using the approximate solution given by the low-rank method as a control variate.
We present a twofold contribution to the numerical simulation of Lindblad equations. First, an adaptive numerical approach to approximate Lindblad equations using low-rank dynamics is described: a deterministic low-rank approximation of the density operator is computed, and its rank is adjusted dynamically, using an on-the-fly estimator of the error committed when reducing the dimension. On the other hand, when the intrinsic dimension of the Lindblad equation is too high to allow for such a deterministic approximation, we combine classical ensemble averages of quantum Monte Carlo trajectories and a denoising technique. Specifically, a variance reduction method based on the consideration of a low-rank dynamics as a control variate is developed. Numerical tests for quantum collapse and revivals show the efficiency of each approach, along with the complementarity of the two approaches.
Resoudre exactement l'equation de Lindblad, qui modelise l'evolution des systemes quantiques ouverts, n'est possible que pour des tailles petites. C'est pourquoi on souhaite disposer d'une gamme de methodes permettant de calculer des solutions approchees. On presentera une methode deterministe dite de rang reduit, qui repose sur une forme reduite approchee de la matrice densite, puis une methode stochastique de Monte-Carlo qui donne la solution a une erreur statistique pres. On exposera d'une part une extension de la methode de rang reduit qui permet d'utiliser un rang adaptatif en majorant l'erreur commise, et d'autre part une nouvelle methode de reduction de variance. Cette nouvelle methode permet d'accelerer considerablement les simulations de Monte-Carlo en utilisant la solution approchee fournie par la methode rang reduit comme variable de controle.
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 quadratic growth of the density matrix with Hilbert-space dimension D is the central obstacle to simulating large open quantum systems. We introduce a deterministic algorithm that eliminates it for Lindblad dynamics whose Hamiltonian consists of a time-dependent diagonal part plus terms that are tridiagonal after reordering the basis. The state is a low-rank ensemble of vectors, propagated by tridiagonal split-operator steps and ensemble rank truncation of short-time Kraus branches, so that memory and cost per step are linear in D at fixed rank. For a driven nitrogen-vacancy-cavity model, rank 16 reproduces full density-matrix observables to relative error below 10−510^{-5}10−5, the method is up to two orders of magnitude faster than QuTiP already at D≈500D \approx 500D≈500, and its runtime scales nearly linearly.
We are interested in the simulation of open quantum systems governed by the Lindblad master equation in an infinite-dimensional Hilbert space. To simulate the solution of this equation, the standard approach involves two sequential approximations: first, we truncate the Hilbert space to derive a differential equation in a finite-dimensional subspace. Then, we use discrete time-step to obtain a numerical solution to the finite-dimensional evolution. In this paper, we establish bounds for these two approximations that can be explicitly computed to guarantee the accuracy of the numerical results. Through numerical examples, we demonstrate the efficiency of our method, empirically highlighting the tightness of the upper bound. While adaptive time-stepping is already a common practice in the time discretization of the Lindblad equation, we extend this approach by showing how to dynamically adjust the truncation of the Hilbert space. This enables fully adaptive simulations of the density matrix. For large-scale simulations, this approach can significantly reduce computational time and relieves users of the challenge of selecting an appropriate truncation. Furthermore, as a special case, our method naturally applies to Hamiltonian (unitary) dynamics.
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.