TY - JOUR
T1 - Collision Models Can Efficiently Simulate Any Multipartite Markovian Quantum Dynamics
AU - Cattaneo, Marco
AU - De Chiara, Gabriele
AU - Maniscalco, Sabrina
AU - Zambrini, Roberta
AU - Giorgi, Gian Luca
N1 - Funding Information:
M. C. thanks Rodrigo Martínez-Peña for useful suggestions. This work was supported by CAIB through QUAREC project (PRD2018/47), by the Spanish State Research Agency through projects PID2019–109094 GB-C21, and through the Severo Ochoa and María de Maeztu Program for Centers and Units of Excellence in R&D (MDM-2017-0711). G. L. G. is funded by the Spanish Ministerio de Educación y Formación Profesional/Ministerio de Universidades and co-funded by the University of the Balearic Islands through the Beatriz Galindo program (BG20/00085). G. D. C. acknowledges support from the UK EPSRC grants No. EP/S02994X/1 and No. EP/T026715/1. S. M. acknowledges financial support from the Academy of Finland via the Centre of Excellence program (Project No. 336814).
Publisher Copyright:
© 2021 American Physical Society.
Copyright:
Copyright 2021 Elsevier B.V., All rights reserved.
PY - 2021/4/2
Y1 - 2021/4/2
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85104427214&partnerID=8YFLogxK
U2 - 10.1103/PhysRevLett.126.130403
DO - 10.1103/PhysRevLett.126.130403
M3 - Article
C2 - 33861108
AN - SCOPUS:85104427214
SN - 0031-9007
VL - 126
JO - Physical Review Letters
JF - Physical Review Letters
IS - 13
M1 - 130403
ER -