Skip to main content
SpringerLink
Log in

Analyze of Quantum Fourier Transform Circuit Implementation

  • Conference paper
  • First Online:
Internet of Things, Smart Spaces, and Next Generation Networks and Systems (ruSMART 2015, NEW2AN 2015)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 9247))

  • 4243 Accesses

Abstract

Quantum Fourier transform circuit is the key element of quantum computation. Originally it was introduced in the Shor’s paper containing a classical proof of correctness. We propose another corroboration that shows the role of each element of the circuit and can be used for the scheme analyze.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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.

References

  1. Shor, P.: Algorithms for quantum computation: discrete logarithms and factoring. In: FOCS, pp. 124–134 (1994)

    Google Scholar 

  2. Yu, K.A.: Quantum measurements and the Abelian Stabilizer Problem, arXiv:quant-ph/9511026

  3. Lanyon, B.P., Weinhold, T.J., Langford, N.K., Barbieri, M., James, D.F.V., Gilchrist, A., White, A.G.: Experimental Demonstration of a Compiled Version of Shor’s Algorithm with Quantum Entanglement. Physical Review Letters 99(25), 250505 (2007)

    Article  Google Scholar 

  4. Ettinger, M., Hoyer, P.: A quantum observable for the graph isomorphism problem, arXiv:quant-ph/9901029

  5. Cooley, J.W., Tukey, J.W.: An algorithm for the machine calculation of complex Fourier series. Math. Comput. 19, 297–301 (1965). doi:10.2307/2003354

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Peter the Great St. Petersburg Polytechnic University, St. Petersburg, 195251, Russia

    Ivan Murashko & Constantine Korikov

Authors
  1. Ivan Murashko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Constantine Korikov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Constantine Korikov .

Editor information

Editors and Affiliations

  1. FRUCT Oy, Helsinki, Finland

    Sergey Balandin

  2. Tampere University of Technology, Tampere, Finland

    Sergey Andreev

  3. Tampere University of Technology, Tampere, Finland

    Yevgeni Koucheryavy

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Murashko, I., Korikov, C. (2015). Analyze of Quantum Fourier Transform Circuit Implementation. In: Balandin, S., Andreev, S., Koucheryavy, Y. (eds) Internet of Things, Smart Spaces, and Next Generation Networks and Systems. ruSMART NEW2AN 2015 2015. Lecture Notes in Computer Science(), vol 9247. Springer, Cham. https://doi.org/10.1007/978-3-319-23126-6_58

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23126-6_58

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23125-9

  • Online ISBN: 978-3-319-23126-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation