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

Limits on broadcasting non-stabilizerness through unrestricted operations

Rivu Gupta, Tanoy Kanti Konar, Patra, Ayan, Aditi Sen De

Published Jan 27, 2025• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2501.15794

Related papers

No-broadcasting of magic states

Zijian Zhang, Lingxuan Feng, Shunlong Luo

From both intuitive and physical perspectives, it is generally recognized that within a resource theory framework, free operations cannot broadcast a resource state due to their inability to generate resource from free states. In the stabilizer formalism of fault-tolerant quantum computation, the basic ingredients of the corresponding resource theory consist of stabilizer states as free states and stabilizer operations as free operations. The celebrated Gottesman-Knill theorem shows that quantum advantages over classical computation come from the magic (nonstabilizer) resource, such as magic states or non-Clifford gates. In this work, we prove that broadcasting of any magic state via stabilizer operations is impossible, which is reminiscent of the no-broadcasting theorems for noncommuting states or quantum correlations. We further derive a trade-off relation between the magic resource consumed in the initial system and that gained in the target system. These results characterize magic states in the stabilizer formalism from the broadcasting angle, and may have implications for distributed quantum computation and quantum secret sharing.

Physical Review A•Jul 25, 2024•11 citations

Testing nonstabilizerness only with stabilizer states

Hyukjoon Kwon

The stabilizer formalism plays a central role in quantum information processing and quantum computing. Since stabilizer states and operations can be efficiently simulated classically and fault-tolerantly implemented in quantum error-correcting codes, quantum states and operations beyond the stabilizer framework, characterized by nonstabilizerness or magic, naturally emerge as resources for quantum computation. Here, we demonstrate that a quantum-information task involving only stabilizer states can reveal a fundamental limitation of stabilizer operations. Specifically, we construct a set of mutually orthogonal stabilizer states that cannot be perfectly distinguished using stabilizer operations and extend this construction to an arbitrary number of qubits. Our results provide an efficient test of nonstabilizerness without requiring the direct use of resourceful states or operations nor relying on computational-hardness assumptions. This nonstabilizerness test could serve as a resource-efficient benchmark for fault-tolerant quantum computers powered by magic-state injection, by providing quantitative bounds on the robustness of magic. More fundamentally, the resulting asymmetry between the preparation and discrimination of free states parallels "nonlocality without entanglement" in entanglement theory, revealing an unexpected connection between these two distinct quantum resource theories.

arXiv:2509.25790•Sep 30, 2025•7 citations

State Dependent and Independent cloner: Cloning and Broadcasting

Shukla, Manish Kumar, Indranil Chakrabarty, Sourav Chatterjee

In this work, we extensively study the problem of broadcasting of entanglement. In the first part of the work, we reconceptualize the idea of state dependent quantum cloning machine, and in that process we introduce different types of state dependent cloners like static and dynamic state dependent cloners. We derive the conditions under which we can make these cloners independent of the input state. In the broadcasting part, as our resource initial state, we start with general two qubit state and consider specific examples like, non maximally entangled state (NME), Werner like state (WS), and Bell diagonal state (BDS). We apply both state dependent/ state independent cloners, both locally and non-locally, in each of these cases. Incidentally, we find several instances where state dependent cloners outperform state independent cloners in broadcasting. This work gives us a holistic view on the broadcasting of entanglement in various two qubit states, when we have an almost exhaustive sets of cloning machines in our arsenal

arXiv:1511.05796•Nov 18, 2015•2 citations

Qubit magic-breaking channels

Patra, Ayan, Rivu Gupta, Alessandro Ferraro +1 more

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.

arXiv:2409.04425•Sep 6, 2024•8 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

Broadcasting of quantum correlations: Possibilities and impossibilities

Sourav Chatterjee, Sk Sazim, Indranil Chakrabarty

