Topological Computation without Braiding

H. Bombin; M.A. Martin-Delgado

Topological Computation without Braiding

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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/0610024 v2 pith:2F6XZH2G submitted 2006-10-04 quant-ph cond-mat.str-elhep-th

Topological Computation without Braiding

H. Bombin , M.A. Martin-Delgado This is my paper

classification quant-ph cond-mat.str-elhep-th

keywords quantumbraidingcomputationprotectedtopologicallyuniversalwithoutachieved

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original abstract

We show that universal quantum computation can be performed within the ground state of a topologically ordered quantum system, which is a naturally protected quantum memory. In particular, we show how this can be achieved using brane-net condensates in 3-colexes. The universal set of gates is implemented without selective addressing of physical qubits and, being fully topologically protected, it does not rely on quasiparticle excitations or their braiding.

discussion (0)

Forward citations

Cited by 1 Pith paper

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

Genuine Multi-Entropy in the Toric Code
hep-th 2026-07 conditional novelty 6.0

Genuine multi-entropy in the toric code reduces to topological entanglement entropy for stabilizer states at low replica index but captures independent topological data at n=4 and for non-stabilizer states.