Quantum Mechanics And The RE Problems


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.

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:

Leave a Reply

Latest posts

Dirty Laundry in Space? NASA is Sending Tide Detergent to Space

What about laundry in space? Tide detergent is partnering with NASA to find a laundry solution to help keep astronauts’ clothes fresh in space. Find out how.

Poco F3 GT with 120Hz AMOLED, Dimensity 1200 and 64MP Camera Launched in India – Starts at Rs. 25,999

Poco today announced the much-awaited Poco F3 GT, successor to 2019's Poco F1. Like every other Poco smartphone, the F3 GT is also a...

Deep-Sea Robots Launched by Titanic Discoverer Bob will Help Find Millions of Shipwrecks

Titanic discoverer Bob Ballard, a marine archaeologist, is creating a new class of deep-sea robots that will transform the search for lost shipwrecks.

Loading Next Article