Related papers: Limits on broadcasting non-stabilizerness through …
Quantum information cannot be broadcast -- an intrinsic limitation imposed by quantum mechanics. However, recent advances in virtual operations offer new insights into the no-broadcasting theorem. Here, we focus on the practical utility and…
It is well known that quantum theory forbids the exact copying of an unknown quantum state. Therefore in broadcasting of classical information by a quantum channel an additional contribution to the error in the decoding is expected. We…
Soon after the dawn of quantum error correction, DiVincenzo and Peres observed that stabilizer codewords could give rise to simple proofs of quantumness via contextuality. This discovery can be recast in the language of nonlocal games:…
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…
Non-stabilizer states are a fundamental resource for universal quantum computation. However,despite broad significance in quantum computing, the emergence of "many-body" non-stabilizerness in interacting quantum systems remains poorly…
A central problem in quantum information is to determine the minimal physical resources that are required for quantum computational speedup and, in particular, for fault-tolerant quantum computation. We establish a remarkable connection…
Quantum resource theories provide a mathematically rigorous way of understanding the nature of various quantum resources. An important problem in any quantum resource theory is to determine how quantum states can be converted into each…
Stabilizer circuits arise in almost every area of quantum computation and communication, so there is interest in studying them from an information-theoretic perspective, i.e. as quantum channels. We consider several natural approaches to…
The no-cloning theorem is a cornerstone of quantum cryptography. Here we generalize and rederive in a unified framework various upper bounds on the maximum achievable fidelity of probabilistic and deterministic cloning machines. Building on…
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…
Suppose we are given an entangled pair and then one can ask how well we can produce two entangled pairs starting from a given entangled pair using only local operations. To give response of the above asked question, we study broadcasting of…
In many architectures for fault tolerant quantum computing universality is achieved by a combination of Clifford group unitary operators and preparation of suitable nonstabilizer states, the so-called magic states. Universality is possible…
Non-stabilizerness is a key resource for fault-tolerant quantum computation, yet its interplay with entanglement in dynamical settings remains underexplored. We address this by analyzing a well-controlled, analytically tractable setup,…
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…
We demonstrate that it is possible to construct operators that stabilize the constraint-satisfying subspaces of computational problems in their Ising representations. We provide an explicit recipe to construct unitaries and associated…
We study a non-stabilizerness resource theory for operators, which is dual to that describing states. We identify that the stabilizer R\'enyi entropy analog in operator space is a good magic monotone satisfying the usual conditions while…
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…
Cryptographic protocols are often based on the two main resources: private randomness and private key. In this paper, we develop a relationship between these two resources. First, we show that any state containing perfect, directly…
Nonstabilizerness, also known as magic, quantifies the number of non-Clifford operations needed in order to prepare a quantum state. As typical measures either involve minimization procedures or a computational cost exponential in the…
We investigate a new class of quantum cloning machines that equally duplicate all real states in a Hilbert space of arbitrary dimension. By using the no-signaling condition, namely that cloning cannot make superluminal communication…