Fetching the paper…
Reading the bibliography…
We present a novel set of reversible modular multipliers applicable to quantum computing, derived from three classical techniques: 1) traditional integer division, 2) Montgomery residue arithmetic, and 3) Barrett reduction.
Multiplication of Many-Digital Numbers by Automatic Computers
A. Karatsuba and Y. Ofman · 1962
Earlier work this paper cites.
A suggestion for a fast multiplier
C.S. Wallace · 1964
Earlier work this paper cites.
Schnelle multiplikation großer zahlen
A. Schönhage and V. Strassen · 1971
Earlier work this paper cites.
Logical reversibility of computation
C.H. Bennett · 1973
Earlier work this paper cites.
A method for obtaining digital signatures and public-key cryptosystems
R. L. Rivest, A. Shamir, and L. Adleman · 1978
Earlier work this paper cites.
Conservative logic
Edward Fredkin and Tommaso Toffoli · 1982
Earlier work this paper cites.
Modular Multiplication without Trial Division
P. L. Montgomery · 1985
Earlier work this paper cites.
Implementing the Rivest, Shamir, and Adleman public key encryption algorithm on a standard digital signal processor
Paul Barrett · 1987
Earlier work this paper cites.
Algorithms for Quantum Computation: Discrete Logarithms and Factoring
P. W. Shor · 1994
Earlier work this paper cites.
Efficient networks for quantum factoring
David Beckman, Amalavoyal N. Chari, Srikrishna Devabhaktuni, and John Preskill · 1996
Earlier work this paper cites.
Quantum networks for elementary arithmetic operations
Vlatko Vedral, Adriano Barenco, and Artur Ekert · 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.
Handbook of Applied Cryptography
Alfred J. Menezes, Scott A. Vanstone, and Paul C. Van Oorschot · 1996
Cited alongside, same era.
Error correcting codes in quantum theory
A. M. Steane · 1996
Cited alongside, same era.
Fast versions of shor’s quantum factoring algorithm
Christof Zalka · 1998
Cited alongside, same era.
Quantum carry-save arithmetic
Phil Gossett · 1998
Cited alongside, same era.
Parallel Quantum Computation and Quantum Codes
Cristopher Moore and Martin Nilsson · 1998
Cited alongside, same era.
Addition on a quantum computer
Thomas G. Draper · 2000
Cited alongside, same era.
Fast parallel circuits for the quantum Fourier transform
R. Cleve and J. Watrous · 2000
Digital Arithmetic
Milos D. Ercegovac and Tomas Lang · 2004
Later among the works it cites.
Fast quantum modular exponentiation
Rodney Van Meter and Kohei M. Itoh · 2005
Later among the works it cites.
Shor’s algorithm on a nearest-neighbor machine
Samuel A. Kutin · 2006
Later among the works it cites.
A logarithmic-depth quantum carry-lookahead adder
Thomas G. Draper, Samuel A. Kutin, Eric M. Rains, and Krysta M. Svore · 2006
Later among the works it cites.
Reversible karatsuba’s algorithm
Luis Antonio Brasil Kowada, Renato Portugal, and Celina Miraglia Herrera de Figueiredo · 2006
Later among the works it cites.
Polynomial-time quantum algorithm for the simulation of chemical dynamics
Ivan Kassal, Stephen P Jordan, Peter J Love, Masoud Mohseni, and Alán Aspuru-Guzik · 2008
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Circuit for Shor’s algorithm using 2n+3 qubits
Stephane Beauregard · 2002
Cited alongside, same era.
Quantum Computation and Quantum Information
M. A. Nielson and I L Chuang · 2002
Cited alongside, same era.
Shor’s discrete logarithm quantum algorithm for elliptic curves
John Proos and Christof Zalka · 2003
Cited alongside, same era.
Implementation of shor’s algorithm on a linear nearest neighbour qubit array
A. G. Fowler, S. J. Devitt, and L. C. L. Hollenberg · 2004
Cited alongside, same era.
A new quantum ripple-carry addition circuit
Steven A. Cuccaro, Thomas G. Draper, Samuel A. Kutin, and David Petrie Moulton · 2004
Cited alongside, same era.
Faster Integer Multiplication
Martin Fürer · 2009
Later among the works it cites.
Adding control to arbitrary unknown quantum operations
Xiao-Qi Zhou, Timothy C. Ralph, Pruet Kalasuwan, Mian Zhang, Alberto Peruzzo, Benjamin P. Lanyon, and Jeremy L. O’Brien · 2011
Later among the works it cites.
An open-system quantum simulator with trapped ions
Julio T Barreiro, Markus Müller, Philipp Schindler, Daniel Nigg, Thomas Monz, Michael Chwalla, Markus Hennrich, Christian F Roos, Peter Zoller, and Rainer Blatt · 2011
Later among the works it cites.
A 2d nearest-neighbor quantum architecture for factoring in polylogarithmic depth
Paul Pham and Krysta M. Svore · 2013
Later among the works it cites.
Fast quantum modular exponentiation architecture for shor’s factoring algorithm
Archimedes Pavlidis and Dimitris Gizopoulos · 2014
Later among the works it cites.
Optimal ancilla-free Clifford+T approximation of z-rotations
N. J. Ross and P. Selinger · 2014
Later among the works it cites.