Monodromy Analysis of the Computational Power of the Ising Topological Quantum Computer

DOI10.1063/1.3460174zbMATH Open1210.81016arXiv0911.2591OpenAlexW3101449562WikidataQ62124823 ScholiaQ62124823MaRDI QIDQ3079591FDOQ3079591

Authors: Andre Ahlbrecht, Lachezar S. Georgiev, Reinhard F. Werner 

Publication date: 2 March 2011

Published in: AIP Conference Proceedings (Search for Journal in Brave)

Abstract: We show that all quantum gates which could be implemented by braiding of Ising anyons in the Ising topological quantum computer preserve the n-qubit Pauli group. Analyzing the structure of the Pauli group's centralizer, also known as the Clifford group, for ngeq 3 qubits, we prove that the image of the braid group is a non-trivial subgroup of the Clifford group and therefore not all Clifford gates could be implemented by braiding. We show explicitly the Clifford gates which cannot be realized by braiding estimating in this way the ultimate computational power of the Ising topological quantum computer.

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

Recommendations

• Topological quantum computation with the universal \(R\) matrix for Ising anyons
• scientific article; zbMATH DE number 2140634
• MONODROMY APPROACH TO QUANTUM COMPUTING
• Towards topological quantum computer
• Publication:4939168
• Topological quantum computation
• Topological quantum computation
• Simulation of topological field theories by quantum computers
• Monodromic quantum computing

zbMATH Keywords

anyonsbraid groupstopological quantum computation

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Braid groups; Artin groups (20F36) Monodromy on manifolds (58K10) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Cited In (5)

• Towards a universal set of topologically protected gates for quantum computation with Pfaffian qubits
• Braid matrices and quantum gates for Ising anyons topological quantum computation
• Title not available (Why is that?)
• Topological quantum computation with the universal \(R\) matrix for Ising anyons
• On topological quantum computing with mapping class group representations

This page was built for publication: Monodromy Analysis of the Computational Power of the Ising Topological Quantum Computer

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