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

Robustness of Magic and the Directed Geometry of State Conversion

Satoshi Kanno, Yoshi-aki Shimada

quant-phcs.ITmath.QASubmitted Oct 28, 2026• Announced Oct 29, 2026• 0 citations
arXivHTMLPDF

Abstract

In this work, we introduce a state-space distance calibrated by stabilizer states based on the dual structure of the robustness of magic (RoM), and show that RoM is exactly represented as the distance to the free-state set. We then extend this geometry to state conversion by defining the directed conversion deficiency $C_{\mathcal F}$ as the distance between a target state and the set of states freely reachable from a given input state. The quantity $C_{\mathcal F}$ characterizes free convertibility and is related to the minimum stabilizer quasiprobability weight required to represent the conversion residual through the relation $1+2C_{\mathcal F}$. It also contains the conventional magic state resource lower bounds based on RoM and can detect stronger conversion obstructions. For single-qubit systems, we analytically construct a continuous family of mixed states with identical RoM but asymmetric convertibility.

AI Summary

The paper asks how robustness of magic (RoM) can quantify task-specific obstructions to magic-state conversion beyond comparing scalar resource amounts. It uses the convention $R=(D-1)/2$, where $D$ is the minimum total absolute weight of a signed stabilizer decomposition. Starting from the dual RoM witness constraints, it defines a stabilizer-calibrated norm and corresponding metric $d_{\mathcal F}$, proving $\inf_{\omega\in\mathcal F}d_{\mathcal F}(\rho,\omega)=2R(\rho)$. It then defines $C_{\mathcal F}(\rho\to\sigma)=\frac12\inf_{\Lambda\in\mathrm{SPO}}d_{\mathcal F}(\Lambda(\rho),\sigma)$ over stabilizer-preserving CPTP maps. Compactness establishes that zero deficiency is equivalent to exact conversion. Contractivity yields a directed triangle inequality and the bounds $[R(\sigma)-R(\rho)]_+\le C_{\mathcal F}\le R(\sigma)$. Linear-programming duality identifies $2C_{\mathcal F}$ with the minimum signed stabilizer correction weight; including a unit-weight processed-input branch gives conditional quasiprobability weight $1+2C_{\mathcal F}$. For mixed qubits with Bloch vectors $(a,a,0)$ and $(2a/3,2a/3,2a/3)$, $1/2<a<1/\sqrt2$, both have $R=a-1/2$. Randomized Clifford processing realizes the forward conversion, while matching channel and dual-witness constructions give reverse deficiency $(2a-1)(3+\sqrt3-\sqrt6-\sqrt2)/4$. This also separates resource-assisted conversion tests from RoM-only bounds: no additional resource is ruled out despite equal RoM. The metric and reachable-set construction are situated within existing base-norm and conversion-distance frameworks. The simulation interpretation is conditional: general stabilizer-preserving maps need not be efficiently simulable, and deficiency neither includes input-simulation cost nor bounds arbitrary classical simulation complexity. Efficient multiqubit evaluation and concrete algorithmic applications remain open directions.

Likely largely AI-generatedIncrementalUnclear novelty

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
25 pages

Related papers

Handbook for Quantifying Robustness of Magic

Hiroki Hamaguchi, Kou Hamada, Nobuyuki Yoshioka

Nonstabilizerness, or magic, is an essential quantum resource for performing universal quantum computation. Specifically, Robustness of Magic (RoM) characterizes the usefulness of a given quantum state for non-Clifford operations. While the mathematical formalism of RoM is concise, determining RoM in practice is highly challenging due to the necessity of dealing with a super-exponential number of stabilizer states. In this work, we present novel algorithms to compute RoM. The key technique is a subroutine for calculating overlaps between all stabilizer states and a target state, with the following remarkable features: (i) the time complexity per state is reduced {exponentially}, and (ii) the total space complexity is reduced {super-exponentially}. Based on this subroutine, we present algorithms to compute RoM for arbitrary states up to n = 8 qubits, whereas the naive method requires a memory size of at least 86 PiB , which is infeasible for any current classical computer. Additionally, the proposed subroutine enables the computation of stabilizer fidelity for a mixed state up to n = 8 qubits. We further propose novel algorithms that exploit prior knowledge of the structure of the target quantum state, such as permutation symmetry or disentanglement, and numerically demonstrate our results for copies of magic states and partially disentangled quantum states. This series of algorithms constitutes a comprehensive ``handbook'' for scaling up the computation of RoM. We envision that the proposed technique will also apply to the computation of other quantum resource measures.

