Why should anyone care about computing with anyons?
From MaRDI portal
Publication:5438173
DOI10.1098/rspa.2007.0026zbMath1132.81004arXiv0704.2241WikidataQ62569139 ScholiaQ62569139MaRDI QIDQ5438173
Jiannis K. Pachos, K. Brennen Gavin
Publication date: 23 January 2008
Published in: Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0704.2241
Related Items
Cites Work
- Anyons in an exactly solved model and beyond
- The wavefunction of an anyon
- Quantum field theory and the Jones polynomial
- State sum invariants of 3-manifolds and quantum \(6j\)-symbols
- \(2n\)-quasihole states realize \(2^{n-1}\)-dimensional spinor braiding statistics in paired quantum Hall states
- A class of \(P,T\)-invariant topological phases of interacting electrons
- A modular functor which is universal for quantum computation
- Fault-tolerant quantum computation by anyons
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Topological Computation without Braiding
- QUANTUM COMPUTATION WITH ABELIAN ANYONS ON THE HONEYCOMB LATTICE
- Qudit surface codes and gauge theory with finite cyclic groups
- A polynomial invariant for knots via von Neumann algebras
- On the computational complexity of the Jones and Tutte polynomials
- Quantum groups and non-Abelian braiding in quantum Hall systems