| Home : October 31 2018 Computer News : Berkeley computer theorists show path to verifying that quantum beats classical |
|
Berkeley computer theorists show path to verifying that quantum beats classical |
October 31, 2018
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.'
Link: https://www.sciencedaily.com/releases/2018/10/181030102817.htm
|
|
|
|
|
