Synthesis and optimization of reversible circuits-a survey

ACM Computing Surveys

Volumn 45, Issue 2, 2013, Pages

  Saeedi, Mehdi ^a   Markov, Igor L ^a,b  

^a University of Southern California   (United States)

^b The Department of Civil and Environmental Engineering   (United States)

Author keywords

Circuit optimization; logic synthesis; reversible circuits

Indexed keywords

COMPUTATION THEORY; COMPUTER CIRCUITS; COMPUTER GRAPHICS; HEURISTIC ALGORITHMS; LOGIC CIRCUITS; LOGIC GATES; LOW POWER ELECTRONICS; OPTIMIZATION; QUANTUM THEORY; SURVEYS; TIMING CIRCUITS;

BIT MANIPULATION; CIRCUIT OPTIMIZATION; LOW-POWER ELECTRONICS; NANO-COMPUTING; OPTIMISATIONS; QUANTUM ALGORITHMS; REVERSIBLE CIRCUITS; REVERSIBLE LOGIC; REVERSIBLE LOGIC CIRCUITS; THEORETICAL RESEARCH;

LOGIC SYNTHESIS;

EID: 84875189521     PISSN: 03600300     EISSN: 15577341     Source Type: Journal    
DOI: 10.1145/2431211.2431220     Document Type: Review

References (128)

