Robust Universal Braiding with Non-semisimple Ising Anyons

Aaron D. Lauda; Filippo Iulianelli; Joshua Sussan; Sung Kim

arxiv: 2509.02843 · v2 · submitted 2025-09-02 · 🪐 quant-ph · cond-mat.str-el· math.GT· math.QA

Robust Universal Braiding with Non-semisimple Ising Anyons

Filippo Iulianelli , Sung Kim , Joshua Sussan , Aaron D. Lauda This is my paper

Pith reviewed 2026-05-18 18:55 UTC · model grok-4.3

classification 🪐 quant-ph cond-mat.str-elmath.GTmath.QA

keywords non-semisimple anyonsIsing anyonstopological quantum computationbraidingneglectonuniversal gatesrobustnessindefinite Hermitian form

0 comments

The pith

Non-semisimple extensions of the Ising anyon model enable universal topological quantum computation via braiding alone over an open interval of the neglecton parameter alpha.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper shows that non-semisimple versions of the Ising anyon model introduce new anyon types parametrized by a real number alpha, called neglectons. Standard semisimple Ising anyons restrict braiding to Clifford gates, which fall short of universal quantum computation. In the extended model braiding remains unitary on a positive-definite computational subspace even though the full Hermitian form is indefinite. This universality holds throughout an open interval of alpha rather than at isolated points. Special values of alpha further allow the computational subspace to decouple exactly from negative-norm states, suppressing leakage.

Core claim

Non-semisimple extensions of the Ising anyon model introduce anyon types indexed by a real parameter alpha, the neglecton. Braiding acts unitarily with respect to an indefinite Hermitian form, while the computational subspace sits in a positive-definite sector. This setup produces a universal gate set from braiding alone. The universality is robust and persists over an open interval of alpha where the computational subspace remains positive-definite. At special values of alpha the physical subspace decouples exactly from negative-norm components, ensuring fully unitary evolution and suppressed leakage.

What carries the argument

The neglecton, a family of anyon types indexed by the real parameter alpha in the non-semisimple extension, which places the computational subspace inside the positive-definite sector of the indefinite Hermitian form.

If this is right

Braiding alone produces a dense set of gates sufficient for universal topological quantum computation.
Universality holds without high-precision tuning of the neglecton parameter alpha.
An alternative encoding yields exact single-qubit Clifford gates together with a non-Clifford phase gate.
Leakage from the computational subspace is suppressed at special values of alpha where exact decoupling occurs.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same robustness pattern could appear in non-semisimple extensions of other anyon models.
Physical systems might realize these gates by operating within a tolerance band around a chosen alpha value.
Further analysis of the indefinite form may link this construction to other areas of topological quantum field theory.

Load-bearing premise

The computational subspace remains positive-definite over an open interval of the real parameter alpha.

What would settle it

A calculation showing that braiding matrices generate only a finite or Clifford subgroup of unitaries for every alpha inside some open interval, or that the computational subspace loses positive definiteness for all but isolated values of alpha.

Figures

Figures reproduced from arXiv: 2509.02843 by Aaron D. Lauda, Filippo Iulianelli, Joshua Sussan, Sung Kim.

**Figure 3.** Figure 3: FIG. 3: Encoding computational qubits into the collective state of a group of anyons. Unitaries are implemented on [PITH_FULL_IMAGE:figures/full_fig_p012_3.png] view at source ↗

**Figure 4.** Figure 4: FIG. 4: Norms of the basis vectors [PITH_FULL_IMAGE:figures/full_fig_p013_4.png] view at source ↗

**Figure 5.** Figure 5: FIG. 5: The Jucys-Murphy braid [PITH_FULL_IMAGE:figures/full_fig_p015_5.png] view at source ↗

read the original abstract

Non-semisimple extensions of the Ising anyon model developed in our previous work enable universal topological quantum computation via braiding alone, overcoming the Clifford-only limitation of semisimple theories. The non-semisimple theory provides new anyon types indexed by a real parameter $\alpha$, the neglecton. Braiding acts unitarily with respect to an indefinite Hermitian form, while the computational subspace sits in a positive-definite sector. We demonstrate that this universality is robust, persisting over an open interval of the neglecton parameter $\alpha$ where the computational subspace remains positive-definite. We identify special values of $\alpha$ where the physical subspace decouples exactly from negative-norm components, ensuring fully unitary evolution and suppressed leakage. We further present an alternative encoding supporting exact single-qubit Clifford gates alongside a non-Clifford phase gate. We show that high-precision tuning of $\alpha$ is not required for efficient gate compilation, significantly enhancing the physical plausibility of non-semisimple anyonic architectures.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

