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

LREI: A fast numerical solver for quantum Landau--Lifshitz equations

Behnam Hashemi, Davoud Mirzaei, Vahid Azimi Mousolou

Published Jun 5, 2026• 0 citations
OpenAlex

Abstract

We develop LREI, short for Low-Rank Eigenmode Integration, a memory- and time-efficient numerical scheme for solving quantum Landau–Lifshitz (q-LL) and quantum Lan- dau–Lifshitz–Gilbert (q-LLG) equations, which govern spin dynamics in open quantum systems. Although the system size grows exponentially with the number of spins, our approach benefits from the low-rank structure of the density matrix and the sparsity of system Hamiltonians to avoid costly full matrix computations. By representing density matrices in terms of their low-rank factors and using Krylov subspace techniques for partial eigendecompositions, we reduce the per-step complexity of Runge–Kutta and Adams–Bashforth schemes from O(N 3) to O(r2N ), where N = 2n is the Hilbert space dimension for n spins and r ? N is the effective rank of the density matrix. Likewise, the memory footprint is reduced from O(N 2) to O(rN ), since no full N × N matrices are ever formed. Among several technical improvements we applied, one key idea was to handle the computation of the action of the invariant subspace of the density matrix associated with its zero eigenvalues. This was accomplished by applying Householder reflectors constructed for the dominant eigenspace, thereby enabling the entire solution process to proceed without ever forming any large matrices. As an example, we can now evolve a time step of a twenty-spin system—corresponding to a density matrix size exceeding one million—in just a few seconds on a standard laptop. In addition, both classes of Runge-Kutta and Adams-Bashforth techniques are reformulated to preserve the physical properties of the density matrix throughout the time evolution. The new low-rank algorithm makes it possible to simulate much larger spin systems that were previously computationally infeasible. This, in turn, provides a powerful tool for comparing the q-LL and q-LLG dynamics, assessing the validity of each model, and exploring how quantum features such as correlations and entanglement evolve across different regimes of system size and damping.

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

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

Analytic gradients for low-rank quantum optimal control

Leo Goutte, Vincenzo Savona

We introduce low-rank optimal control (LROC), a method for designing control pulses in open quantum systems whose full density-matrix simulation is prohibitively expensive. The method exploits a feature of quantum computing itself: because protocols are designed to preserve purity, the density matrix is dominated by a few pure states and admits an accurate low-rank factorization. LROC propagates only this factorized form and, by deriving the corresponding adjoint equation, obtains the gradient of any differentiable objective at the same reduced cost as the simulation, leading to a quadratic improvement in time and memory compared to the full master equation. We illustrate the breadth of the method on four superconducting-circuit tasks: preparation of a five-qubit GHZ state, a CNOT gate, qubit readout, and an error correction primitive, modeled with realistic multilevel transmons, decay, and strong drives, in each case reaching fidelities consistent with the intrinsic dissipation limits. LROC thereby extends pulse-level optimization to system sizes beyond the reach of existing gradient-based methods.

quant-pharXiv:2607.14217•Jul 17, 2026•0 citations

Low rank compression in the numerical solution of the nonequilibrium Dyson equation

Jason Kaye, Denis Golež

We propose a method to improve the computational and memory efficiency of numerical solvers for the nonequilibrium Dyson equation in the Keldysh formalism. It is based on the empirical observation that the nonequilibrium Green's functions and self energies arising in many problems of physical interest, discretized as matrices, have low rank off-diagonal blocks, and can therefore be compressed using a hierarchical low rank data structure. We describe an efficient algorithm to build this compressed representation on the fly during the course of time stepping, and use the representation to reduce the cost of computing history integrals, which is the main computational bottleneck. For systems with the hierarchical low rank property, our method reduces the computational complexity of solving the nonequilibrium Dyson equation from cubic to near quadratic, and the memory complexity from quadratic to near linear. We demonstrate the full solver for the Falicov-Kimball model exposed to a rapid ramp and Floquet driving of system parameters, and are able to increase feasible propagation times substantially. We present examples with 262 144 time steps, which would require approximately five months of computing time and 2.2 TB of memory using the direct time stepping method, but can be completed in just over a day on a laptop with less than 4 GB of memory using our method. We also confirm the hierarchical low rank property for the driven Hubbard model in the weak coupling regime within the GW approximation, and in the strong coupling regime within dynamical mean-field theory.

