Characterizing Arbitrary Lindbladian Dynamics with a Few Pauli Measurements

• URL: http://arxiv.org/abs/2607.23044v1
• Date: Sat, 25 Jul 2026 05:03:00 GMT
• Title: Characterizing Arbitrary Lindbladian Dynamics with a Few Pauli Measurements
• Abstract summary: We present a protocol that reconstructs an arbitrary sparse Markovian generator, including every Hamiltonian together with the jump operator coefficients.<n>The protocol runs at a logarithmic number of positive evolution times on a hardware clock lattice and is provably robust to state-preparation and measurement errors.
• Score: 3.3230675313521716
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Joint Mitigation of Algorithmic and Physical Errors in Noisy Hamiltonian Simulation [22.28754738497284]
  Product-formula Hamiltonian simulation is naturally suited to near-term quantum processors.<n>But its accuracy is set by two competing errors: finite-step Trotter bias and physical hardware noise.<n>We introduce a joint extrapolation strategy that ties the tunable per-layer noise strength to the Trotter step size.<n>We demonstrate the protocol for Ising dynamics on a superconducting quantum computer using learned noise.
  arXiv  Detail & Related papers  (2026-09-10T13:15:37Z)
• Quantum computational resources and validation protocols for a three-mode non-Gaussian trilinear Hamiltonian [39.146761527401424]
  We focus on a three-mode non-Gaussian trilinear Hamiltonian that has recently been realized in superconducting microwave platforms.<n>We investigate its ability to generate two key resources for quantum computation: multipartite entanglement and Wigner negativity.<n>We introduce a measurement-efficient protocol for the experimental validation of the Hamiltonian implementation without requiring full reconstruction of the Wigner function.
  arXiv  Detail & Related papers  (2026-09-09T11:17:53Z)
• Scalable Lindblad Noise Learning via Stochastic Tensor-Network Simulation [48.887627688666974]
  Learning dissipation rates in large-scale open quantum systems is a major obstacle for near-term quantum technologies.<n>Here, we propose a scalable noise-learning framework for Lindblad dissipation rates that combines a simulation method, the Jump Method (TJM)<n>We demonstrate the approach on two noise models in the Ising model, in which independent dissipation rates are learned for each site up to $N_mathrmsite=16$.<n>This combination of scalable numerics and rigorous theoretical guarantees positions TJM-based noise learning as a practical foundation for characterizing dissipation in large quantum devices.
  arXiv  Detail & Related papers  (2026-08-25T15:07:11Z)
• Intrinsic Structure: Spectral Identifiability for Mechanistic Interpretability [51.56484100374058]
  We prove the first identifiability theorem for a mechanistic-interpretability primitive.<n>The spectrum is an identifiable, model-intrinsic fingerprint with a stated error bar, not a legible decomposition.
  arXiv  Detail & Related papers  (2026-08-10T19:42:01Z)
• Learning Arbitrary Lindbladians from Time Evolution [9.103975636688793]
  We study the problem of learning an unknown Markovian open-system generator from access to its physical time evolution.<n>This generator, called a Lindbladian, contains Hamiltonian and dissipative coefficients indexed by an exponentially large family of possible Pauli terms.<n>We propose an efficient algorithm that learns arbitrary Lindbladians from time evolution under minimal assumptions.
  arXiv  Detail & Related papers  (2026-07-30T17:58:01Z)
• The log log jam in Gaussian state tomography [30.395638404311537]
  We show that any protocol that uses Gaussian measurements, even entangled or adaptively chosen ones, must incur a $log log E$ dependence.<n>With highly entangled, non-Gaussian measurements, one can learn $n$-mode pure Gaussian states with $O(n2 / 2)$ samples, independent of $E$.<n>Our results shed new light on the intriguing interplay between adaptivity, entanglement, and magic in quantum learning.
  arXiv  Detail & Related papers  (2026-07-14T17:25:43Z)
