Collision Models Can Efficiently Simulate Any Multipartite Markovian Quantum Dynamics

We introduce the multipartite collision model, defined in terms of elementary interactions between subsystems and ancillas, and show that it can simulate the Markovian dynamics of any multipartite open quantum system. We develop a method to estimate an analytical error bound for any repeated interactions model, and we use it to prove that the error of our scheme displays an optimal scaling. Finally, we provide a simple decomposition of the multipartite collision model into elementary quantum gates, and show that it is efficiently simulable on a quantum computer according to the dissipative quantum Church-Turing theorem, i.e., it requires a polynomial number of resources.

Automated summary

The paper introduces the multipartite collision model to simulate the Markovian dynamics of any multipartite open quantum system, demonstrates an analytical error bound estimation method for repeated interactions models, and proves the optimal scaling of the error in the scheme. It also provides a simple decomposition of the multipartite collision model into elementary quantum gates, showing its efficient simulation on a quantum computer with a polynomial number of resources according to the dissipative quantum Church-Turing theorem.