(Back to the menu - click here.)


“Quantum supremacy using a programmable superconducting processor"





  Thursday, 16  Jan. 2020

    Video-Recording for any system with MP4-support

   - Video.mp4  (ca.714 Mb)

 15:15 – 16:50



                                                        (John Martinis from Google)


The promise of quantum computers is that certain computational tasks might be

executed exponentially faster on a quantum processor than on a classical processor.

A fundamental challenge is to build a high-fidelity processor capable of running

quantum algorithms in an exponentially large computational space.

Here we report the use of a processor with programmable superconducting qubits

to create quantum states on 53 qubits, corresponding to a computational state-space

of dimension 2^53  (about 10^16). Measurements from repeated experiments sample

the resulting probability distribution, which we verify using classical simulations.

Our Sycamore processor takes about 200 seconds to sample one instance of a

quantum circuit a million times—our benchmarks currently indicate that the

equivalent task for a state-of-the-art classical supercomputer would take

approximately 10,000 years. This dramatic increase in speed compared to all known

classical algorithms is an experimental realization of quantum supremacy for this

specific computational task, heralding a much-anticipated computing paradigm.


                              <<<<<<  Denna sida ändrades, den 13 januari 2022 kl.17:47:01    >>>>>>