Wave Matrix Lindbladization (WML)

• Wave Matrix Lindbladization (WML) is a method that encodes Lindblad operators into quantum program states to simulate dissipative quantum dynamics.
• It approximates Lindblad semigroup evolution via repeated short-time interactions, achieving first-order accuracy with error scaling as O(t²/ε).
• Extensions to general Lindbladians yield explicit sample complexity bounds and reveal a typical-versus-adversarial dichotomy based on the spectral profile of the operator.

Wave Matrix Lindbladization (WML) is a sample-based framework for simulating Markovian open-system quantum dynamics when the dissipative generator is supplied not as a classical description but as quantum program states encoding Lindblad operators. In its canonical formulation, introduced in 2023, WML is the open-system analogue of Density Matrix Exponentiation: instead of using copies of a state to simulate Hamiltonian evolution, it uses copies of a state encoding a Lindblad operator $L$ to approximate the Lindblad semigroup $e^{\mathcal{L}t}$, with the basic single-operator construction achieving worst-case normalized diamond-distance error $O(\varepsilon)$ using $n=O(t^2/\varepsilon)$ program copies (Patel et al., 2023). Subsequent work extended the framework to general Lindbladians, linear combinations, and polynomially generated dissipators (Patel et al., 2023), while a 2026 analysis derived an explicit non-asymptotic sample-complexity bound and established a typical-versus-adversarial dichotomy controlled by $\|L\|_\infty^2$ (Park et al., 28 May 2026).

1. Conceptual definition and input model

WML is defined around the Lindblad master equation

$$\frac{\partial \rho}{\partial t} = \mathcal{L}(\rho) = -i[H,\rho] + \sum_{k=1}^{K}\left(L_k \rho L_k^\dagger - \frac{1}{2}\{L_k^\dagger L_k,\rho\}\right),$$

with an initial emphasis on the single-Lindblad-operator, no-Hamiltonian case

$$\mathcal{L}(\rho)=L\rho L^\dagger-\frac12\{L^\dagger L,\rho\}.$$

The distinctive feature of WML is its input model: the operator $L$ is encoded into a pure program state rather than supplied explicitly as a matrix or black-box oracle (Patel et al., 2023).

The encoding is Choi-like: $$|\psi\rangle \coloneqq (L\otimes I)|\Gamma\rangle, \qquad |\Gamma\rangle \coloneqq \sum_j |j\rangle |j\rangle,$$ with the normalization condition

$$\|L\|_2 \coloneqq \sqrt{\operatorname{Tr}[L^\dagger L]} = 1$$

ensuring that $e^{\mathcal{L}t}$0 is a normalized quantum state. Equivalently, the program state is $e^{\mathcal{L}t}$1 (Patel et al., 2023). If the target operator is $e^{\mathcal{L}t}$2 rather than a Hilbert–Schmidt-normalized $e^{\mathcal{L}t}$3, the construction encodes $e^{\mathcal{L}t}$4 and rescales the simulated time according to the quadratic scaling of the dissipator in $e^{\mathcal{L}t}$5 (Patel et al., 2023).

The formal task is channel simulation. Given an unknown input state $e^{\mathcal{L}t}$6 and $e^{\mathcal{L}t}$7 copies of the program state, one seeks an algorithm $e^{\mathcal{L}t}$8 such that

$e^{\mathcal{L}t}$9

where the diamond norm is taken in the worst case over inputs possibly entangled with a reference system (Patel et al., 2023). This places WML in the category of worst-case channel approximation rather than average-case or state-specific propagation.

2. Core construction and first-order simulation mechanism

The basic WML protocol proceeds by repeated short-time interactions between the system and fresh copies of the program state. For a single short step of duration $O(\varepsilon)$0, one evolves the joint state under an auxiliary Lindbladian $O(\varepsilon)$1, then traces out the program registers. In the single-operator construction, the auxiliary generator is

$O(\varepsilon)$2

with a fixed jump operator $O(\varepsilon)$3 built from a SWAP and a projection onto a maximally entangled state (Patel et al., 2023).

The key lemma is the collapse of the auxiliary dissipator to the desired system dissipator after tracing out the program registers. In the notation of the construction,

$O(\varepsilon)$4

$O(\varepsilon)$5

