Random quantum circuit easiest way to beat classical computer

Random quantum circuit easiest way to beat classical computer

  • May 3, 2018
Table of Contents

Random quantum circuit easiest way to beat 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.

Source: arstechnica.com

Tags :
Share :
comments powered by Disqus

Related Posts

Physicists discover new quantum electronic material

Physicists discover new quantum electronic material

MIT, Harvard, and LBNL physicists have discovered a new quantum electronic material, the “kagome metal,” whose atomic structure resembles a Japanese basketweaving pattern and exhibits exotic, quantum behavior.

Read More
Is it Time for Quantum Computing Startups? Maybe

Is it Time for Quantum Computing Startups? Maybe

That was the message of the Q Summit, a one-day meeting of quantum computing researchers, investors, and entrepreneurs hosted by IBM in Menlo Park, Calif., last week.

Read More
20 Entangled Qubits Bring the Quantum Computer Closer

20 Entangled Qubits Bring the Quantum Computer Closer

In 1981, Richard Feynman suggested that a quantum computer might be able to simulate the evolution of quantum systems much better than classical computers. Except for several proof-of-principle experiments, no working quantum computer has yet been built.

Read More