Exact synthesis of elementary quantum gate circuits for reversible functions with don't cares

Proceedings of The International Symposium on Multiple-Valued Logic

Volumn , Issue , 2008, Pages 214-219

  Große, Daniel ^a   Wille, Robert ^a   Dueck, Gerhard W ^b   Drechsler, Rolf ^a  

^a UNIVERSITY OF BREMEN   (Germany)

^b UNIVERSITY OF NEW BRUNSWICK   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; LOGIC GATES; MANY VALUED LOGICS; QUANTUM COMPUTERS; QUANTUM ELECTRONICS; QUANTUM OPTICS; QUANTUM THEORY;

EXACT SYNTHESIS; INTERNATIONAL SYMPOSIUM; MULTIPLE VALUED LOGICS; QUANTUM GATE;

SET THEORY;

EID: 50449107078     PISSN: 0195623X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISMVL.2008.42     Document Type: Conference Paper

References (24)

1. A. Abdollahi and M. Pedram. Analysis and synthesis of quantum circuits by using quantum decision diagrams. In Design, Automation and Test in Europe, pages 317-322, 2006.
2. A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. A. Smolin, and H. Weinfurter. Elementary gates for quantum computation. Phys. Rev. A, 52(5):3457-3467, 1995.
3. M. Davis, G. Logeman, and D. Loveland. A machine program for theorem proving. Comm. of the ACM, 5:394-397, 1962.
4. R. Drechsler and W. Günther. Towards One-Path Synthesis. Kluwer Academic Publishers, 2002.
5. N. Eén and A. Biere. Effective preprocessing in SAT through variable and clause elimination. In SAT, pages 61-75, 2005.
6. N. Eén and N. Sörensson. An extensible SAT solver. In SAT, volume 2919 of LNCS, pages 502-518, 2004.
7. 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.
8. P. Gupta, A. Agrawal, and N. Jha. An algorithm for synthesis of reversible logic circuits. IEEE Trans. on CAD of Integrated Circuits and Systems, 25(11):2317-2330, 2006.
9. W. N. N. Hung, X. Song, G. Yang, J. Yang, and M. A. 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.
10. J. Marques-Silva and K. Sakallah. GRASP: A search algorithm for propositional satisfiability. IEEE Trans. on Comp., 48(5):506-521, 1999.
11. D. Maslov and G.W. Dueck. Reversible cascades with minimal garbage. IEEE Trans. on CAD of Integrated Circuits and Systems, 23(11):1497-1509, 2004.
12. D. Maslov, G. W. Dueck, and D. M. Miller. Toffoli network synthesis with templates. IEEE Trans. on CAD of Integrated Circuits and Systems, 24(6):807-817, 2005.
13. D. Maslov and D. M. Miller. Comparison of the Cost Metrics for Reversible and Quantum Logic Synthesis. ArXiv Quantum Physics e-prints, 2005.
14. D. Maslov, C. Young, D. M. Miller, and G. W. Dueck. Quantum circuit simplification using templates. In Design, Automation and Test in Europe, pages 1208-1213, 2005.
15. K. L. McMillan. Applying SAT methods in unbounded symbolic model checking. In Computer Aided Verification, volume 2404 of LNCS, pages 250-264, 2002.
16. 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.
17. M. Nielsen and I. Chuang. Quantum Computation and Quantum Information. Cambridge Univ. Press, 2000.
18. V. V. Shende, A. K. Prasad, I. L. Markov, and J. P. Hayes. Synthesis of reversible logic circuits. IEEE Trans. on CAD of Integrated Circuits and Systems, 22(6):710-722, 2003.
19. J. A. Smolin and D. P. DiVincenzo. Five two-bit quantum gates are sufficient to implement the quantum fredkin gate. Phys. Rev. A, 53(4):2855-2856, 1996.
20. T. Toffoli. Reversible computing. In ICALP, pages 632-644, 1980.
21. G. S. Tseytin. On the complexity of derivation in propositional calculus. In A. O. Slisenko, editor, Studies in Constructive Mathematics and Mathematical Logic II, volume 8 of Seminars in Mathematics: Steklov Mathem. Inst., pages 115-125. 1970.
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. In Int'l Symp. on Multi-Valued Logic, 2008. RebLiv is available at http://www.revlib.org.
24. R. Wille, H. M. Le, G. W. Dueck, and D. Große. Quantified synthesis of reversible logic. In Design, Automation and Test in Europe, 2008.