Pith. sign in

REVIEW

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 2209.03822 v2 pith:NBYCT5VN submitted 2022-09-08 quant-ph cond-mat.str-elhep-thmath-phmath.MP

Topological Quantum Computation on Supersymmetric Spin Chains

classification quant-ph cond-mat.str-elhep-thmath-phmath.MP
keywords quantumgroupsupersymmetricanyonsbraidchainscomputationmodes
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Quantum gates built out of braid group elements form the building blocks of topological quantum computation. They have been extensively studied in $SU(2)_k$ quantum group theories, a rich source of examples of non-Abelian anyons such as the Ising ($k=2$), Fibonacci ($k=3$) and Jones-Kauffman ($k=4$) anyons. We show that the fusion spaces of these anyonic systems can be precisely mapped to the product state zero modes of certain Nicolai-like supersymmetric spin chains. As a result, we can realize the braid group on the product state zero modes of these supersymmetric systems. These operators kill all the other states in the Hilbert space, thus preventing the occurrence of errors while processing information, making them suitable for quantum computing.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.