Related papers: Certifying nonstabilizerness in quantum processors
Quantum coherence quantifies the amount of superposition in a quantum system, and is the reason and resource behind several phenomena and technologies. It depends on the natural basis in which the quantum state of the system is expressed,…
Quantum computers promise dramatic advantages over their classical counterparts, but the answer to the most basic question "What is the source of the power in quantum computing?" has remained elusive. Here we prove a remarkable equivalence…
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…
Quantum magic, or nonstabilizerness, provides a crucial characterization of quantum systems, regarding the classical simulability with stabilizer states. In this work, we propose a novel and efficient algorithm for computing stabilizer…
Verification is a task to check whether a given quantum state is close to an ideal state or not. In this paper, we show that a variety of many-qubit quantum states can be verified with only sequential single-qubit measurements of Pauli…
Quantum simulation is a cornerstone application of quantum computing, yet how fundamental quantum resources--entanglement and non-stabilizerness (``magic")--shape simulation fidelity remains an open question. In this work, we establish a…
While quantum computers are expected to yield considerable advantages over classical devices, the precise features of quantum theory enabling these advantages remain unclear. Contextuality--the denial of a notion of classical physical…
Many proposals for fault-tolerant quantum computation require injection of 'magic states' to achieve a universal set of operations. Some qubit states are above a threshold fidelity, allowing them to be converted into magic states via 'magic…
Superposed coherent states are central to quantum technologies, yet their reliable identification remains a challenge, especially in noisy or resource-constrained settings. We introduce a novel, directly measurable criterion for detecting…
Unraveling the secrets of how much nonstabilizerness a quantum dynamic can generate is crucial for harnessing the power of magic states, the essential resources for achieving quantum advantage and realizing fault-tolerant quantum…
The interplay between non-stabilizerness and entanglement in random states is a very rich arena of study for the understanding of quantum advantage and complexity. In this work, we tackle the problem of such interplay in random pure quantum…
We introduce a notion of chirality for generic quantum states. A chiral state is defined as a state which cannot be transformed into its complex conjugate in a local product basis using local unitary operations. We introduce a number of…
Magic state distillation is a critical component in leading proposals for fault-tolerant quantum computation. Relatively little is known, however, about how to construct a magic state distillation routine or, more specifically, which…
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…
We show how nonclassical correlations in local bipartite states can act as a resource for quantum information processing. Considering the task of quantum random access codes (RAC) through separable Bell-diagonal states, we demonstrate the…
An obstacle affecting any proposal for a topological quantum computer based on Ising anyons is that quasiparticle braiding can only implement a finite (non-universal) set of quantum operations. The computational power of this restricted set…
Typical measures of nonstabilizerness of a system of $N$ qubits require computing $4^N$ expectation values, one for each Pauli string in the Pauli group, over a state of dimension $2^N$. For permutationally invariant systems, this…
Magic states play an important role in fault-tolerant quantum computation, and so the quantification of magic for quantum states is of great significance. In this work, we propose two new magic quantifiers by introducing two versions of…
Nonstabilizerness, or `magic', is a critical quantum resource that, together with entanglement, characterizes the non-classical complexity of quantum states. Here, we address the problem of quantifying the average nonstabilizerness of…
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…