2020/10/31 by Marco Cattaneo, Gabriele De Chiara, Sabrina Maniscalco +2 · 1 citation
Computer Science · Mathematics · Physics and Astronomy · #Collision #Computer science #Dynamics (music) #Markov process #Mathematics #Multipartite #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum dynamics #Quantum entanglement #Quantum mechanics #Statistical physics #quant-ph
paper · pdf · doi:10.1103/physrevlett.126.130403
published as Phys. Rev. Lett. 126, 130403 (2021) · Accepted version
openalex publication_date 2021/04/02 · arxiv created 2021/04/04 · arxiv updated 2021/04/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/04
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.