Quantifying magic for multi-qubit operations
From MaRDI portal
Publication:5160732
Abstract: The development of a framework for quantifying "non-stabiliserness" of quantum operations is motivated by the magic state model of fault-tolerant quantum computation, and by the need to estimate classical simulation cost for noisy intermediate-scale quantum (NISQ) devices. The robustness of magic was recently proposed as a well-behaved magic monotone for multi-qubit states and quantifies the simulation overhead of circuits composed of Clifford+T gates, or circuits using other gates from the Clifford hierarchy. Here we present a general theory of the "non-stabiliserness" of quantum operations rather than states, which are useful for classical simulation of more general circuits. We introduce two magic monotones, called channel robustness and magic capacity, which are well-defined for general n-qubit channels and treat all stabiliser-preserving CPTP maps as free operations. We present two complementary Monte Carlo-type classical simulation algorithms with sample complexity given by these quantities and provide examples of channels where the complexity of our algorithms is exponentially better than previous known simulators. We present additional techniques that ease the difficulty of calculating our monotones for special classes of channels.
Recommendations
- On the structure of protocols for magic state distillation
- Quantum advantage of unitary Clifford circuits with magic state inputs
- Qutrit magic state distillation
- Quantum magic squares: dilations and their limitations
- Quantum State Estimation
- Optimality of T-gate for generating magic resource
- Multi-query quantum sums
- On quantumness in multi-parameter quantum estimation
- Quantum universality from magic states distillation applied to CSS codes
- Algorithms and Computation
Cites work
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- (Quantumness in the context of) resource theories
- A mathematical theory of resources
- Completely positive linear maps on complex matrices
- Convex geometry of quantum resource quantification
- Hudson’s theorem for finite-dimensional quantum systems
- Linear transformations which preserve trace and positive semidefiniteness of operators
- Negative quasi-probability as a resource for quantum computation
- Quantum advantage of unitary Clifford circuits with magic state inputs
- Quantum universality from magic states distillation applied to CSS codes
- The LU-LC conjecture, diagonal local operations and quadratic forms over GF(2)
- The resource theory of stabilizer quantum computation
- Universal quantum computation with ideal Clifford gates and noisy ancillas
Cited in
(14)- Quantum advantage through the magic pentagram problem
- Stabilizer Rényi entropy on qudits
- Complexity of quantum circuits via sensitivity, magic, and coherence
- Dynamics of atomic magic in the Jaynes-Cummings model
- Detecting magic states via characteristic functions
- Dynamics of steered quantum coherence and magic resource under sudden quench
- The axiomatic and the operational approaches to resource theories of magic do not coincide
- Wigner's theorem for stabilizer states and quantum designs
- Group frames via magic states with applications to SIC-POVMs and MUBs
- Optimality of T-gate for generating magic resource
- A magic state’s fidelity can be superior to the operations that created it
- Operational characterization of weight-based resource quantifiers via exclusion tasks in general probabilistic theories
- Necessary and sufficient conditions on measurements of quantum channels
- Quantifying magic resource via quantum Jensen-Shannon divergence
This page was built for publication: Quantifying magic for multi-qubit operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5160732)
