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:2409.04425

Qubit magic-breaking channels

Patra, Ayan, Rivu Gupta, Alessandro Ferraro, Aditi Sen De

Published Sep 6, 2024• 8 citations
arXivHTMLPDF

Abstract

We develop a notion of quantum channels that can make states useless for universal quantum computation by destroying their magic (non-stabilizerness) - we refer to them as magic-breaking channels. We establish the properties of these channels in arbitrary dimensions. We prove the necessary and sufficient criteria for qubit channels to be magic-breaking and present an algorithm for determining the same. Moreover, we provide compact criteria in terms of the parameters for several classes of qubit channels to be magic-breaking under various post-processing operations. Further, we investigate the necessary and sufficient conditions for the tensor product of multiple qubit channels to be magic-breaking. We establish implications of the same for the dynamical resource theory of magic preservability.

DOI
10.48550/arxiv.2409.04425

Related papers

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

Destroying and Preserving Measurement Incompatibility over a Quantum Channel

Eric Chitambar, Yujie Zhang

A quantum channel is called incompatibility-breaking if it always destroys the incompatibility of quantum measurements. On the other extreme are incompatibility-preserving channels, which never destroy incompatibility. This work studies both types of channels through the mathematical framework of zonotopes and zonoids, an approach that provides a complete characterization of compatibility for dichotomic measurements and is particularly powerful in the qubit setting. Using the language of zonoids, we present necessary and sufficient conditions for when a qubit unital channel is incompatibility-breaking, which are also sufficient for nonunital channels. As one of our main results, we demonstrate the superactivation phenomenon of two incompatibility-breaking qubit channels that are no longer incompatibility-breaking when used in parallel. Translating this result into the task of quantum steering, it says that two copies of a two-qubit Werner state can be steered at noise threshold $1/2$, even though this is impossible using just one copy. For the problem of incompatibility preservation, we prove that a quantum channel with matching input and output dimensions will preserve general incompatibility if and only if it is a unitary transformation. When the output dimension is larger, this result no longer holds, and we offer a conjectured form of a general incompatibility-preserving channel.

quant-pharXiv:2610.06642•Oct 6, 2026•2 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

Information theoretic resource-breaking channels

Abhishek Muhuri, Patra, Ayan, Rivu Gupta +1 more

We propose the notion of process resource-breaking channels that break the resource for a quantum information processing task. We examine the same using quantum dense coding and teleportation protocols. We prove that the sets DBT (dense coding breaking) and TBT (teleportation breaking) are convex and compact and identify classical-quantum channels as their extreme points. We prove group-covariance to be a sufficient condition for channels to be DBT or TBT when they can destroy the resource of maximally entangled states. We present necessary and sufficient conditions for unital channels to be DBT for a single sender-receiver pair, while for multiple senders, the condition is sufficient. The set of qubit TBT channels is proved equivalent to qubit entanglement-breaking channels provided pre-processing is allowed. We construct witness operators to identify non-TBT(non-DBT) maps.

arXiv:2309.03108•Sep 6, 2023•10 citations

Magic-Resource Generating Power of Quantum Channels

Xiaohui Li

In the stabilizer formalism of quantum error correction and fault-tolerant quantum computation, stabilizer states, as common eigenstates (with the eigenvalue 1) of operators in maximal Abelian subgroups of the Pauli group, play the role of classical states, while magic (non-stabilizer) states are quantum resources enabling universal quantum computation when injected into stabilizer circuits.The natural issue arises as how to characterize and quantify the ability of quantum channels (including quantum gates) in generating magic resource (non-stabilzerness) from stabilizer states.In this work, we introduce two intuitive quantities characterizing magic-resource generating power of quantum channels and reveal their basic properties.We evaluate these quantifies for several prototypical quantum channels and quantum gates.In particular, we demonstrate that the qubit T -gate (i.e., π/8-gate) and its qutrit generalization are optimal in generating magic resource in a class of diagonal unitaries.This highlights the significance of the T -gate and its extensions from a resource-theoretic perspective and provides a theoretical support of their wide applications in stabilizer quantum computation.

Advances in physics research/Advances in Physics Research•Jan 1, 2024•0 citations

Limits on broadcasting non-stabilizerness through unrestricted operations

Rivu Gupta, Tanoy Kanti Konar, Patra, Ayan +1 more

