Prime factoring using a Josephson phase-qubit architecture: $15 = 3*5$

ORAL

Abstract

We demonstrate a compiled version of Shor's algorithm using a quantum processor. The processor consists of ``off-the-shelf" components: qubits and resonators arranged in the ReZQu architecture. We have performed the algorithm for N=15 and the period r=2. The required two and three qubit entanglement is observed during the computation, which exemplifies the quantum nature of the algorithm.

–

Authors

  • Erik Lucero

    • University of California, Santa Barbara

  • R. Barends

    • University of California, Santa Barbara

  • J. Bochmann

    • University of California, Santa Barbara

  • Y. Chen

    • University of California, Santa Barbara

  • B. Chiaro

    • University of California, Santa Barbara

  • J. Kelly

    • University of California, Santa Barbara

  • M. Lenander

    • University of California, Santa Barbara

  • M. Mariantoni

    • University of California, Santa Barbara

  • A. Megrant

    • University of California, Santa Barbara

  • C. Neill

    • University of California, Santa Barbara

  • P. O'Malley

    • University of California, Santa Barbara

  • P. Roushan

    • University of California, Santa Barbara

  • D. Sank

    • University of California, Santa Barbara

  • A. Vainsencher

    • University of California, Santa Barbara

  • H. Wang

    • Zhejiang University

  • J. Wenner

    • University of California, Santa Barbara

  • T. White

    • University of California, Santa Barbara

  • Y. Yin

    • University of California, Santa Barbara

  • A.N. Cleland

    • University of California, Santa Barbara

  • John M. Martinis

    • University of California, Santa Barbara