quantum-linear-matrix-differential

name	quantum-linear-matrix-differential
description	Efficient quantum algorithm for solving linear matrix differential equations with applications to open quantum system simulation. Computes solution matrix entries with query complexity O~(νLt/ε), achieving nearly optimal scaling. Use when: quantum simulation of open systems, linear differential equation solvers, quantum dynamics simulation, dissipative quantum systems, quantum Carleman linearization.
license	Complete terms in LICENSE.txt
metadata	{"arxiv_id":"2605.16195","published":"2026-05-15","tags":["quantum-algorithms","differential-equations","open-systems","simulation"]}

Quantum Linear Matrix Differential Equation Solver

Description

A nearly optimal quantum algorithm for solving linear matrix differential equations dX/dt = A(t)X with applications to open quantum system simulation. For unitary or dissipative dynamics, computes any entry of the solution matrix with query complexity O~(νLt/ε), where ν depends on problem parameters, L involves time integrals of evolution operator norms, and ε is the target precision.

Algorithm Overview

Input/Output

• Input: Time-dependent matrix A(t), initial condition X(0), target time t, target entry (i,j), precision ε
• Output: Estimate of [X(t)]_{ij} with error bounded by ε

Complexity

• Query complexity: O~(νLt/ε) — nearly optimal in both time and precision
• Space complexity: Logarithmic in system dimension (exponential advantage over classical for large systems)
• Key parameter ν: Depends on condition number of the solution and problem structure

Core Technique

The algorithm combines:

1. Linear combination of unitaries (LCU) for implementing matrix operations
2. Quantum signal processing for time evolution
3. Variable-time amplitude estimation for efficient entry extraction

Applications

Open Quantum System Simulation

• Simulate Lindblad master equations by reformulating as linear matrix ODEs
• Track density matrix evolution with quantum advantage
• Handle both unitary and dissipative dynamics uniformly

Quantum Dynamics

• Solve time-dependent Schrödinger equation in matrix form
• Simulate quantum circuits as continuous-time evolution
• Study decoherence and noise effects

General Linear ODEs

• Any linear system dX/dt = AX can be reformulated
• Classical control systems, Markov chains, population dynamics
• Quantum advantage scales with system dimension

Usage Patterns

Open Quantum System Simulation

1. Express Lindblad equation as linear matrix ODE: dρ/dt = L(ρ)
2. Vectorize: |ρ⟩ → vec(ρ), L → superoperator matrix
3. Apply quantum algorithm with appropriate ν estimation
4. Extract relevant observables from solution

General Linear Matrix ODE

1. Identify matrix A(t) and initial condition X(0)
2. Compute or bound the parameter L (time integral of operator norms)
3. Estimate condition number for ν
4. Run quantum solver with target precision ε

Activation Keywords

• quantum linear differential equations
• quantum matrix ODE solver
• open quantum system simulation
• quantum Lindblad simulation
• quantum Carleman linearization
• quantum dynamics simulation algorithm
• dissipative quantum simulation

Pitfalls

• Condition number dependence: ν can be large for ill-conditioned systems — check conditioning before applying
• State preparation: Requires efficient preparation of initial state |X(0)⟩
• Output extraction: Only individual entries are accessible — full matrix reconstruction requires repeated runs
• Time-dependent A(t): Requires piecewise-constant or smoothly varying A(t) for efficient implementation
• NISQ limitations: Algorithm assumes fault-tolerant quantum computing