Fetching the paper…
Reading the bibliography…
We first show how to construct an O(n)-depth O(n)-size quantum circuit for addition of two n-bit binary numbers with no ancillary qubits.
A. K. Chandra, S. Fortune, and R. Lipton (1983), Unbounded fan-in circuits and associative functions
1983
Earlier work this paper cites.
1983
Earlier work this paper cites.
N. Pippenger (1987), The complexity of computations by networks
1987
Earlier work this paper cites.
P. W. Shor (1994), Algorithms for quantum computation: discrete logarithms and factoring
1994
Earlier work this paper cites.
A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. A. Smolin, and H. Weinfurter (1995), Elementary gates for quantum computation
1995
Earlier work this paper cites.
V. Vedral, A. Barenco, and A. Ekert (1996), Quantum networks for elementary arithmetic operations
1996
Earlier work this paper cites.
C. Zalka (1998), Fast versions of Shor’s quantum factoring algorithm
1998
Earlier work this paper cites.
T. G. Draper (2000), Addition on a quantum computer
2000
Cited alongside, same era.
M. A. Nielsen and I. L. Chuang (2000), Quantum Computation and Quantum Information
2000
Cited alongside, same era.
F. Green, S. Homer, C. Moore, and C. Pollett (2002), Counting, fanout, and the complexity of quantum ACC
2002
Cited alongside, same era.
S. Beauregard (2003), Circuit for Shor’s algorithm using 2 n + 3 2n+3 qubits
2003
Cited alongside, same era.
J. Proos and C. Zalka (2003), Shor’s discrete logarithm quantum algorithm for elliptic curves
2003
Cited alongside, same era.
D. Hankerson, A. Menezes, and S. Vanstone (2003), Guide to Elliptic Curve Cryptography
2003
Cited alongside, same era.
P. Høyer and R. Špalek (2005), Quantum fan-out is powerful
2005
Later among the works it cites.
Y. Takahashi and N. Kunihiro (2005), A linear-size quantum circuit for addition with no ancillary qubits
2005
Later among the works it cites.
S. A. Cuccaro, T. G. Draper, S. A. Kutin, and D. P. Moulton (2005), A new quantum ripple-carry addition circuit
2005
Later among the works it cites.
Y. Takahashi and N. Kunihiro (2006), A quantum circuit for Shor’s factoring algorithm using 2 n + 2 2n+2 qubits
2006
Later among the works it cites.
T. G. Draper, S. A. Kutin, E. M. Rains, and K. M. Svore (2006), A logarithmic-depth quantum carry-lookahead adder
2006
Later among the works it cites.
M. Fang, S. Fenner, F. Green, S. Homer, and Y. Zhang (2006), Quantum lower bounds for fanout
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. G. Fowler, S. J. Devitt, and L. C. L. Hollenberg (2004), Implementation of Shor’s algorithm on a linear nearest neighbour qubit array
2004
Cited alongside, same era.
2006
Later among the works it cites.
Y. Takahashi and N. Kunihiro (2008), A fast quantum circuit for addition with few qubits
2008
Later among the works it cites.