Related papers: Magic of quantum hypergraph states
Magic, or nonstabilizerness, is a crucial quantum resource, yet its dynamics in open quantum systems remain largely unexplored. We investigate magic in the open XXZ spin chain under either boundary gain and loss, or bulk dephasing using the…
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.…
Quantum advantage is widely understood to rely on key quantum resources beyond entanglement, among which nonstabilizerness (quantum ``magic'') plays a central role in enabling universal quantum computation. However, the exact evaluation of…
In this paper, we investigate the relationship between entanglement and non-stabilizerness (also known as magic) in matrix product states (MPSs). We study the relation between magic and the bond dimension used to approximate the ground…
In the resource theory of non-stabilizerness, we prove that stabilizer operations cannot replicate or broadcast the "magic" resource of all quantum states in an arbitrary finite dimension. Moreover, we show that even in unrestricted…
In this paper we study reusable magic states. These states are a special subset of the standard magic states. Once distilled, reusable magic states can be used, repeatedly, to apply some unitary U. Given this property, reusable magic states…
Universal quantum computers require entanglement and non-stabilizerness, a resource known as \textit{quantum magic}. Here, we introduce a protocol that prepares magic steady states by leveraging non-Hermitian dynamics, which, contrary to…
The entanglement properties of a multiparty pure state are invariant under local unitary transformations. The stabilizer dimension of a multiparty pure state characterizes how many types of such local unitary transformations existing for…
We introduce the magic hierarchy, a quantum circuit model that alternates between arbitrary-sized Clifford circuits and constant-depth circuits with two-qubit gates ($\textsf{QNC}^0$). This model unifies existing circuit models, such as…
The execution cost of quantum algorithms is typically quantified through asymptotic gate counts and qubit register sizes, yet these metrics do not directly capture which genuinely quantum resources, and in what amount, must be created and…
Magic state distillation (MSD) is a purification protocol that plays a central role in fault tolerant quantum computation. Repeated iteration of the steps of a MSD protocol, generates pure single non-stabilizer states, or magic states, from…
A fundamental problem in quantum information is to describe efficiently multipartite quantum states. An efficient representation in terms of graphs exists for several families of quantum states (graph, cluster, stabilizer states),…
Non-stabilizerness - commonly known as magic - measures the extent to which a quantum state deviates from stabilizer states and is a fundamental resource for achieving universal quantum computation. In this work, we investigate the behavior…
We demonstrate the use of variational neural network quantum states to study non-stabilizerness in qubit-regularised quantum field theory. Applying the methodology recently introduced by Sinibaldi et al., we numerically compute the…
Quantum many-body systems have been extensively studied from the perspective of quantum technology, and conversely, critical phenomena in such systems have been characterized by operationally relevant resources like entanglement. In this…
Magic states are key ingredients in schemes to realize universal fault-tolerant quantum computation. Theories of magic states attempt to quantify this computational element via monotones and determine how these states may be efficiently…
We investigate how non-stabilizer resources enable the emergence of quantum state designs within the projected ensemble. Starting from initial states with finite magic and applying resource-free Clifford circuits to scramble them, we…
We introduce Magic Secret Sharing (MSS), a quantum cryptographic primitive in which the secret is the computational capability of a quantum state rather than its classical description. In the resource theory of magic, non-stabilizer states…
We prove that magic states from the Clifford hierarchy give optimal solutions for tasks involving nonlocality and entropic uncertainty with respect to Pauli measurements. For both the nonlocality and uncertainty tasks, stabilizer states are…
Magic states enable universal, fault-tolerant quantum computation within the stabilizer framework. Their non-stabilizerness supplies the resource needed to bypass the Eastin-Knill theorem while allowing fault-tolerant distillation. Although…