Skip to main content

A Novel RM-Based Algorithm for Reversible Circuits

  • Conference paper
Advances in Computation and Intelligence (ISICA 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5821))

Included in the following conference series:

  • 1349 Accesses

Abstract

This paper presents a heuristic fast-matching algorithm for quantum reversible logic circuits synthesis. The algorithm uses the quantum gate formula as the heuristic rules to perform forward-matching. This can avoid blind matching and decrease the matching complexity. Simple, smaller overhead and better to simplify circuits, the algorithm can perform well in the multi-quantum reversible logic circuits synthesis.

This work was supported by The National Natural Science Foundation of China under Grant 60572071 and 60873101, Jiangsu Natural Science Foundation under Grant BK2007104 and BK2008209.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Bennett, C.: Logical reversibility of computation. I. B. M. J. Res. Dev. 17, 525–532 (1973)

    Google Scholar 

  2. Maslov, D., Dueck, G.W., Miller, D.M.: Toffoli network synthesis with templates. In: IEEE Trans CADICS, vol. 24(6), pp. 807–817 (2005)

    Google Scholar 

  3. Miller, D.M., Maslov, D., Dueck, G.W.: A transformation based algorithm for reversible logic synthesis. In: IEEE DAC, vol. 40, pp. 318–323 (2003)

    Google Scholar 

  4. Shende, V.V., Prasad, A.K., Markov, I.l.: Synthesis of reversible logic circuits. In: IEEE Trans CADICS, vol. 22(6), pp. 710–722 (2003)

    Google Scholar 

  5. Yang, G., Song, X., Perkowski, M.A., et al.: Four-level realization of 3-qubit reversible function. In: IET Comput. Digit. Tech, vol. 1(4), pp. 382–388 (2007)

    Google Scholar 

  6. Kerntopf, P.: A new heuristic algorithm for reversible logic synthesis. In: IEEE DAC, vol. 41, pp. 834–837 (2004)

    Google Scholar 

  7. Shende, V.V., Prasad, A.K., Markov, I.L., Hayes, J.P.: Reversible logic circuits synthesis. In: IEEE ACM, pp. 353–360 (2002)

    Google Scholar 

  8. Li, Z.Q., Chen, H.W., et al.: Fast algorithms for 4-qubit reversible logic circuits synthesis. Acta Electronic Sinica 36(11), 2081–2089 (2008)

    Google Scholar 

  9. Saeedi, M., Sedighi, M., Zamani, M.S.: A novel synthesis algorithm for reversible circuits. In: IEEE DAC, pp. 65–68 (2007)

    Google Scholar 

  10. Abdollahi, A., Pedram, M.: Analysis and synthesis of quantum circuits by using quantum decision diagrams, pp. 317–322. DAT, Europe (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, D., Chen, H., An, B., Yang, Z. (2009). A Novel RM-Based Algorithm for Reversible Circuits. In: Cai, Z., Li, Z., Kang, Z., Liu, Y. (eds) Advances in Computation and Intelligence. ISICA 2009. Lecture Notes in Computer Science, vol 5821. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04843-2_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04843-2_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04842-5

  • Online ISBN: 978-3-642-04843-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics