淡江大學機構典藏:Item 987654321/120596
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 64191/96979 (66%)
造访人次 : 8439344      在线人数 : 8328
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧：
  • 您可在西文检索词汇前后加上"双引号"，以获取较精准的检索结果
  • 若欲以作者姓名搜寻，建议至进阶搜寻限定作者字段，可获得较完整数据
    •  进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/120596


    题名: Determining X-chains in graph states
    作者: Wu, Jun-Yi;Kampermann, Hermann;Bruß, Dagmar
    日期: 2015-12-30
    上传时间: 2021-04-22 12:10:32 (UTC+8)
    摘要: The representation of graph states in the X-basis as well as the calculation of graph state overlaps can efficiently be performed by using the concept of X-chains (Wu et al 2015 Phys. Rev. A 92 012322). We present a necessary and sufficient criterion for X-chains and show that they can efficiently be determined by the Bareiss algorithm. An analytical approach for searching X-chain groups of a graph state is proposed. Furthermore we generalize the concept of X-chains to so-called Euler chains, whose induced subgraphs are Eulerian. This approach helps to determine if a given vertex set is an X-chain and we show how Euler chains can be used in the construction of multipartite Bell inequalities for graph states.
    關聯: J. Phys. A: Math. Theor. 49(5), 055302
    DOI: 10.1088/1751-8113/49/5/055302
    显示于类别:[物理學系暨研究所] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    Determining X-chains in graph states.pdf1386KbAdobe PDF2检视/开启
    index.html0KbHTML150检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回馈