Fetching the paper…
Reading the bibliography…
We describe an implementation of Shor's quantum algorithm to factor n-bit integers using only 2n+2 qubits.
Algorithms for quantum computation: Discrete logarithms and factoring
Peter W Shor · 1994
Earlier work this paper cites.
Elementary gates for quantum computation
Adriano Barenco, Charles H Bennett, Richard Cleve, David P DiVincenzo, Norman Margolus, Peter Shor, Tycho Sleator, John A Smolin, and Harald Weinfurter · 1995
Earlier work this paper cites.
Semiclassical Fourier transform for quantum computation
Robert B Griffiths and Chi-Sheng Niu · 1996
Earlier work this paper cites.
Approximate quantum Fourier transform and decoherence
Adriano Barenco, Artur Ekert, Kalle-Antti Suominen, and Päivi Törmä · 1996
Earlier work this paper cites.
Addition on a quantum computer
Thomas G Draper · 2000
Earlier work this paper cites.
Fast parallel circuits for the quantum Fourier transform
Richard Cleve and John Watrous · 2000
Earlier work this paper cites.
Circuit for Shor’s algorithm using 2 n + 3 2n{+}3 qubits
Stephane Beauregard · 2003
Earlier work this paper cites.
A new quantum ripple-carry addition circuit
Steven A Cuccaro, Thomas G Draper, Samuel A Kutin, and David Petrie Moulton · 2004
Earlier work this paper cites.
Fast quantum modular exponentiation
Rodney van Meter and Kohei M. Itoh · 2005
Cited alongside, same era.
A quantum circuit for Shor’s factoring algorithm using 2 n + 2 2n{+}2 qubits
Yasuhiro Takahashi and Noboru Kunihiro · 2006
Cited alongside, same era.
Shor’s algorithm on a nearest-neighbor machine
Samuel A Kutin · 2006
Cited alongside, same era.
Quantum addition circuits and unbounded fan-out
Yasuhiro Takahashi, Seiichiro Tani, and Noboru Kunihiro · 2009
Cited alongside, same era.
Novel constructions for the fault-tolerant Toffoli gate
N. Cody Jones · 2013
Cited alongside, same era.
Efficient synthesis of probabilistic quantum circuits with fallback
Alex Bocharov, Martin Roetteler, and Krysta M. Svore · 2015
Later among the works it cites.
StackExchange: Creating bigger controlled nots from single qubit, Toffoli, and CNOT gates, without workspace
Craig Gidney · 2015
Later among the works it cites.
Practical approximation of single-qubit unitaries by single-qubit quantum Clifford and T T circuits
Vadym Kliuchnikov, Dmitri Maslov, and Michele Mosca · 2016
Closest in time.
Optimal ancilla-free Clifford + T +T approximation of z -rotations
Neil J. Ross and Peter Selinger · 2016
Closest in time.
High performance emulation of quantum circuits
Thomas Häner, Damian S. Steiger, Mikhail Smelyanskiy, and Matthias Troyer · 2016
Closest in time.
qHiPSTER: the quantum high performance software testing environment
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Dave Wecker and Krysta M Svore · 2014
Cited alongside, same era.
Efficient Clifford + T +T approximation of single-qubit operators
Peter Selinger · 2015
Cited alongside, same era.
Efficient synthesis of universal Repeat-Until-Success circuits
Alex Bocharov, Martin Roetteler, and Krysta M. Svore · 2015
Cited alongside, same era.
Mikhail Smelyanskiy, Nicolas PD Sawaya, and Alán Aspuru-Guzik · 2016
Closest in time.
Electronic Design Automation for Integrated Circuits Handbook
Luciano Lavagno, Igor L. Markov, Grant Martin, and Louis K. Scheffer, editors · 2016
Closest in time.