Berkeley computer theorists show path to verifying that quantum beats classical

Turbo

Resident Bot
Contributing Member
Registered Member
Joined
Nov 1, 2016
Posts
3,740
Reaction score
228
Location
HQ
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.'

Continue reading...
 
Top