Skip to main content
Log in

Improving the quantum cost of NCT-based reversible circuit

  • Published:
Quantum Information Processing Aims and scope Submit manuscript

Abstract

We describe a scalable protocol for optimizing the quantum cost of the 3-bit reversible circuits built using NCT library. This technique takes into account a group theory approach. The algorithm analyzes the equivalent quantum circuits obtained by decomposing the reversible circuit to its elementary quantum gates and then applies optimization rules to reduce the number of the used elementary quantum gates. We apply the obtained algorithm using different quantum cost metrics that compare favorably with the relevant methods.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  1. Storme, L., De Vos, A., Jacobs, G.: Group theoretical aspects of reversible logic gates. J. Univ. Comput. Sci. 5(5), 307–321 (1999)

    MATH  Google Scholar 

  2. De Vos, A., Rentergem, Y.V.: From group theory to reversible computers. Int. J. Unconv. Comput. 4(1), 79–88 (2008)

    Google Scholar 

  3. Offermann, S., Wille, R., Drechsler, R.: Efficient realization of control logic in reversible circuits. In: Forum on Specifications and Design Language, pp. 1–7 (2011)

  4. De Vos, A., De Baerdemacker, S.: Symmetry groups for the decomposition of reversible computers, quantum computers, and computers in between. Symmetry 3(2), 305–324 (2011)

    Article  MathSciNet  Google Scholar 

  5. Younes, A.: A single universal n-bit gate for reversible circuit synthesis. arXiv:1306.1254v1 (2013)

  6. Yang, G., Song, X., Hung, W.N.N., Perkowski, M.A., Seo, C.-J.: Synthesis of reversible circuits with minimal costs. CALCOLO 45, 193–206 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  7. Younes, A.: Tight bounds of the synthesis of 3-bit reversible circuits: NFT library. arXiv:1304.5804 (2013)

  8. Osama, M., Younes, A., Fahmy, M.H.: Integration of irreversible gates in reversible circuits using NCT library. IOSR J. Comput. Eng. 14, 69–79 (2013)

    Article  Google Scholar 

  9. De Vos, A., Raa, B., Storme, L.: Generating the group of reversible logic gates. J. Phys. A Math. Gen. 35(33), 7063–7078 (2002)

    Article  ADS  MATH  Google Scholar 

  10. Younes, A.: Tight bounds of the synthesis of 3-bit reversible circuits: NFFr library. J. Circuits Syst. Comput. 23(3), 1450040 (2014)

    Article  MathSciNet  Google Scholar 

  11. Shende, V., Prasad, A.K., Markov, I.L., Hayes, J.P.: Synthesis of reversible logic circuits. IEEE TCAD 22(6), 710–722 (2003)

    Google Scholar 

  12. Maslov, D., Miller, D.M.: Comparison of the cost metrics for reversible and quantum logic synthesis. IET Comput. Digit. Tech. 1(2), 98–104 (2008)

    Article  Google Scholar 

  13. Barenco, A., Bennett, C.H., Cleve, R., DiVincenzo, D.P., Margolus, N., Shor, P., Sleator, T., Smolin, J.A., Weinfurter, H.: Elementary gates for quantum computation. Phys. Rev. A 52, 3457 (1995)

    Article  ADS  Google Scholar 

  14. Seress, A.: Permutation Group Algorithms. Cambridge University Press, Cambridge (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rasha Montaser.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Montaser, R., Younes, A. & Abdel-Aty, M. Improving the quantum cost of NCT-based reversible circuit. Quantum Inf Process 14, 1249–1263 (2015). https://doi.org/10.1007/s11128-015-0929-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11128-015-0929-9

Keywords

Navigation