Related papers: Quantification and manipulation of magic 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…
Stabiliser operations occupy a prominent role in fault-tolerant quantum computing. They are defined operationally: by the use of Clifford gates, Pauli measurements and classical control. These operations can be efficiently simulated on a…
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…
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…
The leading approach to fault tolerant quantum computing requires a continual supply of magic states. When a new magic state is first encoded, its initial fidelity will be too poor for use in the computation. This necessitates a…
Quantum Fourier analysis is an important topic in mathematical physics. We introduce a systematic protocol for testing and measuring ``magic'' in quantum states and gates, using a quantum Fourier approach. Magic, as a quantum resource, is…
We employed the techniques from [Phys. Rev. A \textbf{70}, 052328 (2004)/arXiv:0406196] to analytically study two set of quantum circuits containing one $T$ gate/magic $|T\rangle = \frac{|0\rangle+\sqrt{i}|1\rangle}{\sqrt{2}}$ state. These…
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…
Magic states are essential for achieving universal quantum computation. This study introduces a reversible framework for the manipulation of magic states in odd dimensions, delineating a necessary and sufficient condition for the exact…
Given stabilizer operations and the ability to repeatedly prepare a single-qubit mixed state rho, can we do universal quantum computation? As motivation for this question, "magic state" distillation procedures can reduce the general…
Control strategies for dissipative preparation of target quantum states, both pure and mixed, and subspaces are obtained by switching between a set of available semigroup generators. We show that the class of problems of interest can be…
We introduce a monotone to quantify the amount of non-stabilizerness (or magic for short), in an arbitrary quantum state. The monotone gives a necessary and sufficient criterion for detecting the presence of magic for both pure and mixed…
In quantum computing, the nonstabilizerness of quantum operations is crucial for understanding and quantifying quantum speedups. In this study, we explore the phenomena of nonstabilizerness of the quantum SWITCH, a novel structure that…
It is shown that a finite number of conditions are {\em not} sufficient to determine the locality of transformations between two probability distributions of pure states as well as the locality of transformations between two $d\times d$…
We consider the problem of testing whether an unknown $n$-qubit quantum state $|\psi\rangle$ is a stabilizer state, with only single-copy access. We give an algorithm solving this problem using $O(n)$ copies, and conversely prove that…
Magic quantum states (non-stabilizer states) play a pivotal role in fault-tolerant quantum computation. Simultaneously, random resources have emerged as a key element in various randomized techniques within contemporary quantum science. In…
Motivated by their necessity for most fault-tolerant quantum computation schemes, we formulate a resource theory for magic states. We first show that robustness of magic is a well-behaved magic monotone that operationally quantifies the…
Nonstabilizerness, also known as magic, is a crucial resource for quantum computation. The growth in complexity of quantum processing units (QPUs) demands robust and scalable techniques for characterizing this resource. We introduce the…
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 is a quantum resource essential for universal quantum computation and represents the deviation of quantum states from those that can be simulated efficiently using classical algorithms. Using the Stabilizer R\'enyi Entropy (SRE), we…