Fetching the paper…
Reading the bibliography…
We report optimal and asymptotically optimal reversible circuits composed of NOT, CNOT, and Toffoli (NCT) gates, keeping the count by the subsets of the gate types used.
E. I. Nechiporuk, “ On the complexity of schemes in some bases containing nontrivial elements with zero weights
1962
Earlier work this paper cites.
O. B. Lupanov. “ On circuits of functional elements with delays
1970
Earlier work this paper cites.
C. H. Bennett, “ Logical reversibility of computation
1973
Earlier work this paper cites.
A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. Smolin, and H. Weinfurter, “ Elementary gates for quantum computation
1995
Earlier work this paper cites.
M. Nielsen and I. Chuang, Quantum Computation and Quantum Information
2000
Earlier work this paper cites.
E. Kashefi, A. Kent, V. Vedral, and K. Banaszek, “ A comparison of quantum oracles
2002
Earlier work this paper cites.
D. M. Miller, D. Maslov, and G. W. Dueck, “ A transformation based algorithm for reversible logic synthesis
2003
Cited alongside, same era.
V. V. Shende, A. K. Prasad, I. L. Markov, and J. P. Hayes, “ Synthesis of reversible logic circuits
2003
Cited alongside, same era.
S. Bravyi and A. Kitaev, “ Universal quantum computation with ideal Clifford gates and noisy ancillas
2005
Cited alongside, same era.
D. Maslov, D. M. Miller, and G. W. Dueck, “ Techniques for the synthesis of reversible Toffoli networks
2007
Cited alongside, same era.
V. V. Shende and I. L. Markov, “ On the CNOT-cost of Toffoli gates
2009
Cited alongside, same era.
2010
Later among the works it cites.
2013
Later among the works it cites.
C. Jones, “ Novel constructions for the fault-tolerant Toffoli gate
2013
Later among the works it cites.
2015
Later among the works it cites.
M. Saeedi, private communication, January 23, 2016
2016
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…