Stabilizer rényi entropy
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 …
known as “magic”—by considering the Rényi entropy of the probability distribution …
On the practical usefulness of the hardware efficient ansatz
Abstract Variational Quantum Algorithms (VQAs) and Quantum Machine Learning (QML)
models train a parametrized quantum circuit to solve a given learning task. The success of …
models train a parametrized quantum circuit to solve a given learning task. The success of …
Phase transition in magic with random quantum circuits
Magic is a property of quantum states that enables universal fault-tolerant quantum
computing using simple sets of gate operations. Understanding the mechanisms by which …
computing using simple sets of gate operations. Understanding the mechanisms by which …
Scrambling is necessary but not sufficient for chaos
We show that out-of-time-order correlators (OTOCs) constitute a probe for local-operator
entanglement (LOE). There is strong evidence that a volumetric growth of LOE is a faithful …
entanglement (LOE). There is strong evidence that a volumetric growth of LOE is a faithful …
Quantifying nonstabilizerness through entanglement spectrum flatness
Nonstabilizerness, also colloquially referred to as magic, is a resource for advantage in
quantum computing and lies in the access to non-Clifford operations. Develo** a …
quantum computing and lies in the access to non-Clifford operations. Develo** a …
Quantifying nonstabilizerness of matrix product states
Nonstabilizerness, also known as magic, quantifies the number of non-Clifford operations
needed to prepare a quantum state. As typical measures either involve minimization …
needed to prepare a quantum state. As typical measures either involve minimization …
Scalable measures of magic resource for quantum computers
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 …
needed to prepare quantum states. It is a crucial resource for quantum computing and a …
Random quantum circuits are approximate unitary -designs in depth
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 …
many-body systems to the physics of black holes. Many of these applications are related to …
Dynamical Magic Transitions in Monitored Clifford+ Circuits
The classical simulation of highly entangling quantum dynamics is conjectured to be
generically hard. Thus, recently discovered measurement-induced transitions between …
generically hard. Thus, recently discovered measurement-induced transitions between …
Magic-state resource theory for the ground state of the transverse-field Ising model
Ground states of quantum many-body systems are both entangled and possess a kind of
quantum complexity, as their preparation requires universal resources that go beyond the …
quantum complexity, as their preparation requires universal resources that go beyond the …