Efficient Entanglement Measure for Graph States

Autor:	Saeed Haddadi, Ahmad Akhound, Mohammad Ali Chaman Motlagh
Rok vydání:	2019
Předmět:	Discrete mathematics Quantum Physics TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES Physics and Astronomy (miscellaneous) 010308 nuclear & particles physics General Mathematics FOS: Physical sciences TheoryofComputation_GENERAL Concurrence GCM transcription factors Data_CODINGANDINFORMATIONTHEORY Quantum entanglement Graph state 01 natural sciences Multipartite entanglement Graph Computer Science::Emerging Technologies Qubit 0103 physical sciences Hardware_ARITHMETICANDLOGICSTRUCTURES Quantum Physics (quant-ph) 010306 general physics Mathematics
Zdroj:	International Journal of Theoretical Physics. 58:3406-3413
ISSN:	1572-9575 0020-7748
DOI:	10.1007/s10773-019-04214-4
Popis:	In this paper, we study the multipartite entanglement properties of graph states up to seven qubits. Our analysis shows that the generalized concurrence measure is more efficient than geometric entanglement measure for measuring entanglement quantity in the multi-qubit graph states. 10 pages, 4 tables
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3b374bf95c74228e9ba810543d1ef09c https://doi.org/10.1007/s10773-019-04214-4 Zobrazit plný text záznamu Plný text ve formátu PDF Plný text ve formátu HTML
Nepřihlášeným uživatelům se plný text nezobrazuje	K zobrazení výsledku je třeba se přihlásit.