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

Netflix’s Yeh Ballet Gets Accolades at Special Screening

Netflix hosted a special screening of its original movie 'Yeh Ballet' for directors along with the cast and crew of the movie.

OnePlus 8 Pro Tipped to Carry an Official IP Rating for Water-Resistance

OnePlus is known to offer incredible value-for-money affordable flagship devices in a market where the big players are releasing devices costing way...

KDM Power Bank With 10,000 mAh Capacity and Dual Charging Launched

KDM recently launched KDM 10X Powerbank. The KDM 10X comes with 10,000 mAh and charges 2 devices simultaneously with its two USB-A...

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!