Fetching the paper…
Reading the bibliography…
We develop a framework for resource efficient compilation of higher-level programs into lower-level reversible circuits.
“Logical reversibility of computation,”
C. H. Bennett, · 1973
Earlier work this paper cites.
Computers and Intractability: A Guide to the Theory of NP-Completeness
M. R. Garey and D. S. Johnson, · 1979
Earlier work this paper cites.
“Time/space trade-offs for reversible computation,”
C. H. Bennett, · 1989
Earlier work this paper cites.
“A note on Bennett’s space-time tradeoff for reversible computation,”
R. Y. Levine and A. T. Sherman, · 1990
Earlier work this paper cites.
Computer architecture: a quantitative approach
J. L. Hennessey and D. A. Patterson, · 1990
Earlier work this paper cites.
Available at https://www.ece.cmu.edu/ ee760/760docs/blif.pdf
“Berkeley Logic Interchange Format (BLIF),” · 1992
Earlier work this paper cites.
“A fast quantum mechanical algorithm for database search,”
L. Grover, · 1996
Earlier work this paper cites.
“Efficient networks for quantum factoring,”
D. Beckman, A. N. Chari, S. Devabhaktuni, and J. Preskill, · 1996
Earlier work this paper cites.
“Approximation algorithms for the k k -clique covering problem,”
O. Goldschmidt, D. S. Hochbaum, C. A. J. Hurkens, and G. Yu, · 1996
Earlier work this paper cites.
“Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,”
P. W. Shor, · 1997
Earlier work this paper cites.
Compiler design and implementation
S. S. Muchnick, · 1997
Earlier work this paper cites.
Handbook of Applied Cryptography
A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone, · 1997
Earlier work this paper cites.
Quantum programming in QCL
B. Ömer, · 2000
Earlier work this paper cites.
Quantum Computation and Quantum Information
M. A. Nielsen and I. L. Chuang, · 2000
Earlier work this paper cites.
“Reversible space equals deterministic space,”
K. J. Lange, P. McKenzie, and A. Tapp, · 2000
Earlier work this paper cites.
“Time and space bounds for reversible simulation,”
H. Buhrman, J. Tromp, and P. M. B Vitányi, · 2001
Earlier work this paper cites.
See also the Wikipedia entry http://en.wikipedia.org/wiki/SHA-2
“Federal information processing standards publication 180-2,” 2002, · 2002
Earlier work this paper cites.
“A transformation based algorithm for reversible logic synthesis,”
D. M. Miller, D. Maslov, and G. W. Dueck, · 2003
Cited alongside, same era.
“A new quantum ripple-carry addition circuit,”
S. A. Cuccaro, Th. G Draper, S. A. Kutin, and D. P. Moulton, · 2004
Cited alongside, same era.
“Toffoli network synthesis with templates,”
D. Maslov, G. W. Dueck, and D. M. Miller, · 2005
Cited alongside, same era.
“A logarithmic-depth quantum carry-lookahead adder,”
Th. G Draper, S. A Kutin, E. M Rains, and K. M Svore, · 2006
Cited alongside, same era.
“Reversible karatsuba’s algorithm,”
L. A. B. Kowada, R. Portugal, and C. M. H. de Figueiredo, · 2006
Cited alongside, same era.
“A reversible programming language and its invertible self-interpreter,”
T. Yokoyama and R. Glück, · 2007
Cited alongside, same era.
“A functional language for describing reversible logic,”
M. K. Thomsen, · 2012
Later among the works it cites.
“A study of optimal 4-bit reversible Toffoli circuits and their synthesis,”
O. Golubitsky and D. Maslov, · 2012
Later among the works it cites.
Expert F # \# 3.0
D. Syme, A. Granicz, and A. Cisternino, · 2012
Later among the works it cites.
“An introduction to quantum programming in Quipper,”
A. S. Green, P. LeFanu Lumsdaine, N. J. Ross, P. Selinger, and B. Valiron, · 2013
Later among the works it cites.
“Quipper: a scalable quantum programming language,”
A. S. Green, P. LeFanu Lumsdaine, N. J. Ross, P. Selinger, and B. Valiron, · 2013
Later among the works it cites.
“QuaFL: A typed DSL for quantum programming,”
A. Lapets, M. da Silva, M. Thome, A. Adler, J. Beal, and M. Roetteler, · 2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“Techniques for the synthesis of reversible Toffoli networks,”
D. Maslov, D. M. Miller, and G. W. Dueck, · 2007
Cited alongside, same era.
Compilers: Principles, Techniques, and Tools
A. V. Aho, M. S. Lam, R. Sethi, and J. D. Ullman, · 2007
Cited alongside, same era.
“Principles of a reversible programming language,”
T. Yokoyama, H. B. Axelsen, and R. Glück, · 2008
Cited alongside, same era.
“Reversible flowchart languages and the structured reversible program theorem,”
T. Yokoyama, H. B. Axelsen, and R. Glück, · 2008
Cited alongside, same era.
“Boolean factoring and decomposition of logic networks,”
A. Mishchenko, R. Brayton, and S. Chatterjee, · 2008
Cited alongside, same era.
“The quantum IO monad,”
Th. Altenkirch and A. S. Green, · 2009
Cited alongside, same era.
“Abstract resource cost derivations for logical quantum circuit descriptions,”
A. Lapets and M. Roetteler, · 2013
Later among the works it cites.
“Reversible logic synthesis of k k -input, m m -output lookup tables,”
A. Shafaei, M. Saeedi, and M. Pedram, · 2013
Later among the works it cites.
“Synthesis and optimization of reversible circuits - a survey,”
M. Saeedi and I. L. Markov, · 2013
Later among the works it cites.
Pebble games and complexity
S. M. Chan, · 2013
Later among the works it cites.
“Limits on fundamental limits to computation,”
I. L. Markov, · 2014
Later among the works it cites.
“Exponential improvement in precision for simulating sparse Hamiltonians,”
Berry D. W., A. M. Childs, R. Cleve, R. Kothari, and R. D. Somma, · 2014
Later among the works it cites.
Introduction to Reversible Computing
K. S. Perumalla, · 2014
Later among the works it cites.
“RMDDS: Reed-Muller decision diagram synthesis of reversible logic circuits,”
C.-C. Lin and N. K. Jha, · 2014
Later among the works it cites.
“Compiler management of communication and parallelism for quantum computation,”
J. Heckey, S. Patil, A. Javadi Abhari, A. Holmes, D. Kudrow, K. R. Brown, D. Franklin, F. T. Chong, and M. Martonosi, · 2015
Closest in time.
“Quantum circuits for G F ( 2 n ) GF(2^{n}) -multiplication with subquadratic gate count,”
K. Shepley and R. Steinwandt, · 2015
Closest in time.