Non-semisimple Ising anyons give braiding-only universality that's claimed to hold over an open α interval, with added decoupling and encoding results, but the positive-definiteness step still needs explicit checks.

read the letter

Hi, the main thing to know is that this paper takes the non-semisimple Ising extension and shows universality via braiding alone can hold over an open interval of the neglecton parameter α, plus clean decoupling at special values and an alternative encoding with exact Clifford gates plus a phase gate. They also note that high-precision tuning of α is not required for efficient compilation, which helps the physical story. This builds directly on their prior work and adds those specific robustness and encoding pieces that were not in the earlier literature. What they do well is lay out how braiding acts unitarily on the positive-definite computational subspace while the overall Hermitian form stays indefinite, addressing the Clifford-only limit of semisimple models. The abstract states the claims plainly and ties them to the new anyon types indexed by α. The soft spot is the load-bearing claim that the subspace remains positive-definite over an open interval of real α. The stress-test note is fair here: without explicit braiding matrices, a closed-form eigenvalue expression for the Gram matrix on the subspace, or a parameter-free argument showing continuous dependence that keeps eigenvalues positive, it is hard to confirm the interval is genuinely open rather than collapsing or selected after the fact. If the full text supplies those derivations and verifies the signature, the robustness result strengthens considerably; otherwise the central argument rests on an assertion that still needs tighter support. This paper is for theorists already working with anyon categories and topological quantum computation who know the semisimple versus non-semisimple distinction. A reader looking for concrete alternatives to standard Ising braiding would get the most from the new encodings and the interval claim. It shows clear engagement with the literature and honest effort to make the non-semisimple route more viable. I would send it to peer review so experts can check the definiteness argument and the explicit matrices.

Referee Report

2 major / 1 minor

Summary. The manuscript claims that non-semisimple extensions of the Ising anyon model, parameterized by a real neglecton parameter α, enable universal topological quantum computation via braiding alone. Braiding acts unitarily on a positive-definite computational subspace embedded in an indefinite Hermitian form. The universality is asserted to be robust over an open interval of α, with special decoupling values of α ensuring exact decoupling from negative-norm components and fully unitary evolution. An alternative encoding is presented that supports exact single-qubit Clifford gates together with a non-Clifford phase gate, and the work argues that high-precision tuning of α is unnecessary for efficient gate compilation.

Significance. If the central claims hold, the result would be significant for topological quantum computation: it supplies a concrete route to universality beyond the Clifford group using only braiding in a non-semisimple anyonic theory, while the reported robustness over an interval of α and the existence of decoupling points would materially improve physical plausibility. The alternative encoding further adds practical utility.

major comments (2)

[Abstract / robustness discussion] Abstract and main text (robustness paragraph): the load-bearing claim that the computational subspace remains positive-definite over an open interval of α requires explicit verification. The continuous dependence of the eigenvalues of the restricted Gram matrix on α must be demonstrated (analytically or numerically) to establish that the positive-definite region is indeed an open interval rather than isolated points; without this, the robustness assertion is not yet substantiated.
[Alternative encoding section] Section presenting the alternative encoding: the claim that this encoding yields exact single-qubit Clifford gates plus a non-Clifford phase gate should be accompanied by the explicit braiding matrices (or their action on the computational subspace) and a verification that they remain unitary with respect to the restricted positive-definite form for the stated range of α.

minor comments (1)

Notation for the neglecton parameter α and the indefinite Hermitian form should be introduced with a clear definition and reference to the prior work on the non-semisimple category before being used in claims about positive-definiteness.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading and constructive comments, which help clarify the presentation of our results on non-semisimple Ising anyons. We address each major comment below and will incorporate revisions to strengthen the manuscript.

read point-by-point responses

Referee: [Abstract / robustness discussion] Abstract and main text (robustness paragraph): the load-bearing claim that the computational subspace remains positive-definite over an open interval of α requires explicit verification. The continuous dependence of the eigenvalues of the restricted Gram matrix on α must be demonstrated (analytically or numerically) to establish that the positive-definite region is indeed an open interval rather than isolated points; without this, the robustness assertion is not yet substantiated.

