New Article: Reliability of digitized quantum annealing and the decay of entanglement

Quantum Information Group @ CBPF

In this new article we used our NMR quantum computer (only two qubits…), in collaboration with Frederico Brito (USP-SC), to simulate in a digital-analog way a quantum annealing process. We currently hold (as far as I know…) the record of Trotter steps (235) and gates (more than 2000) in a quantum simulation. Moreover, we were able to relate the quality of the computation with the amount of entanglement it generated. But don’t let this trick you: more entanglement does seem to relate with better computation quality, but it does not necessarily imply better-than-classical computation! See the plot and description below, and click here for the full article.

Computation Reliabilty. Experimental results for mean (time-average) success and fidelity (top panel) and maximum and mean entanglement (bottom panel), as a function of the applied magnetic field gradient. Classical algorithm is assumed to not suffer any kind of noise, as it is implemented in a classical computer. Computation Reliabilty. Experimental results for mean
(time-average) success and fidelity (top panel) and maximum and mean
entanglement (bottom panel), as a function of the applied magnetic
field gradient. Classical algorithm is assumed to not suffer any kind
of noise, as it is implemented…

View original post 148 more words

Advertisements


Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s