Quantified synthesis of reversible logic

Proceedings -Design, Automation and Test in Europe, DATE

Volumn , Issue , 2008, Pages 1015-1020

  Wille, Robert ^a   Le, Hoang M ^a   Dueck, Gerhard W ^b   Große, Daniel ^a  

^a UNIVERSITY OF BREMEN   (Germany)

^b UNIVERSITY OF NEW BRUNSWICK   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY DECISION DIAGRAMS; BOOLEAN ALGEBRA; DATA STRUCTURES; DECISION THEORY; EMBEDDED SYSTEMS; FILE ORGANIZATION; INDUSTRIAL ENGINEERING; LOGIC GATES; OPTICAL DATA PROCESSING; QUANTUM COMPUTERS; TESTING;

BOOLEAN SATISFIABILITY; EXACT SYNTHESIS; GATE LIBRARIES; LOW-POWER DESIGNS; OPTICAL COMPUTING; PROBLEM FORMULATION; QBF SOLVERS; QUANTIFIED BOOLEAN FORMULA; QUANTUM COMPUTING; QUANTUM COSTS; RESEARCH AREA; REVERSIBLE LOGICS; SATISFIABILITY; SINGLE-STEP; SYNTHESIS PROBLEMS;

BOOLEAN FUNCTIONS;

EID: 49749148011     PISSN: 15301591     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DATE.2008.4484814     Document Type: Conference Paper

References (24)

1. A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVinchenzo, N. Margolus, P. Shor, T. Sleator, J. A. Smolin, and H. Weinfurter. Elementary gates for quantum computation. APS Physical Review A, 52:3457-3467, 1995.
2. M. Benedetti. sKizzo: a QBF Decision Procedure based on Propositional Skolemization and Symbolic Reasoning, Tech.Rep. 04-11-03, ITC-irst, 2004.
3. M. Benedetti. sKizzo: a Suite to Evaluate and Certify QBFs. In Proc. of 20th International Conference on Automated Deduction (CADE05), 2005.
4. C. H. Bennett. Logical reversibility of computation. IBM J. Res. Dev, 17(6):525-532, 1973.
5. A. Biere. Resolve and expand. 7th Intl. Conf. on Theory and Applications of Satisfiability Testing (SAT'04), 3542, 2005.
6. R. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Trans. on Comp., 35(8):677-691, 1986.
7. N. Eén and N. Sörensson. An extensible SAT solver. In SAT 2003, volume 2919 of LNCS, pages 502-518, 2004.
8. E. F. Fredkin and T. Toffoli. Conservative logic. International Journal of Theoretical Physics, 21(3/4):219-253, 1982.
9. D. Große, X. Chen, G. W. Dueck, and R. Drechsler. Exact SAT-based Toffoli network synthesis. In Great Lakes Symp. VLSI, pages 96-101, 2007.
10. P. Gupta, A. Agrawal, and N. Jha. An algorithm for synthesis of reversible logic circuits. IEEE Trans. on CAD, 25(11):2317-2330, 2006.
11. W. Hung, X. Song, G. Yang, J. Yang, and M. Perkowski. Optimal synthesis of multiple output Boolean functions using a set of quantum gates by symbolic reachability analysis. IEEE Trans. on CAD, 25(9):1652-1663, 2006.
12. D. Maslov and G. W. Dueck. Reversible cascades with minimal garbage. IEEE Trans. on CAD, 23(11):1497-1509, 2004.
13. D. M. Miller, D. Maslov, and G. W. Dueck. A transformation based algorithm for reversible logic synthesis. In Design Automation Conf., pages 318-323, 2003.
14. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Design Automation Conf., pages 530-535, 2001.
15. M. A. Nielsen and I. Chuang. Quantum computation and quantum information. Cambridge University Press, 2000.
16. A. Peres. Reversible logic and quantum computers. Phys. Rev. A, (32):3266-3276, 1985.
17. V. Shende, A. Prasad, I. Markov, and J. Hayes. Reversible logic circuit synthesis. In Int'l Conf. on CAD, pages 353-360, 2002.
18. F. Somenzi. CUDD: CU Decision Diagram Package Release 2.4.1. University of Colorado at Boulder, 2005.
19. T. Toffoli. Reversible computing. In W. de Bakker and J. van Leeuwen, editors, Automata, Languages and Programming, page 632. Springer, 1980. Technical Memo MIT/LCS/TM-151, MIT Lab. for Comput. Sci.
20. G. Tseitin. On the complexity of derivation in propositional calculus. In Studies in Constructive Mathematics and Mathematical Logic, Part 2, pages 115-125, 1968.
21. R. Wille, G. Fey, D. Große, S. Eggersglüß, and R. Drechsler. Sword: A sat like prover using word level information. In VLSI-SOC, pages 88-93, 2007.
22. R. Wille and D. Große. Fast exact Toffoli network synthesis of reversible logic. In Int'l Conf. on CAD, pages 60-64, 2007.
23. R. Wille, D. Große, L. Teuber, G. W. Dueck, and R. Drechsler. RevLib: An Online Resource for Reversible Functions and Reversible Circuits (to be published). RevLib is avaiable at http://www.revlib.org.
24. G. Yang, X. Song, W. N. N. Hung, and M. A. Perkowski. Fast synthesis of exact minimal reversible circuits using group theory. In ASP Design Automation Conf., pages 1002-1005, 2005.