arXiv:2311.01362•Quantum•Sep 5, 2024•36 citations

A Phase-Space Geometric Measure of Magic in Qubit Systems

Soumyojyoti Dutta, Tushar

Magic -- the resource enabling quantum computational advantage beyond stabilizer circuits -- has a clean phase-space characterization in odd prime dimensions that qubits notoriously lack. We study C(rho), the l_1 distance from a state's discrete Wigner function to the stabilizer polytope, and determine its exact geometry. For a single qubit with Bloch vector r we prove the closed form C = max(0, ||r||_1 - 1)/2, so the maximum is (sqrt(3)-1)/2, attained at the eight face states. For products of single-qubit states, C(rho_1 x ... x rho_n) <= prod_i (1 + C(rho_i)) - 1, with equality whenever every factor has Bloch sign product r_x r_y r_z <= 0; this includes the exact tensor powers ((1+sqrt(3))/2)^n - 1 and the exact maximum of C over fully separable n-qubit states. Because no discrete Wigner function for qubits is Clifford covariant, any such measure is frame dependent, and we identify which of its features are not. For a single qubit there are exactly two valid frames up to phase-space translation and C is identical on both. Pauli-covariant two-qubit frames number 2048 up to translation, and across them the ratio C(rho_Rx)/C(rho_Ry) takes the values 1/2, 1 and 2. In every one of these frames some stabilizer state has negative Wigner entries, a consequence of the Mermin-Peres square, so the two-qubit bound Gamma >= 1 + C/2 against the robustness of magic Gamma is frame independent. Within the Wootters frame we prove integer values 1, 2, 1 of the tightness ratio kappa := (Gamma-1)/C for three families in the two-qubit repetition codespace, with explicit certificates. For n-qubit GHZ phase states we prove Gamma = |sin phi| + |cos phi| for all n and C >= 2^(floor(n/2)-1) (|sin phi| + |cos phi| - 1), tight for n = 2 and, by exact linear programming, for n = 3, 4, so kappa decays exponentially. Finally, C is not a magic monotone, so it cannot replace Gamma in distillation bounds.

quant-pharXiv:2603.20792•Mar 24, 2026•2 citations

Universal magic state concentration

Jacopo Rizzo, Lorenzo Leone

Magic plays a dual role in quantum computation: it promotes stabilizer dynamics from efficient classical simulability to computational universality, but also challenges fault-tolerant architectures, since non-stabilizer operations are harder to protect against noise. Magic state distillation addresses this issue, yet existing protocols remain largely tailored to specific assumptions about the input or noise model and, more fundamentally, no general information-theoretic theory of optimal magic-state conversion currently exists. Here we develop such a characterization for pure qubit states through universal magic state concentration: a fixed stabilizer protocol that converts a few copies of an unknown pure non-stabilizer qubit state into an exact target magic state. Motivated by the impossibility of exact $T$-state concentration, we build six- and eight-copy protocols producing an exact $\mathrm{CCZ}$ state, with six copies being minimal. Their success probabilities are governed by the linearized order-three stabilizer Rényi entropy $M^{\mathrm{lin}}_3$. We show that this connection is structural: for up to nine input copies, $M^{\mathrm{lin}}_3$ fully determines the success probability of every universal Clifford-invariant stabilizer protocol. Remarkably, this characterization persists asymptotically: our constructions achieve optimal rates among universal single-output protocols and remain optimal up to logarithmic factors among arbitrary stabilizer protocols. As a corollary, we show that any unknown pure non-stabilizer state suffices for universal quantum computation via probabilistic $\mathrm{CCZ}$-state injection. Together, these results identify the stabilizer Rényi entropy as a fundamental operational quantity in magic state distillation.

quant-pharXiv:2608.13376•Aug 14, 2026•2 citations

