pith. sign in

arxiv: 2005.10840 · v2 · pith:N7YNQAQ4new · submitted 2020-05-21 · 🪐 quant-ph · cond-mat.quant-gas· cond-mat.str-el· physics.atom-ph

Complexity of Fermionic Dissipative Interactions and Applications to Quantum Computing

classification 🪐 quant-ph cond-mat.quant-gascond-mat.str-elphysics.atom-ph
keywords quantumcomputinginteractionsmany-bodysimulablesystemsclassicallycomplexity
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.