The ability of quantum computers to directly manipulate and analyze quantum states stored
in quantum memory allows them to learn about aspects of our physical world that would …

In this paper, we present a learning algorithm aimed at learning states obtained from
computational basis states by Clifford circuits doped with a finite number $ t $ of $ T $-gates …

We introduce a new notion called Q-secure pseudorandom isometries (PRI). A
pseudorandom isometry is an efficient quantum circuit that maps an n-qubit state to an (n+ …

Cross-platform verification is the task of comparing the output states produced by different
physical platforms using solely local quantum operations and classical communication …

We show it is possible to obtain quantum pseudorandomness and pseudoentanglement
from random subset states--ie quantum states which are equal superpositions over (pseudo) …

The existence of pseudorandom unitaries (PRUs)--efficient quantum circuits that are
computationally indistinguishable from Haar-random unitaries--has been a central open …

Stabilizer entropies (SEs) are measures of nonstabilizerness or “magic” that quantify the
degree to which a state is described by stabilizers. SEs are especially interesting due to their …

We may soon see agencies offering public access to quantum communication networks. In
such networks it may be a feature that certain resources are available only to priority users …

Quantum theory is traditionally formulated using complex numbers. This imaginarity of
quantum theory has been quantified as a resource with applications in discrimination tasks …

Pseudorandom states (PRS) are an important primitive in quantum cryptography. In this
paper, we show that subset states can be used to construct PRSs. A subset state with …