Complexity of Fermionic Dissipative Interactions and Applications to Quantum Computing

Published on May 21, 2020in arXiv: Quantum Physics
· DOI :10.1103/PRXQUANTUM.2.030350
Oles Shtanko7
Estimated H-index: 7
(UMD: University of Maryland, College Park),
Abhinav Deshpande7
Estimated H-index: 7
(UMD: University of Maryland, College Park)
+ 1 AuthorsAlexey V. Gorshkov55
Estimated H-index: 55
(UMD: University of Maryland, College Park)
Sources
Abstract
Interactions between particles are usually a resource for quantum computing, making quantum many-body systems intractable by any known classical algorithm. In contrast, noise is typically considered as being inimical to quantum many-body correlations, ultimately leading the system to a classically tractable state. This work shows that noise represented by two-body processes, such as pair loss, plays the same role as many-body interactions and makes otherwise classically simulable systems universal for quantum computing. We analyze such processes in detail and establish a complexity transition between simulable and nonsimulable systems as a function of a tuning parameter. We determine important classes of simulable and nonsimulable two-body dissipation. Finally, we show how using resonant dissipation in cold atoms can enhance the performance of two-qubit gates.
📖 Papers frequently viewed together
2021
2011
1 Author (Jacob Jordan)
References105
Newest
Cited By0
Newest
This website uses cookies.
We use cookies to improve your online experience. By continuing to use our website we assume you agree to the placement of these cookies.
To learn more, you can find in our Privacy Policy.