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:2009.06657 · npj Quantum Information

Low-rank density-matrix evolution for noisy quantum circuits

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

Published Apr 20, 2021• 19 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1038/s41534-021-00392-4

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

Analog simulation of noisy quantum circuits

Etienne Granet, Kévin Hémery, Henrik Dreyer

It is well known that simulating quantum circuits with low but nonzero hardware noise is more difficult than without noise. It requires either to perform density matrix simulations (coming with a space overhead) or to sample over “quantum trajectories” where Kraus operators are inserted randomly (coming with a runtime overhead). We propose a simulation technique based on a representation of hardware noise in terms of trajectories generated by operators that remain close to identity at low noise. We give explicit expressions for noise that can be represented by Pauli channels, as well as for certain non-Pauli channels. This representation significantly reduces the variance over the quantum trajectories, speeding up noisy simulations by factors around 10 to 100. As a by-product, we provide a formula to factorize generic Pauli channels into a concatenation of channels involving only one nontrivial Pauli string.

arXiv:2410.08639•Physical Review Research•Feb 27, 2025•2 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

Real-Time Sign-Problem-Suppressed Quantum Monte Carlo Algorithm for Noisy Quantum Circuit Simulations

Tong Shen, Daniel A. Lidar

We present a real-time quantum Monte Carlo algorithm that simulates the dynamics of open quantum systems by stochastically compressing and evolving the density matrix under both Markovian and non-Markovian master equations. Our algorithm uses population dynamics to continuously suppress the sign problem, preventing its accumulation throughout the evolution for a broad class of noisy-circuit Liouvillians of practical and experimental interest. We apply it to a variety of quantum circuits and demonstrate significant speedups and scaling improvements over state-of-the-art quantum trajectory methods and convergence to exact solutions even in non-Markovian regimes where trajectory methods fail. Our approach improves the efficiency of classical simulation of gate-based quantum computing, quantum annealing, and general open system dynamics.

arXiv:2502.18929•Physical Review Letters•Apr 30, 2026•3 citations

Efficiency of classical simulations of a noisy Grover algorithm

Raphaël Menu, Johannes Schachenmayer

We analyze the modification of entanglement dynamics in the Grover algorithm when the qubits are subjected to single-qubit amplitude-damping or phase-flip noise. We compare quantum trajectories with full density-matrix simulations, analyzing the dynamics of averaged trajectory entanglement (TE) and operator entanglement (OE), in the respective state representation. Although not a genuine entanglement measure, both TE and OE are connected to the efficiency of matrix product state simulations and thus of fundamental interest. As in many quantum algorithms, at the end of the Grover circuit entanglement decreases as the system converges towards the target product state. While we find that this is well captured in the OE dynamics, quantum trajectories rarely follow paths of reducing entanglement. Optimized unraveling schemes can lower TE slightly, however we show that deep in the circuit OE is generally smaller than TE. This implies that matrix product density operator (MPDO) simulations of quantum circuits can in general be more efficient than quantum trajectories. In addition, we investigate the noise-rate scaling of success probabilities for both amplitude-damping and phase-flip noise in Grover's algorithm.

quant-pharXiv:2602.17569•Feb 20, 2026•0 citations

Stochastic Approach for Simulating Quantum Noise Using Tensor Networks

William Berquist, Danylo Lykov, Minzhao Liu +1 more

Noisy quantum simulation is challenging since one has to take into account the stochastic nature of the process. The dominating method for it is the density matrix approach. In this paper, we evaluate conditions for which this method is inferior to a substantially simpler way of simulation. Our approach uses stochastic ensembles of quantum circuits, where random Krauss operators are applied to original quantum gates to represent random errors for modeling quantum channels. We show that our stochastic simulation error is relatively low, even for large numbers of qubits. We implemented this approach as a part of the QTensor package. While usual density matrix simulations on average hardware are challenging at$n > 15$, we show that for up to$n \underset{\sim}{<} 30$, it is possible to run embarrassingly parallel simulations with$<1\%$error. By using the tensor slicing technique, we can simulate up to 100 qubit QAOA circuits with high depth using supercomputers.

arXiv:2210.15874•IEEE/ACM International Workshop on Quantum Computing Software (QCS)•Nov 1, 2022•3 citations
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.
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.
It is well known that simulating quantum circuits with low but nonzero hardware noise is more difficult than without noise. It requires either to perform density matrix simulations (coming with a space overhead) or to sample over “quantum trajectories” where Kraus operators are inserted randomly (coming with a runtime overhead). We propose a simulation technique based on a representation of hardware noise in terms of trajectories generated by operators that remain close to identity at low noise. We give explicit expressions for noise that can be represented by Pauli channels, as well as for certain non-Pauli channels. This representation significantly reduces the variance over the quantum trajectories, speeding up noisy simulations by factors around 10 to 100. As a by-product, we provide a formula to factorize generic Pauli channels into a concatenation of channels involving only one nontrivial Pauli string.
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 present a real-time quantum Monte Carlo algorithm that simulates the dynamics of open quantum systems by stochastically compressing and evolving the density matrix under both Markovian and non-Markovian master equations. Our algorithm uses population dynamics to continuously suppress the sign problem, preventing its accumulation throughout the evolution for a broad class of noisy-circuit Liouvillians of practical and experimental interest. We apply it to a variety of quantum circuits and demonstrate significant speedups and scaling improvements over state-of-the-art quantum trajectory methods and convergence to exact solutions even in non-Markovian regimes where trajectory methods fail. Our approach improves the efficiency of classical simulation of gate-based quantum computing, quantum annealing, and general open system dynamics.
We analyze the modification of entanglement dynamics in the Grover algorithm when the qubits are subjected to single-qubit amplitude-damping or phase-flip noise. We compare quantum trajectories with full density-matrix simulations, analyzing the dynamics of averaged trajectory entanglement (TE) and operator entanglement (OE), in the respective state representation. Although not a genuine entanglement measure, both TE and OE are connected to the efficiency of matrix product state simulations and thus of fundamental interest. As in many quantum algorithms, at the end of the Grover circuit entanglement decreases as the system converges towards the target product state. While we find that this is well captured in the OE dynamics, quantum trajectories rarely follow paths of reducing entanglement. Optimized unraveling schemes can lower TE slightly, however we show that deep in the circuit OE is generally smaller than TE. This implies that matrix product density operator (MPDO) simulations of quantum circuits can in general be more efficient than quantum trajectories. In addition, we investigate the noise-rate scaling of success probabilities for both amplitude-damping and phase-flip noise in Grover's algorithm.
Noisy quantum simulation is challenging since one has to take into account the stochastic nature of the process. The dominating method for it is the density matrix approach. In this paper, we evaluate conditions for which this method is inferior to a substantially simpler way of simulation. Our approach uses stochastic ensembles of quantum circuits, where random Krauss operators are applied to original quantum gates to represent random errors for modeling quantum channels. We show that our stochastic simulation error is relatively low, even for large numbers of qubits. We implemented this approach as a part of the QTensor package. While usual density matrix simulations on average hardware are challenging atn>15n > 15n>15, we show that for up ton<∼30n \underset{\sim}{<} 30n∼<​30, it is possible to run embarrassingly parallel simulations with<1%<1\%<1%error. By using the tensor slicing technique, we can simulate up to 100 qubit QAOA circuits with high depth using supercomputers.