Measurement-Only Topological Quantum Computation
classification
🪐 quant-ph
cond-mat.mes-hallhep-th
keywords
computationalquantumtopologicalgatesanaloganyonicanyonsaround
read the original abstract
We remove the need to physically transport computational anyons around each other from the implementation of computational gates in topological quantum computing. By using an anyonic analog of quantum state teleportation, we show how the braiding transformations used to generate computational gates may be produced through a series of topological charge measurements.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Lower overhead fault-tolerant building blocks for noisy quantum computers
New combinatorial proofs and circuit designs for quantum error correction reduce physical qubit overhead by up to 10x and time overhead by 2-6x for codes including Steane, Golay, and surface codes.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.