Berkeley computer theorists show path to verifying that quantum beats classical

Researchers have just found a way to show that quantum computing beats classical computing by giving a leading practical proposal known as random circuit sampling (RCS) a qualified seal of approval with the weight of complexity theoretic evidence behind it. They showed that producing a random output with a 'quantum accent' is indeed hard for a classical computer through a technical complexity theoretic construct called 'worst-to-average-case reduction.'

from Latest Science News -- ScienceDaily https://ift.tt/2yGC3pL