Topological Quantum Computation

DOI10.1007/978-3-642-38874-3_5zbMath1380.81089OpenAlexW2198369452MaRDI QIDQ5300887

Jiannis K. Pachos

Publication date: 28 June 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38874-3_5

Mathematics Subject Classification ID

General low-dimensional topology (57M99) Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Cites Work

• Unnamed Item
• Anyons in an exactly solved model and beyond
• Quantum field theory and the Jones polynomial
• The two-eigenvalue problem and density of Jones representation of braid groups.
• Fault-tolerant quantum computation by anyons
• Ground state entanglement and geometric entropy in the Kitaev model
• Sufficient symmetry conditions for Topological Quantum Order
• Non-Abelian anyons and topological quantum computation
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Universal quantum computation with ideal Clifford gates and noisy ancillas
• Significance of Electromagnetic Potentials in the Quantum Theory
• QUANTUM HOLONOMIES FOR QUANTUM COMPUTING
• Quantal phase factors accompanying adiabatic changes
• A polynomial invariant for knots via von Neumann algebras
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Error Correcting Codes in Quantum Theory
• On the computational complexity of the Jones and Tutte polynomials
• Topological quantum computation
• Universal Quantum Computation with a Non-Abelian Topological Memory
• Connection between Spin, Statistics, and Kinks
• A polynomial quantum algorithm for approximating the Jones polynomial

This page was built for publication: Topological Quantum Computation