arXiv:2610.06845
Rewire and reset are all you need: Minimal resources for manipulating non-Abelions
Chiu Fan Bowen Lo, Rohith Sajith, Anasuya Lyons, Ashvin Vishwanath, Ruben Verresen
Abstract
Braiding and fusing anyons are fundamental to topological quantum computation, yet existing circuit protocols often employ ancillas and measurements. We determine the minimal circuit resources for performing such anyon operations in quantum double models of generic finite groups. Our approach braids anyons through a sequential unitary circuit without ancillas. Intuitively, this is obtained by deforming the underlying graph on which the anyons live. More generally, we introduce graph rewiring, a diagrammatic calculus that assigns a geometric interpretation to individual two-qudit gates and tracks their action on stabilizers. For fusion, we prove a general no-go theorem excluding purely unitary protocols for fusing unknown anyon types without introducing ancillas. Remarkably, we show such "input-agnostic" fusion is enabled by simply using a qudit reset. Hence, contrary to folklore, ancilla resources are not needed to braid or fuse non-Abelian anyons (non-Abelions). This work has implications in experimental efforts in error correction: our fusion protocol highlights reset as an underutilized primitive for error correction without the spacetime-overhead of ancillas and measurements.
AI Summary
The paper asks which circuit resources are needed to braid and fuse anyons in finite-group quantum doubles $D(G)$, distinguishing fusion from read-out of its outcome. It introduces graph rewiring: an individual controlled group-multiplication gate slides an edge endpoint along a neighboring edge, mapping vertex and plaquette operators to those of the modified graph. Gate-conjugation identities establish this correspondence for arbitrary finite $G$, including excited sectors. Rewiring gives ancilla-free unitary circuits for nearest-neighbor charge and flux exchange, each using six controlled multiplications and one single-qudit inversion on the square lattice. Sequential composition implements longer-distance exchanges. For fluxes, the circuit explicitly realizes $|w_1,w_2\rangle\mapsto|w_2,w_2w_1w_2^{-1}\rangle$. A dimension-counting argument rules out purely unitary input-agnostic fusion that always empties the source, including protocols with an ancilla returned to its initial state. Charge and flux fusion instead use an ungauge–reset–regauge construction: three controlled multiplications expose the source on one edge, one unconditional reset removes it, and three inverse gates restore the lattice. Heisenberg-picture projector identities establish exact preservation of fusion-outcome probabilities; full dyon-label tracking for flux fusion assumes specified neighboring vertices are charge-free. Fusion produces no classical outcome record. Reset need not preserve coherence between fusion channels, illustrated explicitly in $D(S_3)$. The constructions concern finite-group quantum doubles, not general string-net theories. Error-correction applications remain prospective: no decoding threshold, fault-tolerant memory protocol, or improved relaxation-time bound is established.
Central claim may not hold: The abstract's unrestricted fusion claim exceeds the demonstrated protocols, whose full dyonic-label guarantee assumes five neutral perimeter vertices and is not extended to arbitrary dyonic inputs. The known-source no-go derivation uses a false Frobenius-reciprocity identity, contradicted by the paper's own S3 fusion rules, although the main input-agnostic no-go theorem survives. The purported unitary charge-ribbon circuit contains the generally nonunitary operator Z^Gamma_ij, which cannot become unitary through unitary rewiring.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 20 pages; 58 pages total