$O(\varepsilon)$6

These identities reproduce exactly the three terms of the Lindblad dissipator (Patel et al., 2023).

The one-step approximation is therefore first-order accurate: $O(\varepsilon)$7 Repeating the step $O(\varepsilon)$8 times yields a total error of order $O(\varepsilon)$9, which leads to the asymptotic sample-complexity statement

$n=O(t^2/\varepsilon)$0

for worst-case normalized diamond-distance error $n=O(t^2/\varepsilon)$1 (Patel et al., 2023).

The same paper extends the construction to

$n=O(t^2/\varepsilon)$2

by encoding $n=O(t^2/\varepsilon)$3 as a density operator $n=O(t^2/\varepsilon)$4, taking the combined program state $n=O(t^2/\varepsilon)$5, and adding a Hamiltonian SWAP term to the auxiliary evolution. The asymptotic sample complexity remains $n=O(t^2/\varepsilon)$6 in that extension (Patel et al., 2023).

3. Extensions to general Lindbladians, linear combinations, and polynomials

The second WML paper generalized the prequel from a single jump operator to several broader input classes (Patel et al., 2023). The target dynamics remains

$n=O(t^2/\varepsilon)$7

but the program resources can now be mixed, sampled, or coherently combined.

For general Lindbladians, the paper presents two strategies. The sampling-based approach builds a mixed program state

$n=O(t^2/\varepsilon)$8

with

$n=O(t^2/\varepsilon)$9

and

$\|L\|_\infty^2$0

Conditioned on the label register, the algorithm applies either a SWAP-generated unitary or the dissipative WML channel, and then traces out the program registers. Its first-order expansion is

$\|L\|_\infty^2$1

which yields a sample complexity

$\|L\|_\infty^2$2

copies of $\|L\|_\infty^2$3 (Patel et al., 2023).

The Trotter-like alternative decomposes $\|L\|_\infty^2$4 into single-term generators and applies them sequentially in short steps. With

$\|L\|_\infty^2$5

the paper states a complexity of

$\|L\|_\infty^2$6

copies of each program state, and total program-state use

$\|L\|_\infty^2$7

It also notes that

$\|L\|_\infty^2$8

so the sampling-based algorithm is never worse in sample complexity than the Trotter-like one (Patel et al., 2023).

The same paper further treats the case in which a single Lindblad operator is a linear combination

$\|L\|_\infty^2$9

Using LCU plus amplitude amplification, it prepares

$$\frac{\partial \rho}{\partial t} = \mathcal{L}(\rho) = -i[H,\rho] + \sum_{k=1}^{K}\left(L_k \rho L_k^\dagger - \frac{1}{2}\{L_k^\dagger L_k,\rho\}\right),$$0

and then applies the original WML mechanism to $$\frac{\partial \rho}{\partial t} = \mathcal{L}(\rho) = -i[H,\rho] + \sum_{k=1}^{K}\left(L_k \rho L_k^\dagger - \frac{1}{2}\{L_k^\dagger L_k,\rho\}\right),$$1, obtaining

$$\frac{\partial \rho}{\partial t} = \mathcal{L}(\rho) = -i[H,\rho] + \sum_{k=1}^{K}\left(L_k \rho L_k^\dagger - \frac{1}{2}\{L_k^\dagger L_k,\rho\}\right),$$2

copies of $$\frac{\partial \rho}{\partial t} = \mathcal{L}(\rho) = -i[H,\rho] + \sum_{k=1}^{K}\left(L_k \rho L_k^\dagger - \frac{1}{2}\{L_k^\dagger L_k,\rho\}\right),$$3 (Patel et al., 2023).

Finally, the polynomial extension allows

$$\frac{\partial \rho}{\partial t} = \mathcal{L}(\rho) = -i[H,\rho] + \sum_{k=1}^{K}\left(L_k \rho L_k^\dagger - \frac{1}{2}\{L_k^\dagger L_k,\rho\}\right),$$4

with monomials

$$\frac{\partial \rho}{\partial t} = \mathcal{L}(\rho) = -i[H,\rho] + \sum_{k=1}^{K}\left(L_k \rho L_k^\dagger - \frac{1}{2}\{L_k^\dagger L_k,\rho\}\right),$$5

maximum degree

