arXiv:2610.05288
Fast Random Compilers for Time-Dependent and Time-Independent Lindbladian Simulation
Youngjin Seo, Dhrumil Patel, Hyukjoon Kwon, Mark M. Wilde
Abstract
Randomized product formulas provide simple and flexible methods for quantum simulation. While qDRIFT-type randomized simulation has been extended to Lindbladian dynamics, higher-order randomized compilers have primarily been developed for Hamiltonian simulation. In this work, we develop first- and second-order randomized sampling algorithms for Lindbladian simulation in both the time-independent and time-dependent settings. Building on first-order qDRIFT-type Lindbladian simulation, we introduce a qSWIFT-type second-order correction for time-independent Lindbladians with a finite local decomposition. For $λt \geq 1$, where $λ$ is the sum of the Hamiltonian coefficients and dissipative rates, the resulting approximation achieves normalized diamond-norm error at most $\varepsilon$ using $r=O(λ^2 t^2/\sqrt{\varepsilon})$ time slices, improving the $\varepsilon^{-1}$ precision dependence of the first-order qDRIFT-type approximation. We then develop first- and second-order continuous-time sampling algorithms for general time-dependent Lindbladians, with the second-order construction likewise achieving an $\varepsilon^{-1/2}$ dependence on the target precision in the number of time slices. We further extend the time-dependent construction to a linear-combination input model over local Hamiltonian and dissipative generators, allowing the randomized sampler to be formulated in terms of local evolutions rather than the full time-dependent Lindbladian. Because the second-order corrected maps need not be CPTP, we use them to estimate observable expectation values rather than to deterministically prepare output states.
AI Summary
The paper studies whether higher-order randomized Hamiltonian compilers can be extended to Lindblad evolution, including time-dependent generators. It develops second-order corrections to averaged qDRIFT-type maps and implements their observable expectations through randomized estimators rather than deterministic output-state preparation. For a time-independent local decomposition, let $\lambda$ be the sum of Hamiltonian coefficients and dissipative rates. The construction adds a single second-order correction at every possible position among $r$ qDRIFT steps. Its normalized diamond-norm error is bounded by $4\lambda^3t^3/(3r^2)+4(r-1)\lambda^4t^4/r^3$. For $\lambda t\geq1$, this gives $r=O(\lambda^2t^2/\sqrt{\varepsilon})$, versus the first-order $O(\lambda^2t^2/\varepsilon)$ slice bound. For time-dependent dynamics, the sampler draws times with probabilities proportional to generator diamond norms and partitions evolution into equal integrated-norm intervals. It also supports joint sampling of local terms and times. Writing $N$ for the integrated generator norm, or the integrated sum of local-generator norms, the second-order error is at most $N^3/(6r^2)+(r-1)N^4/(4r^3)$. Proofs combine Taylor matching, channel contractivity, and telescoping expansions. The corrected maps need not be completely positive. Observable estimators use control-qubit constructions and heralded local unitary dilations. Slice counts assume sampling and implementation primitives, excluding classical preprocessing and finite-precision synthesis. The time-dependent estimator additionally assumes bounded dilation normalization factors. A sharper variance and sample-complexity analysis, and rigorous higher-order extensions, are left open.
During the final preparation of this manuscript, the authors used ChatGPT-6 Astra to assist with proofreading and consistency checks.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 43 pages. The first two authors contributed equally