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

  title={Experimental realisation of Shor's quantum factoring algorithm using qubit recycling},
  author={Enrique Martin-Lopez and Anthony Laing and Thomas Lawson and Roberto Alvarez and X.-Q Zhou and Jeremy Lloyd O'Brien},
  journal={2013 Conference on Lasers \& Electro-Optics Europe \& International Quantum Electronics Conference CLEO EUROPE/IQEC},
  • E. Martin-Lopez, A. Laing, J. O'Brien
  • Published 17 November 2011
  • Physics, Computer Science
  • 2013 Conference on Lasers & Electro-Optics Europe & International Quantum Electronics Conference CLEO EUROPE/IQEC
Quantum algorithms are computational routines that exploit quantum mechanics to solve problems exponentially faster than the best classical algorithms. Shor's quantum factoring algorithm is a key example and the prime motivator in the international effort to realise a quantum computer. However, due to the large number of resources required, to date, there have been only four small scale demonstrations. Here we address this resource demand and demonstrate a scalable version of Shor's algorithm… 
Using Shor's algorithm on near term Quantum computers: a reduced version
This work introduces a reduced version of Shor’s algorithm that proposes a step forward in increasing the range of numbers that can be factorized on noisy Quantum devices and finds noteworthy results in most cases.
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.
Experimental superposition of orders of quantum gates
This work experimentally demonstrates the creation of the required superposition of gate orders by using additional degrees of freedom of the photons encoding qubits, which could allow quantum algorithms to be implemented with an efficiency unlikely to be achieved on a fixed-gate-order quantum computer.
Demonstration of a small programmable quantum computer with atomic qubits
A five-qubit trapped-ion quantum computer that can be programmed in software to implement arbitrary quantum algorithms by executing any sequence of universal quantum logic gates, which provides the flexibility to implement a variety of algorithms without altering the hardware.
Variational Quantum Factoring
The proposed variational quantum factoring (VQF) algorithm starts by simplifying equations over Boolean variables in a preprocessing step to reduce the number of qubits needed for the Hamiltonian, and seeks an approximate ground state of the resulting Ising Hamiltonian by training variational circuits using the quantum approximate optimization algorithm (QAOA).
Pretending to factor large numbers on a quantum computer
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.
Simplified Factoring Algorithms for Validating Small-Scale Quantum Information Processing Technologies
This work proposes a different verification scheme based on compiled versions of Shor's factoring algorithm that may be extended to large circuits in the future and demonstrates that an additional layer of compilation can be added using classical operations, that will reduce the number of qubits and gates needed in a given compiled circuit.
Streamlining Shor's algorithm for potential hardware savings
We constructed a virtual quantum computer by running a complete, scaling, quantum-gate\char21{}by\char21{}quantum-gate implementation of Shor's algorithm on a 128-core classical cluster computer. In
A quantum Fredkin gate
The first quantum Fredkin gate is demonstrated and used to implement small-scale algorithms and produce high-fidelity GHZ states, and paves the way for larger controlled circuits to be realized efficiently.
A quantum information processor with trapped ions
This work presents a small-scale quantum information processor based on a string of 40Ca+ ions confined in a macroscopic linear Paul trap and reviews the set of operations which includes non-coherent operations allowing us to realize arbitrary Markovian processes.


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.
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 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.
Efficient networks for quantum factoring.
The number of memory quantum bits (qubits) and the number of operations required to perform factorization, using the algorithm suggested by Shor are estimated.
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.
Adding control to arbitrary unknown quantum operations
An architecture-independent technique is developed and demonstrated that simplifies adding control qubits to arbitrary quantum operations—a requirement in many quantum algorithms, simulations and metrology, and is demonstrated in a photonic system.
A scheme for efficient quantum computation with linear optics
It is shown that efficient quantum computation is possible using only beam splitters, phase shifters, single photon sources and photo-detectors and are robust against errors from photon loss and detector inefficiency.
Demonstration of an all-optical quantum controlled-NOT gate
An unambiguous experimental demonstration and comprehensive characterization of quantum CNOT operation in an optical system that produces all four entangled Bell states as a function of only the input qubits' logical values, for a single operating condition of the gate.
Quantum Computers
This research paper gives an overview of quantum computers – description of their operation, differences between quantum and silicon computers, major construction problems of a quantum computer and
High-speed linear optics quantum computing using active feed-forward
It is demonstrated that, for a perfect cluster state and no photon loss, the one-way quantum computation scheme would operate with good fidelity and that the feed-forward components function with very high speed and low error for detected photons.