Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2202.07867 · Physical Review A

Quantifying multiqubit magic channels with completely stabilizer-preserving operations

Gaurav Saxena, Gilad Gour

Published Oct 17, 2022• 26 citations
arXivHTMLPDF

Abstract

In this paper we extend the resource theory of magic states to the channel domain 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 magic channels by extending the generalized robustness and the min-relative entropy defined for magic states to channels 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 channels. Our algorithm depends on some predefined precision, and if there is no bound on the desired precision then it achieves a constant runtime.

DOI
10.1103/physreva.106.042422

Related papers

Quantification and manipulation of magic states

Mehdi Ahmadi, Hoan Bui Dang, Gilad Gour +1 more

Magic states can be used as a resource to circumvent the restrictions due to stabilizer-preserving operations, and magic-state conversion has not been studied in the single-copy regime thus far. Here we solve the question of whether a stabilizer-preserving quantum operation exists that can convert between two given magic states in the single-shot regime. We first phrase this question as a feasibility problem for a semidefinite program, which provides a procedure for constructing a stabilizer-preserving quantum operation (free channel) if it exists. Then we employ a variant of the Farkas lemma to derive necessary and sufficient conditions for existence, and this method is used to construct a complete set of magic monotones.

arXiv:1706.03828•Physical Review A•Jun 20, 2018•55 citations

Pauli spectrum of quantum channels and the related magic-channel distillation bounds

Yiran Wang, Yongming Li

Nonstabilizerness (``magic'') is an essential part of quantum computation, so the quantitative study of nonstabilizerness has become a very important issue. Since researchers have defined the Pauli spectrum of quantum states, they can use it to calculate other nonstabilizerness measures such as stabilizer R\'enyi entropy and stabilizer nullity. At the same time, the study of the magic-channel resource theory has become a main direction in recent years. In this article we extend the definition of the Pauli spectrum to quantum channels and define the definitions of stabilizer R\'enyi entropy and stabilizer nullity for quantum channels based on the Pauli spectrum. Meanwhile, we study the properties of stabilizer R\'enyi entropy and stabilizer nullity of quantum channels and give the corresponding proofs. Additionally, this article gives the necessary and sufficient condition that the depolarizing channel is a completely stabilizer-preserving operation (CSPO), and we can calculate other channels. Furthermore, we verify that stabilizer R\'enyi entropy of quantum channels satisfies the amortization inequality so that the maximum value of the distillation bounds of the magic channels provided by the stabilizer R\'enyi entropy can be established. Therefore, we can give an alternative method to calculate the magic-channel distillation bounds. Moreover, we compare the channel distillation rate provided by stabilizer R\'enyi entropy with that provided by thauma and find that the channel distillation rate proposed in this article has higher distillation efficiency. Finally, the nonstabilizerness cost of the gate synthesis is given.

Physical Review A•Jan 3, 2025•3 citations

Quantifying the magic of quantum channels

Xin Wang, Mark M. Wilde, Yuan Su

Abstract To achieve universal quantum computation via general fault-tolerant schemes, stabilizer operations must be supplemented with other non-stabilizer quantum resources. Motivated by this necessity, we develop a resource theory for magic quantum channels to characterize and quantify the quantum ‘magic’ or non-stabilizerness of noisy quantum circuits. For qudit quantum computing with odd dimension d , it is known that quantum states with non-negative Wigner function can be efficiently simulated classically. First, inspired by this observation, we introduce a resource theory based on completely positive-Wigner-preserving quantum operations as free operations, and we show that they can be efficiently simulated via a classical algorithm. Second, we introduce two efficiently computable magic measures for quantum channels, called the mana and thauma of a quantum channel. As applications, we show that these measures not only provide fundamental limits on the distillable magic of quantum channels, but they also lead to lower bounds for the task of synthesizing non-Clifford gates. Third, we propose a classical algorithm for simulating noisy quantum circuits, whose sample complexity can be quantified by the mana of a quantum channel. We further show that this algorithm can outperform another approach for simulating noisy quantum circuits, based on channel robustness. Finally, we explore the threshold of non-stabilizerness for basic quantum circuits under depolarizing noise.

arXiv:1903.04483•New Journal of Physics•Sep 18, 2019•154 citations

Quantifying magic for multi-qubit operations

James R. Seddon, Earl T. Campbell

The development of a framework for quantifying ‘non-stabilizerness’ 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-stabilizerness’ 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 stabilizer-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 previously known simulators. We present additional techniques that ease the difficulty of calculating our monotones for special classes of channels.

arXiv:1901.03322•Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences•Jul 1, 2019•140 citations

The axiomatic and the operational approaches to resource theories of magic do not coincide

Arne Heimendahl, Markus Heinrich, David Gross

Stabilizer operations (SO) 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 classical computer, a result which is known as the Gottesman–Knill theorem. However, an additional supply of magic states is enough to promote them to a universal, fault-tolerant model for quantum computing. To quantify the needed resources in terms of magic states, a resource theory of magic has been developed. SO are considered free within this theory; however, they are not the most general class of free operations. From an axiomatic point of view, these are the completely stabilizer-preserving (CSP) channels, defined as those that preserve the convex hull of stabilizer states. It has been an open problem to decide whether these two definitions lead to the same class of operations. In this work, we answer this question in the negative, by constructing an explicit counter-example. This indicates that recently proposed stabilizer-based simulation techniques of CSP maps are strictly more powerful than Gottesman–Knill-like methods. The result is analogous to a well-known fact in entanglement theory, namely, that there is a gap between the operationally defined class of local operations and classical communication and the axiomatically defined class of separable channels.

arXiv:2011.11651•Journal of Mathematical Physics•Nov 1, 2022•24 citations

The relative entropy of magic and its nonadditivity

