Pith. sign in

REVIEW

Complexity of Fermionic Dissipative Interactions and Applications to Quantum Computing

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2005.10840 v2 pith:N7YNQAQ4 submitted 2020-05-21 quant-ph cond-mat.quant-gascond-mat.str-elphysics.atom-ph

classification quant-phcond-mat.quant-gascond-mat.str-elphysics.atom-ph
keywords quantumcomputinginteractionsmany-bodysimulablesystemsclassicallycomplexity
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Sign in to comment.

Pith tools