Experimental study of Shor's factoring algorithm using the IBM Q Experience

  title={Experimental study of Shor's factoring algorithm using the IBM Q Experience},
  author={Mirko Amico and Zain Saleem and M. Kumph},
  journal={Physical Review A},
We study the results of a compiled version of Shor's factoring algorithm on the ibmqx5 superconducting chip, for the particular case of $N=15$, $21$ and $35$. The semi-classical quantum Fourier transform is used to implement the algorithm with only a small number of physical qubits and the circuits are designed to reduce the number of gates to the minimum. We use the square of the statistical overlap to give a quantitative measure of the similarity between the experimentally obtained… 

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

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.

The Present and Future of Discrete Logarithm Problems on Noisy Quantum Computers

The experiments with the ibm_kawasaki device discovered that the simplest circuit from a 2-bit DLP instance achieves a sufficiently high success probability to proclaim the experiment successful, and a near-term prediction based on required noise levels to solve some selected small DLPs and integer factoring instances is given.

Reproducing quantum experiments on NISQ computers using high level quantum programming

We execute the quantum eraser, the Elitzur-Vaidman bomb, and the Hardy’s paradox experiment using high-level programming language on a generic, gate-based superconducting quantum processor made

Experimenting quantum phenomena on NISQ computers using high level quantum programming

We execute the quantum eraser, the Elitzur–Vaidman bomb, and the Hardy’s paradox experiment using high-level programming language on a generic, gate-based superconducting quantum processor made

Prime number factorization using a spinor Bose-Einstein condensate-inspired topological quantum computer

The quantum double D(Q8) anyon model is considered as a platform to carry out a particular instance of Shor’s factorization algorithm, providing the excitation spectrum, the fusion rules, and the braid group representation, and design a circuit architecture that facilitates the computation.

Proof-of-principle demonstration of compiled Shor's algorithm using a quantum dot single-photon source.

A fully compiled version of Shor's algorithm for factoring 15 has been accomplished with a significantly reduced resource requirement that employs the four-photon cluster state that opens new applications for cluster state beyond one-way quantum computing.

A New Error-Modeling of Hardy’s Paradox for Superconducting Qubits and Its Experimental Verification

Hardy’s paradox (equivalently, Hardy’s non-locality or Hardy’s test) [Phys. Rev. Lett. 68, 2981 (1992)] is used to show non-locality without inequalities, and it has been tested several times using

Iterative Qubits Management for Quantum Index Searching in a Hybrid System

IQuCS, which aims at index searching and counting in a quantum-classical hybrid system based on Grover’s algorithm, and reduces qubits consumption by up to 66.2%.

Approaching the theoretical limit in quantum gate decomposition

It turns out that 15 and 63CNOT gates are sufficient to decompose a general 3- and 4-qubit unitary, respectively, with high numerical accuracy.

Simulation of wave-particle duality in multipath interferometers on a quantum computer

We present an architecture to investigate wave-particle duality in $N$-path interferometers on a universal quantum computer involving as low as $2{log}_{2}N$ qubits and develop a measurement scheme



Experimental realisation of Shor's quantum factoring algorithm using qubit recycling

This work demonstrates a scalable version of Shor's quantum factoring algorithm in which then qubit control register is replaced by a single qubit that is recycled n times: the total number of qubits is one third of that required in the standard protocol.

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

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.

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

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.

Shor’s Quantum Factoring Algorithm on a Photonic Chip

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.

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

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.

Implementation of the Semiclassical Quantum Fourier Transform in a Scalable System

The implementation of the semiclassical quantum Fourier transform in a system of three beryllium ion qubits confined in a segmented multizone trap incorporates the key elements of a scalable ion-trap architecture, suggesting the future capability of applying the quantum Fouriers transform to a large number of qubits as required for a useful quantum factoring algorithm.

Semiclassical Fourier transform for quantum computation.

  • GriffithsNiu
  • Physics, Computer Science
    Physical review letters
  • 1996
It is shown that the Fourier transform preceding the final measurement in Shor's algorithm for factorization on a quantum computer can be carried out in a semiclassical way by using the ``classical''

Oversimplifying quantum factoring

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.

Realization of a scalable Shor algorithm

The realization of a scalable Shor algorithm, as proposed by Kitaev, is presented, which has been realized scalably within an ion-trap quantum computer and returns the correct factors with a confidence level exceeding 99%.

Computing prime factors with a Josephson phase qubit quantum processor

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