Quantifying multiqubit magic channels with completely stabilizer-preserving operations

Gaurav Saxena, Gilad Gour

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.

arXiv:2202.07867•Physical Review A•Oct 17, 2022•26 citations

Non-local Magic: closed-form solution and equivalence with magic of purification

Michele Viscardi, Lorenzo Leone, Alioscia Hamma

Non-local magic quantifies the non-stabilizerness beyond the local choice of basis. Its evaluation is a hard problem requiring optimization over local unitaries. Here, we show that for the log-stabilizer fidelity this optimization admits an exact closed-form analytic solution depending only on the Schmidt spectrum. We then address the open problem of non-stabilizerness of mixed states by introducing the magic of purification and show that it naturally induces a resource theory whose free states are the states with zero stabilizer entropy. For the log-stabilizer fidelity, the magic of purification admits a distance-based formulation in terms of the Uhlmann fidelity. We prove that non-local magic coincides with the minimum magic of purification along the unitary orbit of the reduced density operator. This framework introduces non-local magic as the relevant resource for non-trivial steering and the characterization of entangling and non-stabilizer resources in measurements. These results provide both an efficient analytical characterization and a mixed-state resource-theoretic interpretation of non-local magic.

quant-pharXiv:2609.04119•Sep 4, 2026•17 citations

When Symmetry Suppresses Magic

A. de Oliveira Junior, Jake Xuereb, Rafael A. Macêdo +2 more

Nonstabilizerness is a critical resource for quantum advantage, but evaluating it, especially for mixed states, requires superexponentially many samples in system size, making the problem NP-hard. While symmetries are known to reduce this complexity, it is unclear whether they also restrict the amount of magic. In this work, we provide an explicit example of such a symmetry by proving that the Robustness of Magic (RoM) for N-qubit X-states is at most $\sqrt{3}$. Leveraging this symmetry constraint, we introduce a computationally efficient method to lower-bound the RoM of arbitrary many-body states, demonstrating its utility on the ground states of a spin-1/2 Hamiltonian with system sizes well beyond the reach of exact evaluation. Furthermore, for Hamiltonians whose equilibrium states are X-states, we analytically derive the critical temperature at which magic emerges. Our work shows why certain symmetries constrain magic while others do not, provides a scalable lower-bounding method, and identifies a nontrivial regime where many-body nonstabilizerness is analytically solvable.

