{"paper":{"title":"Efficient Quantum Algorithms for Simulating Lindblad Evolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Chunhao Wang, Richard Cleve","submitted_at":"2016-12-30T15:57:09Z","abstract_excerpt":"We consider the natural generalization of the Schr\\\"{o}dinger equation to Markovian open system dynamics: the so-called the Lindblad equation. We give a quantum algorithm for simulating the evolution of an $n$-qubit system for time $t$ within precision $\\epsilon$. If the Lindbladian consists of $\\mathrm{poly}(n)$ operators that can each be expressed as a linear combination of $\\mathrm{poly}(n)$ tensor products of Pauli operators then the gate cost of our algorithm is $O(t\\, \\mathrm{polylog}(t/\\epsilon)\\mathrm{poly}(n))$. We also obtain similar bounds for the cases where the Lindbladian consist"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.09512","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}