Related papers: Probing quantum complexity via universal saturatio…
Quantifying non-stabilizerness (``magic'') in interacting fermionic systems remains a formidable challenge, particularly for extracting high order correlations from quantum Monte Carlo simulations. In this Letter, we establish the two-point…
We employ the Stabilizer Renyi Entropy (SRE) to characterize a quantum phase transition that has so far eluded any standard description and can thus now be explained in terms of the interplay between its non-stabilizer properties and…
While there is strong evidence for advantages of quantum over classical computation, the repertoire of computational primitives with proven or conjectured quantum advantage remains limited. A big challenge of quantum algorithmic design is a…
Non-stabilizerness, or magic, is a resource for universal quantum computation in most fault-tolerant architectures; access to states with non-stabilizerness allows for non-classically simulable quantum computation to be performed.…
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 $\Omega(n)$ $T$-gates are necessary for any Clifford+$T$ circuit to prepare…
Quantum state discrimination plays a central role in defining the possible and impossible operations through a restricted class of quantum operations. A seminal result by Bennett et al. [Phys. Rev. A 59, 1070 (1999)] demonstrates the…
Recent work has explored using the stabilizer formalism to classically simulate quantum circuits containing a few non-Clifford gates. The computational cost of such methods is directly related to the notion of stabilizer rank, which for a…
The development of a framework for quantifying "non-stabiliserness" of quantum operations is motivated by the magic state model of fault-tolerant quantum computation, and by the need to estimate classical simulation cost for noisy…
We study the emergence of complexity in deep random $N$-qubit $T$-gate doped Clifford circuits, as reflected in their spectral properties and in magic generation, characterized by the stabilizer R\'enyi entropy distribution and the…
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…
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…
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…
We present a novel quantum Monte Carlo method for evaluating the $\alpha$-stabilizer R\'enyi entropy (SRE) for any integer $\alpha\ge 2$. By interpreting $\alpha$-SRE as partition function ratios, we eliminate the sign problem in the…
The study of the boundary between classically simulable and computationally complex quantum dynamics is fundamental to understanding which physical resources may enable enhanced information-processing capabilities. We investigate this…
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…
We investigate the effectiveness of the stabilizer R\'enyi entropy (SRE), a quantifier associated with non-stabilizer resources (quantum magic), as an indicator of quantum phase transitions. Specifically, we analyze the behavior of the…
We introduce an efficient method to quantify nonstabilizerness in fermionic Gaussian states, overcoming the long-standing challenge posed by their extensive entanglement. Using a perfect sampling scheme based on an underlying determinantal…
Random Clifford circuits doped with non Clifford gates exhibit transitions to universal entanglement spectrum statistics[1] and quantum chaotic behavior. In [2] we proved that the injection of $O(n)$ non Clifford gates into a $n$-qubit…
We present a thorough investigation of nonstabilizerness - a fundamental quantum resource that quantifies state complexity within the framework of quantum computing - in a one-dimensional U(1) lattice gauge theory. We show how…
Universal quantum computing requires nonstabilizer (magic) quantum states. Quantifying the nonstabilizerness and relating it to other quantum resources is vital for characterizing the complexity of quantum many-body systems. In this work,…