Characterizing Arbitrary Lindbladian Dynamics with a Few Pauli Measurements

AI summary

Overview

Research area: Quantum characterization and learning of open quantum systems — specifically, reconstructing the generator (Lindbladian) of Markovian noise and coherent dynamics from limited, experimentally friendly measurements.

Technical level: Advanced. The paper is a theory work relying on Pauli/symplectic notation, polynomial approximation via Legendre kernels, positivity (no-jump) arguments, and supplementary proofs; the conceptual message is accessible, but the machinery is not.

Scope in one sentence: The paper presents and analyzes a control-free protocol that reconstructs every Hamiltonian and dissipative coefficient of an arbitrary sparse Lindbladian from product Pauli state preparation, single forward evolutions, and product Pauli measurements, with provable sample and evolution-time costs.

What This Paper Is About

Quantum devices are open systems: their dynamics mix intended coherent evolution with unwanted dissipation, and separating the two is necessary for benchmarking, error mitigation, and error correction. Existing characterization methods either assume a known noise or interaction structure, require resources near-term hardware does not have (ancillas, entangled probes, mid-circuit control, inverse evolutions), or only recover the Pauli-diagonal part of the noise. This paper gives a protocol that recovers an arbitrary sparse Lindbladian — all Hamiltonian coefficients and all Kossakowski-matrix entries, with supports learned from data rather than assumed — using only the preparation, evolution, and readout primitives a near-term device natively offers.

Key Contributions

1. An ansatz-free, control-free Lindbladian reconstruction protocol (Algorithm 1). It uses product Pauli state preparation, one uninterrupted forward evolution under e^{tℒ}, and product Pauli measurements, with no ancillas, no inverse evolutions, no mid-circuit operations, and no locality assumptions on the supports.

2. Unconditional sample and time complexity guarantees. Given a sparsity budget M₀, strength bound Γ ≥ Γ*, and target precision ε, every coefficient is learned to precision ε with probability at least 1 − δ using Õ(Γ²M₀²/ε⁴) experimental shots and Õ(ΓM₀²/ε²) total evolution time (Theorem 1, informal; Theorem 4 in the Supplementary Materials). At the sound scale Γ = 2M₀ the evolution time reads Õ(M₀³/ε²).

3. Three new technical devices for handling open-system obstructions. The authors identify three places where the closed-system toolkit breaks (loss of band-limited/trigonometric signal structure, dissipation damping coherent signatures, Hamiltonian and dissipative terms colliding on shared Pauli labels) and resolve them with a one-sided polynomial differentiation scheme using a signed Legendre kernel at a logarithmic number of strictly positive times, a positivity (no-jump) domination argument, and an exact phase-orthogonality identity separating the two contributions label by label.

4. Practicality guarantees. The protocol queries only O(log(Γ/ε)) distinct evolution times, all strictly positive and of order Γ⁻¹ up to logarithmic factors (reducible to R + 1 Chebyshev–Lobatto times), works when times are snapped onto a hardware clock lattice of spacing Δt = Õ(ε²/(M₀Γ²)), and is provably robust to calibrated Pauli-diagonal state-preparation and measurement errors, which merely rescale responses by known factors.

Main Findings

• Optimal precision scaling in ε and Γ. The ε and Γ dependence saturates the control-free lower bound established for the Hamiltonian special case, with per-coefficient evolution time matching that bound; the ε⁻² scaling of the dissipative sector is argued to be unavoidable even for adaptive protocols equipped with ancillas.

• Sparsity overhead is quadratic in the budget. Total evolution time scales as Õ(ΓM₀²/ε²); the M₀² factor comes from estimating each of the |Σ_C| ≤ 16M₀² fixed-sum blocks with its own data set. The number of shots is dominated by Stage 1 (dissipation structure), and the evolution time by Stage 3 (coefficient estimation).

• Supports are learned, and the zero output is certified. Stage 1 identifies the heavy dissipative rows using three global bases Xⁿ, Yⁿ, Zⁿ, returning a set C with |C| ≤ 4M₀ that contains every heavy row. Stage 2 identifies Hamiltonian labels outside the collision set Δ_C; anything output as zero is provably at most ε in magnitude, for dissipative entries by positive semidefiniteness (|A_uv|² ≤ A_u,u A_v,v) and for Hamiltonian labels by the Stage-2 covering guarantee.

• Per-derivative cost. Each derivative estimate costs Õ(Γ²/ε²) shots and Õ(Γ/ε²) evolution time, with bias O(ΓR³2^{−R}) and range O(ΓR³) for polynomial degree R = ⌈C₀ log(e + Γ/ε)⌉.

• Numerical validation reproduces standard-quantum-limit scaling. Figure 1 reports reconstructions for a k-local case (n = 6, k ∈ {2,3,4,5}, M_loc = 8 k-local Pauli terms, 1200 reconstructions) and a sparse random case (n = 5, M ∈ {4,6,8,10,12} Pauli terms, 960 reconstructions), with error measured by MAE_S that charges missed coefficients as zero. Both cases show the expected T^{−1/2} SQL scaling, and the error dependence on M is below the predicted M^{−3} at the setting Γ = 2M₀.

• Conceptual placement. Compared with the first ansatz-free in-situ Lindbladian protocol (whose sample complexity is governed by the conditioning of a linear system that can be exponential in system size) and with concurrent structure-learning schemes restricted to (quasi-)local generators, the present guarantee is unconditional — no structural assumptions and no error-correcting encodings — while remaining in situ.

Methodology in Plain English

The generator is written in a Pauli basis: a Hamiltonian part with real coefficients h_s and a dissipative part encoded by a positive semidefinite Kossakowski matrix A, whose diagonal entries are Pauli noise rates and whose off-diagonal entries record correlations between jump directions. Sparsity is measured by M = |S_H| + |S_D|², and the learner is handed a budget M₀ ≥ M plus a strength bound Γ that caps every time derivative of the measured signals; since Γ* ≤ 2M₀, choosing Γ = 2M₀ is always sound.

Each experimental shot prepares a random product Pauli eigenstate, evolves once for a chosen time, measures a product Pauli string, and post-processes the outcome. The average of a "trace shot" E_q → E_{q+s} equals a two-sided Pauli response, so every coefficient of the generator sits in a first derivative of such a response at t = 0. The protocol has three stages:

• Stage 1 (dissipation structure) uses same-Pauli measurements in the three global bases at a short time τ_D. Averaging over random preparation signs twirls the channel, so each flip pattern appears with probability tied to a diagonal entry of the Pauli-χ matrix; rows with A_u,u ≥ ξ = c_ξ ε²/M₀ clear a counting threshold, and at most O(1/p_ξ) patterns can pass it, in the spirit of population recovery. Comparing patterns across the three bases decodes every local Pauli and yields the candidate dissipative set plus the collision set Σ_C = {u + v : u, v ∈ C}.

• Stage 2 (Hamiltonian structure) finds Hamiltonian labels by looking at displacements between prepared and measured strings in same-Pauli shots, which reveal the x- and z-projections of the acting Pauli labels. Dissipation could damp these signatures, but a no-jump domination inequality e^{tℒ}(ρ) ⪰ e^{tK₀} ρ e^{tK₀†} with K₀ = −iH − J/2 lower-bounds every displacement probability by the corresponding no-jump amplitude; because J is Hermitian and the Hamiltonian enters along the imaginary direction, a coefficient with |h_s| > ε creates its displacement with probability at least p_* = c₀ε²/(Γ²R⁶).

• Stage 3 (coefficients) uses cross-Pauli trace shots. On the collision set, an expansion in the two-sided Pauli basis lets the anticommutator terms cancel in a difference, and averaging the known phases γ_{a,a+s}(q) over uniformly random q isolates each entry R_{a,a+s} orthogonally. Outside the collision set, a randomized linear-response estimator prepares along one axis and measures along another; whenever the target label differs from the random configuration in an odd number of positions, the response derivative equals 2σ_c(s)h_s up to an O(ε) dissipative bias, so dividing by the probability q(s) ≥ 1/3 makes the estimator unbiased, and one shot estimates all remaining candidates at once.

