C1000-112 - When to use Quantum Computers

When to use Quantum Computer

22-May-2021, I started with the topic 'The Case for Quantum' from this URL https://qiskit.org/textbook/ch-states/case-for-quantum.html

I learned (refreshed my knowledge) about Big O notation.  This simple chart explained the various computational complexity notation

Image courtesy : IBM Qiskit Textbook https://qiskit.org/textbook/ch-states/case-for-quantum.html

Further I learned the complexity of Factorization which is an exponential complexity making today cryptography techniques unbreakable.

In the closing notes, this article discuss 'When to use Quantum Computer'.  In my opinion, this is very important concept to understand.  Without this understanding, we may be misguided by the Quantum Hype that Quantum Computer is a solution for everything and misunderstanding that Quantum Computer will replace classical computer which is not true.

Quantum computers are great to solve certain class of problems which are classified as NP Hard problems.  From Complexity Theory perspective, any problem having complexity in Exponential form, is suitable for Quantum Computers to solve.

Image courtesy : IBM Qiskit Textbook https://qiskit.org/textbook/ch-states/case-for-quantum.html

From the above image, it is very clear that Quantum Computation has advantage with more volume and more complex problems.