Abstract
In this book several approaches have been presented to optimize quantum circuits as well as to analyze their complexity on the three major level of the design flow depicted in Fig. 6.1. The achieved contributions on each level have been described in separate chapters. Accordingly, on each level of the design flow, two approaches have been described to improve the cost of the final realization. Besides, an extensive study of the complexity of implementing a given function has been outlined.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Abdessaied, N., Soeken, M., Thomsen, M.K., Drechsler, R.: Upper bounds for reversible circuits based on Young subgroups. Inf. Process. Lett. 114 (6), 282–286 (2014)
Barenco, A., Bennett, C.H., Cleve, R., DiVinchenzo, D., Margolus, N., Shor, P., Sleator, T., Smolin, J., Weinfurter, H.: Elementary gates for quantum computation. Am. Phys. Soc. 52, 3457–3467 (1995)
Miller, D.M., Maslov, D., Dueck, G.W.: A transformation based algorithm for reversible logic synthesis. In: Design Automation Conference, pp. 318–323 (2003)
Miller, D.M., Wille, R., Sasanian, Z.: Elementary quantum gate realizations for multiple-control Toffolli gates. In: International Symposium on Multiple-Valued Logic, pp. 217–222. IEEE, New York (2011)
Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)
Saeedi, M., Zamani, M.S., Sedighi, M., Sasanian, Z.: Reversible circuit synthesis using a cycle-based approach. J. Emerg. Technol. 6 (4), 13 (2010)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Abdessaied, N., Drechsler, R. (2016). Conclusions. In: Reversible and Quantum Circuits. Springer, Cham. https://doi.org/10.1007/978-3-319-31937-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-31937-7_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-31935-3
Online ISBN: 978-3-319-31937-7
eBook Packages: EngineeringEngineering (R0)