Quantifying dynamical magic with completely stabilizer preserving operations as free
arXiv:2202.07867 · doi:10.1103/PhysRevA.106.042422
Abstract
In this paper, we extend the resource theory of magic to the channel case by considering completely stabilizer preserving operations (CSPOs) as free. We introduce and characterize the set of CSPO preserving and completely CSPO preserving superchannels. We quantify the magic of quantum channels by extending the generalized robustness and the min relative entropy of magic from the state to the channel domain and show that they bound the single-shot dynamical magic cost and distillation. We also provide analytical conditions for qubit interconversion under CSPOs and show that it is a linear programming feasibility problem and hence can be efficiently solved. Lastly, we give a classical simulation algorithm whose runtime is related to the generalized robustness of magic for channels. Our algorithm depends on some pre-defined precision, and if there is no bound on the desired precision then it achieves a constant runtime.
Minor changes to the previous edition
References in corpus (27)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Surface codes: Towards practical large-scale quantum computation
- Application of a resource theory for magic states to fault-tolerant quantum computing
- Quantum Circuits Architecture
- Magic state distillation with low overhead
- Transforming quantum operations: quantum supermaps
- Stabilizer Rényi entropy
- Entanglement Detection in the Stabilizer Formalism
- Quantum stochastic processes and quantum non-Markovian phenomena
- Magic state distillation in all prime dimensions using quantum Reed-Muller codes
- Many-body quantum magic
- Improved magic states distillation for quantum universality
- Wigner function negativity and contextuality in quantum computation on rebits
- Classicality in discrete Wigner functions
- Multilevel distillation of magic states for quantum computing
- Discrete Wigner functions and quantum computational speedup
- Quantifying quantum speedups: improved classical simulation from tighter magic monotones
- Non-negative Wigner functions in prime dimensions
- Simulation of Qubit Quantum Circuits via Pauli Propagation
- Distilling one-qubit magic states into Toffoli states
- A hidden variable model for universal quantum computation with magic states on qubits
- Quantifying Qubit Magic Resource with Gottesman-Kitaev-Preskill Encoding
- Discrete Wigner Formalism for Qubits and Non-Contextuality of Clifford Gates on Qubit Stabilizer States
- One-Shot Manipulation of Dynamical Quantum Resources
- Constraints on magic state protocols from the statistical mechanics of Wigner negativity
- One-Shot Yield-Cost Relations in General Quantum Resource Theories
- Quantum Advantage for Shared Randomness Generation
Cited by in corpus (13)
- Measuring magic on a quantum processor
- Pseudomagic Quantum States
- Learning efficient decoders for quasi-chaotic quantum scramblers
- Magic-induced computational separation in entanglement theory
- Magic of quantum hypergraph states
- Gravitational back-reaction is magical
- Mixed-state additivity properties of magic monotones based on quantum relative entropies for single-qubit states and beyond
- A nonstabilizerness monotone from stabilizerness asymmetry
- Complete Characterization of Entanglement Embezzlement
- One-shot manipulation of coherence in dynamic quantum resource theory
- Choi-Defined Resource Theories
- Enhancement of non-Stabilizerness within Indefinite Causal Order
- Quantifying magic via quantum Jensen-Shannon divergence