Thank you for sharing this thought-provoking concept, and here's to the exciting developments in the field of quantum computing!
Most Recent
Forum Legend
Following
New Comments
Locked Topic
Pinned Topic
THis is from my book " computer chess and beyond"
BIRTHDAY PARADOX AND QUANTUM COMPUTERS
Nobody understands quantum mechanics
Richard Feynman
Quantum computers are fast but they are not reliable at very shaky quantum states, for this reason today no quantum computer can solve any problem efficiently than a classical computing system.
We need to find a way to increase reliability of quantum computers. Here birthday paradox comes handy with the help of classical computers it is possible to produce much better quantum computing systems. We can put quantum computing and classical computing together by using birthday paradox as a glue to create a hybrid computing system.
Let’s say we have computational search tree problem called problem A which can be solved by a classical computer in 1 trillion seconds. We also have a quantum computer which can solve the same problem in 1 second. But our quantum computer is not reliable. It has probability of working properly one in a trillion (1/1012).
We can run our classical computer for one trillion (1012) seconds or we can try our quantum computer one trillion times. Both computing approach has same time complexity and it is one trillion seconds which approximately equals to 31688 years. Well if you do not have that level of patience I recommend you to try hybrid quantum computing.
The Diagram below shows the basic schema of Hybrid Quantum computing based on generalized birthday paradox. Every second classical computer computes the 1/1012 size of the very large search tree. Then Quantum computer tries to solve the problem with excluding this part of the search tree and so on. If every step takes one second after 3000000 steps the probability of solving the given problem is more than 97 percent and it takes approximately 35 days.
Hybrid Quantum Computing
C=classical computer Q=Quantum computer.