We prove that random quantum circuits on any geometry, including a 1D line, can form
approximate unitary designs over $ n $ qubits in $\log n $ depth. In a similar manner, we …

We study the complexity of learning quantum states in various models with respect to the
stabilizer formalism and obtain the following results: We prove that Ω (n) T-gates are …

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

Quantum pseudorandom state generators (PRSG s) have stimulated exciting developments
in recent years. A PRSG, on a fixed initial (eg, all-zero) state, produces an output state that is …

Quantum pseudorandomness has found applications in many areas of quantum information,
ranging from entanglement theory, to models of scrambling phenomena in chaotic quantum …

We study the task of agnostic tomography: given copies of an unknown $ n $-qubit state
$\rho $ which has fidelity $\tau $ with some state in a given class $ C $, find a state which …

Work extraction is one of the most central processes in quantum thermodynamics. However,
the prior analysis of optimal extractable work has been restricted to a limited operational …

A fundamental result in classical cryptography is that pseudorandom generators are
equivalent to one-way functions and in fact implied by nearly every classical cryptographic …

A core challenge for superconducting quantum computers is to scale up the number of
qubits in each processor without increasing noise or cross-talk. Distributed quantum …

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+ …