Authors: We thank the referee for this observation. The restricted Gram matrix in our analysis has entries that are polynomial (hence continuous) functions of the neglecton parameter α. The eigenvalues of a matrix are continuous functions of its entries, so they vary continuously with α. The region where all eigenvalues remain positive is therefore the preimage of an open set under a continuous map and is itself open. We will add an explicit statement of this continuity argument, together with a short analytical derivation or numerical illustration of the eigenvalue dependence, to the robustness discussion in the revised manuscript. revision: yes
Referee: [Alternative encoding section] Section presenting the alternative encoding: the claim that this encoding yields exact single-qubit Clifford gates plus a non-Clifford phase gate should be accompanied by the explicit braiding matrices (or their action on the computational subspace) and a verification that they remain unitary with respect to the restricted positive-definite form for the stated range of α.

Authors: We agree that explicit matrices and unitarity verification will improve clarity. In the revised section we will supply the explicit braiding matrices (or their action on the chosen computational basis) for the alternative encoding and verify that each matrix is unitary with respect to the restriction of the indefinite Hermitian form to the positive-definite subspace, for all α in the open interval where that subspace is positive-definite. revision: yes

Circularity Check

0 steps flagged

No significant circularity; robustness claim rests on independent verification of positive-definiteness interval

full rationale

The paper constructs the non-semisimple extension via prior category-theoretic work and then demonstrates that the computational subspace remains positive-definite over an open interval of the real parameter α, with braiding acting unitarily on that sector. This interval is not defined tautologically but is presented as a property shown to hold continuously for a range of α values, with special decoupling points identified separately. No load-bearing step reduces by construction to a fitted parameter, self-citation chain, or ansatz smuggled from the authors' own prior results; the central universality claim retains independent content from the explicit analysis of the indefinite Hermitian form restricted to the subspace. The derivation is therefore self-contained against external benchmarks of the underlying anyon model.

Axiom & Free-Parameter Ledger

1 free parameters · 1 axioms · 1 invented entities

The construction rests on the existence of non-semisimple extensions of the Ising category and on the existence of an indefinite Hermitian form whose positive-definite sector contains the computational subspace.

free parameters (1)

neglecton parameter α
Real parameter indexing new anyon types; universality and positive-definiteness are claimed to hold over an open interval of this parameter.

axioms (1)

domain assumption Non-semisimple extensions of the Ising anyon model admit a unitary braiding action with respect to an indefinite Hermitian form whose positive-definite sector supports universal computation.
Invoked throughout the abstract as the foundation for the non-semisimple theory.

invented entities (1)

neglecton no independent evidence
purpose: New anyon type indexed by the real parameter α that enables the non-semisimple extension.
Introduced to label the additional anyon species in the extended theory.

pith-pipeline@v0.9.0 · 5715 in / 1446 out tokens · 53915 ms · 2026-05-18T18:55:37.855341+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/AlexanderDuality.lean alexander_duality_circle_linking echoes

?

echoes
ECHOES: this paper passage has the same mathematical shape or conceptual pattern as the Recognition theorem, but is not a direct formal dependency.

We demonstrate that this universality is robust, persisting over an open interval of the neglecton parameter α where the computational subspace remains positive-definite.

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

15 extracted references · 15 canonical work pages · 1 internal anchor

[1]

The module P2 is the projective cover of S2, having it as a submodule

The subscripts under each vector denote the weights. The module P2 is the projective cover of S2, having it as a submodule. The quotient P2/S2 has CH 4 and CH −4 as submodules. Quotienting again by these leaves an additional S2. One can compute that qdim( Sn) = [ n + 1]. Again, in the limit as q → 1, this quantum dimension reduces to (n + 1), the dimensio...

work page
[2]

Using these two results we construct the transformation from the Clebsch-Gordan basis to the tensor product basis: U =   0 1 0 0 1 0 q−1 0 −q−1 0 1 0 0 0 0 q + q−1  

Example 9 presents an analogous calculation for the subrepresenta- tion of 1 ⊗1 isomorphic to 2. Using these two results we construct the transformation from the Clebsch-Gordan basis to the tensor product basis: U =   0 1 0 0 1 0 q−1 0 −q−1 0 1 0 0 0 0 q + q−1   . Then, the half-twist on 1 ⊗1 is defined as √ θ1⊗1 = U √ θ0⊕ √ θ2 U −1 where √ θ0 =...

work page
[3]

