Related papers: Maximal Magic for Two-qubit States
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…
In quantum computing, non-stabilizerness -- the magic -- refers to the computational advantage of certain quantum states over classical computers and is an essential ingredient for universal quantum computation. Employing the second order…
Magic, a key quantum resource beyond entanglement, remains poorly understood in terms of its structure and classification. In this paper, we demonstrate a striking connection between high-dimensional symmetric lattices and quantum magic…
Magic and entanglement are two measures that are widely used to characterize quantum resources. We study the interplay between magic and entanglement in two-qubit systems, focusing on the two extremes: maximal magic and minimal magic for a…
Identifying the boundary between classical and quantum computation is a central challenge in quantum information. In multi-qubit systems, entanglement and magic are the key resources underlying genuinely quantum behaviour. While…
Magic, or nonstabilizerness, characterizes the deviation of a quantum state from the set of stabilizer states and plays a fundamental role from quantum state complexity to universal fault-tolerant quantum computing. However, analytical or…
Magic is a property of a quantum state that characterizes its deviation from a stabilizer state, serving as a useful resource for achieving universal quantum computation e.g., within schemes that use Clifford operations. In this work, we…
Magic, capturing the deviation of a quantum state from the stabilizer formalism, is a key resource underpinning the quantum advantage. The recently introduced stabilizer R\'enyi entropy (SRE) offers a tractable measure of magic, avoiding…
Magic (non-stabilizerness) is a necessary but "expensive" kind of "fuel" to drive universal fault-tolerant quantum computation. To properly study and characterize the origin of quantum "complexity" in computation as well as physics, it is…
Magic describes the distance of a quantum state to its closest stabilizer state. It is -- like entanglement -- a necessary resource for a potential quantum advantage over classical computing. We study magic, quantified by stabilizer…
We introduce a methodology to estimate non-stabilizerness or "magic", a key resource for quantum complexity, with Neural Quantum States (NQS). Our framework relies on two schemes based on Monte Carlo sampling to quantify non-stabilizerness…
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…
Nonstabilizerness, or magic, is a necessary resource for quantum advantage beyond the classically simulatable Clifford framework. Recent works have begun to chart the structure of magic in many-body states, introducing the concepts of…
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…
Stabilizer R\'enyi entropies (SREs) probe the non-stabilizerness (or magic) of many-body systems and quantum computers. Here, we introduce the mutual von-Neumann SRE and magic capacity, which can be efficiently computed in time $O(N\chi^3)$…
The nonstabilizerness, or magic, is an essential quantum resource to perform universal quantum computation. Robustness of magic (RoM) in particular characterizes the degree of usefulness of a given quantum state for non-Clifford operation.…
Non-stabilizerness, also known as ``magic,'' quantifies how far a quantum state departs from the stabilizer set. It is a central resource behind quantum advantage and a useful probe of the complexity of quantum many-body states. Yet…
In most stabilizer-based quantum computing schemes, so-called magic states are a necessary resource for implementing non-transversal quantum gates. With the resource theory of magic, it is possible to analyze and quantify the generation of…
Magic or non-stabilizerness is a resource for quantum computing that has been extensively studied in qudit networks. It describes the degree to which Clifford gates cannot generate a given state, capturing the advantage of quantum over…
Notions of nonstabilizerness, or "magic", quantify how non-classical quantum states are in a precise sense: states exhibiting low nonstabilizerness preclude quantum advantage. We introduce 'pseudomagic' ensembles of quantum states that,…