{
  "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.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2610.05288",
  "author_total": 4,
  "authors": [
    {
      "name": "Youngjin Seo"
    },
    {
      "name": "Dhrumil Patel"
    },
    {
      "name": "Hyukjoon Kwon"
    },
    {
      "name": "Mark M. Wilde"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/7m43tr2rhpkms.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2610.05288",
  "fulltext_url": null,
  "id": "7m43tr2rhpkms",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2610.05288",
  "language": null,
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Computing Algorithms and Architecture"
    ]
  ],
  "openalex": "W7220684844",
  "pdf_url": "https://arxiv.org/pdf/2610.05288",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-04",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/7m43tr2rhpkms.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:27:01Z",
      "native_id": "2610.05288",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2610.05288"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Fast Random Compilers for Time-Dependent and Time-Independent Lindbladian Simulation",
  "title_text": "Fast Random Compilers for Time-Dependent and Time-Independent Lindbladian Simulation",
  "type": "preprint",
  "updated_at": "2026-10-30T12:27:01Z",
  "url": "https://research.draconitic.com/paper/7m43tr2rhpkms",
  "venue": "arXiv",
  "versions": []
}