In this work, we extensively study the problem of broadcasting of quantum correlations (QCs). This includes broadcasting of quantum entanglement as well as correlations that go beyond the notion of entanglement (QCsbE). It is quite well known from the ``no-broadcasting theorem'' that perfect broadcasting of QCs is not possible. However, it does not rule out the possibility of partial broadcasting of QCs where we can get lesser correlated states from a given correlated state. In order to have a holistic view of broadcasting, we investigate this problem by starting with a most general representation of two qubit mixed states in terms of the Bloch vectors. As a cloning transformation we have used universal symmetric optimal Buzek-Hillery (BH) cloner both locally and nonlocally. Unlike entanglement, we find that it is impossible to broadcast QCsbE optimally. Lastly, we generalize these results for any symmetric or asymmetric cloning machines as well. This result brings out a fundamental difference between the correlations defined from the perspective of entanglement and the correlations measure which claims to go beyond entanglement.

arXiv:1411.4397•Physical Review A•Apr 7, 2016•18 citations
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.
From both intuitive and physical perspectives, it is generally recognized that within a resource theory framework, free operations cannot broadcast a resource state due to their inability to generate resource from free states. In the stabilizer formalism of fault-tolerant quantum computation, the basic ingredients of the corresponding resource theory consist of stabilizer states as free states and stabilizer operations as free operations. The celebrated Gottesman-Knill theorem shows that quantum advantages over classical computation come from the magic (nonstabilizer) resource, such as magic states or non-Clifford gates. In this work, we prove that broadcasting of any magic state via stabilizer operations is impossible, which is reminiscent of the no-broadcasting theorems for noncommuting states or quantum correlations. We further derive a trade-off relation between the magic resource consumed in the initial system and that gained in the target system. These results characterize magic states in the stabilizer formalism from the broadcasting angle, and may have implications for distributed quantum computation and quantum secret sharing.
The stabilizer formalism plays a central role in quantum information processing and quantum computing. Since stabilizer states and operations can be efficiently simulated classically and fault-tolerantly implemented in quantum error-correcting codes, quantum states and operations beyond the stabilizer framework, characterized by nonstabilizerness or magic, naturally emerge as resources for quantum computation. Here, we demonstrate that a quantum-information task involving only stabilizer states can reveal a fundamental limitation of stabilizer operations. Specifically, we construct a set of mutually orthogonal stabilizer states that cannot be perfectly distinguished using stabilizer operations and extend this construction to an arbitrary number of qubits. Our results provide an efficient test of nonstabilizerness without requiring the direct use of resourceful states or operations nor relying on computational-hardness assumptions. This nonstabilizerness test could serve as a resource-efficient benchmark for fault-tolerant quantum computers powered by magic-state injection, by providing quantitative bounds on the robustness of magic. More fundamentally, the resulting asymmetry between the preparation and discrimination of free states parallels "nonlocality without entanglement" in entanglement theory, revealing an unexpected connection between these two distinct quantum resource theories.
In this work, we extensively study the problem of broadcasting of entanglement. In the first part of the work, we reconceptualize the idea of state dependent quantum cloning machine, and in that process we introduce different types of state dependent cloners like static and dynamic state dependent cloners. We derive the conditions under which we can make these cloners independent of the input state. In the broadcasting part, as our resource initial state, we start with general two qubit state and consider specific examples like, non maximally entangled state (NME), Werner like state (WS), and Bell diagonal state (BDS). We apply both state dependent/ state independent cloners, both locally and non-locally, in each of these cases. Incidentally, we find several instances where state dependent cloners outperform state independent cloners in broadcasting. This work gives us a holistic view on the broadcasting of entanglement in various two qubit states, when we have an almost exhaustive sets of cloning machines in our arsenal
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.
In this work, we extensively study the problem of broadcasting of quantum correlations (QCs). This includes broadcasting of quantum entanglement as well as correlations that go beyond the notion of entanglement (QCsbE). It is quite well known from the ``no-broadcasting theorem'' that perfect broadcasting of QCs is not possible. However, it does not rule out the possibility of partial broadcasting of QCs where we can get lesser correlated states from a given correlated state. In order to have a holistic view of broadcasting, we investigate this problem by starting with a most general representation of two qubit mixed states in terms of the Bloch vectors. As a cloning transformation we have used universal symmetric optimal Buzek-Hillery (BH) cloner both locally and nonlocally. Unlike entanglement, we find that it is impossible to broadcast QCsbE optimally. Lastly, we generalize these results for any symmetric or asymmetric cloning machines as well. This result brings out a fundamental difference between the correlations defined from the perspective of entanglement and the correlations measure which claims to go beyond entanglement.