Skip to main content

Synthesis Algorithm based on the Pre-evaluation of Quantum Circuits for Linear Nearest Neighbor Architectures

  • Conference paper
  • First Online:
Advances in Intelligent Systems and Interactive Applications (IISA 2017)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 686))

  • 2414 Accesses

Abstract

In order to design quantum circuits for LNN, in this work, we propose a kind of synthesis algorithm based on the pre-evaluation of quantum circuits for LNN. Through pre-evaluation, not only can the algorithm accurately calculate if there are deletable redundant SWAP gates and remove them, but also convert every non-adjacent quantum gate to adjacent quantum gate, with inserting a minimal number of SWAP gates, and therefore get quantum circuits of minimal quantum cost (qc). As for quantum circuits of n lines and m quantum gates, the time and space complexity of the algorithm and optimized algorithm is O(m^3) and O(n^n+m), respectively. The results present that, with fewer average gates of quantum circuits and higher improvement efficiency of quantum cost, the algorithm has a wider range of application compared to the existing algorithm.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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

References

  1. D.Cheung, D.Maslov, and S.Severini. Translation techniques between quantum circuit architectures. Quantum Information Processing, 2007. available online at http://citeseerx.ist.psu.edu/viewdoc/download;jsessionid=C437A1E24389757B8BDC0D5C3D1DADAB?doi=10.1.1.133.7479&rep=rep1&type=pdf

  2. Saeedi, M., Wille, R., Drechsler, R.: Synthesis of quantum circuits for linear nearest neighbor architectures. Quantum Information Processing 10(3), 355–377 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  3. Hollenberg, L.C.L., Greentree, A.D., Fowler, A.G., Wellard, C.J.: Two-dimensional architectures for donor-based quantum computing. Physical Review B 74(4), 045–311 (2006)

    Article  Google Scholar 

  4. Amlan Chakrabarti, Susmita Sur-Kolay, Senior Member, IEEE and Ayan Chaudhury. Linear Nearest Neighbor Synthesis of Reversible Circuits by Graph Partitioning. 2011. available online at http://arxiv.org/pdf/1112.0564v2.pdf

  5. Robert Wille, Aaron Lye, Rolf Drechsler. Optimal SWAP Gate Insertion for Nearest Neighbor Quantum Circuits. In 19th Asia and South Pacific Design Automation Conference (ASP-DAC), 2014

    Google Scholar 

  6. Lee, S., Lee, S.J., Kim, T.: The cost of quantum gate primitives. Multiple Valued Logic and Soft Computing 12(5/6), 561 (2006)

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

This work was financially supported by the Nantong University Graduate Research and Innovation Project funded projects (No.YKC16087), Natural Science Foundation of Jiangsu Province (BK20151274) and National Natural Science Foundation(61403216).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhijin Guan .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wang, D., Guan, Z., Tan, Y., Wang, Y. (2018). Synthesis Algorithm based on the Pre-evaluation of Quantum Circuits for Linear Nearest Neighbor Architectures. In: Xhafa, F., Patnaik, S., Zomaya, A. (eds) Advances in Intelligent Systems and Interactive Applications. IISA 2017. Advances in Intelligent Systems and Computing, vol 686. Springer, Cham. https://doi.org/10.1007/978-3-319-69096-4_105

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-69096-4_105

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-69095-7

  • Online ISBN: 978-3-319-69096-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics