Quantifying dissipation is essential for controlling quantum noise and characterizing open-system dynamics. In practical experimental settings, residual noise may still persist despite efforts to suppress it, making it important to determine whether the dissipative strength remains within a prescribed tolerance threshold. We study this question for an unknown, time-independent Lindblad generator with bounded strength, where the jump operators are local but with unrestricted overlap, using only memoryless forward-evolution access. The task is to distinguish dissipative strength of at most $\varepsilon_1$ from strength of at least $\varepsilon_2$, for $0 \leq \varepsilon_1 < \varepsilon_2$, measured in the canonical dissipator's normalized Frobenius norm. We give an algorithm that solves this task in total evolution time $O(\varepsilon_2/(\varepsilon_2-\varepsilon_1)^2)$ for all nontrivial thresholds, with constant success probability, and provide a matching lower bound $Ω(\varepsilon_2/(\varepsilon_2-\varepsilon_1)^2)$ that establishes optimality even for adaptive protocols. This extends dissipation testing to the tolerant setting and eliminates the bounded-degree requirement, making the framework applicable to a broader range of experimentally relevant settings.
AI Summary
The paper studies tolerant testing of dissipation in an unknown, time-independent Lindblad generator $\mathcal L=-i[H,\cdot]+\mathcal D$: distinguish $\|\mathcal D\|_F\leq\varepsilon_1$ from $\|\mathcal D\|_F\geq\varepsilon_2$. Here $\mathcal D$ is the canonical dissipator obtained with traceless jump operators, and the normalized Frobenius norm equals the generator’s distance from Hamiltonian dynamics. Assumptions are $\|\mathcal L\|_\diamond\leq\Lambda$ and jump operators supported on at most a fixed $k$ qubits; supports are unknown, overlap is unrestricted, and the Hamiltonian may be nonlocal.
With memoryless forward-evolution access, the optimal total interaction time is $\Theta_k(\varepsilon_2/(\varepsilon_2-\varepsilon_1)^2)$ for success probability at least $2/3$, throughout $0\leq\varepsilon_1<\varepsilon_2\leq\Lambda/\sqrt2$. The upper threshold range covers all nontrivial cases. This extends non-tolerant dissipation testing and removes its bounded-degree assumption.
The algorithm projects short-time Choi probes orthogonally to the maximally entangled input, isolating a positive jump block with rate $\Gamma$ and normalized state $\sigma$. An exact identity expresses dissipative strength through $\Gamma$ and a functional combining global purity with dimension-rescaled reference-marginal purity. Locality-based support discovery and a product-Pauli U-statistic estimate this functional using $\Theta_k(\eta^{-2})$ copies for additive accuracy $\eta$. A single-qubit dephasing construction, compared through Poisson phase-flip records, proves the time lower bound even for adaptive protocols with ancillas and joint measurements.
Optimality concerns summed oracle durations, including failed preparations and parallel calls—not query count, gates, storage, or wall-clock time. The model permits arbitrarily short calls and free known operations; constants depend on fixed $k$.
Some signs of AI-generated textAI use disclosed
These models also assisted with language editing, manuscript organization, notation consistency, literature searches, and the review of mathematical arguments and derivations.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
Quantifying dissipation is essential for controlling quantum noise and characterizing open-system dynamics. In practical experimental settings, residual noise may still persist despite efforts to suppress it, making it important to determine whether the dissipative strength remains within a prescribed tolerance threshold. We study this question for an unknown, time-independent Lindblad generator with bounded strength, where the jump operators are local but with unrestricted overlap, using only memoryless forward-evolution access. The task is to distinguish dissipative strength of at most ε1 from strength of at least ε2, for 0≤ε1<ε2, measured in the canonical dissipator's normalized Frobenius norm. We give an algorithm that solves this task in total evolution time O(ε2/(ε2−ε1)2) for all nontrivial thresholds, with constant success probability, and provide a matching lower bound Ω(ε2/(ε2−ε1)2) that establishes optimality even for adaptive protocols. This extends dissipation testing to the tolerant setting and eliminates the bounded-degree requirement, making the framework applicable to a broader range of experimentally relevant settings.
The paper studies tolerant testing of dissipation in an unknown, time-independent Lindblad generator L=−i[H,⋅]+D: distinguish ∥D∥F≤ε1 from ∥D∥F≥ε2. Here D is the canonical dissipator obtained with traceless jump operators, and the normalized Frobenius norm equals the generator’s distance from Hamiltonian dynamics. Assumptions are ∥L∥⋄≤Λ and jump operators supported on at most a fixed k qubits; supports are unknown, overlap is unrestricted, and the Hamiltonian may be nonlocal.
With memoryless forward-evolution access, the optimal total interaction time is Θk(ε2/(ε2−ε1)2) for success probability at least 2/3, throughout 0≤ε1<ε2≤Λ/2. The upper threshold range covers all nontrivial cases. This extends non-tolerant dissipation testing and removes its bounded-degree assumption.
The algorithm projects short-time Choi probes orthogonally to the maximally entangled input, isolating a positive jump block with rate Γ and normalized state σ. An exact identity expresses dissipative strength through Γ and a functional combining global purity with dimension-rescaled reference-marginal purity. Locality-based support discovery and a product-Pauli U-statistic estimate this functional using Θk(η−2) copies for additive accuracy η. A single-qubit dephasing construction, compared through Poisson phase-flip records, proves the time lower bound even for adaptive protocols with ancillas and joint measurements.
Optimality concerns summed oracle durations, including failed preparations and parallel calls—not query count, gates, storage, or wall-clock time. The model permits arbitrarily short calls and free known operations; constants depend on fixed k.
Experimental implementations of Hamiltonian dynamics are often affected by dissipative noise arising from interactions with the environment. This raises the question of whether one can detect the presence or absence of such dissipation using only access to the observed time evolution of the system. We consider the following decision problem: given black-box access to the time-evolution channels etL generated by an unknown time-independent Lindbladian L, determine whether the dynamics are purely Hamiltonian or contain dissipation of magnitude at least ε in normalized Frobenius norm. We give a randomized procedure that solves this task using total evolution time O(ε−1), which is information-theoretically optimal. This guarantee holds under the assumptions that the Lindblad generator has bounded strength and its dissipative part is of constant locality with bounded degree. Our work provides a practical method for detecting dissipative noise in experimentally implemented quantum dynamics.
We study the problem of learning arbitrary n-qubit Lindbladians, the generators of Markovian open-system dynamics, from their time evolution. We give the first known efficient algorithm that learns arbitrary Lindbladians without any structural assumptions. For an n-qubit Lindbladian of dynamical strength at most Λ, the algorithm estimates every coefficient to error ε using O(Λ2/ε2) experiments and O(Λ/ε2) total evolution time, with classical running time polynomial in n and Λ/ε. Both experimental costs match known lower bounds up to polylogarithmic factors. The algorithm identifies candidate labels through product Pauli experiments and estimates their coefficients using random stabilizer preparations and Clifford measurements. It requires no ancillas or control during the unknown evolution.
For constant k, our algorithm learns generic k-local Lindbladians of local dynamical strength at most Λloc using O(n2Λloc2/ε2) experiments and O(nΛloc/ε2) total evolution time, improving the upper bounds of prior works in terms of the dependence on n. We further improve the lower bounds of Arad, Chen, Guo, Rebentrost, and Yu (SODA 2027) using a family of 3-local Lindbladians. They already hold when the support is known, and only one Hamiltonian coefficient is requested, even for adaptive protocols with arbitrary ancillas and quantum memory. These lower bounds establish that our algorithm is optimal up to polylogarithmic factors in both experiment count and total evolution time for every fixed k≥3.
We study the problem of learning local Lindbladians from black-box access to the physical evolution, where the goal is to estimate all Hamiltonian and dissipative coefficients. For local Lindbladians with low-intersection dissipators and local dynamical strength at most Λ, we design an algorithm that learns the coefficients to target accuracy ε, whose experiment count and total evolution time scale as O(Λ2/ε2) and O(Λ/ε2), respectively, with only logarithmic dependence on the number of qubits. The algorithm is built directly from finite-time channel probes. It runs the unknown evolution for short times, estimates the corresponding Pauli transfer matrices from classical shadows, and converts these estimates into Lindbladian coefficients by stable local Fourier inversions.
The algorithm is non-adaptive, uses no ancillas, and requires only random product states as inputs followed by random Pauli measurements. The method does not require knowing the structure of the Lindbladian in advance. We prove matching lower bounds that establish the near-optimality of the algorithm in both resources. By constructing a family of single-qubit dephasing Lindbladians, we show that any algorithm, even an adaptive one with arbitrary ancillas and measurements, requires Ω(Λ2/ε2) experiments and Ω(Λ/ε2) total evolution time. In particular, the lower bounds imply that the Heisenberg-limited scaling achievable for Hamiltonian learning is information-theoretically impossible once dissipative coefficients must be estimated.
Characterizing the dynamics of open quantum systems at the level of microscopic interactions and error mechanisms is essential for calibrating quantum hardware, designing robust simulation protocols, and developing tailored error-correction methods. Under Markovian noise/dissipation, a natural characterization approach is to identify the full Lindbladian generator that gives rise to both coherent (Hamiltonian) and dissipative dynamics. Prior protocols for learning Lindbladians from dynamical data assumed pre-specified interaction structure, which can be restrictive when the relevant noise channels or control imperfections are not known in advance. In this paper, we present a sample-efficient protocol for learning sparse Lindbladians without assuming any a priori structure. Our protocol is ancilla-free, uses only product-state preparations and Pauli-basis measurements, admits provably stable coefficient reconstruction, and achieves near-optimal time resolution, making it compatible with near-term experimental capabilities. Together, this provides a systematic route to scalable characterization of open-system quantum dynamics, especially in settings where the error mechanisms of interest are unknown.
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 M0 and a strength bound Γ of the Lindbladian, every coefficient is learned to precision ε from O(Γ2M02/ε4) experiments and O(ΓM02/ε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.
We present an efficient protocol for learning an unknown k-local Lindblad generator on n qubits using only product-state preparations, short-time evolution, and single-qubit Pauli measurements, without prior knowledge of the interaction structure. For fixed k and a supplied weighted interaction-strength bound αˉ, the protocol estimates all Hamiltonian and dissipative Pauli--GKSL coefficients with total coefficient error at each site at most ε with probability at least 1−δ using Ok(αˉ2n2k−2ε−2log(n/δ)) samples and polylogarithmically many distinct evolution times. This guarantee requires no degree, sparsity, or tail promise. A convex optimization converts these estimates into a valid k-local Lindblad generator with diamond-norm error at most ε using Ok(αˉ2n2kε−2log(n/δ)) samples and polynomial-time classical postprocessing. With a supplied local effective-sparsity bound r and a sufficiently small sitewise subthreshold tail Ok(ε), coefficient recovery requires only Ok(αˉ2r2ε−2log(n/δ)) samples, without a supplied threshold or coefficient locations and without a coefficient-gap assumption. In particular, exactly sparse bounded-degree models have logarithmic sample dependence on n. We also provide guard-band support recovery and complementary supplied-candidate guarantees, extend the guarantees to model misspecification, and prove complementary sample-complexity lower bounds.