1. AARONSON, S. AND GOTTESMAN, D. 2004. Improved simulation of stabilizer circuits. Phys. Rev. A 70
2. ALTEPETER, J., JEFFREY, E., AND KWIAT, P. 2005. Photonic state tomography. Adv. At. Mol. Opt. Phys. 52. 105-159
3. ARABZADEH, M. AND SAEEDI, M. 2011. RCviewer+, A viewer/analyzer for reversible and quantum circuits, version 1.88. http://ceit.aut.ac.ir/QDA/RCV.htm
4. ARABZADEH, M., SAEEDI, M., AND SAHEB ZAMANI, M. 2010. Rule-Based optimization of reversible circuits. In Proceedings of the Asia and South Pacific Design Automation Conference. 849-854
5. ASANO, M. AND ISHII, C. 2005. New structural quantum circuit simulating a toffoli gate. arXiv:quantph/0512016
6. BACON, D. AND VAN DAM, W. 2010. Recent progress in quantum algorithms. Comm. ACM 53, 84-93
7. BARENCO, A., BENNETT, C., CLEVE, R., DIVINCENZO, D., MARGOLUS, N., SHOR, P., SLEATOR, T., SMOLIN, J., AND WEINFURTER, H. 1995. Elementary gates for quantum computation. Phys. Rev. A 52, 3457-3467
8. BECKMAN, D., CHARI, A. N., DEVABHAKTUNI, S., AND PRESKILL, J. 1996. Efficient networks for quantum factoring. Phys. Rev. A 54, 2, 1034-1063 (Pubitemid 126599992)
9. BENNETT, C. H. 1973. Logical reversibility of computation. IBM J. Res. Dev. 17, 6, 525-532
10. BERGHOLM, V., VARTIAINEN, J. J., MöTTöNEN, M., AND SALOMAA, M. M. 2005. Quantum circuits with uniformly controlled one-qubit gates. Phys. Rev. A 71
11. BOLLIG, B., LöBBING, M., SAUERHOFF, M., AND WEGENER, I. 1999. On the complexity of the hidden weighted bit function for various bdd models. Informatique Theorique et Appl. 33, 2, 103-116
12. BRYANT, R. 1986. Graph-Based algorithms for boolean function manipulation. IEEE Trans. Comput. 35, 8, 677-691 (Pubitemid 16629996)
13. BUSHNELL, M. AND AGRAWAL, V. 2000. Essentials of Electronic Testing for Digital, Memory and Mixed-Signal VLSI Circuits. Kluwer
14. CHEUNG, D. 2004. Improved bounds for the approximate qft. In Proceedings of the International Symposium on Information and Communication Technologies. 1-6
15. CHEUNG, D., MASLOV, D., MATHEW, J., AND PRADHAN, D. K. 2009. On the design and optimization of a quantum polynomial-time attack on elliptic curve cryptography. Quant. Inf. Comput. 9, 7&8, 610-621
16. CHEUNG, D., MASLOV, D., AND SEVERINI., S. 2007. Translation techniques between quantum circuit architectures. In Proceedings of the Workshop on Quantum Information
17. CHILDS, A. M. AND VAN DAM, W. 2010. Quantum algorithms for algebraic problems.Rev. Mod. Phys. 82, 1, 1-52
18. CHOI, B. AND VAN METER, R. 2008. Effects of interaction distance on quantum addition circuits. quant-ph/0809.4317
19. CUCCARO, S. A., DRAPER, T. G., KUTIN, S. A., AND MOULTON, D. P. 2005. A new quantum ripple-carry addition circuit. In Proceedings of the Workshop on Quantum Information.
20. DALLY, W. AND TOWLES, B. 2003. Principles and Practices of Interconnection Networks. Morgan Kaufmann
21. DE VOS, A. 2010a. Reversible computer hardware. Electron. Notes Theor. Comput. Sci. 253, 6, 17-22
22. DE VOS, A. 2010b. Reversible Computing. Wiley-VCH
23. DE VOS, A., RAA, B., AND STORME, L. 2002. Generating the group of reversible logic gates. J. Phys. A 35, 33, 7063
24. DESOETE, B. AND DE VOS, A. 2002. A reversible carry-look-ahead adder using control gates. Integr. VLSI J. 33, 1, 89-104 (Pubitemid 35459786)
25. DIMITROV, V. S., JARVINEN, K. U., AND ADIKARI, J. 2011. Area-Efficient multipliers based on multiple-radix representations. IEEE Trans. Comput. 60, 2, 189-201
26. DONALD, J. AND JHA, N. K. 2008. Reversible logic synthesis with fredkin and peres gates. J. Emerg. Technol. Comput. Syst. 4, 1, 2:1-2:19
27. DOUCÇOT, B., IOFFE, L. B., AND VIDAL, J. 2004. Discrete non-abelian gauge theories in josephson-junction arrays and quantum computation. Phys. Rev. B 69, 21
28. EGNER, S., PüSCHEL, M., AND BETH, T. 1997. Decomposing a permutation into a conjugated tensor product. In Proceedings of the International Symposium on Symbolic and Algebraic Computation. 101-108
29. FAZEL, K., THORNTON, M., AND RICE, J. 2007. ESOP-Based toffoli gate cascade generation. In Proceedings of the IEEE Pacific Rim Conference on Communications. 206-209
30. FEI, X., JIANG-FENG, D., MING-JUN, S., XIAN-YI, Z., RONG-DIAN, H., AND JI-HUI, W. 2002. Realization of the fredkin gate by three transition pulses in a nuclear magnetic resonance quantum information processor. Chinese Phys. Lett. 19, 8, 1048
31. FEYNMAN, R. 1986. Quantum mechanical computers. Found. Phys. 16, 6, 507-531
32. FOWLER, A. G., DEVITT, S. J., AND HOLLENBERG, L. C. L. 2004a. Implementation of shor's algorithm on a linear nearest neighbour qubit array. Quant. Inf. Comput. 4, 237-245
33. FOWLER, A. G., HILL, C. D., AND HOLLENBERG, L. C. L. 2004b. Quantum error correction on linear nearest neighbor qubit arrays. Phys. Rev. A 69, 4
34. FREDKIN, E. F. AND TOFFOLI, T. 1982. Conservative logic. Int. J. Theor. Phys. 21, 3/4, 219-253
35. GAO, W.-B., XU, P., YAO, X.-C., GüHNE, O., CABELLO, A., LU, C.-Y., PENG, C.-Z., CHEN, Z.-B., AND PAN, J.-W. 2010 Experimental realization of a controlled-not gate with four-photon six-qubit cluster states. Phys. Rev. Lett. 104, 2
36. GL üCK, R. AND KAWABE, M. 2005. A method for automatic program inversion based on ir(0) parsing. Fundam. Inf. 66, 4, 367-395 (Pubitemid 41218081)
37. GOLUBITSKY, O., FALCONER, S. M., AND MASLOV, D. 2010. Synthesis of the optimal 4-bit reversible circuits. In Proceedings of the Design Automation Conference. 653-656
38. GOLUBITSKY, O. AND MASLOV, D. 2011. A study of optimal 4-bit reversible toffoli circuits and their synthesis. arXiv:1103.2686
39. GRASSL, M. 2003. Circuits for quantum error-correcting codes. http://iaks-www.ira.uka.de/home/grassl/QECC/index.html
40. GROSSE, D., WILLE, R., DUECK, G., AND DRECHSLER, R. 2009. Exact multiple-control toffoli network synthesis with SAT techniques. IEEE Trans. Comput. Aid. Des. 28, 5, 703-715
41. GUPTA, P., AGRAWAL, A., AND JHA, N. 2006. An algorithm for synthesis of reversible logic circuits. IEEE Trans. Comput Aid. Des. 25, 11, 2317-2330
42. HACHTEL, G. D. AND SOMENZI, F. 2000. Logic Synthesis and Verification Algorithms. Kluwer
43. HäFFNER, H., HäNSEL, W., ROOS, C. F., BENHELM, J., AL KAR, D. C., CHWALLA, M., KöRBER, T., RAPOL, U. D., RIEBE, M., SCHMIDT, P. O., BECHER, C., GüHNE, O., DüR, W., AND BLATT, R. 2005. Scalable multiparticle entanglement of trapped ions. Nature 438, 643-646 (Pubitemid 41740570)
44. HILEWITZ, Y. AND LEE, R. B. 2008. Fast bit gather, bit scatter and bit permutation instructions for commodity microprocessors. J. Signal Process. Syst. 53, 145-169
45. HIRATA, Y., NAKANISHI, M., YAMASHITA, S., AND NAKASHIMA, Y. 2011. An efficient conversion of quantum circuits to a linear nearest neighbor architecture. Quant. Inf. Comput. 11, 1-2, 142-166
46. HUNG, W., SONG, X., YANG, G., YANG, J., AND PERKOWSKI, M. 2006. Optimal synthesis of multiple output boolean functions using a set of quantum gates by symbolic reachability analysis. IEEE Trans. Comput. Aid. Des. 25, 9, 1652-1663 (Pubitemid 44304095)
47. IWAMA, K., KAMBAYASHI, Y., AND YAMASHITA, S. 2002. Transformation rules for designing cnot-based quantum circuits. In Proceedings of the Design Automation Conference. 419-424
48. JERRUM, M., SINCLAIR, A., AND VIGODA, E. 2004. A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. J. ACM 51, 4, 671-697
49. KANE, B. 1998. A silicon-based nuclear spin quantum computer. Nature 393, 133-137 (Pubitemid 28242245)
50. KERNTOPF, P. 2004. A new heuristic algorithm for reversible logic synthesis. In Proceedings of the Design Automation Conference. 834-837
51. KIM, S., ZIESLER, C. H., AND PAPAEFTHYMIOU, M. C. 2005. Charge-Recovery computing on silicon. IEEE Trans. Comput. 54, 6, 651-659 (Pubitemid 40871258)
52. KORF, R. 1999. Artificial intelligence search algorithms. In Algorithms Theory Computation Handbook., CRC Press
53. KUTIN, S., MOULTON, D., AND SMITHLINE, L. 2007. Computation at a distance. Chicago J. Theor. Comput. Sci
54. KUTIN, S. A. 2007. Shor's algorithm on a nearest-neighbor machine. In Proceedings of the Asian Conference on Quantu Information Science
55. LAFOREST, M., SIMON, D., BOILEAU, J.-C., BAUGH, J., DITTY, M., AND LAFLAMME, R. 2007. Using error correction to determine the noise model. Phys. Rev. A 75, 1, 133-137
56. LAGARIAS, J. C. AND ODLYZKO, A. M. 1987. Computing [pi](x): An analytic method. J. Algor. 8, 2, 173-191
57. LANDAUER, R. 1961. Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 5, 183-191
58. LEE, S., LEE, S., KIM, T., LEE, J. S., BIAMONTE, J., AND PERKOWSKI, M. 2006. The cost of quantum gate primitives. J. Multiple-Valued Logic Soft Comput. 12, 5-6
59. MARKOV, I. L. AND ROY, J. A. 2003. On sub-optimallity and scalability of logic synthesis tools. In Proceedings of the International Workshop on Logic Synthesis
60. MARKOV, I. L. AND SAEEDI, M. 2012. Constant-optimized quantum circuits for modular multiplication and exponentiation. Quantum Info. Comput. 12, 5-6, 361-394
61. MARKOV, I. L. AND SAEEDI, M. 2013. Faster quantum number factoring via circuit synthesis. Phys. Rev. A 87, 012310
62. MASLOV, D. 2007. Linear depth stabilizer and quantum fourier transformation circuits with no auxiliary qubits in finite neighbor quantum architectures. Phys. Rev. A 76
63. MASLOV, D. 2011. Reversible logic synthesis benchmarks page. http://www.cs.uvic.ca/?dmaslov/
64. MASLOV, D. ANDDUECK, G. 2003. Improved quantum cost for n-bit toffoli gates. Electron. Lett. 39, 25, 1790-1791
65. MASLOV, D. AND DUECK, G. 2004. Reversible cascades with minimal garbage. IEEE Trans. Comput. Aid. Des. 23, 11, 1497-1509
66. MASLOV, D., DUECK, G., AND MILLER, D. 2005a. Synthesis of fredkin-toffoli reversible networks. IEEE Trans. VLSI Syst. 13, 6, 765-769 (Pubitemid 41120267)
67. MASLOV, D., DUECK, G., AND MILLER, D. 2005b. Toffoli network synthesis with templates. IEEE Trans. Comput. Aid. Des. 24, 6, 807-817 (Pubitemid 40818745)
68. MASLOV, D., DUECK, G., MILLER, D., AND NEGREVERGNE, C. 2008a. Quantum circuit simplification and level compaction. IEEE Trans. Comput. Aid. Des. 27, 3, 436-444 (Pubitemid 351305803)
69. MASLOV, D., DUECK, G. W., AND MILLER, D. M. 2007. Techniques for the synthesis of reversible Toffoli networks. ACM Trans. Des. Autom. Electron. Syst. 12, 4, 42:1-42:28
70. MASLOV, D., FALCONER, S. M., AND MOSCA, M. 2008b. Quantum circuit placement. IEEE Trans. Comput. Aid. Des. 27, 4, 752-763 (Pubitemid 351470942)
71. MASLOV, D. AND SAEEDI, M. 2011. Reversible circuit optimization via leaving the Boolean domain. IEEE Trans. Comput. Aid. Des. 30, 6, 806-816
72. MCGREGOR, J. P. AND LEE, R. B. 2003. Architectural techniques for accelerating subword permutations with repetitions. IEEE Trans. VLSI 11, 325-335
73. MILLER, D. AND SASANIAN, Z. 2010. Improving the NCV realization of multiple-control Toffoli gates. In Proceedings of the International Workshop on Boolean Problems. 37-44
74. MILLER, D. M., MASLOV, D., AND DUECK, G. W. 2003. A transformation based algorithm for reversible logic synthesis. In Proceedings of the Design Automation Conference. 318-323
75. MILLER, D. M., WILLE, R., AND DRECHSLER, R. 2010. Reducing reversible circuit cost by adding lines. In Proceedings of the International Symposium on Multiple-Valued Logic. 217-222
76. MISHCHENKO, A. AND PERKOWSKI, M. 2002. Logic synthesis of reversible wave cascades. In Proceedings of the International Workshop on Logic Synthesis. 197-202
77. MOORE, C. AND CRUTCHFIELD, J. P. 2000. Quantum automata and quantum grammars. Theor. Comput. Sci. 237, 1-2, 275-306
78. MORITA, K. 2008. Reversible computing and cellular automata-A survey. Theor. Comput. Sci. 395, 1, 101-131
79. MöTTöNEN, M. AND VARTIAINEN, J. J. 2006. Decompositions of general quantum gates. In Trends in Quantum Computing Research. NOVA Publishers, Chapter 7
80. NEGREVERGNE, C., MAHESH, T. S., RYAN, C. A., DITTY, M., CYR-RACINE, F., POWER, W., BOULANT, N., HAVEL, T., CORY, D. G., AND LAFLAMME, R. 2006. Benchmarking quantum control methods on a 12-qubit system. Phys. Rev. Lett. 96, 17
81. NIELSEN, M. AND CHUANG, I. 2000. Quantum Computation and Quantum Information. Cambridge University Press, Cambridge, UK
82. PATEL, K. N., MARKOV, I. L., AND HAYES, J. P. 2008. Optimal synthesis of linear reversible circuits. Quant. Inf. Comput. 8, 3-4, 282-294
83. PERES, A. 1985. Reversible logic and quantum computers. Phys. Rev. A 32, 3266-3276
84. PéREZ-DELGADO, C. A., MOSCA, M., CAPPELLARO, P., AND CORY, D. G. 2006. Single spin measurement using cellular automata techniques. Phys. Rev. Lett. 97, 10, 100501
85. POLIAN, I., FIEHN, T., BECKER, B., AND HAYES, J. P. 2005. A family of logical fault models for reversible circuits. In Proceedings of the Asian Test Symposium. 422-427 (Pubitemid 46228381)
86. POLITI, A., MATTHEWS, J. C. F., AND O'BRIEN, J. L. 2009. Shor's quantum factoring algorithm on a photonic chip. Sci. 325, 5945, 1221
87. PRASAD, A. K., SHENDE, V. V., MARKOV, I. L., HAYES, J. P., AND PATEL, K. N. 2006. Data structures and algorithms for simplifying reversible circuits. J. Emerg. Technol. Comput. Syst. 2, 4, 277-293 (Pubitemid 46192921)
88. RENTERGEM, Y. V., VOS, A. D., AND KEYSER, K. D. 2007. Six synthesis methods for reversible logic. Open Syst. Inf. Dynam. 14, 1, 91-116
89. SAEEDI, M., ARABZADEH, M., SAHEB ZAMANI, M., AND SEDIGHI, M. 2011a. Block-based quantum-logic synthesis. Quant. Inf. Comput. 11, 3-4, 0262-0277
90. SAEEDI, M., SAHEB ZAMANI, M., AND SEDIGHI, M. 2007a. Reversible circuit synthesis using a cycle-based approach. In Proceedings of the International Symposium on VLSI. 428-436
91. SAEEDI, M., SAHEB ZAMANI, M., SEDIGHI, M., AND SASANIAN, Z. 2010a. Synthesis of reversible circuit using cycle-based approach. J. Emerg. Technol. Comput. Syst. 6, 4, 13:1-13:26
92. SAEEDI, M., SEDIGHI, M., AND SAHEB ZAMANI, M. 2007b. A novel synthesis algorithm for reversible circuits. In Proceedings of the International Conference on Computer-Aided Design. 65-68
93. SAEEDI, M., SEDIGHI, M., AND SAHEB ZAMANI, M. 2010b. A library-based synthesis methodology for reversible logic. Microelectron. J. 41, 4, 185-194
94. SAEEDI, M., WILLE, R., AND DRECHSLER, R. 2011b. Synthesis of quantum circuits for linear nearest neighbor architectures. Quant. Inf. Proc. 10, 3, 355-377
95. SHENDE, V., BULLOCK, S., AND MARKOV, I. L. 2006. Synthesis of quantum-logic circuits. IEEE Trans. Comput. Aid. Des. 25, 6, 1000-1010
96. SHENDE, V. V. AND MARKOV, I. L. 2009. On the CNOT-cost of TOFFOLI gates. Quant. Inf. Comput. 9, 5-6, 461-486
97. SHENDE, V. V., MARKOV, I. L., AND BULLOCK, S. S. 2004. Minimal universal two-qubit quantum circuits. Phys. Rev. A 69, 062321
98. SHENDE, V. V., PRASAD, A. K., MARKOV, I. L., AND HAYES, J. P. 2003. Synthesis of reversible logic circuits. IEEE Trans. Comput. Aid. Des. 22, 6, 710-722
99. SHI, Y.-Y., DUAN, L.-M., AND VIDAL, G. 2006. Classical simulation of quantum many-body systems with a tree tensor network. Phys. Rev. A 74, 2
100. SHI, Z. AND LEE, R. B. 2000. Bit permutation instructions for accelerating software cryptography. In Proceedings of the International Conference on Application-Specific Systems, Architectures, and Processors. 138-148
101. SKINNER, A. J., DAVENPORT, M. E., AND KANE, B. E. 2003. Hydrogenic spin quantum computing in silicon: A digital approach. Phys. Rev. Lett. 90, 8, 087901
102. SKONECZNY, M., VAN RENTERGEM, Y., AND DE VOS, A. 2008. Reversible fourier transform chip. Mixed Des. Integr. Circ. Syst., 281-286
103. SOEKEN, M., FREHSE, S., WILLE, R., AND DRECHSLER, R. 2010a. RevKit: A toolkit for reversible circuit design. In Proceedings of the Workshop on Reversible Computation. http://www.revkit.org
104. SOEKEN, M., WILLE, R., DUECK, G. W., AND DRECHSLER, R. 2010b. Window optimization of reversible and quantum circuits. Des. Diagnost. Elec. Circ. Syst., 341-345
105. STORME, L., VOS, A. D., AND JACOBS, G. 1999. Group theoretical aspects of reversible logic gates. J. Universal Comput. Sci. 5, 5, 307-321
106. SVORE, K. M., AHO, A. V., CROSS, A. W., CHUANG, I., AND MARKOV, I. L. 2006. A layered software architecture for quantum computing design tools. Comput. 39, 74-83 (Pubitemid 43186097)
107. TAKAHASHI, Y. AND KUNIHIRO, N. 2008. A fast quantum circuit for addition with few qubits. Quant. Inf. Comput. 8, 6-7, 636-649
108. TAKAHASHI, Y., KUNIHIRO, N., AND OHTA, K. 2007. The quantum Fourier transform on a linear nearest neighbor architecture. Quant. Inf. Comput. 7, 4, 383-391
109. TAKAHASHI, Y., TANI, S., AND KUNIHIRO, N. 2010. Quantum addition circuits and unbounded fan-out. Quant. Inf. Comput. 10, 9-10, 872-890
110. TOFFOLI, T. 1980. Reversible computing. Tech. memo MIT/LCS/TM-151, MIT Lab
111. VAN METER, R. AND ITOH, K. M. 2005. Fast quantum modular exponentiation. Phys. Rev. A 71, 5
112. VAN METER, R. AND OSKIN, M. 2006. Architectural implications of quantum computing technologies. J. Emerg. Technol. Comput. Syst. 2, 1, 31-63 (Pubitemid 43925102)
113. VIAMONTES, G., MARKOV, I. L., AND HAYES, J. P. 2009. Quantum Circuit Simulation. Springer
114. VIAMONTES, G. F., MARKOV, I. L., AND HAYES, J. P. 2007. Checking equivalence of quantum circuits and states. In Proceedings of the International Conference on Computer-Aided Design. 69-74
115. VISAN, A. M., POLYAKOV, A., SOLANKI, P. S., ARYA, K., DENNISTON, T., AND COOPERMAN, G. 2009. Temporal debugging using URDB. CoRR abs/0910.5046
116. VON NEUMANN, J. 1966. Theory of Self-Reproducing Automata. University of Illinois Press.
117. WILLE, R. AND DRECHSLER, R. 2009. BDD-Based synthesis of reversible logic for large functions. In Proceedings of the Design Automation Conference. 270-275
118. WILLE, R. AND DRECHSLER, R. 2010. Towards a Design Flow for Reversible Logic. Springer
119. WILLE, R., GROSSE, D., MILLER, D. M., AND DRECHSLER, R. 2009. Equivalence checking of reversible circuits. In Proceedings of the International Symposium on Multiple-Valued Logic. 324-330
120. WILLE, R., GROSSE, D., TEUBER, L., DUECK, G. W., AND DRECHSLER, R. 2008a. RevLib: An online resource for reversible functions and reversible circuits. In Proceedings of the International Symposium on Multiple-Valued Logic. 220-225
121. WILLE, R., LE, H. M., DUECK, G. W., AND GROSSE, D. 2008b. Quantified synthesis of reversible logic. In Proceedings of the Conference on Design, Automation, and Test in Europe. 1015-1020
122. WILLE, R., OFFERMANN, S., AND DRECHSLER, R. 2010a. SyReC: A programming language for synthesis of reversible circuits. In Proceedings of the Forum on Specification and Design Languages
123. WILLE, R., SOEKEN, M., AND DRECHSLER, R. 2010b. Reducing the number of lines in reversible circuits. In Proceedings of the Design Automation Conference. 647-652
124. YAMASHITA, S. AND MARKOV, I. L. 2010. Fast equivalence-checking for quantum circuits. Quant. Inf. Comput. 9, 9-10, 721-734
125. YANG, G., SONG, X., HUNG, W. N., XIE, F., AND PERKOWSKI, M. A. 2006. Group theory based synthesis of binary reversible circuits. Lecture Notes in Computer Science, vol. 3959, Springer, 365-374 (Pubitemid 44030108)
126. YANG, G., SONG, X., HUNG, W. N. N., AND PERKOWSKI, M. A. 2008. Bi-directional synthesis of 4-bit reversible circuits. Comput. J. 51, 207-215 (Pubitemid 351795728)
127. YOKOYAMA, T., AXELSEN, H. B., AND GL üCK, R. 2008. Principles of a reversible programming language. Comput. Frontiers, 43-54
128. ZHANG, J., VALA, J., SASTRY, S., AND WHALEY, K. B. 2003. Geometric theory of nonlocal two-qubit operations. Phys. Rev. A 67, 4, 042313. AC.