Quantum speeding-up of computation demonstrated in a superconducting two-qubit processor
Andreas Dewes, Romain Lauro, Florian R. Ong, Vivient Schmitt, Perola Milman, Patrice Bertet, Denis Vion, Daniel Esteve
DOI 10.1103/PhysRevB.85.140503 · Physical Review B
Active bibliographic source — not scientific approval
Bibliographic access preserves source history; it does not approve extracted materials or validate reported claims. Review warnings on each occurrence separately.
Abstract
We operate a superconducting quantum processor consisting of two tunable transmon qubits coupled by a swapping interaction, and equipped with nondestructive 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, which is 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.
Similar papers
Demonstrating quantum speed-up in a superconducting two-qubit processor
similarity 0.91A. Dewes et al. · 2011 · arXiv:1110.5170
Source status unknown — claims are unverified
Two-Qutrit Quantum Algorithms on a Programmable Superconducting Processor
similarity 0.91Tanay Roy et al.
Source status unknown — claims are unverified
Programmable Superconducting Processor with Native Three-Qubit Gates
similarity 0.89Tanay Roy et al.
Source status unknown — claims are unverified