$$\frac{\partial \rho}{\partial t} = \mathcal{L}(\rho) = -i[H,\rho] + \sum_{k=1}^{K}\left(L_k \rho L_k^\dagger - \frac{1}{2}\{L_k^\dagger L_k,\rho\}\right),$$6

and a cyclic-swap variant of the fixed auxiliary jump operator. The same asymptotic sample complexity,

$$\frac{\partial \rho}{\partial t} = \mathcal{L}(\rho) = -i[H,\rho] + \sum_{k=1}^{K}\left(L_k \rho L_k^\dagger - \frac{1}{2}\{L_k^\dagger L_k,\rho\}\right),$$7

is obtained after preparing the corresponding combined program state by LCU and amplitude amplification (Patel et al., 2023).

WML variant	Program resource	Sample complexity
Basic single-operator WML	copies of $$\frac{\partial \rho}{\partial t} = \mathcal{L}(\rho) = -i[H,\rho] + \sum_{k=1}^{K}\left(L_k \rho L_k^\dagger - \frac{1}{2}\{L_k^\dagger L_k,\rho\}\right),$$8	$$\frac{\partial \rho}{\partial t} = \mathcal{L}(\rho) = -i[H,\rho] + \sum_{k=1}^{K}\left(L_k \rho L_k^\dagger - \frac{1}{2}\{L_k^\dagger L_k,\rho\}\right),$$9
General Lindbladians, sampling-based	copies of mixed $$\mathcal{L}(\rho)=L\rho L^\dagger-\frac12\{L^\dagger L,\rho\}.$$0	$$\mathcal{L}(\rho)=L\rho L^\dagger-\frac12\{L^\dagger L,\rho\}.$$1
General Lindbladians, Trotter-like	copies of each program state	$$\mathcal{L}(\rho)=L\rho L^\dagger-\frac12\{L^\dagger L,\rho\}.$$2 per program state
Linear-combination Lindblad operator	copies of $$\mathcal{L}(\rho)=L\rho L^\dagger-\frac12\{L^\dagger L,\rho\}.$$3	$$\mathcal{L}(\rho)=L\rho L^\dagger-\frac12\{L^\dagger L,\rho\}.$$4
Polynomial Lindblad operator	copies of polynomial $$\mathcal{L}(\rho)=L\rho L^\dagger-\frac12\{L^\dagger L,\rho\}.$$5	$$\mathcal{L}(\rho)=L\rho L^\dagger-\frac12\{L^\dagger L,\rho\}.$$6

These extensions establish that WML is not restricted to a single dissipator supplied in isolation. It supports mixed Hamiltonian–dissipative input, operator synthesis by LCU, and higher-order operator constructions, while preserving the same first-order repeated-interaction logic (Patel et al., 2023).

4. Sample complexity, explicit bounds, and the typical-versus-adversarial dichotomy

The original WML paper framed its guarantee asymptotically: there exists an algorithm $$\mathcal{L}(\rho)=L\rho L^\dagger-\frac12\{L^\dagger L,\rho\}.$$7 such that

$$\mathcal{L}(\rho)=L\rho L^\dagger-\frac12\{L^\dagger L,\rho\}.$$8

using

$$\mathcal{L}(\rho)=L\rho L^\dagger-\frac12\{L^\dagger L,\rho\}.$$9

copies of the program state in the single-operator setting (Patel et al., 2023). The second paper retained that quadratic-in-$L$0, inverse-in-$L$1 structure, with additional weight factors for more general input models (Patel et al., 2023).

A 2026 analysis sharpened the single-jump setting by deriving an explicit non-asymptotic upper bound for the WML algorithm. For

$L$2

and a $L$3-dimensional jump operator $L$4, the paper proves that for $L$5, $L$6, and $L$7,

$L$8

and therefore

$L$9

This refines the best previously known bound $$|\psi\rangle \coloneqq (L\otimes I)|\Gamma\rangle, \qquad |\Gamma\rangle \coloneqq \sum_j |j\rangle |j\rangle,$$0 to a dependence linear in $$|\psi\rangle \coloneqq (L\otimes I)|\Gamma\rangle, \qquad |\Gamma\rangle \coloneqq \sum_j |j\rangle |j\rangle,$$1 (Park et al., 28 May 2026).