= v = s1 0 ⊗ s1 0, Y 11 2 (s2

work page
[4]

= ∆F v = q−1s0 ⊗ s1 1 + s1 1 ⊗ s1 0, Y 11 2 (s2

work page
[5]

1 1 2 =   1 0 0 0 1 q 0 0 1 0 0 0 q + 1 q   Example 10

= (∆F )2v = (q + q−1)s1 1 ⊗ s1 1. 1 1 2 =   1 0 0 0 1 q 0 0 1 0 0 0 q + 1 q   Example 10. The fusion rules from Table III state that α ⊗ 1 ∼= (α+1) ⊕ (α−1). The map Y α1 α−1 : α−1 → α ⊗ 1 is determined by mapping the highest weight vector of (α−1) to a highest weight vector in v ∈ α ⊗1 of the same highest weight α + 2. (Recall that Vα has highes...

work page
[6]

left-hanging tree

Notice that the basis vectors are ordered lexicographically, and that the first coefficient is 1. The image of all other vectors in (α−1) is then determined by applying sequences of ∆ F : α 1 α−1 :    vα−1 0 7→ v vα−1 1 7→ ∆F v vα−1 2 7→ (∆F )2v vα−1 3 7→ (∆F )3v = vα−1 0 vα−1 1 vα−1 2 vα−1 3     0 0 0 0 vα 0 ⊗s1 0...

work page
[7]

Hence, the Hilbert space Hn can be simultaneously diagonalized into eigenstates of 14 the Jucys-Murphy operators

From the braid representations of these operators, it follows that they are mutually com- muting operators on Hn. Hence, the Hilbert space Hn can be simultaneously diagonalized into eigenstates of 14 the Jucys-Murphy operators. It is not hard to see that the basis of left-oriented fusion trees is an eigenbasis for these operators. See for example, Figure ...

work page
[8]

A and B do not commute

work page
[9]

ϕA and ϕB are both different from 1/2

work page
[10]

The first and third conditions are necessary, while the second condition can be relaxed in some cases

At least one between ϕA and ϕB must must not be of the form m n , with m and n are integers such that m < n ≤ 6. The first and third conditions are necessary, while the second condition can be relaxed in some cases. We see that condition 1 is clearly satisfied by b2 1 and b2 because they cannot be simultaneously diagonalized. The eigenvalues of b2 1 and b...

work page
[11]

mod 4 . Proof. Using the recursive construction from Lemma 17, with U = b3 and D(θ) = ( J2J −1 3 )2, one obtains ap- proximately diagonal (and hence nearly leakage-free) gates on H2, provided that | ⟨N C1|b3|00⟩ | < 1 and | ⟨N C2|b3|11⟩ | < 1, and for πα ̸= 0 in the interval (− π 2 , π 2 ) mod 2 π. The resulting gates are entangling, which can be verified...

work page
[12]

∈ {(0, 1), (2, 1)} and the noncomputational space spanned by (v1, v′

work page
[13]

The computational space is positive-definite for all values of α, and the whole space is positive-definite when 1 < α < 2

= (2, 3). The computational space is positive-definite for all values of α, and the whole space is positive-definite when 1 < α < 2. The affine braid group Br aff 2n+1 acts on H′ n where the braid generators bi for i > 1 act on the computational space by the standard Ising braid matrices. Hence, we can execute exact Clifford gates in this encoding followi...

work page 1902
[14]

If U ∈ Proj, and W ∈ Ob(C ), then for any f ∈ End(U ⊗ W ), we have tU ⊗W (f) = tU (ptrR(f)) . (A.5)

work page
[15]

Commuting Families in Temperley-Lieb Algebras

If U, V ∈ Proj, then for any morphisms f : V → U, and g : U → V in C , we have tV (g ◦ f) = tU(f ◦ g). (A.6) There exists up to a scalar a unique trace on Proj. Appendix B: Non-semisimple F symbols For the traditional Ising category, the F -symbols de- scribing the change of basis for ((1 , 1)a, 1)1 with a = 0, 2 into the space (1, (1, 1)b)1 gives the non...

work page internal anchor Pith review Pith/arXiv arXiv doi:10.1103/phys- 2003

[1] [1]

The module P2 is the projective cover of S2, having it as a submodule

The subscripts under each vector denote the weights. The module P2 is the projective cover of S2, having it as a submodule. The quotient P2/S2 has CH 4 and CH −4 as submodules. Quotienting again by these leaves an additional S2. One can compute that qdim( Sn) = [ n + 1]. Again, in the limit as q → 1, this quantum dimension reduces to (n + 1), the dimensio...

work page

[2] [2]

Using these two results we construct the transformation from the Clebsch-Gordan basis to the tensor product basis: U =   0 1 0 0 1 0 q−1 0 −q−1 0 1 0 0 0 0 q + q−1  

Example 9 presents an analogous calculation for the subrepresenta- tion of 1 ⊗1 isomorphic to 2. Using these two results we construct the transformation from the Clebsch-Gordan basis to the tensor product basis: U =   0 1 0 0 1 0 q−1 0 −q−1 0 1 0 0 0 0 q + q−1   . Then, the half-twist on 1 ⊗1 is defined as √ θ1⊗1 = U √ θ0⊕ √ θ2 U −1 where √ θ0 =...

work page

[3] [3]

= v = s1 0 ⊗ s1 0, Y 11 2 (s2

work page

[4] [4]

= ∆F v = q−1s0 ⊗ s1 1 + s1 1 ⊗ s1 0, Y 11 2 (s2

work page

[5] [5]

1 1 2 =   1 0 0 0 1 q 0 0 1 0 0 0 q + 1 q   Example 10

= (∆F )2v = (q + q−1)s1 1 ⊗ s1 1. 1 1 2 =   1 0 0 0 1 q 0 0 1 0 0 0 q + 1 q   Example 10. The fusion rules from Table III state that α ⊗ 1 ∼= (α+1) ⊕ (α−1). The map Y α1 α−1 : α−1 → α ⊗ 1 is determined by mapping the highest weight vector of (α−1) to a highest weight vector in v ∈ α ⊗1 of the same highest weight α + 2. (Recall that Vα has highes...

work page

[6] [6]

left-hanging tree

Notice that the basis vectors are ordered lexicographically, and that the first coefficient is 1. The image of all other vectors in (α−1) is then determined by applying sequences of ∆ F : α 1 α−1 :    vα−1 0 7→ v vα−1 1 7→ ∆F v vα−1 2 7→ (∆F )2v vα−1 3 7→ (∆F )3v = vα−1 0 vα−1 1 vα−1 2 vα−1 3     0 0 0 0 vα 0 ⊗s1 0...

work page

[7] [7]

Hence, the Hilbert space Hn can be simultaneously diagonalized into eigenstates of 14 the Jucys-Murphy operators

From the braid representations of these operators, it follows that they are mutually com- muting operators on Hn. Hence, the Hilbert space Hn can be simultaneously diagonalized into eigenstates of 14 the Jucys-Murphy operators. It is not hard to see that the basis of left-oriented fusion trees is an eigenbasis for these operators. See for example, Figure ...

work page

[8] [8]

A and B do not commute

work page

[9] [9]

ϕA and ϕB are both different from 1/2

work page

[10] [10]

The first and third conditions are necessary, while the second condition can be relaxed in some cases

At least one between ϕA and ϕB must must not be of the form m n , with m and n are integers such that m < n ≤ 6. The first and third conditions are necessary, while the second condition can be relaxed in some cases. We see that condition 1 is clearly satisfied by b2 1 and b2 because they cannot be simultaneously diagonalized. The eigenvalues of b2 1 and b...

work page

[11] [11]

mod 4 . Proof. Using the recursive construction from Lemma 17, with U = b3 and D(θ) = ( J2J −1 3 )2, one obtains ap- proximately diagonal (and hence nearly leakage-free) gates on H2, provided that | ⟨N C1|b3|00⟩ | < 1 and | ⟨N C2|b3|11⟩ | < 1, and for πα ̸= 0 in the interval (− π 2 , π 2 ) mod 2 π. The resulting gates are entangling, which can be verified...

work page

[12] [12]

∈ {(0, 1), (2, 1)} and the noncomputational space spanned by (v1, v′

work page

[13] [13]

The computational space is positive-definite for all values of α, and the whole space is positive-definite when 1 < α < 2

= (2, 3). The computational space is positive-definite for all values of α, and the whole space is positive-definite when 1 < α < 2. The affine braid group Br aff 2n+1 acts on H′ n where the braid generators bi for i > 1 act on the computational space by the standard Ising braid matrices. Hence, we can execute exact Clifford gates in this encoding followi...

work page 1902

[14] [14]

If U ∈ Proj, and W ∈ Ob(C ), then for any f ∈ End(U ⊗ W ), we have tU ⊗W (f) = tU (ptrR(f)) . (A.5)

work page

[15] [15]

Commuting Families in Temperley-Lieb Algebras

If U, V ∈ Proj, then for any morphisms f : V → U, and g : U → V in C , we have tV (g ◦ f) = tU(f ◦ g). (A.6) There exists up to a scalar a unique trace on Proj. Appendix B: Non-semisimple F symbols For the traditional Ising category, the F -symbols de- scribing the change of basis for ((1 , 1)a, 1)1 with a = 0, 2 into the space (1, (1, 1)b)1 gives the non...

work page internal anchor Pith review Pith/arXiv arXiv doi:10.1103/phys- 2003