Carolin Deckers, Justus Neumann, Hermann Kampermann +1 more

In most stabilizer-based quantum computing schemes, so-called magic states are a necessary resource for implementing non-transversal quantum gates. With the resource theory of magic, it is possible to analyze and quantify the generation of the non-stabilizer states. The relative entropy is a measure used in various resource theories. For single qubits, we characterize magic states and their closest stabilizer states by applying analytical results known from the relative entropy of entanglement and show that the magic states and their closest stabilizer states are arranged symmetrically around the states at the centers of the faces of the stabilizer octahedron. For tensor products of single-qubit states, we prove analytically that the relative entropy of magic is nonadditive in almost all cases.

quant-pharXiv:2605.22392•May 22, 2026•0 citations
In this paper we extend the resource theory of magic states to the channel domain 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 magic channels by extending the generalized robustness and the min-relative entropy defined for magic states to channels 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 channels. Our algorithm depends on some predefined precision, and if there is no bound on the desired precision then it achieves a constant runtime.
Magic states can be used as a resource to circumvent the restrictions due to stabilizer-preserving operations, and magic-state conversion has not been studied in the single-copy regime thus far. Here we solve the question of whether a stabilizer-preserving quantum operation exists that can convert between two given magic states in the single-shot regime. We first phrase this question as a feasibility problem for a semidefinite program, which provides a procedure for constructing a stabilizer-preserving quantum operation (free channel) if it exists. Then we employ a variant of the Farkas lemma to derive necessary and sufficient conditions for existence, and this method is used to construct a complete set of magic monotones.
Nonstabilizerness (``magic'') is an essential part of quantum computation, so the quantitative study of nonstabilizerness has become a very important issue. Since researchers have defined the Pauli spectrum of quantum states, they can use it to calculate other nonstabilizerness measures such as stabilizer R\'enyi entropy and stabilizer nullity. At the same time, the study of the magic-channel resource theory has become a main direction in recent years. In this article we extend the definition of the Pauli spectrum to quantum channels and define the definitions of stabilizer R\'enyi entropy and stabilizer nullity for quantum channels based on the Pauli spectrum. Meanwhile, we study the properties of stabilizer R\'enyi entropy and stabilizer nullity of quantum channels and give the corresponding proofs. Additionally, this article gives the necessary and sufficient condition that the depolarizing channel is a completely stabilizer-preserving operation (CSPO), and we can calculate other channels. Furthermore, we verify that stabilizer R\'enyi entropy of quantum channels satisfies the amortization inequality so that the maximum value of the distillation bounds of the magic channels provided by the stabilizer R\'enyi entropy can be established. Therefore, we can give an alternative method to calculate the magic-channel distillation bounds. Moreover, we compare the channel distillation rate provided by stabilizer R\'enyi entropy with that provided by thauma and find that the channel distillation rate proposed in this article has higher distillation efficiency. Finally, the nonstabilizerness cost of the gate synthesis is given.
Abstract To achieve universal quantum computation via general fault-tolerant schemes, stabilizer operations must be supplemented with other non-stabilizer quantum resources. Motivated by this necessity, we develop a resource theory for magic quantum channels to characterize and quantify the quantum ‘magic’ or non-stabilizerness of noisy quantum circuits. For qudit quantum computing with odd dimension d , it is known that quantum states with non-negative Wigner function can be efficiently simulated classically. First, inspired by this observation, we introduce a resource theory based on completely positive-Wigner-preserving quantum operations as free operations, and we show that they can be efficiently simulated via a classical algorithm. Second, we introduce two efficiently computable magic measures for quantum channels, called the mana and thauma of a quantum channel. As applications, we show that these measures not only provide fundamental limits on the distillable magic of quantum channels, but they also lead to lower bounds for the task of synthesizing non-Clifford gates. Third, we propose a classical algorithm for simulating noisy quantum circuits, whose sample complexity can be quantified by the mana of a quantum channel. We further show that this algorithm can outperform another approach for simulating noisy quantum circuits, based on channel robustness. Finally, we explore the threshold of non-stabilizerness for basic quantum circuits under depolarizing noise.
The development of a framework for quantifying ‘non-stabilizerness’ 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-stabilizerness’ 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 stabilizer-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 previously known simulators. We present additional techniques that ease the difficulty of calculating our monotones for special classes of channels.
Stabilizer operations (SO) 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 classical computer, a result which is known as the Gottesman–Knill theorem. However, an additional supply of magic states is enough to promote them to a universal, fault-tolerant model for quantum computing. To quantify the needed resources in terms of magic states, a resource theory of magic has been developed. SO are considered free within this theory; however, they are not the most general class of free operations. From an axiomatic point of view, these are the completely stabilizer-preserving (CSP) channels, defined as those that preserve the convex hull of stabilizer states. It has been an open problem to decide whether these two definitions lead to the same class of operations. In this work, we answer this question in the negative, by constructing an explicit counter-example. This indicates that recently proposed stabilizer-based simulation techniques of CSP maps are strictly more powerful than Gottesman–Knill-like methods. The result is analogous to a well-known fact in entanglement theory, namely, that there is a gap between the operationally defined class of local operations and classical communication and the axiomatically defined class of separable channels.
In most stabilizer-based quantum computing schemes, so-called magic states are a necessary resource for implementing non-transversal quantum gates. With the resource theory of magic, it is possible to analyze and quantify the generation of the non-stabilizer states. The relative entropy is a measure used in various resource theories. For single qubits, we characterize magic states and their closest stabilizer states by applying analytical results known from the relative entropy of entanglement and show that the magic states and their closest stabilizer states are arranged symmetrically around the states at the centers of the faces of the stabilizer octahedron. For tensor products of single-qubit states, we prove analytically that the relative entropy of magic is nonadditive in almost all cases.