Abstract
Quantum computing offers a promising emerging technology due to the potential theoretical capacity of solving many important problems with exponentially less complexity. Since most of the known quantum algorithms include Boolean components, the design of quantum computers is often conducted by a two-stage approach. In a first step, the Boolean component is realized in reversible logic and then mapped to quantum gates in a second step. This paper describes a new mapping flow for determining quantum gate realizations for single-target gates (ST). Since each ST gate contains a Boolean control function, our method attempts to find a decomposition based on its BDD representation. It consists on breaking large ST gate into smaller ones using additional lines. Experiments show that we obtain smaller realizations when comparing to standard mapping.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Devitt, S.J.: Classical control of large-scale quantum computers. In: Yamashita, S., Minato, S. (eds.) RC 2014. LNCS, vol. 8507, pp. 26–39. Springer, Heidelberg (2014)
Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge Univ. Press (2000)
Fowler, A.G., Stephens, A.M., Groszkowski, P.: High-threshold universal quantum computation on the surface code. Physical Review A 80, 052312 (2009)
Barenco, A., Bennett, C.H., Cleve, R., DiVinchenzo, D., Margolus, N., Shor, P., Sleator, T., Smolin, J., Weinfurter, H.: Elementary gates for quantum computation. Physical Review A 52, 3457–3467 (1995)
Maslov, D., Dueck, G.W., Miller, D.M.: Toffoli network synthesis with templates. IEEE Trans. on CAD of Integrated Circuits and Systems 24(6), 807–817 (2005)
De Vos, A., Van Rentergem, Y.: Young subgroups for reversible computers. Advances in Mathematics of Communications 2(2), 183–200 (2008)
Soeken, M., Tague, L., Dueck, G.W., Drechsler, R.: Ancilla-free synthesis of large reversible functions using binary decision diagrams (2014). CoRR abs/1408.3955
Sasao, T.: AND-EXOR expressions and their optimization. In: Sasao, T., (ed.) Logic Synthesis and Optimization. Kluwer Academic Publisher, pp. 287–312 (1993)
Ashenhurst, R.L.: The decomposition of switching functions. In: Int’l Symp. on the Theory of Switching, pp. 74–116 (1957)
Curtis, H.A.: A new approach to the design of switching circuits. van Nostrand Princeton, NJ (1962)
Brayton, R.K.: Factoring logic functions. IBM Journal of Research and Development 31(2), 187–198 (1987)
Sasao, T., Matsuura, M.: DECOMPOS: an integrated system for functional decomposition. In: Int’l Workshop on Logic Synthesis, pp. 471–477 (1998)
Mishchenko, A., Brayton, R.K., Chatterjee, S.: Boolean factoring and decomposition of logic networks. In: Int’l Conf. on Computer-Aided Design, pp. 38–44 (2008)
Mishchenko, A., Steinbach, B., Perkowski, M.A.: An algorithm for bi-decomposition of logic functions. In: Design Automation Conference, pp. 103–108 (2001)
Bertacco, V., Damiani, M.: The disjunctive decomposition of logic functions. In: Int’l Conf. on Computer-Aided Design, pp. 78–82 (1997)
Yang, C., Ciesielski, M.J.: BDS: a BDD-based logic optimization system. IEEE Trans. on CAD of Integrated Circuits and Systems 21(7), 866–876 (2002)
Abdessaied, N., Soeken, M., Thomsen, M.K., Drechsler, R.: Upper bounds for reversible circuits based on Young subgroups. Information Processing Letters 114(6), 282–286 (2014)
Van Rentergem, Y., De Vos, A., Storme, L.: Implementing an arbitrary reversible logic gate. Journal of Physics A: Mathematical and General 38(16), 3555–3577 (2005)
Soeken, M., Frehse, S., Wille, R., Drechsler, R.: RevKit: A toolkit for reversible circuit design. Journal of Multiple-Valued Logic & Soft Computing 18(1) (2012). RevKit is available at http://www.revkit.org
Vemuri, N., Kalla, P., Tessier, R.: BDD-based logic synthesis for LUT-based FPGAs. ACM Trans. Design Autom. Electr. Syst. 7(4), 501–525 (2002)
Mishchenko, A., Perkowski, M.: Fast heuristic minimization of exclusive-sums-of-products. In: Int’l Workshop on Applications of the Reed-Muller Expansion in Circuit Design, pp. 242–250 (2001)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Abdessaied, N., Soeken, M., Drechsler, R. (2015). Technology Mapping for Single Target Gate Based Circuits Using Boolean Functional Decomposition. In: Krivine, J., Stefani, JB. (eds) Reversible Computation. RC 2015. Lecture Notes in Computer Science(), vol 9138. Springer, Cham. https://doi.org/10.1007/978-3-319-20860-2_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-20860-2_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-20859-6
Online ISBN: 978-3-319-20860-2
eBook Packages: Computer ScienceComputer Science (R0)