Demonstrating quantum speed-up in a superconducting two-qubit processor
  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. 
A. Dewes, R. Lauro, F.R. Ong, V. Schmitt, P. Milman, P. Bertet, D.   Vion, and D. Esteve
quant-ph cond-mat.supr-con