Entanglement and separability of graph Laplacian quantum states

Simple item page
dc.contributor.authorJoshi, Anoopa
dc.contributor.authorSingh, Parvinder
dc.contributor.authorKumar, Atul
dc.date.accessioned2024-01-21T10:48:38Z
dc.date.accessioned2024-08-14T05:05:58Z
dc.date.available2024-01-21T10:48:38Z
dc.date.available2024-08-14T05:05:58Z
dc.date.issued2022-04-07T00:00:00
dc.description.abstractIn this article, we study the entanglement properties of multi-qubit quantum states using a graph-theoretic approach. For this, we define entanglement and separability for m-qubit quantum states associated with a weighted graph on 2 m vertices. We further explore the properties of a block graph and a star graph to demonstrate criteria for entanglement and separability of these graphs. � 2022, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.en_US
dc.identifier.doi10.1007/s11128-022-03483-z
dc.identifier.issn15700755
dc.identifier.urihttps://kr.cup.edu.in/handle/32116/3903
dc.identifier.urlhttps://link.springer.com/10.1007/s11128-022-03483-z
dc.language.isoen_USen_US
dc.publisherSpringeren_US
dc.subjectBlock graphsen_US
dc.subjectDensity operatorsen_US
dc.subjectGraph Laplacian operatorsen_US
dc.subjectQuantum entanglementen_US
dc.subjectStar graphsen_US
dc.titleEntanglement and separability of graph Laplacian quantum statesen_US
dc.title.journalQuantum Information Processingen_US
dc.typeArticleen_US
dc.type.accesstypeClosed Accessen_US

Files

Collections

Computer Science And Technology - Research Publications