• Active Quantum Kernel Acquisition for Gaussian Process Regression [30.032230630492155]
  Recent work on quantum kernel classification has shown that allocating shots non-uniformly across kernel entries can reduce the shot budget required to reach a target accuracy.<n>We extend this idea to Gaussian process (GP) regression, a setting whose downstream quantities (full-spectrum posterior variance, log-determinant, marginal likelihood) couple to kernel error more tightly than the sign-only outputs of classification.<n>We derive three closed-form pair-level sensitivities predictive coupling $|_i_j|$, leave-one-out residual, and marginal-likelihood gradient and plug them into a Neyman-style minimum
  arXiv  Detail & Related papers  (2026-06-27T09:40:20Z)
• Robust Structure Learning of $k$-local Lindbladians [6.257768263476564]
  We present an efficient protocol for learning an unknown $k$-local Lindblad generator on $n$ qubits.<n>For fixed $k$ and bounded weighted interaction strength, the protocol estimates all Hamiltonian and dissipative Pauli-GKSL coefficients to entrywise accuracy.<n>We extend the guarantees to model misspecifications and prove sample-complexity lower bounds.
  arXiv  Detail & Related papers  (2026-06-22T17:38:41Z)
• Near-Optimal Learning of Local Lindbladians [8.542629891640045]
  We study the problem of learning local Lindbladians from black-box access to the physical evolution.<n>We give an algorithm built directly from finite-time channel probes, which runs the unknown evolution for short times.<n>We complement the algorithm with matching lower bounds, showing that the learning algorithm is near-optimal both in physical dynamics accesses and in total evolution time.
  arXiv  Detail & Related papers  (2026-06-18T17:48:31Z)
• Optimal Ansatz-free Hamiltonian Learning In Situ [3.3230675313521716]
  We show that an algorithm can learn an ansatz-free Hamiltonian $H$ in total evolution time of $(frac2log(frac))$.<n>Our results demonstrate the fundamental cost of experimentally friendly Hamiltonian learning and provide a practical route to rigorous in situ characterization of near-term quantum platforms.
  arXiv  Detail & Related papers  (2026-06-17T18:21:30Z)
• Correction and Corruption: A Two-Rate View of Error Flow in LLM Protocols [51.56484100374058]
  We propose a paired-outcome measurement interface for auditing a single protocol step on exact-match tasks.<n>For each instance, the interface records a baseline correctness bit and a post-step correctness bit.<n>These rates predict accuracy changes and define a reusable empirical interface testable across seeds, mixtures, and pipelines.
  arXiv  Detail & Related papers  (2026-04-20T13:25:40Z)
• Ansatz-Free Learning of Lindbladian Dynamics In Situ [2.380854690607918]
  We present the first sample-efficient protocol for learning sparse Lindbladians without assuming a priori structure or locality.<n>Our protocol is ancilla-free, uses only product-state preparations and Pauli-basis measurements, and achieves near-optimal time resolution.
  arXiv  Detail & Related papers  (2026-03-05T18:57:25Z)
• Stabilizing Fixed-Point Iteration for Markov Chain Poisson Equations [49.702772230127465]
  We study finite-state Markov chains with $n$ states and transition matrix $P$.<n>We show that all non-decaying modes are captured by a real peripheral invariant subspace $mathcalK(P)$, and that the induced operator on the quotient space $mathbbRn/mathcalK(P) is strictly contractive, yielding a unique quotient solution.
  arXiv  Detail & Related papers  (2026-01-31T02:57:01Z)
• Learning and certification of local time-dependent quantum dynamics and noise [5.1798081822960365]
  Hamiltonian learning protocols are essential tools to benchmark quantum computers and simulators.<n>We learn the time-dependent evolution of a locally interacting $nqubit system on a graph of effective dimensionD$.<n>Our protocol outputs function approximating coefficients to accuracy $epsilon$ on an interval with success probability $1-delta$.
  arXiv  Detail & Related papers  (2025-10-09T17:39:40Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.