In the resource theory of non-stabilizerness, we prove that stabilizer operations cannot replicate or broadcast the "magic" resource of all quantum states in an arbitrary finite dimension. Moreover, we show that even in unrestricted scenarios, there are fundamental limits on cloning the non-stabilizerness content of quantum states. When using an auxiliary system as part of the cloning process, we show that it is impossible to broadcast the non-stabilizerness of qubits that possess a greater degree of non-stabilizerness than the known states on which the transformations are based. We also derive the conditions to broadcast magic perfectly using unrestricted operations. Furthermore, we compare non-stabilizerness broadcasting with traditional state cloning methods, such as state-dependent and -independent cloners, which can achieve perfect broadcasting of states with known magic content. Our findings reveal that state-dependent cloning unitaries designed for specific states have lower average non-stabilizerness-generating power than magic-generating unitaries.

arXiv:2501.15794•Jan 27, 2025•0 citations
We develop a notion of quantum channels that can make states useless for universal quantum computation by destroying their magic (non-stabilizerness) - we refer to them as magic-breaking channels. We establish the properties of these channels in arbitrary dimensions. We prove the necessary and sufficient criteria for qubit channels to be magic-breaking and present an algorithm for determining the same. Moreover, we provide compact criteria in terms of the parameters for several classes of qubit channels to be magic-breaking under various post-processing operations. Further, we investigate the necessary and sufficient conditions for the tensor product of multiple qubit channels to be magic-breaking. We establish implications of the same for the dynamical resource theory of magic preservability.
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.
A quantum channel is called incompatibility-breaking if it always destroys the incompatibility of quantum measurements. On the other extreme are incompatibility-preserving channels, which never destroy incompatibility. This work studies both types of channels through the mathematical framework of zonotopes and zonoids, an approach that provides a complete characterization of compatibility for dichotomic measurements and is particularly powerful in the qubit setting. Using the language of zonoids, we present necessary and sufficient conditions for when a qubit unital channel is incompatibility-breaking, which are also sufficient for nonunital channels. As one of our main results, we demonstrate the superactivation phenomenon of two incompatibility-breaking qubit channels that are no longer incompatibility-breaking when used in parallel. Translating this result into the task of quantum steering, it says that two copies of a two-qubit Werner state can be steered at noise threshold 1/21/21/2, even though this is impossible using just one copy. For the problem of incompatibility preservation, we prove that a quantum channel with matching input and output dimensions will preserve general incompatibility if and only if it is a unitary transformation. When the output dimension is larger, this result no longer holds, and we offer a conjectured form of a general incompatibility-preserving channel.
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.
We propose the notion of process resource-breaking channels that break the resource for a quantum information processing task. We examine the same using quantum dense coding and teleportation protocols. We prove that the sets DBT (dense coding breaking) and TBT (teleportation breaking) are convex and compact and identify classical-quantum channels as their extreme points. We prove group-covariance to be a sufficient condition for channels to be DBT or TBT when they can destroy the resource of maximally entangled states. We present necessary and sufficient conditions for unital channels to be DBT for a single sender-receiver pair, while for multiple senders, the condition is sufficient. The set of qubit TBT channels is proved equivalent to qubit entanglement-breaking channels provided pre-processing is allowed. We construct witness operators to identify non-TBT(non-DBT) maps.
In the stabilizer formalism of quantum error correction and fault-tolerant quantum computation, stabilizer states, as common eigenstates (with the eigenvalue 1) of operators in maximal Abelian subgroups of the Pauli group, play the role of classical states, while magic (non-stabilizer) states are quantum resources enabling universal quantum computation when injected into stabilizer circuits.The natural issue arises as how to characterize and quantify the ability of quantum channels (including quantum gates) in generating magic resource (non-stabilzerness) from stabilizer states.In this work, we introduce two intuitive quantities characterizing magic-resource generating power of quantum channels and reveal their basic properties.We evaluate these quantifies for several prototypical quantum channels and quantum gates.In particular, we demonstrate that the qubit T -gate (i.e., π/8-gate) and its qutrit generalization are optimal in generating magic resource in a class of diagonal unitaries.This highlights the significance of the T -gate and its extensions from a resource-theoretic perspective and provides a theoretical support of their wide applications in stabilizer quantum computation.
In the resource theory of non-stabilizerness, we prove that stabilizer operations cannot replicate or broadcast the "magic" resource of all quantum states in an arbitrary finite dimension. Moreover, we show that even in unrestricted scenarios, there are fundamental limits on cloning the non-stabilizerness content of quantum states. When using an auxiliary system as part of the cloning process, we show that it is impossible to broadcast the non-stabilizerness of qubits that possess a greater degree of non-stabilizerness than the known states on which the transformations are based. We also derive the conditions to broadcast magic perfectly using unrestricted operations. Furthermore, we compare non-stabilizerness broadcasting with traditional state cloning methods, such as state-dependent and -independent cloners, which can achieve perfect broadcasting of states with known magic content. Our findings reveal that state-dependent cloning unitaries designed for specific states have lower average non-stabilizerness-generating power than magic-generating unitaries.