arXiv:2610.22691

Quantum-Classical Neural Networks for Solving Lindblad Master Equations

Rafael Florencio Díaz, Julio Guerrero García, Elvira Romera Gutiérrez

quant-phcs.LGSubmitted Oct 15, 2026• Announced Oct 19, 2026• 0 citations

Abstract

Variational quantum algorithms have emerged as a promising approach for simulating open quantum systems, yet their expressive power and trainability remain poorly understood. We propose a variational framework for solving Lindblad master equations by minimizing a residual cost function using a compositional ansatz obtained by combining a classical neural network with a parameterized quantum circuit. The density matrix is represented through a purification on an enlarged Hilbert space, ensuring positivity, Hermiticity, and unit trace by construction, while all gradients are evaluated exactly via the parameter-shift rule. Beyond the algorithmic formulation, we derive an upper bound for the covering number of the proposed compositional model and compare it with that of purely quantum neural networks. Our analysis shows that the classical parametrization enlarges the effective hypothesis class while providing finer control over its complexity, thereby establishing a theoretical connection between expressivity, covering numbers, effective dimension, and the barren plateau phenomenon. Numerical experiments validate both the accuracy of the proposed method for representative Lindblad master equations and the theoretical predictions regarding gradient concentration. These results provide a unified variational and theoretical framework for the simulation of dissipative quantum dynamics using compositional quantum machine learning models.

Related papers

Hybrid Quantum-Classical Training in Quantum Neural Networks: A Framework for Bridging Parameterized Quantum Circuits and Classical Optimization

Matthew Busel

Quantum Neural Networks (QNNs) represent a compelling convergence of quantum mechanics and machine learning, yet their practical deployment remains constrained by noise, limited qubit counts, and the cost of full quantum execution. Hybrid quantum-classical (HQC) training offers a pragmatic path forward: parameterized quantum circuits (PQCs) process information in exponentially large Hilbert spaces while classical optimizers update parameters via gradient methods accessible on today's hardware. We present a modular HQC training framework, formalising the parameter-shift rule for hardware-compatible gradient estimation, characterising the barren-plateau phenomenon through a variance-decay analysis, and introducing noise-aware training strategies for NISQ devices. Empirical results from state-vector and shot-based simulation confirm measurable quantum advantage on quantum-structured tasks, with the phase classification benchmark improving +12.1% over a classical MLP baseline. The accompanying open-source library provides a clean abstraction between quantum simulation and classical optimisation, serving as a foundation for near-term quantum machine learning research.

Mar 3, 20260 citations

Quantum neural network approach to Markovian dissipative dynamics of many-body open quantum systems

Cun Long, Long Cao, Liwei Ge +5 more

Numerous variational methods have been proposed for solving quantum many-body systems, but they often face exponentially increasing computational complexity as the Hilbert space dimension grows. To address this, we introduce a novel approach using quantum neural networks to simulate the dissipative dynamics of many-body open quantum systems. This method combines neural-network quantum state representation with the time-dependent variational principle, both implemented via quantum algorithms. This results in accurate open quantum dynamics described by the Lindblad quantum master equation, exemplified by the spin-boson and transverse field Ising models. Our approach avoids the computational expense of classical algorithms and demonstrates the potential advantages of quantum computing for many-body simulations. To reduce measurement errors, we introduce a projection reset procedure, which could benefit other quantum simulations. In addition, our approach can be extended to simulate non-Markovian quantum dynamics.

The Journal of Chemical PhysicsAug 22, 202413 citations

Neural-Network Approach to Dissipative Quantum Many-Body Dynamics

Michael J. Hartmann, Giuseppe Carleo

In experimentally realistic situations, quantum systems are never perfectly isolated and the coupling to their environment needs to be taken into account. Often, the effect of the environment can be well approximated by a Markovian master equation. However, solving this master equation for quantum many-body systems becomes exceedingly hard due to the high dimension of the Hilbert space. Here we present an approach to the effective simulation of the dynamics of open quantum many-body systems based on machine-learning techniques. We represent the mixed many-body quantum states with neural networks in the form of restricted Boltzmann machines and derive a variational Monte Carlo algorithm for their time evolution and stationary states. We document the accuracy of the approach with numerical examples for a dissipative spin lattice system.

arXiv:1902.05131Physical Review LettersJun 28, 2019263 citations

Neural-network variational quantum algorithm for simulating many-body dynamics

Chee‐Kong Lee, Pranay Patil, Shengyu Zhang +1 more

We propose a neural-network variational quantum algorithm to simulate the time evolution of quantum many-body systems.Based on a modified restricted Boltzmann machine (RBM) wave function ansatz, the proposed algorithm can be efficiently implemented in near-term quantum computers with low measurement cost.Using a qubit recycling strategy, only one ancilla qubit is required to represent all the hidden spins in an RBM architecture.The variational algorithm is extended to open quantum systems by employing a stochastic Schrödinger equation approach.Numerical simulations of spin-lattice models demonstrate that our algorithm is capable of capturing the dynamics of closed and open quantum many-body systems with high accuracy without suffering from the vanishing gradient (or "barren plateau") issue for the considered system sizes.

arXiv:2008.13329Physical Review ResearchMay 5, 202133 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.05908QuantumFeb 4, 20257 citations

Next-Generation Optimization in Quantum and Hybrid Neural Frameworks

Sara Ali, Polla Fattah, Sanar Fawzi

The problem of the neural network optimization is local minima and flat areas. According to quantum-inspired methods, quantum mechanics, superposition, entanglement and interference are inspirational in order to possibly surpass these constraints in a more efficient manner. Variational quantum algorithms use parameterized quantum circuits parameterized quantum circuits (ansatz) to optimize weights. Quantum kernel methods also take advantage of quantum embeddings in order to transform features better. Hybrid quantum-classical systems incorporate quantum-inspired processing with already known reliability of optimization. There are, however, serious weaknesses that limit implementation. There are exponentially decreasing gradients due to the barren plateau phenomenon that makes it hard to train at scale. The modern quantum machines have a 0.1-1% error and a microsecond coherence time. The overheads in state preparation, the cost of measurement, circuit depth, and poor qubit connectivity are still impediments. The quantum-inspired classical algorithms, which include the tensor networks and optimization heuristics and run-on standard computers, are the most effective in the near future. These come with small advances in certain areas without involving quantum hardware. Although both quantum kernel methods and variational approaches show theoretical potential, the advantages are still small (relative to the advantages of optimized classical methods). Recent evaluations show that quantum benefits are more constrained than originally claimed them to be. Real quantum applications benefits in neural network optimization may only happen 10-20 years ahead, notwithstanding failure resistant quantum hardware and algorithm developments.

CRC Press eBooksMay 20, 20260 citations