Random quantum circuit easiest way to beat classical computer

Enlarge / The evolution of a chaotic quantum system. (credit: Joint Quantum Institute)

One of the near-term (but somewhat irrelevant) goals of quantum computing is something called quantum supremacy. Quantum supremacy is not, sadly, a cage fight between proponents of competing interpretations of quantum mechanics. It is a demonstration of a quantum computer performing a computation, no matter how trivial, that cannot be performed on a classical computer.

The key question: what computation should be performed? A team of researchers is suggesting that computing the state of a random quantum circuit that exhibits chaotic behavior would be perfect for the task. Let’s delve into why that might be.

Getting all superior

The idea of quantum supremacy goes a bit like this. Yes, we have all of these different versions of quantum computing. And yes, they all seem to behave how we expect a quantum computer to behave. But they are all remarkably slow and can easily be beaten by classical computers.

Read 21 remaining paragraphs | Comments

Post Author: martin

Martin is an enthusiastic programmer, a webdeveloper and a young entrepreneur. He is intereted into computers for a long time. In the age of 10 he has programmed his first website and since then he has been working on web technologies until now. He is the Founder and Editor-in-Chief of BriefNews.eu and PCHealthBoost.info Online Magazines. His colleagues appreciate him as a passionate workhorse, a fan of new technologies, an eternal optimist and a dreamer, but especially the soul of the team for whom he can do anything in the world.

Leave a Reply

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.