arXiv:2010.06511•SciPost Physics•Apr 26, 2021•56 citations

Full- and Low-Rank Exponential Euler Integrators for the Lindblad Equation

Hao Chen, Alfio Borzı̀, Denis Janković +2 more

Abstract. The Lindblad equation is a widely used quantum master equation to model the dynamical evolution of open quantum systems whose states are described by density matrices. These solution matrices are characterized by semipositiveness and trace preserving properties, which must be guaranteed in any physically meaningful numerical simulation. In this paper, novel full- and low-rank exponential Euler integrators are developed for approximating the Lindblad equation that preserve positivity and trace unconditionally. Theoretical results are presented that provide sharp error estimates for the two classes of exponential integration methods. Results of numerical experiments are discussed that illustrate the effectiveness of the proposed schemes, beyond present state-of-the-art capabilities.

arXiv:2408.13601•SIAM Journal on Scientific Computing•Jan 2, 2026•1 citation

Gregory Nested Picard Iteration Schemes for Open Quantum Systems Governed by the Lindblad Equation

Jiuhua Hu, Daniel Appelo, Yingda Cheng

Numerical simulation of quantum computing hardware and open quantum systems governed by the Lindblad equation is challenging due to the high dimensionality of the density matrix and the need to preserve fundamental physical properties. In our previous work, we developed an arbitrary-order, low-rank, completely positive and trace preserving (CPTP) method for the Lindblad equation with time-dependent Hamiltonians by nested Picard iteration (NPI). In this work, we develop Gregory NPI schemes, which are CPTP schemes constructed by Gregory-type quadrature on equispaced nodes. The methods, which are of order up to nine, substantially reduce the computational cost compared to our previously proposed NPI schemes with Gaussian quadrature rules, while retaining high-order accuracy and structure preservation. We analyze the stability of the resulting scheme for a physics-based test equation. Numerical experiments verify the convergence of the method and demonstrate the effectiveness of the low-rank approximation. We study the performance of a previously constructed CNOT gate for both closed and open quantum systems.

