Optimal synthesis of multiple output Boolean functions using a set of quantum gates by symbolic reachability analysis
暂无分享,去创建一个
Guowu Yang | Xiaoyu Song | William N. N. Hung | Jin Yang | Marek A. Perkowski | Xiaoyu Song | Jin Yang | M. Perkowski | Guowu Yang | W. Hung
[1] DiVincenzo,et al. Five two-bit quantum gates are sufficient to implement the quantum Fredkin gate. , 1996, Physical review. A, Atomic, molecular, and optical physics.
[2] Pérès,et al. Reversible logic and quantum computers. , 1985, Physical review. A, General physics.
[3] Masahiro Fujita,et al. Symbolic model checking using SAT procedures instead of BDDs , 1999, DAC '99.
[4] D. M. Miller. Spectral and two-place decomposition techniques in reversible logic , 2002, The 2002 45th Midwest Symposium on Circuits and Systems, 2002. MWSCAS-2002..
[5] William N. N. Hung,et al. Reference model based RTL verification: an integrated approach , 2004, Proceedings. Ninth IEEE International High-Level Design Validation and Test Workshop (IEEE Cat. No.04EX940).
[6] Ieee Circuits,et al. IEEE Transactions on Very Large Scale Integration (VLSI) Systems , 2018, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.
[7] J. A. Jones,et al. Implementation of a quantum algorithm on a nuclear magnetic resonance quantum computer , 1998, quant-ph/9801027.
[8] D. Deutsch. Quantum computational networks , 1989, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.
[9] Artur Ekert,et al. Basic Concepts in Quantum Computation (量子情報理論とその応用論文小特集) , 1998 .
[10] Guowu Yang,et al. Algebraic Characterization of Reversible Logic Gates , 2006, Theory of Computing Systems.
[11] Sleator,et al. Realizable Universal Quantum Logic Gates. , 1995, Physical review letters.
[12] Barenco,et al. Elementary gates for quantum computation. , 1995, Physical review. A, Atomic, molecular, and optical physics.
[13] Guowu Yang,et al. Majority-based reversible logic gates , 2005, Theor. Comput. Sci..
[14] Yahiko Kambayashi,et al. Transformation rules for designing CNOT-based quantum circuits , 2002, DAC '02.
[15] I. Chuang,et al. Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance , 2001, Nature.
[16] N. Bohr. II - Can Quantum-Mechanical Description of Physical Reality be Considered Complete? , 1935 .
[17] Jozef Gruska,et al. Quantum Computing , 2008, Wiley Encyclopedia of Computer Science and Engineering.
[18] Gerhard W. Dueck,et al. A transformation based algorithm for reversible logic synthesis , 2003, Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451).
[19] T. Toffoli,et al. Conservative logic , 2002, Collision-Based Computing.
[20] Armando Tacchella,et al. Benefits of Bounded Model Checking at an Industrial Setting , 2001, CAV.
[21] Eugene Goldberg,et al. BerkMin: A Fast and Robust Sat-Solver , 2002, Discret. Appl. Math..
[22] Marek A. Perkowski,et al. Reversible Logic Synthesis by Iterative Compositions , 2002, IWLS.
[23] Tommaso Toffoli,et al. Reversible Computing , 1980, ICALP.
[24] Xiaoyu Song,et al. Segmented channel routability via satisfiability , 2004, TODE.
[25] Sérgio Vale Aguiar Campos,et al. Symbolic Model Checking , 1993, CAV.
[26] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.
[27] John P. Hayes,et al. Synthesis of reversible logic circuits , 2003, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[28] Xiaoyu Song,et al. BDD minimization by scatter search , 2002, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[29] Thierry Paul,et al. Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.
[30] Albert Einstein,et al. Can Quantum-Mechanical Description of Physical Reality Be Considered Complete? , 1935 .