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

The Theory of Quantum Information

The Theory of Quantum Information

To be published by Cambridge University Press in April 2018. Upon publication this book will be available for purchase through Cambridge University Press and other standard distribution channels. Please see the publisher’s web page to pre-order the book or to obtain further details on its publication date.

Read More
Quantum Computers Strive to Break Out of the Lab

Quantum Computers Strive to Break Out of the Lab

Schrödinger’s famous thought experiment has come to life in a new form because quantum researchers are at the cusp of a long-sought accomplishment: creating a quantum computer that can do something notraditional computer can match. They’ve spent years battling naysayers who insisted that a quantum computer was an unachievable sci-fi fantasy, and nowthese researchers are finally beginning to indulge in some well-deserved self-congratulation.

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