Related papers: Quantification and manipulation of magic states
The coherence transformation is pivotal for quantum technologies, which cannot always be accomplished deterministically. We investigate the probabilistic coherence transformation under strictly incoherent operations. To this end, by virtue…
Based on the conditional quantum dynamics of laser-ion interaction, we propose an efficient theoretical scheme to deterministically generate quantum pure states of a single trapped cold ion without performing the Lamb-Dicke approximation.…
Manipulation and quantification of quantum resources are fundamental problems in quantum physics. In the asymptotic limit, coherence distillation and dilution have been proposed by manipulating infinite identical copies of states. In the…
It was recently shown that a hidden variable model can be constructed for universal quantum computation with magic states on qubits. Here we show that this result can be extended, and a hidden variable model can be defined for quantum…
How can one certify that an unknown quantum state possesses magic without resorting to full state tomography? We address this question by introducing two thermodynamic witnesses that rely solely on energy and heat measurements. First, we…
We present the theoretical basis for and experimental verification of arbitrary single-qubit state generation, using the polarization of photons generated via spontaneous parametric downconversion. Our precision measurement and state…
Quantum states are very delicate, so it is likely some sort of quantum error correction will be necessary to build reliable quantum computers. The theory of quantum error-correcting codes has some close ties to and some striking differences…
We propose a general scheme for dissipatively preparing arbitrary pure quantum states on a multipartite qubit register in a finite number of basic control blocks. Our "splitting-subspace" approach relies on control resources that are…
If we want to transform the quantum state of a system to another using local measurement processes, what is the probability of success? This probability is bounded by quantifying entanglement in both the states. In this paper, we construct…
We find a minimal set of necessary and sufficient conditions for the existence of a local procedure that converts a finite pure state into one of a set of possible final states. This result provides a powerful method for obtaining optimal…
In formal languages and automata theory, the magic number problem can be formulated as follows: for a given integer n, is it possible to find a number d in the range [n,2^n] such that there is no minimal deterministic finite automaton with…
Quantum magic, which accounts for the non-stabilizer content of a state, is essential for universal quantum computation beyond classically simulable resources. We investigate the generation and evolution of quantum magic in discrete-time…
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…
The advent of quantum technologies brought forward much attention to the theoretical characterization of the computational resources they provide. A method to quantify quantum resources is to use a class of functions called magic monotones…
The stabiliser formalism allows the efficient description of a sizeable class of pure as well as mixed quantum states of N-qubit systems. That same formalism has important applications in the field of quantum error correcting codes, where…
Some problems of quantum information, cloning, estimation and testing of states, universal coding etc., are special example of the following `state convertibility' problem. In this paper, we consider the dual of this problem, 'observable…
A fundamental approach for the characterization and quantification of all kinds of resources is to study the conversion between different resource objects under certain constraints. Here we analyze, from a resource-non-specific standpoint,…
Standard quantum state preparation methods work by preparing a required state locally and then distributing it to a distant location by a free-space propagation. We instead study procedures of preparing a target state at a remote location…
A major difficulty in quantum computation is the ability to implement fault tolerant computations, protecting information against undesired interactions with the environment. Stabiliser codes were introduced as a means to protect…
We introduce and analyze a task that we call symmetrization, in which a state of a quantum system, associated with a symmetry group, is transformed by a random unitary operation to a symmetric state. Each element of the unitary ensemble is…