The same paper emphasizes that the factor $$|\psi\rangle \coloneqq (L\otimes I)|\Gamma\rangle, \qquad |\Gamma\rangle \coloneqq \sum_j |j\rangle |j\rangle,$$2 governs a sharp dichotomy. When

$$|\psi\rangle \coloneqq (L\otimes I)|\Gamma\rangle, \qquad |\Gamma\rangle \coloneqq \sum_j |j\rangle |j\rangle,$$3

the explicit dimension factor cancels and one obtains typical-case sample complexity

$$|\psi\rangle \coloneqq (L\otimes I)|\Gamma\rangle, \qquad |\Gamma\rangle \coloneqq \sum_j |j\rangle |j\rangle,$$4

For Frobenius-normalized Ginibre operators $$|\psi\rangle \coloneqq (L\otimes I)|\Gamma\rangle, \qquad |\Gamma\rangle \coloneqq \sum_j |j\rangle |j\rangle,$$5, the paper shows that with probability at least $$|\psi\rangle \coloneqq (L\otimes I)|\Gamma\rangle, \qquad |\Gamma\rangle \coloneqq \sum_j |j\rangle |j\rangle,$$6,

$$|\psi\rangle \coloneqq (L\otimes I)|\Gamma\rangle, \qquad |\Gamma\rangle \coloneqq \sum_j |j\rangle |j\rangle,$$7

and hence

$$|\psi\rangle \coloneqq (L\otimes I)|\Gamma\rangle, \qquad |\Gamma\rangle \coloneqq \sum_j |j\rangle |j\rangle,$$8

so asymptotically

$$|\psi\rangle \coloneqq (L\otimes I)|\Gamma\rangle, \qquad |\Gamma\rangle \coloneqq \sum_j |j\rangle |j\rangle,$$9

By contrast, the paper proves that in the worst case WML necessarily requires $$\|L\|_2 \coloneqq \sqrt{\operatorname{Tr}[L^\dagger L]} = 1$$0 samples, using an explicit rank-one Lindblad operator as an adversarial example (Park et al., 28 May 2026).

This result alters the interpretation of WML’s “dimension independence.” The 2023 papers state dimension-independent asymptotic sample-complexity formulas in their principal settings (Patel et al., 2023, Patel et al., 2023). The 2026 refinement shows that, in the single-jump model, explicit dependence on $$\|L\|_2 \coloneqq \sqrt{\operatorname{Tr}[L^\dagger L]} = 1$$1 reappears through $$\|L\|_2 \coloneqq \sqrt{\operatorname{Tr}[L^\dagger L]} = 1$$2: dimension independence is typical for random or spectrally delocalized operators, but not uniform over all Lindblad operators (Park et al., 28 May 2026). A plausible implication is that WML’s practical behavior depends strongly on the spectral profile of the encoded dissipator, not merely on Hilbert-space size.

5. Relation to Liouville-space vectorization and phase-space continuity

The term “Wave Matrix Lindbladization” is most precisely associated with the sample-based program-state simulation framework of the 2023–2026 papers (Patel et al., 2023, Patel et al., 2023, Park et al., 28 May 2026). Two other strands of literature are nevertheless closely related in spirit and are often useful for situating WML conceptually.

The first is matrix-vector representation of Lindblad dynamics. A 2015 review presents three approaches for representing the Lindblad or L-GKS equation in matrix-vector notation, with the most direct one “vec-ing the density matrix” into a vector $$\|L\|_2 \coloneqq \sqrt{\operatorname{Tr}[L^\dagger L]} = 1$$3 obeying

$$\|L\|_2 \coloneqq \sqrt{\operatorname{Tr}[L^\dagger L]} = 1$$4

Its algebraic core is the set of identities

$$\|L\|_2 \coloneqq \sqrt{\operatorname{Tr}[L^\dagger L]} = 1$$5

leading to an explicit $$\|L\|_2 \coloneqq \sqrt{\operatorname{Tr}[L^\dagger L]} = 1$$6 Liouvillian matrix (Am-Shallem et al., 2015). That paper does not use the term WML, but it identifies the conceptual triad

