Its a good article though but just to make it even better go through an example. The best example of how quantum computing works is, imagine you are in a puzzle or say a maze. To get out of the maze, you have to try every possible path, i.e. one path per attempt because you can not be present at all the positions simultaneously. i.e either 0 or 1.
But what if i say you can be present at all the positions simultaneously to check every path simultaneously, you would probably find the right path in just fraction of the previous time. i.e you can be 0 or 1 or both. This is the foundation.
You are viewing a single comment's thread from:
reminds me of the options facing Mr. Nobody! Great comment and great article, thanks!
Awesome!! your explanation couldn't get any easier for this subject. Thanks for adding this, I greatly appreciate it.