Interactions in quantum systems can spread initially localized quantum information into the
exponentially many degrees of freedom of the entire system. Understanding this process …

We introduce a novel measure for the quantum property of “nonstabilizerness”—commonly
known as “magic”—by considering the Rényi entropy of the probability distribution …

The complexity of quantum states has become a key quantity of interest across various
subfields of physics, from quantum computing to the theory of black holes. The evolution of …

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 …

The precise control of complex quantum systems promises numerous technological
applications including digital quantum computing. The complexity of such devices renders …

The classical simulation of highly entangling quantum dynamics is conjectured to be
generically hard. Thus, recently discovered measurement-induced transitions between …

Nonstabilizerness or magic resource characterizes the amount of non-Clifford operations
needed to prepare quantum states. It is a crucial resource for quantum computing and a …

The applications of random quantum circuits range from quantum computing and quantum
many-body systems to the physics of black holes. Many of these applications are related to …

Magic (nonstabilizerness) is a necessary but “expensive” kind of “fuel” to drive universal fault-
tolerant quantum computation. To properly study and characterize the origin of quantum …

Motivated by recent work showing that a quantum error correcting code can be generated by
hybrid dynamics of unitaries and measurements, we study the long time behavior of such …