Analysis of Quantum Algorithms with Classical Systems Counterpart

In this note, we look into two quantum algorithms, Deutsch-Josza’s and Shor’s algorithms. An attempt made to analyze classical as well as quantum parts computation. With that, analyze classical as well quantum parts complexities.

[1]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[2]  I. Chuang,et al.  Quantum Computation and Quantum Information: Bibliography , 2010 .

[3]  Sanders,et al.  Limitations on practical quantum cryptography , 2000, Physical review letters.

[4]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[5]  Jr.,et al.  Shor's Quantum Factoring Algorithm , 2000, quant-ph/0010034.

[6]  Umesh V. Vazirani,et al.  Quantum complexity theory , 1993, STOC.

[7]  D. Deutsch.  Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[8]  A. Pitchai,et al.  Quantum Walk Algorithm to Compute Subgame Perfect Equilibrium in Finite Two-player Sequential Games , 2016 .

[9]  Daniel R. Simon,et al.  On the power of quantum computation , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[10]  D. Deutsch,et al.  Rapid solution of problems by quantum computation , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

[11]  N. Bohr.  II - Can Quantum-Mechanical Description of Physical Reality be Considered Complete? , 1935 .

[12]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.