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 …

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 …

Quantum circuit complexity—a measure of the minimum number of gates needed to
implement a given unitary transformation—is a fundamental concept in quantum …

The recent discovery of fully homomorphic classical encryption schemes has had a dramatic
effect on the direction of modern cryptography. Such schemes, however, implicitly rely on the …

We consider Gaussian quantum circuits supplemented with non-Gaussian input states and
derive sufficient conditions for efficient classical strong simulation of these circuits. In …

We introduce a quantum convolution and a conceptual framework to study states in discrete-
variable (DV) quantum systems. All our results suggest that stabilizer states play a role in DV …

Discriminating between quantum computing architectures that can provide quantum
advantage from those that cannot is of crucial importance. From the fundamental point of …

Given a unitary transformation, what is the size of the smallest quantum circuit that
implements it? This quantity, known as the quantum circuit complexity, is a fundamental …

Magic, or nonstabilizerness, characterizes how far away a state is from the stabilizer states,
making it an important resource in quantum computing, under the formalism of the Gotteman …