Determining X-chains in graph states

機構典藏 > College of Sciences > Graduate Institute & Department of Physics > Journal Article > Item 987654321/120596

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/120596

Title:	Determining X-chains in graph states
Authors:	Wu, Jun-Yi;Kampermann, Hermann;Bruß, Dagmar
Date:	2015-12-30
Issue Date:	2021-04-22 12:10:32 (UTC+8)
Abstract:	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.
Relation:	J. Phys. A: Math. Theor. 49(5), 055302
DOI:	10.1088/1751-8113/49/5/055302
Appears in Collections:	[Graduate Institute & Department of Physics] Journal Article

Files in This Item:

File	Description	Size	Format
Determining X-chains in graph states.pdf		1386Kb	Adobe PDF	2	View/Open
index.html		0Kb	HTML	150	View/Open