Pith. sign in

REVIEW 1 cited by

Anyons from non-solvable finite groups are sufficient for universal quantum computation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv quant-ph/0206128 v2 pith:G4335MOD submitted 2002-06-19 quant-ph

classification quant-ph
keywords universalanyonscomputationfinitegate-setnon-solvablequantumreservoir
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We present a constructive proof that anyonic magnetic charges with fluxes in a non-solvable finite group can perform universal quantum computations. The gates are built out of the elementary operations of braiding, fusion, and vacuum pair creation, supplemented by a reservoir of ancillas of known flux. Procedures for building the ancilla reservoir and for correcting leakage are also described. Finally, a universal qudit gate-set, which is ideally suited for anyons, is presented. The gate-set consists of classical computation supplemented by measurements of the X operator.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Reconstructing non-Abelian braiding and fusion without anyon transport

    quant-ph 2026-08 conditional novelty 6.0 of 10

    A compact two-qutrit measurement-only protocol on a trapped-ion processor reconstructs the squared braiding phases and fusion amplitudes of D(S3) anyons with average output-state fidelities above 0.998.

Pith tools