Demonstrating quantum speed-up in a superconducting two-qubit processor

TL;DR

This paper demonstrates a quantum speed-up in a superconducting two-qubit processor by successfully implementing Grover's algorithm, achieving a higher success probability than classical methods, thus providing proof-of-concept for quantum computational advantage.

Contribution

First experimental demonstration of quantum speed-up in a superconducting quantum processor using Grover's algorithm.

Findings

Success probability between 0.52 and 0.67 for quantum search

Classical success probability is 0.25

Proof-of-concept for quantum speed-up in superconducting devices

Abstract

We operate a superconducting quantum processor consisting of two tunable transmon qubits coupled by a swapping interaction, and equipped with non destructive single-shot readout of the two qubits. With this processor, we run the Grover search algorithm among four objects and find that the correct answer is retrieved after a single run with a success probability between 0.52 and 0.67, significantly larger than the 0.25 achieved with a classical algorithm. This constitutes a proof-of-concept for the quantum speed-up of electrical quantum processors.