Email Print Share

News From the Field

Berkeley computer theorists show path to verifying that quantum beats classical


October 29, 2018

This material is available primarily for archival purposes. Telephone numbers or other contact information may be out of date; please see current contact information at media contacts.

Researchers at the University of California, Berkeley, have just found a way to show that quantum computing beats classical computing by giving a leading practical proposal known as random circuit sampling 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. Full Story

Source
University of California, Berkeley

The U.S. National Science Foundation propels the nation forward by advancing fundamental research in all fields of science and engineering. NSF supports research and people by providing facilities, instruments and funding to support their ingenuity and sustain the U.S. as a global leader in research and innovation. With a fiscal year 2021 budget of $8.5 billion, NSF funds reach all 50 states through grants to nearly 2,000 colleges, universities and institutions. Each year, NSF receives more than 40,000 competitive proposals and makes about 11,000 new awards. Those awards include support for cooperative research with industry, Arctic and Antarctic research and operations, and U.S. participation in international scientific efforts.

mail icon Get News Updates by Email 

Connect with us online
NSF website: nsf.gov
NSF News: nsf.gov/news
For News Media: nsf.gov/news/newsroom
Statistics: nsf.gov/statistics/
Awards database: nsf.gov/awardsearch/

Follow us on social
Twitter: twitter.com/NSF and twitter.com/NSFspox
Facebook: facebook.com/US.NSF
Instagram: instagram.com/nsfgov