math.NACross-listedarXiv:2606.29002•Jun 30, 2026•0 citations
We develop LREI, short for Low-Rank Eigenmode Integration, a memory- and time-efficient numerical scheme for solving quantum Landau–Lifshitz (q-LL) and quantum Lan- dau–Lifshitz–Gilbert (q-LLG) equations, which govern spin dynamics in open quantum systems. Although the system size grows exponentially with the number of spins, our approach benefits from the low-rank structure of the density matrix and the sparsity of system Hamiltonians to avoid costly full matrix computations. By representing density matrices in terms of their low-rank factors and using Krylov subspace techniques for partial eigendecompositions, we reduce the per-step complexity of Runge–Kutta and Adams–Bashforth schemes from O(N 3) to O(r2N ), where N = 2n is the Hilbert space dimension for n spins and r ? N is the effective rank of the density matrix. Likewise, the memory footprint is reduced from O(N 2) to O(rN ), since no full N × N matrices are ever formed. Among several technical improvements we applied, one key idea was to handle the computation of the action of the invariant subspace of the density matrix associated with its zero eigenvalues. This was accomplished by applying Householder reflectors constructed for the dominant eigenspace, thereby enabling the entire solution process to proceed without ever forming any large matrices. As an example, we can now evolve a time step of a twenty-spin system—corresponding to a density matrix size exceeding one million—in just a few seconds on a standard laptop. In addition, both classes of Runge-Kutta and Adams-Bashforth techniques are reformulated to preserve the physical properties of the density matrix throughout the time evolution. The new low-rank algorithm makes it possible to simulate much larger spin systems that were previously computationally infeasible. This, in turn, provides a powerful tool for comparing the q-LL and q-LLG dynamics, assessing the validity of each model, and exploring how quantum features such as correlations and entanglement evolve across different regimes of system size and damping.
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.
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 introduce low-rank optimal control (LROC), a method for designing control pulses in open quantum systems whose full density-matrix simulation is prohibitively expensive. The method exploits a feature of quantum computing itself: because protocols are designed to preserve purity, the density matrix is dominated by a few pure states and admits an accurate low-rank factorization. LROC propagates only this factorized form and, by deriving the corresponding adjoint equation, obtains the gradient of any differentiable objective at the same reduced cost as the simulation, leading to a quadratic improvement in time and memory compared to the full master equation. We illustrate the breadth of the method on four superconducting-circuit tasks: preparation of a five-qubit GHZ state, a CNOT gate, qubit readout, and an error correction primitive, modeled with realistic multilevel transmons, decay, and strong drives, in each case reaching fidelities consistent with the intrinsic dissipation limits. LROC thereby extends pulse-level optimization to system sizes beyond the reach of existing gradient-based methods.
We propose a method to improve the computational and memory efficiency of numerical solvers for the nonequilibrium Dyson equation in the Keldysh formalism. It is based on the empirical observation that the nonequilibrium Green's functions and self energies arising in many problems of physical interest, discretized as matrices, have low rank off-diagonal blocks, and can therefore be compressed using a hierarchical low rank data structure. We describe an efficient algorithm to build this compressed representation on the fly during the course of time stepping, and use the representation to reduce the cost of computing history integrals, which is the main computational bottleneck. For systems with the hierarchical low rank property, our method reduces the computational complexity of solving the nonequilibrium Dyson equation from cubic to near quadratic, and the memory complexity from quadratic to near linear. We demonstrate the full solver for the Falicov-Kimball model exposed to a rapid ramp and Floquet driving of system parameters, and are able to increase feasible propagation times substantially. We present examples with 262 144 time steps, which would require approximately five months of computing time and 2.2 TB of memory using the direct time stepping method, but can be completed in just over a day on a laptop with less than 4 GB of memory using our method. We also confirm the hierarchical low rank property for the driven Hubbard model in the weak coupling regime within the GW approximation, and in the strong coupling regime within dynamical mean-field theory.
Abstract. The Lindblad equation is a widely used quantum master equation to model the dynamical evolution of open quantum systems whose states are described by density matrices. These solution matrices are characterized by semipositiveness and trace preserving properties, which must be guaranteed in any physically meaningful numerical simulation. In this paper, novel full- and low-rank exponential Euler integrators are developed for approximating the Lindblad equation that preserve positivity and trace unconditionally. Theoretical results are presented that provide sharp error estimates for the two classes of exponential integration methods. Results of numerical experiments are discussed that illustrate the effectiveness of the proposed schemes, beyond present state-of-the-art capabilities.
Numerical simulation of quantum computing hardware and open quantum systems governed by the Lindblad equation is challenging due to the high dimensionality of the density matrix and the need to preserve fundamental physical properties. In our previous work, we developed an arbitrary-order, low-rank, completely positive and trace preserving (CPTP) method for the Lindblad equation with time-dependent Hamiltonians by nested Picard iteration (NPI). In this work, we develop Gregory NPI schemes, which are CPTP schemes constructed by Gregory-type quadrature on equispaced nodes. The methods, which are of order up to nine, substantially reduce the computational cost compared to our previously proposed NPI schemes with Gaussian quadrature rules, while retaining high-order accuracy and structure preservation. We analyze the stability of the resulting scheme for a physics-based test equation. Numerical experiments verify the convergence of the method and demonstrate the effectiveness of the low-rank approximation. We study the performance of a previously constructed CNOT gate for both closed and open quantum systems.