Demonstration of Two-Qubit Algorithms with a Superconducting Quantum Processor
L. DiCarlo, J. M. Chow, J. M. Gambetta, Lev S. Bishop, B. R. Johnson,, D. I. Schuster, J. Majer, A. Blais, L. Frunzio, S. M. Girvin, and R. J., Schoelkopf

TL;DR
This paper demonstrates a two-qubit superconducting quantum processor capable of executing quantum algorithms like Grover search and Deutsch-Jozsa, using a novel tunable interaction mediated by a cavity bus in a cQED architecture.
Contribution
It introduces a new two-qubit interaction mechanism in superconducting circuits, enabling high entanglement and implementation of quantum algorithms.
Findings
Achieved up to 94% entanglement concurrence.
Successfully implemented Grover and Deutsch-Jozsa algorithms.
Demonstrated a tunable two-qubit interaction in cQED architecture.
Abstract
By harnessing the superposition and entanglement of physical states, quantum computers could outperform their classical counterparts in solving problems of technological impact, such as factoring large numbers and searching databases. A quantum processor executes algorithms by applying a programmable sequence of gates to an initialized register of qubits, which coherently evolves into a final state containing the result of the computation. Simultaneously meeting the conflicting requirements of long coherence, state preparation, universal gate operations, and qubit readout makes building quantum processors challenging. Few-qubit processors have already been shown in nuclear magnetic resonance, cold ion trap and optical systems, but a solid-state realization has remained an outstanding challenge. Here we demonstrate a two-qubit superconducting processor and the implementation of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
