



@article {1902,
	title = {Efficient simulation of sparse Markovian quantum dynamics},
	journal = {Quantum Information and Computation},
	volume = {17},
	year = {2017},
	month = {2017/09/01},
	pages = {901-947},
	abstract = {<p><span style="font-family: \&quot;Lucida Grande\&quot;, helvetica, arial, verdana, sans-serif; font-size: 14.4px;">Quantum algorithms for simulating Hamiltonian dynamics have been extensively developed, but there has been much less work on quantum algorithms for simulating the dynamics of open quantum systems. We give the first efficient quantum algorithms for simulating Markovian quantum dynamics generated by Lindbladians that are not necessarily local. We introduce two approaches to simulating sparse Lindbladians. First, we show how to simulate Lindbladians that act within small invariant subspaces using a quantum algorithm to implement sparse Stinespring isometries. Second, we develop a method for simulating sparse Lindblad operators by concatenating a sequence of short-time evolutions. We also show limitations on Lindbladian simulation by proving a no-fast-forwarding theorem for simulating sparse Lindbladians in a black-box model.</span></p>},
	doi = {10.26421/QIC17.11-12},
	url = {https://arxiv.org/abs/1611.05543},
	author = {Andrew M. Childs and Tongyang Li}
}
