Determining X-chains in graph states
學年 104
學期 1
出版（發表）日期 2015-12-30
作品名稱 Determining X-chains in graph states
作品名稱（其他語言）
著者 Jun-Yi Wu; Hermann Kampermann; Dagmar Bruß
單位
出版者
著錄名稱、卷期、頁數 J. Phys. A: Math. Theor. 49(5), 055302
摘要 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.
關鍵字
語言 en_US
ISSN 1751-8121
期刊性質 國外
收錄於 SCI
產學合作
通訊作者
審稿制度 否
國別 GBR
公開徵稿
出版型式 ,電子版
相關連結

機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/120596 )