The absence of inverse evolutions means no symmetric difference through t = 0 is available. The replacement is a signed Legendre kernel on the window [0, τ] with τ = 1/(2Γ): because |f^{(ℓ)}| ≤ Γ^ℓ, the response is 2^{−R}-close to a degree-R polynomial, and the kernel differentiates such polynomials at the origin exactly, so a single shot at a randomly drawn time τU, reweighted by κ(U), returns an estimator whose mean is f′(0) up to a controlled bias. A union bound over the four randomized stages produces the theorem.

Why This Matters

Impact on research. The work extends in-situ, ansatz-free dynamics learning from closed systems to open systems without giving up the favorable ε and Γ dependence, and it removes the exponential conditioning bottleneck of the earlier ancilla-free Lindbladian protocol. It also shows that the Pauli-diagonal restriction common to twirling-based noise learning can be lifted while staying within near-term experimental primitives, which makes generator-level noise models — not just Pauli error rates — accessible for certified simulation and for error mitigation beyond Pauli-twirled channels.

Real-world applications (as identified or implied by the paper):

• Calibrating and certifying analog and digital quantum simulators.
• Measuring the sensitivity of quantum sensors.
• Formulating error-correction thresholds and decoder priors from a learned noise model.
• Supplying probabilistic error cancellation, which removes noise by inverting a learned sparse Pauli–Lindblad model.

Industry relevance. The access model matches what superconducting and other qubit platforms actually offer — product state preparation, forward evolution, single-qubit readout — and the guarantee survives clock-lattice discretization and calibrated SPAM errors, both of which are unavoidable on real hardware. Hardware vendors and groups building error-mitigation or benchmark pipelines would be the direct consumers.

Future Directions

• Removing the M₀² overhead in evolution time. The quadratic factor stems from estimating each fixed-sum block with its own data set; whether a control-free protocol can approach the sparsity-independent Õ(Γ/ε²) cost known for the closed-system case is stated as unknown.

• Extending beyond Markovianity. Broadening the guarantee to time-dependent or weakly non-Markovian dynamics is left open, and would widen the reach of in-situ open-system learning.

• Reducing the number of distinct evolution times further. The protocol already uses O(log(Γ/ε)) times and notes a restriction to R + 1 Chebyshev–Lobatto times; tightening these practical requirements is a natural continuation.

• Bridging to downstream pipelines. Since generator-level models are now learnable in situ, feeding non-Pauli-diagonal noise descriptions into error mitigation and threshold estimation is an open practical program.

Target Audience

Quantum-information theorists and experimentalists working on characterization, benchmarking, and noise learning; researchers in quantum error mitigation and error correction who need quantitative noise models; and graduate students or advanced practitioners comfortable with Lindblad formalism, Pauli/symplectic notation, and sample-complexity analysis who want a rigorous, experimentally grounded protocol for open-system learning.

Authors’ abstract

Quantum devices are open systems whose dynamics interleave coherent evolution with dissipation, and benchmarking, error mitigation, and error correction all rest on a faithful model of both. Existing characterization protocols either assume prior knowledge of the interaction and noise structure, or demand ancillas, entangled probes, or mid-circuit control, or capture only the Pauli-diagonal part of the noise. Here, we present a protocol that reconstructs an arbitrary sparse Markovian generator, including every Hamiltonian together with the jump operator coefficients, using only product Pauli state preparation, single uninterrupted forward evolutions, and product Pauli measurements. Given a sparsity budget $M_0$ and a strength bound $Γ$ of the Lindbladian, every coefficient is learned to precision $ε$ from $\widetilde{O}(Γ^2M_0^2/ε^4)$ experiments and $\widetilde{O}(ΓM_0^2/ε^2)$ total evolution time, with both supports identified from data without locality assumptions. The protocol runs at a logarithmic number of positive evolution times on a hardware clock lattice and is provably robust to calibrated state-preparation and measurement errors.