Related papers: Stabilizer Entropy of Subspaces
Finding ways to quantify magic is an important problem in quantum information theory. Recently Leone, Oliviero and Hamma introduced a class of magic measures for qubits, the stabilizer entropies of order $\alpha$, to aid in studying…
Boundary time crystals exhibit measurement-induced phase transitions in their steady-state entanglement, with critical behavior that depends on the particular unraveling of the Lindblad dynamics. In this work, we investigate another key…
Non-stabilizerness - also colloquially referred to as magic - is the a resource for advantage in quantum computing and lies in the access to non-Clifford operations. Developing a comprehensive understanding of how non-stabilizerness can be…
Entanglement and magic are fundamental resources that capture the complexity of quantum many-body systems. Non-local magic isolates the irreducible nonstabilizerness intrinsically tied to entanglement. However, evaluating this quantity…
Nonstabilizerness, also known as magic, quantifies the number of non-Clifford operations needed in order to prepare a quantum state. As typical measures either involve minimization procedures or a computational cost exponential in the…
Quantum state complexity metrics, such as anticoncentration and nonstabilizerness, or ``magic'', offer key insights into many-body physics, information scrambling, and quantum computing. Anticoncentration and equilibration of magic…
The quantum relative entropy is a fundamental quantity in quantum information science, characterizing the distinguishability between two quantum states. However, this quantity is not additive in general for correlated quantum states,…
We investigate magic and its connection to entanglement in 1+1 dimensional random free fermion circuits, with a focus on hybrid free fermion dynamics that can exhibit an entanglement phase transition. To quantify magic, we use the…
Magic states are fundamental building blocks on the road to fault-tolerant quantum computing. CSS codes play a crucial role in the construction of magic distillation protocols. Previous work has cast quantum computing with magic states for…
We investigate the dynamics of nonstabilizerness - also known as `magic' - in monitored quantum circuits composed of random Clifford unitaries and local projective measurements. For measurements in the computational basis, we derive an…
Recently, cat states have been used to heuristically improve the runtime of a classical simulator of quantum circuits based on the diagrammatic ZX-calculus. Here we investigate the use of cat-state injection within the quantum circuit…
Quantum computing's promise lies in its intrinsic complexity, with entanglement initially heralded as its hallmark. However, the quest for quantum advantage extends beyond entanglement, encompassing the realm of nonstabilizer (magic)…
Stabilizer states constitute a set of pure states which plays a dominant role in quantum error correction, measurement--based quantum computation, and quantum communication. Central in these applications are the local symmetries of these…
We study the non-stabilizerness (quantum magic) content of the Hubbard dimer, an analytically solvable, yet completely non-trivial, model of strongly correlated fermions. We can access zero- and finite-temperature properties as well as the…
Classical and quantum states can be distinguished by entanglement entropy, which can be viewed as a measure of quantum resources. Entanglement entropy also plays a pivotal role in understanding computational complexity in simulating quantum…
Stabiliser states play a central role in the theory of quantum computation. For example, they are used to encode computational basis states in the most common quantum error correction schemes. Arbitrary quantum states admit many stabiliser…
Stabilizer Entropy (SE) quantifies the spread of a state in the basis of Pauli operators. It is a computationally tractable measure of non-stabilizerness and thus a useful resource for quantum computation. SE can be moved around a quantum…
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 Clifford group and stabilizer states. These resources - sometimes…
Erasure qubits constitute a promising approach for tackling the daunting resources required for fault-tolerant quantum computing. By heralding erasure errors, both the error-correction threshold and the sub-threshold scaling of the logical…
Quantum systems can not be efficiently simulated classically due to the presence of entanglement and nonstabilizerness, also known as quantum magic. Here we study the generation of magic under evolution by a quantum circuit. To be able to…