SCIENCE@home

Computing prime factors with a Josephson phase qubit quantum processor

E. Lucero,R. Barends,Yu Chen,J. Kelly,M. Mariantoni,A. Megrant,P. O’Malley,D. Sank,A. Vainsencher,J. Wenner,T. White,Yi Yin,A. Cleland,J. Martinis

Published 2012 in Nature Physics

ABSTRACT

Shor’s quantum algorithm factorizes integers, and implementing this is a benchmark test in the early development of quantum processors. Researchers now demonstrate this important test in a solid-state system: a circuit made up of four superconducting qubits factorizes the number 15. A quantum processor can be used to exploit quantum mechanics to find the prime factors of composite numbers1. Compiled versions of Shor’s algorithm and Gauss sum factorizations have been demonstrated on ensemble quantum systems2, photonic systems3,4,5,6 and trapped ions7. Although proposed8, these algorithms have yet to be shown using solid-state quantum bits. Using a number of recent qubit control and hardware advances9,10,11,12,13,14,15,16, here we demonstrate a nine-quantum-element solid-state quantum processor and show three experiments to highlight its capabilities. We begin by characterizing the device with spectroscopy. Next, we produce coherent interactions between five qubits and verify bi- and tripartite entanglement through quantum state tomography10,14,17,18. In the final experiment, we run a three-qubit compiled version of Shor’s algorithm to factor the number 15, and successfully find the prime factors 48% of the time. Improvements in the superconducting qubit coherence times and more complex circuits should provide the resources necessary to factor larger composite numbers and run more intricate quantum algorithms.

PUBLICATION RECORD

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

REFERENCES

Showing 1-33 of 33 references · Page 1 of 1

CITED BY

Showing 1-100 of 289 citing papers · Page 1 of 3

123
Next