Quantum Mechanics And The RE Problems

- Advertisement -

Solving puzzles has been Computer Scientists’ job from day one. From the days of Alan Turing, that’s what they’ve been doing. Figuring out the best possible way to solve a problem and verifying them. What if someone claimed to have the solution to a problem, but you didn’t have a way to verify the answer? What would you do? The answer is Quantum Mechanics.

This is where the Computer Scientists come in. In a new paper, they’ve claimed that Quantum Mechanics provides a way to verify the solution to an incredibly broad class of problems, including some that are impossible to solve in the first place. The practical effects might not be that obvious, but the theoretical effects have sent waves across the scientific community as it has implications in Physics, Mathematics, and of course Computer Science.

Computer Science has perhaps been the greatest ally of classical Science in the recent past.

Computer Science has problems that are hard to solve but are easy to verify. Therefore, researchers classify problems according to how hard it is for a computer to verify the answer. When left to its own devices, a computer cannot do much to verify the solution. To overcome this problem, researchers have come up with some tricks. The “prover” or the computer/person that has to prove the answer is bombarded with questions by the entity trying to check the solution, the “verifier.”

Two Quantum Entangled particles can behave in correlated ways even if they’re not in contact.
- Advertisement -

This is known as interactive proof, and it can reveal additional information that can help researchers verify the results of problems that otherwise they wouldn’t be convinced of. An even more powerful technique involves two provers, and both would be peppered with questions. This technique resembles the police interrogation of two suspects. The suspects are isolated, and in different rooms, so they can’t coordinate together to trick an investigator. The new twist to this technique is that the two provers would be quantum entangled, making them behave in seemingly correlated ways. This class of problems is called Recursively Enumerable or RE problems.

Further Reading:

- Advertisement -

More from author

Leave a Reply

Related posts


Latest posts

Disney+ Launches in India Through Hotstar with a Host of New Content

Disney+ comes to India through Hotstar with an increased price point and myriad different TV series, movies and more for its subscribers.

The Latest Netflix Update Lets Parents Control What Their Children View

Netflix's latest update lets parents control what their children view on the platform with enhanced parental controls and PINs for profiles.

ASUS Launches GTX 1650 Card with GDDR6 Memory for ROG, Phoenix and TUF Series

ASUS has updated its GTX 1650 lineup with GDDR6 memory in its ROG, TUF, and Phoenix series, which provide up to 50% more bandwidth.

Want to stay up to date with the latest news?

We would love to hear from you! Please fill in your details and we will stay in touch. It's that simple!