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.
Anyons from non-solvable finite groups are sufficient for universal quantum computation
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2026 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Reconstructing non-Abelian braiding and fusion without anyon transport
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.