# Quantum Computer Search Algorithms: Can We Outperform the Classical Search Algorithms?

## Abstract

Quantum Computers are not limited to just two states. Qubits, the basic unit of quantum computing have the power to exist in more than one state at a time. While the classical computers only perform operations by manipulation of classical bits having two values 0 and 1, quantum bits can represent data in multiple states. This property of inheriting multiple states at a time is called superposition which gives quantum computers tremendous power over classical computers. With this power, the algorithms designed on quantum computers to solve search queries can yield result significantly faster than the classical algorithms. There are four types of problems that exist: Polynomial (P), Non-Deterministic Polynomial (NP), Non-Deterministic Polynomial Complete (NP-complete) and Non-Deterministic Polynomial hard (NP-hard). P problems can be solved in the polynomial amount of time like searching a database for an item. However, when the size of the search space grows, it becomes difficult to compute solutions even for P problems. Quantum algorithms like Grover’s algorithm has reduced the time complexity of some of the classical algorithm problems from N to \(\sqrt{N}\). Variants of Grover’s algorithm like Quantum Partial Search propose changes that yield not exact but closer results in time even lesser than Grover’s algorithm. NP problems are the problems whose solution if known can be verified in polynomial amount time. Factorization of prime numbers which is considered to be an NP problem took an exponential amount of time when solved using the classical computer while the Shor’s quantum computing algorithm computes it in polynomial time. Factorization is also a class of bounded-error quantum polynomial time (BQP) problems which are decision problems solved by quantum computers in polynomial time. There are problems to which if a solution is found can solve every problem Of NP class, these are NP-complete problems. The power of Qubits could be exploited in the future to come up with solutions for NP-complete problems in the future.

## Keywords

Qubit Superposition Search algorithms Grover’s algorithms Quantum computing Shor’s algorithm## References

- 1.Aaronson, S.: Quantum computing and hidden variables. Phys. Rev. A
**71**(3), 032325 (2005)MathSciNetCrossRefGoogle Scholar - 2.Brassard, G., Hoyer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. Contemp. Math.
**305**, 53–74 (2002)MathSciNetCrossRefGoogle Scholar - 3.Campbell, T.: Double Slit Experiment (2010). https://youtu.be/LW6Mq352f0E
- 4.Cleve, R., Ekert, A., Henderson, L., Macchiavello, C., Mosca, M.: On quantum algorithms (1998)Google Scholar
- 5.Gritter, T.: Grover’s algorithm (2017). https://youtu.be/hK6BBluTGhU
- 6.Grover, L.K.: A fast quantum mechanical algorithm for estimating the median, arXiv preprint quant-ph/9607024 (1996)Google Scholar
- 7.Helson, J.: QTM1x The quantum Internet and quantum computers: how will they change the world? (2018). https://youtu.be/8t1CNC6dqPQ
- 8.Grover, L.K.: A fast quantum mechanical algorithm for database search, arXiv preprint quant-ph/9605043 (1996)Google Scholar
- 9.Lederman, L., Hill, C.T.: Quantum Physics for Poets. Prometheus Books (2011)Google Scholar
- 10.Grover, L.K.: Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett.
**79**(2), 325 (1997)CrossRefGoogle Scholar - 11.Nielsen, M.A., Chuang, I.: Quantum computation and quantum information (2002)Google Scholar
- 12.Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev.
**41**(2), 303–332 (1999)MathSciNetCrossRefGoogle Scholar