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.25368

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

Roman Ovsiannikov, Kurt Jacobs, Andrii G. Sotnikov, Denys I. Bondar

quant-phSubmitted Sep 21, 2026• Announced Sep 23, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

AI Summary

The paper addresses density-matrix storage and propagation costs for Lindblad systems whose Hamiltonian is a time-dependent diagonal term plus terms made tridiagonal by basis permutations, with similarly banded collapse operators. It combines a low-rank factorization $\rho\approx\Psi\Psi^\dagger$ with split-operator propagation: coherent factors use diagonal phases and tridiagonal Cayley solves; dissipation generates short-time ensemble-rank-truncation (ERT) branches, compressed through their Gram matrix. The coherent substep is second order, but the dissipative integrator is only first-order globally before rank truncation. For Hilbert-space dimension $D$, retained rank $R$, and $K$ collapse channels, ensemble storage is $O(DR)$, temporary branch storage is $O(DKR)$, and compression costs $O[D(2KR)^2+(2KR)^3]$. Scaling is therefore linear in $D$ only at fixed $R$ and $K$. Tests use a driven collective-spin–cavity model and QuTiP references. Over $0.5$ ns, rank 16 gives a combined integrated relative observable error of approximately $6.3$–$7.0\times10^{-6}$ across $D=30$–$513$. At $D=513$, recorded times per output interval are $0.0164$ s for rank 16 versus $0.739$ s for QuTiP. Separate fixed-rank timings through $D=60{,}300$ yield scaling exponents $1.09$–$1.23$. The stated limitations are low-rank spectra, few collapse channels, exploitable band structure, and sufficiently small dissipative time steps. Fixed-rank timing does not establish efficiency at fixed accuracy. Rank, time-step, and cutoff convergence require separate checks; discarded weight alone does not certify global accuracy. A lasing stress test required ranks that removed the runtime advantage. The formulation is restricted to time-local Markovian GKSL dynamics.

Little sign of AI-generated textIncrementalStrong assumptionsMissing comparison

Error found: The abstract omits the fixed number of collapse channels and inexpensive collapse-operator actions required for the algorithm's linear-in-D cost. The abstract's below-10^-5 relative-error statement is supported only for a combined time-integrated observable metric over 0–0.5 ns, not as a per-observable or pointwise error bound.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
11 pages, 4 figures

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•9 citations

Well-conditioned iterative methods for large open quantum systems

Gaspard Beugnot, Paul Gregory, Rémi Robin +1 more

Markovian open quantum systems are well modeled by the Lindblad Master Equation (ME) $\frac{\mathrm{d}}{\mathrm{d} t} ρ_t = \mathcal{L} ρ_t$, where $\mathcal{L}$ is a linear (super-)operator and $ρ_t$ is the system state, a positive matrix. When designing or characterizing a quantum system, one is usually interested in the steady state $ρ_\infty$ (such that $\mathcal{L} ρ_\infty = 0$), the first few excited states, and trajectories $t\mapsto ρ_t$. In finite dimension, $ρ_t$ is an $n\times n$ matrix, $\mathcal{L}$ thus typically costs $n^4$ to store explicitly as a dense matrix, and $O(n^6)$ to diagonalize or invert exactly, making standard linear algebraic techniques expensive for large systems. However, $\mathcal{L}$ usually costs only $O(n^3)$ to apply. This makes iterative methods appealing, but they do not work without a good preconditioner. In this article, our main observation is that a part of the Lindblad equation, corresponding to the so-called no-jump evolution $\mathcal{S}$, can be inverted efficiently. Using this inverse map, we introduce an auxiliary completely positive trace-preserving (CPTP) map $Φ$ whose fixed point is directly related to $ρ_\infty$, all the other eigenvalues having smaller magnitude. The map $Φ$ is thus well suited to iterative methods, and $ρ_\infty$ can be found in a few Arnoldi iterations. Using the same inverse map $\mathcal{S}^{-1}$ as preconditioner, we compute the low-lying spectrum efficiently via shift-invert Arnoldi, and, as a proof of concept, build an implicit time integrator that is competitive on stiff systems in the low-precision regime. For the steady-state and low excited states problems, our methods scale like $O(n^3)$ per iteration and offer state-of-the-art performance on CPU and GPU.

quant-pharXiv:2608.30860•Sep 1, 2026•0 citations

Low-rank density-matrix evolution for noisy quantum circuits

Yi-Ting Chen, Collin Farquhar, Robert M. Parrish

Abstract In this work, we present an efficient rank-compression approach for the classical simulation of Kraus decoherence channels in noisy quantum circuits. The approximation is achieved through iterative compression of the density matrix based on its leading eigenbasis during each simulation step without the need to store, manipulate, or diagonalize the full matrix. We implement this algorithm using an in-house simulator and show that the low-rank algorithm speeds up simulations by more than two orders of magnitude over existing implementations of full-rank simulators, and with negligible error in the noise effect and final observables. Finally, we demonstrate the utility of the low-rank method as applied to representative problems of interest by using the algorithm to speed up noisy simulations of Grover’s search algorithm and quantum chemistry solvers.

arXiv:2009.06657•npj Quantum Information•Apr 20, 2021•24 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

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•2 citations

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

Roussel, Julien

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.

•Jun 30, 2015•0 citations
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.
The paper addresses density-matrix storage and propagation costs for Lindblad systems whose Hamiltonian is a time-dependent diagonal term plus terms made tridiagonal by basis permutations, with similarly banded collapse operators. It combines a low-rank factorization ρ≈ΨΨ†\rho\approx\Psi\Psi^\daggerρ≈ΨΨ† with split-operator propagation: coherent factors use diagonal phases and tridiagonal Cayley solves; dissipation generates short-time ensemble-rank-truncation (ERT) branches, compressed through their Gram matrix. The coherent substep is second order, but the dissipative integrator is only first-order globally before rank truncation.
For Hilbert-space dimension DDD, retained rank RRR, and KKK collapse channels, ensemble storage is O(DR)O(DR)O(DR), temporary branch storage is O(DKR)O(DKR)O(DKR), and compression costs O[D(2KR)2+(2KR)3]O[D(2KR)^2+(2KR)^3]O[D(2KR)2+(2KR)3]. Scaling is therefore linear in DDD only at fixed RRR and KKK. Tests use a driven collective-spin–cavity model and QuTiP references. Over 0.50.50.5 ns, rank 16 gives a combined integrated relative observable error of approximately 6.36.36.3–7.0×10−67.0\times10^{-6}7.0×10−6 across D=30D=30D=30–513513513. At D=513D=513D=513, recorded times per output interval are 0.01640.01640.0164 s for rank 16 versus 0.7390.7390.739 s for QuTiP. Separate fixed-rank timings through D=60,300D=60{,}300D=60,300 yield scaling exponents 1.091.091.09–1.231.231.23.
The stated limitations are low-rank spectra, few collapse channels, exploitable band structure, and sufficiently small dissipative time steps. Fixed-rank timing does not establish efficiency at fixed accuracy. Rank, time-step, and cutoff convergence require separate checks; discarded weight alone does not certify global accuracy. A lasing stress test required ranks that removed the runtime advantage. The formulation is restricted to time-local Markovian GKSL 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.
Markovian open quantum systems are well modeled by the Lindblad Master Equation (ME) ddtρt=Lρt\frac{\mathrm{d}}{\mathrm{d} t} ρ_t = \mathcal{L} ρ_tdtd​ρt​=Lρt​, where L\mathcal{L}L is a linear (super-)operator and ρtρ_tρt​ is the system state, a positive matrix. When designing or characterizing a quantum system, one is usually interested in the steady state ρ∞ρ_\inftyρ∞​ (such that Lρ∞=0\mathcal{L} ρ_\infty = 0Lρ∞​=0), the first few excited states, and trajectories t↦ρtt\mapsto ρ_tt↦ρt​. In finite dimension, ρtρ_tρt​ is an n×nn\times nn×n matrix, L\mathcal{L}L thus typically costs n4n^4n4 to store explicitly as a dense matrix, and O(n6)O(n^6)O(n6) to diagonalize or invert exactly, making standard linear algebraic techniques expensive for large systems. However, L\mathcal{L}L usually costs only O(n3)O(n^3)O(n3) to apply. This makes iterative methods appealing, but they do not work without a good preconditioner. In this article, our main observation is that a part of the Lindblad equation, corresponding to the so-called no-jump evolution S\mathcal{S}S, can be inverted efficiently. Using this inverse map, we introduce an auxiliary completely positive trace-preserving (CPTP) map ΦΦΦ whose fixed point is directly related to ρ∞ρ_\inftyρ∞​, all the other eigenvalues having smaller magnitude. The map ΦΦΦ is thus well suited to iterative methods, and ρ∞ρ_\inftyρ∞​ can be found in a few Arnoldi iterations. Using the same inverse map S−1\mathcal{S}^{-1}S−1 as preconditioner, we compute the low-lying spectrum efficiently via shift-invert Arnoldi, and, as a proof of concept, build an implicit time integrator that is competitive on stiff systems in the low-precision regime. For the steady-state and low excited states problems, our methods scale like O(n3)O(n^3)O(n3) per iteration and offer state-of-the-art performance on CPU and GPU.
Abstract In this work, we present an efficient rank-compression approach for the classical simulation of Kraus decoherence channels in noisy quantum circuits. The approximation is achieved through iterative compression of the density matrix based on its leading eigenbasis during each simulation step without the need to store, manipulate, or diagonalize the full matrix. We implement this algorithm using an in-house simulator and show that the low-rank algorithm speeds up simulations by more than two orders of magnitude over existing implementations of full-rank simulators, and with negligible error in the noise effect and final observables. Finally, we demonstrate the utility of the low-rank method as applied to representative problems of interest by using the algorithm to speed up noisy simulations of Grover’s search algorithm and quantum chemistry solvers.
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
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.
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.