A combinatorial approach for studying LOCC transformations of multipartite states

Simple item page
dc.creatorSingh, Sudhir Kumar
dc.creatorPal, Sudebkumar Prasant
dc.creatorKumar, Somesh
dc.creatorSrikanth, R.
dc.date2004-06-18
dc.date2005-11-10
dc.date.accessioned2026-07-07T06:36:56Z
dc.date.available2026-07-07T06:36:56Z
dc.descriptionWe develop graph theoretic methods for analysing maximally entangled pure states distributed between a number of different parties. We introduce a technique called {\it bicolored merging}, based on the monotonicity feature of entanglement measures, for determining combinatorial conditions that must be satisfied for any two distinct multiparticle states to be comparable under local operations and classical communication (LOCC). We present several results based on the possibility or impossibility of comparability of pure multipartite states. We show that there are exponentially many such entangled multipartite states among $n$ agents. Further, we discuss a new graph theoretic metric on a class of multi-partite states, and its implications.
dc.descriptionTo appear in the Journal of Mathematical Physics, 33 pages, 16 figures
dc.identifierhttps://arxiv.org/abs/quant-ph/0406135
dc.identifierhttp://arxiv.org/abs/quant-ph/0406135
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/100257
dc.subjectQuantum Physics
dc.subjectDiscrete Mathematics
dc.subjectCombinatorics
dc.titleA combinatorial approach for studying LOCC transformations of multipartite states
dc.typetext

Files

Collections

arXiv