Demonstrating quantum speed-up in a superconducting two-qubit processor
ORAL
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 [1]. 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 [2].\\[4pt] [1] arXiv:1109.6735v1 \\[0pt] [2] arXiv:1110.5170v1
–
Authors
-
Andreas Dewes
CEA Saclay, CEA-Saclay, France, CEA-Saclay
-
Romain Lauro
CEA Saclay, CEA-Saclay, France
-
Florian Ong
CEA Saclay
-
Vivien Schmitt
CEA Saclay, CEA-Saclay, France
-
Daniel Esteve
CEA Saclay, CEA-Saclay, France, CEA-Saclay
-
Patrice Bertet
CEA Saclay, CEA-Saclay, France, CEA-Saclay
-
Denis Vion
CEA Saclay, CEA-Saclay, France, CEA-Saclay
-
Perola Milman
Laboratoire Materiaux et Phenomenes Quantiques, Universite Paris Diderot