quant-pharXiv:2609.38319•Oct 1, 2026•1 citation
In this work, we introduce a state-space distance calibrated by stabilizer states based on the dual structure of the robustness of magic (RoM), and show that RoM is exactly represented as the distance to the free-state set. We then extend this geometry to state conversion by defining the directed conversion deficiency CFC_{\mathcal F}CF​ as the distance between a target state and the set of states freely reachable from a given input state. The quantity CFC_{\mathcal F}CF​ characterizes free convertibility and is related to the minimum stabilizer quasiprobability weight required to represent the conversion residual through the relation 1+2CF1+2C_{\mathcal F}1+2CF​. It also contains the conventional magic state resource lower bounds based on RoM and can detect stronger conversion obstructions. For single-qubit systems, we analytically construct a continuous family of mixed states with identical RoM but asymmetric convertibility.
The paper asks how robustness of magic (RoM) can quantify task-specific obstructions to magic-state conversion beyond comparing scalar resource amounts. It uses the convention R=(D−1)/2R=(D-1)/2R=(D−1)/2, where DDD is the minimum total absolute weight of a signed stabilizer decomposition.
Starting from the dual RoM witness constraints, it defines a stabilizer-calibrated norm and corresponding metric dFd_{\mathcal F}dF​, proving inf⁡ω∈FdF(ρ,ω)=2R(ρ)\inf_{\omega\in\mathcal F}d_{\mathcal F}(\rho,\omega)=2R(\rho)infω∈F​dF​(ρ,ω)=2R(ρ). It then defines CF(ρ→σ)=12inf⁡Λ∈SPOdF(Λ(ρ),σ)C_{\mathcal F}(\rho\to\sigma)=\frac12\inf_{\Lambda\in\mathrm{SPO}}d_{\mathcal F}(\Lambda(\rho),\sigma)CF​(ρ→σ)=21​infΛ∈SPO​dF​(Λ(ρ),σ) over stabilizer-preserving CPTP maps. Compactness establishes that zero deficiency is equivalent to exact conversion. Contractivity yields a directed triangle inequality and the bounds [R(σ)−R(ρ)]+≤CF≤R(σ)[R(\sigma)-R(\rho)]_+\le C_{\mathcal F}\le R(\sigma)[R(σ)−R(ρ)]+​≤CF​≤R(σ). Linear-programming duality identifies 2CF2C_{\mathcal F}2CF​ with the minimum signed stabilizer correction weight; including a unit-weight processed-input branch gives conditional quasiprobability weight 1+2CF1+2C_{\mathcal F}1+2CF​.
For mixed qubits with Bloch vectors (a,a,0)(a,a,0)(a,a,0) and (2a/3,2a/3,2a/3)(2a/3,2a/3,2a/3)(2a/3,2a/3,2a/3), 1/2<a<1/21/2<a<1/\sqrt21/2<a<1/2​, both have R=a−1/2R=a-1/2R=a−1/2. Randomized Clifford processing realizes the forward conversion, while matching channel and dual-witness constructions give reverse deficiency (2a−1)(3+3−6−2)/4(2a-1)(3+\sqrt3-\sqrt6-\sqrt2)/4(2a−1)(3+3​−6​−2​)/4. This also separates resource-assisted conversion tests from RoM-only bounds: no additional resource is ruled out despite equal RoM.
The metric and reachable-set construction are situated within existing base-norm and conversion-distance frameworks. The simulation interpretation is conditional: general stabilizer-preserving maps need not be efficiently simulable, and deficiency neither includes input-simulation cost nor bounds arbitrary classical simulation complexity. Efficient multiqubit evaluation and concrete algorithmic applications remain open directions.
Nonstabilizerness, or magic, is an essential quantum resource for performing universal quantum computation. Specifically, Robustness of Magic (RoM) characterizes the usefulness of a given quantum state for non-Clifford operations. While the mathematical formalism of RoM is concise, determining RoM in practice is highly challenging due to the necessity of dealing with a super-exponential number of stabilizer states. In this work, we present novel algorithms to compute RoM. The key technique is a subroutine for calculating overlaps between all stabilizer states and a target state, with the following remarkable features: (i) the time complexity per state is reduced {exponentially}, and (ii) the total space complexity is reduced {super-exponentially}. Based on this subroutine, we present algorithms to compute RoM for arbitrary states up to n = 8 qubits, whereas the naive method requires a memory size of at least 86 PiB , which is infeasible for any current classical computer. Additionally, the proposed subroutine enables the computation of stabilizer fidelity for a mixed state up to n = 8 qubits. We further propose novel algorithms that exploit prior knowledge of the structure of the target quantum state, such as permutation symmetry or disentanglement, and numerically demonstrate our results for copies of magic states and partially disentangled quantum states. This series of algorithms constitutes a comprehensive ``handbook'' for scaling up the computation of RoM. We envision that the proposed technique will also apply to the computation of other quantum resource measures.
Magic -- the resource enabling quantum computational advantage beyond stabilizer circuits -- has a clean phase-space characterization in odd prime dimensions that qubits notoriously lack. We study C(rho), the l_1 distance from a state's discrete Wigner function to the stabilizer polytope, and determine its exact geometry. For a single qubit with Bloch vector r we prove the closed form C = max(0, ||r||_1 - 1)/2, so the maximum is (sqrt(3)-1)/2, attained at the eight face states. For products of single-qubit states, C(rho_1 x ... x rho_n) <= prod_i (1 + C(rho_i)) - 1, with equality whenever every factor has Bloch sign product r_x r_y r_z <= 0; this includes the exact tensor powers ((1+sqrt(3))/2)^n - 1 and the exact maximum of C over fully separable n-qubit states. Because no discrete Wigner function for qubits is Clifford covariant, any such measure is frame dependent, and we identify which of its features are not. For a single qubit there are exactly two valid frames up to phase-space translation and C is identical on both. Pauli-covariant two-qubit frames number 2048 up to translation, and across them the ratio C(rho_Rx)/C(rho_Ry) takes the values 1/2, 1 and 2. In every one of these frames some stabilizer state has negative Wigner entries, a consequence of the Mermin-Peres square, so the two-qubit bound Gamma >= 1 + C/2 against the robustness of magic Gamma is frame independent. Within the Wootters frame we prove integer values 1, 2, 1 of the tightness ratio kappa := (Gamma-1)/C for three families in the two-qubit repetition codespace, with explicit certificates. For n-qubit GHZ phase states we prove Gamma = |sin phi| + |cos phi| for all n and C >= 2^(floor(n/2)-1) (|sin phi| + |cos phi| - 1), tight for n = 2 and, by exact linear programming, for n = 3, 4, so kappa decays exponentially. Finally, C is not a magic monotone, so it cannot replace Gamma in distillation bounds.
Magic plays a dual role in quantum computation: it promotes stabilizer dynamics from efficient classical simulability to computational universality, but also challenges fault-tolerant architectures, since non-stabilizer operations are harder to protect against noise. Magic state distillation addresses this issue, yet existing protocols remain largely tailored to specific assumptions about the input or noise model and, more fundamentally, no general information-theoretic theory of optimal magic-state conversion currently exists. Here we develop such a characterization for pure qubit states through universal magic state concentration: a fixed stabilizer protocol that converts a few copies of an unknown pure non-stabilizer qubit state into an exact target magic state. Motivated by the impossibility of exact TTT-state concentration, we build six- and eight-copy protocols producing an exact CCZ\mathrm{CCZ}CCZ state, with six copies being minimal. Their success probabilities are governed by the linearized order-three stabilizer Rényi entropy M3linM^{\mathrm{lin}}_3M3lin​. We show that this connection is structural: for up to nine input copies, M3linM^{\mathrm{lin}}_3M3lin​ fully determines the success probability of every universal Clifford-invariant stabilizer protocol. Remarkably, this characterization persists asymptotically: our constructions achieve optimal rates among universal single-output protocols and remain optimal up to logarithmic factors among arbitrary stabilizer protocols. As a corollary, we show that any unknown pure non-stabilizer state suffices for universal quantum computation via probabilistic CCZ\mathrm{CCZ}CCZ-state injection. Together, these results identify the stabilizer Rényi entropy as a fundamental operational quantity in magic state distillation.
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.
Non-local magic quantifies the non-stabilizerness beyond the local choice of basis. Its evaluation is a hard problem requiring optimization over local unitaries. Here, we show that for the log-stabilizer fidelity this optimization admits an exact closed-form analytic solution depending only on the Schmidt spectrum. We then address the open problem of non-stabilizerness of mixed states by introducing the magic of purification and show that it naturally induces a resource theory whose free states are the states with zero stabilizer entropy. For the log-stabilizer fidelity, the magic of purification admits a distance-based formulation in terms of the Uhlmann fidelity. We prove that non-local magic coincides with the minimum magic of purification along the unitary orbit of the reduced density operator. This framework introduces non-local magic as the relevant resource for non-trivial steering and the characterization of entangling and non-stabilizer resources in measurements. These results provide both an efficient analytical characterization and a mixed-state resource-theoretic interpretation of non-local magic.
Nonstabilizerness is a critical resource for quantum advantage, but evaluating it, especially for mixed states, requires superexponentially many samples in system size, making the problem NP-hard. While symmetries are known to reduce this complexity, it is unclear whether they also restrict the amount of magic. In this work, we provide an explicit example of such a symmetry by proving that the Robustness of Magic (RoM) for N-qubit X-states is at most 3\sqrt{3}3​. Leveraging this symmetry constraint, we introduce a computationally efficient method to lower-bound the RoM of arbitrary many-body states, demonstrating its utility on the ground states of a spin-1/2 Hamiltonian with system sizes well beyond the reach of exact evaluation. Furthermore, for Hamiltonians whose equilibrium states are X-states, we analytically derive the critical temperature at which magic emerges. Our work shows why certain symmetries constrain magic while others do not, provides a scalable lower-bounding method, and identifies a nontrivial regime where many-body nonstabilizerness is analytically solvable.