# Computing prime factors with a Josephson phase qubit quantum processor

@article{Lucero2012ComputingPF, title={Computing prime factors with a Josephson phase qubit quantum processor}, author={Erik Lucero and Rami Barends and Yu Chen and Julian Kelly and M. Mariantoni and Anthony Megrant and P. J. J. O’Malley and Daniel Thomas Sank and Amit Vainsencher and J. Wenner and Theodore White and Yi Yin and Andrew N. Cleland and John M. Martinis}, journal={Nature Physics}, year={2012}, volume={8}, pages={719-723} }

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.

## 246 Citations

### Computing prime factors using a Josephson phase-qubit architecture: 15 = 3 x 5

- Physics
- 2012

Computing prime factors using a Josephson phase-qubit architecture: 15 = 3× 5

### Proposal: A Spin Ensemble Quantum Memory for Superconducting Qubits

- Physics
- 2016

This chapter is dedicated to the presentation of the quantum memory protocol, on which our experiments are based. It describes the storage in parallel of multiple quantum states into a spin ensemble,…

### Quantum Computing: Architectures, Circuits, Algorithms

- Computer Science, Physics2019 IEEE National Aerospace and Electronics Conference (NAECON)
- 2019

The aim of this paper is to provide a brief overview of Quantum Computing development with focus on quantum architectures, gates, circuits, tools, and quantum error correction. We also discuss…

### Pretending to factor large numbers on a quantum computer

- Computer Science
- 2013

This work demonstrates how to factor products of large prime numbers using a compiled version of Shor’s quantum factoring algorithm, which can factor all products of p,q such that p, q are unequal primes greater than two, runs in constant time, and requires only two coherent qubits.

### The Crown Jewels of Quantum Algorithms

- Computer Science
- 2020

This chapter provides detailed descriptions of the most intellectually valued algorithms in quantum computing, including Peter Shor’s factoring algorithm and Lov Grover search algorithm, among…

### Oversimplifying quantum factoring

- Computer ScienceNature
- 2013

All composite numbers admit simplification of the quantum factoring algorithm to a circuit equivalent to flipping coins, and the difficulty of a particular experiment depends on the level of simplification chosen, not the size of the number factored.

### A Note On One Realization of a Scalable Shor Algorithm

- Computer ScienceArXiv
- 2016

The report is somewhat misleading because there are three flaws in the proposed circuit diagram of Shor algorithm, and the principles behind the demonstration have not been explained properly, including its correctness and complexity.

### Quantum computation and simulation with superconducting qubits

- PhysicsChinese Physics B
- 2021

Superconducting circuits based on Josephson junctions are regarded as one of the most promising technologies for the implementation of scalable quantum computers. This review presents the basic…

### Demonstration of Shor's factoring algorithm for N [Formula: see text] 21 on IBM quantum processors.

- Computer ScienceScientific reports
- 2021

This work implemented the quantum order-finding algorithm for factoring the integer 21 using only five qubits and successfully verified the presence of entanglement between the control and work register qubits, which is a necessary condition for the algorithm's speedup in general.

### Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing

- Physics, Computer Science
- 2014

The results demonstrate that Josephson quantum computing is a high-fidelity technology, with a clear path to scaling up to large-scale, fault-tolerant quantum circuits.

## References

SHOWING 1-10 OF 35 REFERENCES

### Experimental demonstration of a compiled version of Shor's algorithm with quantum entanglement.

- Physics, Computer SciencePhysical review letters
- 2007

For the first time, the core processes, coherent control, and resultant entangled states required in a full-scale implementation of Shor's powerful quantum algorithm for factoring are demonstrated in a photonic system.

### Computing prime factors using a Josephson phase-qubit architecture: 15 = 3 x 5

- Physics
- 2012

Computing prime factors using a Josephson phase-qubit architecture: 15 = 3× 5

### Demonstration of a compiled version of Shor's quantum factoring algorithm using photonic qubits.

- PhysicsPhysical review letters
- 2007

An experimental demonstration of a complied version of Shor's algorithm using four photonic qubits using a simplified linear optical network to coherently implement the quantum circuits of the modular exponential execution and semiclassical quantum Fourier transformation.

### Shor’s Quantum Factoring Algorithm on a Photonic Chip

- PhysicsScience
- 2009

The demonstration of a compiled version of Shor’s quantum factoring algorithm on an integrated waveguide silica-on-silicon chip that guides four single-photon qubits through the computation to factor 15 is reported.

### Tripartite interactions between two phase qubits and a resonant cavity

- Physics
- 2010

Micrometre-scale superconducting circuits are at present explored as the building blocks for scalable quantum information processors. In a system where two such qubits are coupled to a resonant…

### Implementing the Quantum von Neumann Architecture with Superconducting Circuits

- PhysicsScience
- 2011

A quantum central processing unit that exchanges data with a quantum random-access memory integrated on a chip, with instructions stored on a classical computer is demonstrated.

### Demonstration of two-qubit algorithms with a superconducting quantum processor

- PhysicsNature
- 2009

A two-qubit superconducting processor and the implementation of the Grover search and Deutsch–Jozsa quantum algorithms are demonstrated and the generation of highly entangled states with concurrence up to 94 per cent is allowed.

### High-fidelity gates in a single josephson qubit.

- PhysicsPhysical review letters
- 2008

A new metrology tool is introduced-- Ramsey interference error filter- that can measure the occupation probability of the state |2> which is outside the computational basis, down to 10{-4}, thereby confirming that the quantum system stays within the qubit manifold during single qubit logic operations.

### Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance

- Computer ScienceNature
- 2001

A simple, parameter-free but predictive model of decoherence effects in the authors' system is presented, which is in principle scalable to systems containing many quantum bits, but such scalability is not implied by the present work.

### State tomography of capacitively shunted phase qubits with high fidelity.

- PhysicsPhysical review letters
- 2006

A new design concept is introduced in which the capacitive element is explicitly separate from the Josephson tunnel junction for improved qubit performance and the number of two-level systems that couple to the qubit is reduced and the measurement fidelity improves to 90%.