Monodromy analysis of the computational power of the Ising topological quantum computer

Research output: Chapter in book/report/conference proceedingContribution to book/anthologyResearchpeer review

Authors

Research Organisations

View graph of relations

Details

Original languageUndefined/Unknown
Title of host publicationLie theory and its applications in physics
EditorsV Dobrev
Pages279-288
Number of pages10
Volume1243
Publication statusPublished - 2010

Publication series

NameAIP Conference Proceedings

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 $n$ 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.

Cite this

Monodromy analysis of the computational power of the Ising topological quantum computer. / Ahlbrecht, Andre; Georgiev, Lachezar S.; Werner, Reinhard F.
Lie theory and its applications in physics. ed. / V Dobrev. Vol. 1243 2010. p. 279-288 (AIP Conference Proceedings).

Research output: Chapter in book/report/conference proceedingContribution to book/anthologyResearchpeer review

Ahlbrecht, A, Georgiev, LS & Werner, RF 2010, Monodromy analysis of the computational power of the Ising topological quantum computer. in V Dobrev (ed.), Lie theory and its applications in physics. vol. 1243, AIP Conference Proceedings, pp. 279-288. https://doi.org/10.1063/1.3460174
Ahlbrecht, A., Georgiev, L. S., & Werner, R. F. (2010). Monodromy analysis of the computational power of the Ising topological quantum computer. In V. Dobrev (Ed.), Lie theory and its applications in physics (Vol. 1243, pp. 279-288). (AIP Conference Proceedings). https://doi.org/10.1063/1.3460174
Ahlbrecht A, Georgiev LS, Werner RF. Monodromy analysis of the computational power of the Ising topological quantum computer. In Dobrev V, editor, Lie theory and its applications in physics. Vol. 1243. 2010. p. 279-288. (AIP Conference Proceedings). doi: 10.1063/1.3460174
Ahlbrecht, Andre ; Georgiev, Lachezar S. ; Werner, Reinhard F. / Monodromy analysis of the computational power of the Ising topological quantum computer. Lie theory and its applications in physics. editor / V Dobrev. Vol. 1243 2010. pp. 279-288 (AIP Conference Proceedings).
Download
@inbook{3876241ebf394036a365be9876c2f1a2,
title = "Monodromy analysis of the computational power of the Ising topological quantum computer",
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 $n$ 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.",
author = "Andre Ahlbrecht and Georgiev, {Lachezar S.} and Werner, {Reinhard F.}",
year = "2010",
doi = "10.1063/1.3460174",
language = "Undefined/Unknown",
volume = "1243",
series = "AIP Conference Proceedings",
pages = "279--288",
editor = "V Dobrev",
booktitle = "Lie theory and its applications in physics",

}

Download

TY - CHAP

T1 - Monodromy analysis of the computational power of the Ising topological quantum computer

AU - Ahlbrecht, Andre

AU - Georgiev, Lachezar S.

AU - Werner, Reinhard F.

PY - 2010

Y1 - 2010

N2 - 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 $n$ 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.

AB - 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 $n$ 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.

U2 - 10.1063/1.3460174

DO - 10.1063/1.3460174

M3 - Beitrag in Buch/Sammelwerk

VL - 1243

T3 - AIP Conference Proceedings

SP - 279

EP - 288

BT - Lie theory and its applications in physics

A2 - Dobrev, V

ER -

By the same author(s)