Braid matrices and quantum gates for Ising anyons topological quantum computation

被引:5
|
作者
Fan, Z. [1 ]
de Garis, H. [2 ]
机构
[1] Nanjing Univ, Dept Phys, Nanjing 210093, Peoples R China
[2] Xiamen Univ, Dept Comp Sci, Artificial Intelligence Inst, Xiamen, Fujian Province, Peoples R China
来源
EUROPEAN PHYSICAL JOURNAL B | 2010年 / 74卷 / 03期
基金
中国国家自然科学基金;
关键词
EXCITED LANDAU-LEVEL; HALL STATE; QUASI-PARTICLE; FIELD-THEORY; UNIVERSAL; QUBITS;
D O I
10.1140/epjb/e2010-00087-4
中图分类号
O469 [凝聚态物理学];
学科分类号
070205 ;
摘要
We study various aspects of the topological quantum computation scheme based on the non-Abelian anyons corresponding to fractional quantum hall effect states at filling fraction 5/2 using the Temperley-Lieb recoupling theory. Unitary braiding matrices are obtained by a normalization of the degenerate ground states of a system of anyons, which is equivalent to a modification of the definition of the 3-vertices in the Temperley-Lieb recoupling theory as proposed by Kauffman and Lomonaco. With the braid matrices available, we discuss the problems of encoding of qubit states and construction of quantum gates from the elementary braiding operation matrices for the Ising anyons model. In the encoding scheme where 2 qubits are represented by 8 Ising anyons, we give an alternative proof of the no-entanglement theorem given by Bravyi and compare it to the case of Fibonacci anyons model. In the encoding scheme where 2 qubits are represented by 6 Ising anyons, we construct a set of quantum gates which is equivalent to the construction of Georgiev.
引用
收藏
页码:419 / 427
页数:9
相关论文
共 50 条
  • [21] Implementation of Clifford gates in the Ising-anyon topological quantum computer
    Ahlbrecht, Andre
    Georgiev, Lachezar S.
    Werner, Reinhard F.
    PHYSICAL REVIEW A, 2009, 79 (03):
  • [22] Braid Group Representation on Quantum Computation
    Aziz, Ryan Kasyfil
    Muchtadi-Alamsyah, Intan
    5TH INTERNATIONAL CONFERENCE ON MATHEMATICS AND NATURAL SCIENCES (ICMNS 2014), 2015, 1677
  • [23] Efficient quantum computation with probabilistic quantum gates
    Duan, LM
    Raussendorf, R
    PHYSICAL REVIEW LETTERS, 2005, 95 (08)
  • [24] Unified approach to topological quantum computation with anyons: From qubit encoding to Toffoli gate
    Xu, Haitan
    Taylor, J. M.
    PHYSICAL REVIEW A, 2011, 84 (01):
  • [25] Quantum computation with Abelian anyons on the honeycomb lattice
    Pachos, Jiannis K.
    INTERNATIONAL JOURNAL OF QUANTUM INFORMATION, 2006, 4 (06) : 947 - 954
  • [26] Universal quantum computation with weakly integral anyons
    Shawn X. Cui
    Seung-Moon Hong
    Zhenghan Wang
    Quantum Information Processing, 2015, 14 : 2687 - 2727
  • [27] Quantum gates with topological phases
    Ionicioiu, R
    PHYSICAL REVIEW A, 2003, 68 (03):
  • [28] ELEMENTARY GATES FOR QUANTUM COMPUTATION
    BARENCO, A
    BENNETT, CH
    CLEVE, R
    DIVINCENZO, DP
    MARGOLUS, N
    SHOR, P
    SLEATOR, T
    SMOLIN, JA
    WEINFURTER, H
    PHYSICAL REVIEW A, 1995, 52 (05): : 3457 - 3467
  • [29] Fault-tolerant quantum computation by anyons
    Kitaev, AY
    ANNALS OF PHYSICS, 2003, 303 (01) : 2 - 30
  • [30] Elementary gates for quantum computation
    Phys Rev A, 5 (3457):