Google’s claim of achieving “quantum supremacy” has received its fair share of criticisms from industry competitors and skeptics. Despite being able to show a demonstration of the technological milestone, critics counter that the utility of the quantum supremacy display ends there and that the technology is not useful for practical tasks, at least as of yet. However, quantum theoretician Scott Aaronson from the University of Texas at Austin claims otherwise.
Aaronson, who peer-reviewed the quantum supremacy paper released by Google, said that he sees potential application of quantum computing in cryptocurrencies, particularly in moderating issues associated with proof-of-stake (PoS) crypto technology.
Quantum computing could be applied to PoS
Proof-of-stake is a type of consensus algorithm wherein a crypto Blockchain network chooses the next block creator by relying on various combinations of random selection, which includes age or wealth. However, the integrity of the PoS variant has long been the subject of debates in the crypto community.
On October 23, Aaronson told Fortune that a sampling-based experiment that used quantum computing technology could be adapted immediately for a completely different purpose. He stressed that quantum computing could generate bits that are genuinely random, which could assuage the issues associated with PoS random selection. Aside from its potential application to proof-of-stake, Aaronson said that quantum computing could also be applied to other cryptographic protocols.
Google Quantum vs. Church-Turing thesis
According to Google, its Sycamore 54-qubit processor was able to solve an extremely complex equation in just 200 seconds. Notably, the most powerful supercomputer in the world would take 10, 000 years to achieve what quantum supremacy has done. As claimed by Google, their experiment marks the first time the extended Church-Turing thesis had been challenged. In computability theory, the Church-Turing hypothesis states that traditional computers can perform a “reasonable” model of computation if and only if it is computable by a Turing machine.