Sergio Boixo's guest appearances

Sergio Boixo

meet the meQuanics - Quantum Computing Discussions

Sabine Hossenfelder

Jacob Taylor

Chris Jackson

Alan Ho

Chris Ferrie

Earl Campbell

Jeffrey Cohen

Seth Lloyd

Mark Everitt

Michael Biercuk

Krysta Svore

Robert Sutor

Michael Brett

Andrew Cross

Simon Benjamin

OwlTail

During this time of lockdown, the centre for quantum software and information (QSI) at the University of Technology Sydney has launched an online seminar series.  With talks once or twice a week from leading researchers in the field, meQuanics is supporting this series by mirroring the audio from each talk.  I would encourage if you listen to this episode, to visit and subscribe to the UTS:QSI YouTube page to see each of these talks with the associated slides to help it make more sense. https://youtu.be/Vq8itsMG39w This talk explains the quantum supremacy milestone achieved by Google.  TITLE: Quantum supremacy using a programmable superconducting processor SPEAKER: Prof Sergio Boixo AFFILIATION: Google Research, Los Angeles, USA HOSTED BY: Prof Michael Bremner, UTS Centre for Quantum Science and Information  ABSTRACT: 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.

During this time of lockdown, the centre for quantum software and information (QSI) at the University of Technology Sydney has launched an online seminar series.  With talks once or twice a week from leading researchers in the field, meQuanics is supporting this series by mirroring the audio from each talk.  I would encourage if you listen to this episode, to visit and subscribe to the UTS:QSI YouTube page to see each of these talks with the associated slides to help it make more sense. <a href="https://youtu.be/Vq8itsMG39w" rel="nofollow" target="_blank">https://youtu.be/Vq8itsMG39w</a> This talk explains the quantum supremacy milestone achieved by Google.  TITLE: Quantum supremacy using a programmable superconducting processor SPEAKER: Prof Sergio Boixo AFFILIATION: Google Research, Los Angeles, USA HOSTED BY: Prof Michael Bremner, UTS Centre for Quantum Science and Information  ABSTRACT: 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.

meQuanics - QSI@UTS Seminar Series - S16 - Sergio Boixo (Google)