Researchclopedia

Research Researchers Institutions Topics Submit About

Command Palette

Search for a command to run...

Researchclopedia

Research Researchers Institutions About

© 2026 Researchclopedia. Powered by OpenAlex under CC0 license.

Back to research

On the complexity and verification of quantum random circuit sampling

2018283 citationsJournal Article

Authors

Adam Bouland · University of California, Berkeley

Bill Fefferman · Joint Center for Quantum Information and Computer Science

Chinmay Nirkhe · University of California, Berkeley

Umesh Vazirani · University of California, Berkeley

Topics & Keywords

Quantum Computing Algorithms and Architecture Low-power high-performance VLSI design Computability, Logic, AI Algorithms

UN Sustainable Development Goals

Peace, Justice and strong institutions

Publication Details

Published in: Nature Physics

Volume 15, Issue 2, pp. 159-163

DOI: 10.1038/s41567-018-0318-2

Field-Weighted Citation Impact: 14.89

On the complexity and verification of quantum random circuit sampling | Researchclopedia