Exact synthesis of elementary quantum gate circuits

Journal of Multiple-Valued Logic and Soft Computing

Volumn 15, Issue 4, 2009, Pages 283-300

  Grobe, 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

Boolean satisfiability; Multi valued encoding; Quantum circuits; Reversible logic; Synthesis

Indexed keywords

BOOLEAN SATISFIABILITY; MULTI VALUED ENCODING; QUANTUM CIRCUITS; REVERSIBLE LOGIC; SYNTHESIS;

ALGORITHMS; BOOLEAN FUNCTIONS; ENCODING (SYMBOLS); LOGIC GATES; QUANTUM COMPUTERS; QUANTUM ELECTRONICS; QUANTUM OPTICS; SET THEORY;

LOGIC CIRCUITS;

EID: 70449394629     PISSN: 15423980     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (28)

1. A. Abdollahi and M. Pedram. Analysis and synthesis of quantum circuits by using quantum decision diagrams. In Design, Automation and Test in Europe, 2006, pp. 317-322.
2. Adriano Barenco, Charles H. Bennett, Richard Cleve, David P. DiVincenzo, Norman Margolus, Peter Shor, Tycho Sleator, John A. Smolin and Harald Weinfurter. Elementary gates for quantum computation. Phys. Rev. A 52(5) (1995), 3457-3467.
3. M. Davis, G. Logeman and D. Loveland. A machine program for theorem proving. Comm. of the ACM 5 (1962), 394-397.
4. R. Drechsler and W. Günther. Towards One-Path Synthesis. Kluwer Academic Publishers, 2002.
5. N. Eén and N. Sörensson. An extensible SAT solver. In SAT, vol.2919 of LNCS, 2004, pp. 502-518.
6. Niklas Eén and Armin Biere. Effective preprocessing in SAT through variable and clause elimination. In SAT, 2005, pp. 61-75.
7. E. F. Fredkin and T. Toffoli. Conservative logic. International Journal of Theoretical Physics 21(3/4) (1982) 219-253.
8. D. Grobe, X. Chen, G. W. Dueck and R. Drechsler. Exact SAT-based Toffoli network synthesis. In Great Lakes Symp. VLSI, 2007, pp. 96-101.
9. D. Grobe, R. Wille, G. W. Dueck and R. Drechsler. Exact synthesis of elementary quantum gate circuits for reversible functions with don't cares. In Int'l Symp. on Multi-Valued Logic, 2008, pp. 214-219.
10. P. Gupta, A. Agrawal and N. K. Jha. An algorithm for synthesis of reversible logic circuits. IEEE Trans. on CAD of Integrated Circuits and Systems 25(11) (2006), 2317-2330.
11. William N. N. Hung, Xiaoyu Song, Guowu Yang, Jin Yang and Marek 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) (2006), 1652-1663.
12. R. Landauer. Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 5 (1961), 183.
13. J. P. Marques-Silva and K. A. Sakallah. GRASP: A search algorithm for propositional satisfiability. IEEE Trans. on Comp. 48(5) (1999), 506-521.
14. D. Maslov and D. M. Miller. Comparison of the Cost Metrics for Reversible and Quantum Logic Synthesis. ArXiv Quantum Physics e-prints, 2005.
15. D. Maslov, C. Young, D. Michael Miller and G. W. Dueck. Quantum circuit simplification using templates. In Design, Automation and Test in Europe, 2005, pp. 1208-1213. (Pubitemid 44172174)
16. Dmitri Maslov and Gerhard W. Dueck. Reversible cascades with minimal garbage. IEEE Trans. on CAD of Integrated Circuits and Systems 23(11) (2004), 1497-1509.
17. Dmitri Maslov, Gerhard W. Dueck and D. Michael Miller. Toffoli network synthesis with templates. IEEE Trans. on CAD of Integrated Circuits and Systems 24(6) (2005), 807-817.
18. K. L. McMillan. Applying SAT methods in unbounded symbolic model checking. In Computer Aided Verification, volume 2404 of LNCS, 2002, pp. 250-264.
19. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang and S. Malik. Chaff: Engineering an efficient SAT solver. In Design Automation Conf., 2001, pp. 530-535.
20. M. Nielsen and I. Chuang. Quantum Computation and Quantum Information. Cambridge Univ. Press, 2000.
21. A. Peres. Reversible logic and quantum computers. Phys. Rev. A (32) (1985), 3266-3276.
22. Vivek V. Shende, Aditya K. Prasad, Igor L. Markov and John P. Hayes. Synthesis of reversible logic circuits. IEEE Trans. on CAD ofIntegrated Circuits and Systems 22(6) (2003), 710-722.
23. John A. Smolin and David P. DiVincenzo. Five two-bit quantum gates are sufficient to implement the quantum fredkin gate. Phys. Rev. A 53(4) (1996), 2855-2856.
24. T. Toffoli. Reversible computing. In W. de Bakker and J. van Leeuwen, editors, Automata, Languages and Programming. Springer, 1980, p. 632. Technical Memo MIT/LCS/TM-151, MIT Lab. for Comput. Sci.
25. G. S. Tseytin. On the complexity of derivation in propositional calculus. In A. O. Slisenko, editor, Studies in Constructive Mathematics and Mathematical Logic II,vol.8ofSeminars in Mathematics: Steklov Mathem. Inst., 1970, pp. 115-125.
26. R. Wille and D. Grobe. Fast exact Toffoli network synthesis of reversible logic. In Int'l Conf. on CAD, 2007, pp. 60-64.
27. R. Wille, D. Grobe, 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, pp. 220-225. RevLib is available at http://www.revlib.org.
28. R. Wille, H. M. Le, G. W. Dueck and D. Grobe. Quantified synthesis of reversible logic. In Design, Automation and Test in Europe, 2008, pp. 1015-1020.