Skip to main content

Transforming MCT Circuits to NCVW Circuits

  • Conference paper
Reversible Computation (RC 2011)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 7165))

Included in the following conference series:

Abstract

Mapping a circuit of reversible gates to a circuit of elementary quantum gates is a key step in synthesizing quantum realizations of Boolean functions. The library containing NOT, controlled-NOT and controlled square-root-of-NOT gates has been considered extensively. In this paper, we extend the library to include fourth-root-of-NOT gates. Experimental results using REVLIB benchmark circuits show that using this extended library results in smaller quantum circuits.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Barenco, A., Bennett, C., Cleve, R., DiVincenzo, D., Margolus, M., Shor, P., Sleator, T., Smolin, J., Weinfurter, H.: Elementary gates for quantum computation. Physical Review A 52(5), 3457–3467 (1995)

    Article  Google Scholar 

  2. Fredkin, E., Toffoli, T.: Conservative logic. Int’l J. of Theoretical Physics 21, 219–253 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  3. Miller, D.M., Wille, R., Dueck, G.W.: Synthesizing reversible circuits from irreversible specifications using Reed-Muller spectral techniques. In: Proc. Reed-Muller Workshop, pp. 87–96 (May 2009)

    Google Scholar 

  4. Miller, D.M., Wille, R., Sasanian, Z.: Elementary quantum gate realizations for multiple-control Toffolli gates. In: Proc. Int’l Symp. on Multiple-valued Logic, pp. 288–293 (2011)

    Google Scholar 

  5. Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge Univ. Press (2000)

    Google Scholar 

  6. Peres, A.: Reversible logic and quantum computers. Physical Review A 32, 3266–3276 (1985)

    Article  MathSciNet  Google Scholar 

  7. Sasanian, Z., Miller, D.M.: NCVW quantum gate realization of mixed control MCT gates. IEEE Trans. on CAD (2011) (submitted)

    Google Scholar 

  8. Sasanian, Z., Miller, D.M.: A new methodology for optimizing quantum realizations of reversible circuits. ACM J. on Emerging Technologies in Computing Systems (2011) (submitted)

    Google Scholar 

  9. Wille, R., Große, D., Teuber, L., Dueck, G.W., Drechsler, R.: RevLib: An online resource for reversible functions and reversible circuits. In: Int’l Symp. on Multi-Valued Logic, pp. 220–225 (2008), RevLib, www.revlib.org

  10. Wille, R., Drechsler, R.: Synthesis of Boolean Functions in Reversible Logic. In: Progress in Applications of Boolean Functions (Synthesis Lectures on Digital Circuits and Systems). Morgan and Claypool (2010)

    Google Scholar 

  11. Wille, R., Große, D., Miller, D.M., Drechsler, R.: Equivalence checking of reversible circuits. In: Proc. Int’l Symp. on Multiple-valued Logic (CD), 7p (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sasanian, Z., Miller, D.M. (2012). Transforming MCT Circuits to NCVW Circuits. In: De Vos, A., Wille, R. (eds) Reversible Computation. RC 2011. Lecture Notes in Computer Science, vol 7165. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29517-1_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29517-1_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29516-4

  • Online ISBN: 978-3-642-29517-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics