Quantum supremacy using the Sycamore processor

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. Recently, our team has demonstrated a dramatic speedup relative to all known classical algorithms providing an experimental realization of quantum supremacy on a computational task. In this talk, I will focus on the hardware details of the Sycamore processor and how this device enabled supremacy-quality two-qubit gates.