Quantum random sampling is the leading proposal for demonstrating a computational
advantage of quantum computers over classical computers. Recently the first large-scale …

The concept of quantum computing has inspired a whole new generation of scientists,
including physicists, engineers, and computer scientists, to fundamentally change the …

The Haar measure plays a vital role in quantum information, but its study often requires a
deep understanding of representation theory, posing a challenge for beginners. This tutorial …

A critical milestone on the path to useful quantum computers is the demonstration of a
quantum computation that is prohibitively hard for classical computers—a task referred to as …

We introduce a framework to study discrete-variable (DV) quantum systems based on qudits.
It relies on notions of a mean state (MS), a minimal stabilizer-projection state (MSPS), and a …

We consider quantum circuits consisting of randomly chosen two-local gates and study the
number of gates needed for the distribution over measurement outcomes for typical circuit …

The classical shadows protocol, recently introduced by Huang, Kueng, and Preskill [Nat.
Phys. 16, 1050 (2020)], is a quantum-classical protocol to estimate properties of an unknown …

Quantum computational supremacy arguments, which describe a way for a quantum
computer to perform a task that cannot also be done by a classical computer, typically …

Pseudorandom quantum states (PRSs) and pseudorandom unitaries (PRUs) possess the
dual nature of being efficiently constructible while appearing completely random to any …

Sampling from the output distributions of quantum computations comprising only commuting
gates, known as instantaneous quantum polynomial (IQP) computations, is believed to be …