Engineering complex topological memories from simple Abelian models

DOI10.1016/J.AOP.2011.05.008MaRDI QIDQ719702zbMATH OpenOpenAlexFDO

Authors James R. Wootton, Ville Lahtinen, Jiannis K. Pachos, B. Douçot

Publication date 11 October 2011

Published in Annals of Physics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0908.0708

zbMATH Keywords

anyonfault-tolerant quantum computationtopological model

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum coding (general) (81P70) Other types of codes (94B60)

Abstract: In three spatial dimensions, particles are limited to either bosonic or fermionic statistics. Two-dimensional systems, on the other hand, can support anyonic quasiparticles exhibiting richer statistical behaviours. An exciting proposal for quantum computation is to employ anyonic statistics to manipulate information. Since such statistical evolutions depend only on topological characteristics, the resulting computation is intrinsically resilient to errors. So-called non-Abelian anyons are most promising for quantum computation, but their physical realization may prove to be complex. Abelian anyons, however, are easier to understand theoretically and realize experimentally. Here we show that complex topological memories inspired by non-Abelian anyons can be engineered in Abelian models. We explicitly demonstrate the control procedures for the encoding and manipulation of quantum information in specific lattice models that can be implemented in the laboratory. This bridges the gap between requirements for anyonic quantum computation and the potential of state-of-the-art technology.

Recommendations

• Universal quantum computation with a non-abelian topological memory
• QUANTUM COMPUTATION WITH ABELIAN ANYONS ON THE HONEYCOMB LATTICE
• Universal quantum computation with abelian anyon models
• Fault-tolerant quantum computation by anyons
• Simulation of anyonic statistics and its topological path independence using a seven-qubit quantum simulator

Cites work

• Fault-tolerant quantum computation by anyons
• QUANTUM COMPUTATION WITH ABELIAN ANYONS ON THE HONEYCOMB LATTICE
• Qudit surface codes and gauge theory with finite cyclic groups
• The physical implementation of quantum computation.
• Topological computation without braiding
• Universal quantum computation with a non-abelian topological memory

Cited in

(8)

• Prime number factorization using a spinor Bose-Einstein condensate-inspired topological quantum computer
• Universal quantum computation with abelian anyon models
• Quantum memories and error correction
• Majorana anyons, non-abelian statistics and quantum computation in Chern-Simons-Higgs theory
• QUANTUM COMPUTATION WITH ABELIAN ANYONS ON THE HONEYCOMB LATTICE
• Ternary logic design in topological quantum computing
• Programming a quantum phase of matter
• Universal quantum computation with a non-abelian topological memory

This page was built for publication: Engineering complex topological memories from simple Abelian models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q719702)