Implementation of Clifford gates in the Ising-anyon topological quantum computer

Publikation: Beitrag in FachzeitschriftArtikelForschungPeer-Review

Autoren

Organisationseinheiten

Forschungs-netzwerk anzeigen

Details

OriginalspracheEnglisch
Seiten (von - bis)032311
Seitenumfang1
FachzeitschriftPhys. Rev. A
Jahrgang79
Ausgabenummer3
PublikationsstatusVeröffentlicht - 2009

Abstract

We give a general proof for the existence and realizability of Clifford gates in the Ising topological quantum computer. We show that all quantum gates that can be implemented by braiding of Ising anyons are Clifford gates. We find that the braiding gates for two qubits exhaust the entire two-qubit Clifford group. Analyzing the structure of the Clifford group for n qubits we prove that the image of the braid group is a nontrivial subgroup of the Clifford group so that not all Clifford gates could be implemented by braiding in the Ising topological quantum computation scheme. We also point out which Clifford gates cannot in general be realized by braiding.

Zitieren

Implementation of Clifford gates in the Ising-anyon topological quantum computer. / Ahlbrecht, Andre; Georgiev, Lachezar S.; Werner, Reinhard F.
in: Phys. Rev. A, Jahrgang 79, Nr. 3, 2009, S. 032311.

Publikation: Beitrag in FachzeitschriftArtikelForschungPeer-Review

Ahlbrecht A, Georgiev LS, Werner RF. Implementation of Clifford gates in the Ising-anyon topological quantum computer. Phys. Rev. A. 2009;79(3):032311. doi: 10.1103/PhysRevA.79.032311
Ahlbrecht, Andre ; Georgiev, Lachezar S. ; Werner, Reinhard F. / Implementation of Clifford gates in the Ising-anyon topological quantum computer. in: Phys. Rev. A. 2009 ; Jahrgang 79, Nr. 3. S. 032311.
Download
@article{1bab491f4e244dc08bcf1afb44bb8369,
title = "Implementation of Clifford gates in the Ising-anyon topological quantum computer",
abstract = "We give a general proof for the existence and realizability of Clifford gates in the Ising topological quantum computer. We show that all quantum gates that can be implemented by braiding of Ising anyons are Clifford gates. We find that the braiding gates for two qubits exhaust the entire two-qubit Clifford group. Analyzing the structure of the Clifford group for n qubits we prove that the image of the braid group is a nontrivial subgroup of the Clifford group so that not all Clifford gates could be implemented by braiding in the Ising topological quantum computation scheme. We also point out which Clifford gates cannot in general be realized by braiding.",
author = "Andre Ahlbrecht and Georgiev, {Lachezar S.} and Werner, {Reinhard F.}",
year = "2009",
doi = "10.1103/PhysRevA.79.032311",
language = "English",
volume = "79",
pages = "032311",
journal = "Phys. Rev. A",
issn = "2469-9934",
publisher = "American Physical Society",
number = "3",

}

Download

TY - JOUR

T1 - Implementation of Clifford gates in the Ising-anyon topological quantum computer

AU - Ahlbrecht, Andre

AU - Georgiev, Lachezar S.

AU - Werner, Reinhard F.

PY - 2009

Y1 - 2009

N2 - We give a general proof for the existence and realizability of Clifford gates in the Ising topological quantum computer. We show that all quantum gates that can be implemented by braiding of Ising anyons are Clifford gates. We find that the braiding gates for two qubits exhaust the entire two-qubit Clifford group. Analyzing the structure of the Clifford group for n qubits we prove that the image of the braid group is a nontrivial subgroup of the Clifford group so that not all Clifford gates could be implemented by braiding in the Ising topological quantum computation scheme. We also point out which Clifford gates cannot in general be realized by braiding.

AB - We give a general proof for the existence and realizability of Clifford gates in the Ising topological quantum computer. We show that all quantum gates that can be implemented by braiding of Ising anyons are Clifford gates. We find that the braiding gates for two qubits exhaust the entire two-qubit Clifford group. Analyzing the structure of the Clifford group for n qubits we prove that the image of the braid group is a nontrivial subgroup of the Clifford group so that not all Clifford gates could be implemented by braiding in the Ising topological quantum computation scheme. We also point out which Clifford gates cannot in general be realized by braiding.

U2 - 10.1103/PhysRevA.79.032311

DO - 10.1103/PhysRevA.79.032311

M3 - Article

VL - 79

SP - 032311

JO - Phys. Rev. A

JF - Phys. Rev. A

SN - 2469-9934

IS - 3

ER -

Von denselben Autoren