• density matrix $$\|L\|_2 \coloneqq \sqrt{\operatorname{Tr}[L^\dagger L]} = 1$$7 vector,
• Lindblad superoperator $$\|L\|_2 \coloneqq \sqrt{\operatorname{Tr}[L^\dagger L]} = 1$$8 matrix,
• operator equation $$\|L\|_2 \coloneqq \sqrt{\operatorname{Tr}[L^\dagger L]} = 1$$9 linear ODE, which is strongly aligned with one possible reading of “wave-matrix” reformulation.

The second is a phase-space route to Lindblad structure. A 2023 paper on Wigner phase-space dynamics argues that insisting the Wigner function satisfy a continuity equation,

$e^{\mathcal{L}t}$00

forces photon-addition and photon-removal processes into specific gain-loss-plus-diffusion combinations that coincide with the standard Lindblad form for a bosonic mode (Steuernagel et al., 2023). The key claim is not a new proof of complete positivity, but that the continuity requirement in Wigner space reproduces a generator already known to be Lindbladian. That paper does not explicitly frame itself as WML, yet it is described as being “very much in the same spirit”: the Lindblad structure is derived from a phase-space representation and a structural constraint on the evolution, rather than from the usual operator-based complete-positivity axioms (Steuernagel et al., 2023).

These related frameworks should not be conflated. Vec-based Liouville-space notation is an exact matrix representation of a known Lindbladian (Am-Shallem et al., 2015). The Wigner-continuity approach is a phase-space derivation of Lindblad form from current continuity (Steuernagel et al., 2023). Canonical WML, by contrast, is a sample-based algorithmic method in which the dissipator is encoded into quantum program states and simulated through repeated auxiliary open-system interactions (Patel et al., 2023).

6. Scope, limitations, and interpretive significance

WML was introduced as a sample-complexity theory for open-system simulation, not as a complete gate-complexity solution. The original paper explicitly notes that efficient physical implementation of the short-time auxiliary Lindbladian step remains open; its main theorems concern the number of program-state copies needed for worst-case channel simulation, not the total time or gate count of a fault-tolerant realization (Patel et al., 2023). This is a central limitation of the framework in its original form.

A second limitation concerns generality. The prequel works out the single-operator case in detail and notes that extensions to broader classes follow by additional constructions (Patel et al., 2023). The sequel provides those constructions for general Lindbladians, linear combinations, and polynomials (Patel et al., 2023), but the complexity statements remain sample-complexity statements tied to the encoded-input model. WML is therefore best understood as a theory of simulation from quantum data rather than a generic replacement for classical-description Lindblad simulation.

A third issue is the relation to tomography. The 2023 sequel argues that WML provides an efficient route for simulation relative to full tomography of encoded operators, because tomography of the $e^{\mathcal{L}t}$01-dimensional program state has dimension-dependent copy complexity, while WML’s principal sample-complexity bounds do not scale with $e^{\mathcal{L}t}$02 in the same way (Patel et al., 2023). The 2026 refinement strengthens this comparison by showing that WML can have typical-case sample complexity $e^{\mathcal{L}t}$03 even when tomography of the underlying program state remains polynomially dimension dependent (Park et al., 28 May 2026). This suggests that, in the encoded-operator model, simulation may be fundamentally cheaper than learning.

A recurrent misconception is to identify WML with any one of three broader ideas: vectorization of master equations, phase-space derivations of Lindblad form, or abstract “wave-to-matrix” reformulations. Those are related but distinct. The canonical usage of WML refers to the program-state, repeated-interaction protocol initiated in 2023 (Patel et al., 2023). The vec-ing literature supplies a numerical linear-algebra representation of Lindblad evolution (Am-Shallem et al., 2015). The Wigner-space literature supplies a structural derivation of Lindblad dissipators from continuity requirements (Steuernagel et al., 2023). The overlap is methodological rather than terminological.

In that sense, WML occupies a specific position at the intersection of sample-based quantum algorithms, Choi-state operator encoding, and open-system simulation. Its central idea is that a state of the form

$e^{\mathcal{L}t}$04

can function as a reusable program resource whose repeated, local use induces the target dissipative generator on another system (Patel et al., 2023). Subsequent refinements show that this mechanism is robust enough to cover general Lindbladians and operator synthesis, while also exhibiting a sharply characterized separation between typical and adversarial sample complexity (Patel et al., 2023, Park et al., 28 May 2026).