Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Quantum Information Science

Incomparability Through Superposition of Many States under LOCC

Amit Bhar, Santi Prasad Sinha

Published Jan 1, 2011• 0 citations
Publisher

Abstract

In this paper we investigate the global property of the states constructed through superposition of many states by using the concept of incomparability under LOCC as the inherent property of the states.In our work we are able to form a bridge between comparable and incomparable classes of states through linear superposition of a states and the concept of strong incomparability criterian under LOCC. PACS number(s): 03.67.Hk, 03.65.Ud, 03.65.Ta, 03.67.-a, 89.70+c.

DOI
10.4236/jqis.2011.11001

Related papers

Peculiarities of Bounds on States through the Concept of Linear Superposition

Amit Bhar

We investigate the effect of superposition of states on local conversion of pure bipartite states under deterministic LOCC. We also investigate the entanglement behaviour of such classes of states, specifically their monotone nature. Finally we are able to construct some counterintuitive situations, on the bounds of different measures of entanglement, emphasis on the idea of comparability and incomparability under deterministic LOCC.

Journal of Applied Mathematics•Jan 1, 2012•2 citations

No-Cloning and No-Deleting Theorems through the Existence of Incomparable States Under LOCC

Amit Bhar, Indrani Chattopadhyay, Debasis Sarkar

arXiv:quant-ph/0606206•Quantum Information Processing•Nov 28, 2006•9 citations

Coherent Superposition of Local States

A. L. Licht

The notion of coherent superposition is generalized so as to apply to local states.

Journal of Mathematical Physics•Sep 1, 1968•0 citations

Deterministic Local Conversion of Incomparable States by Collective LOCC

Indrani Chattopadhyay, D. Sarkar

Incomparability of pure bipartite entangled states under deterministic LOCC is a very strange phenomena. We find two possible ways of getting our desired pure entangled state which is incomparable with the given input state, by collective LOCC with certainty. The first one is by providing some pure entanglement through the lower dimensional maximally-entangled states or using further less amount of entanglement and the next one is by collective operation on two pairs which are individually incomparable. It is quite surprising that we are able to achieve maximally entangled states of any Schmidt rank from a finite number of 2x2 pure entangled states only by deterministic LOCC. We provide general theory for the case of 3x3 system of incomparable states by the above processes where incomparability seems to be the most hardest one.

arXiv:quant-ph/0409174•Quantum Information and Computation•May 1, 2005•7 citations

Statistics of entanglement transformation with hierarchies among catalysts

Rivu Gupta, Arghya Maity, Shiladitya Mal +1 more

The distribution of typical bipartite pure states is studied within the framework of state transformation via local operations and classical communication (LOCC). We report the statistics of comparable and incomparable states in different dimensions for single- and multicopy regimes, and we establish a connection between state transformation and the difference between the entanglement contents of the initial and the target states. From the analysis of catalyst resources, required to further otherwise impossible LOCC transformations between pairs, we demonstrate a universal pattern in the average and minimum entanglement of the randomly generated catalysts. Furthermore, we introduce a concept of hierarchy between different kinds of catalysts, and we show how they can not only aid in the conversion of incomparable states, but they can also act as a less costly resource toward this goal. We confirm the existence of catalysts, referred to as strong catalysts, which can activate LOCC transformation between pairs at the single-copy level, when it is initially impossible even with multiple copies.

arXiv:2202.01540•Physical Review A•Nov 1, 2022•6 citations

Hypergraph-theoretic charaterizations for LOCC incomparable ensembles of multipartite CAT states

Arijit Ghosh, Sudebkumar Prasant Pal, Anupam Prakash +1 more

Using graphs and hypergraphs to systematically model collections of arbitrary subsets of parties representing {\it ensembles (or collections)} of shared multipartite CAT states, we study transformations between such {\it ensembles} under {\it local operations and classical communication (LOCC)}. We show using partial entropic criteria, that any two such distinct ensembles represented by {\it $r$-uniform hypergraphs} with the same number of hyperedges (CAT states), are LOCC incomparable for even integers $r\geq 2$, generalizing results in \cite{mscthesis,sin:pal:kum:sri}. We show that the cardinality of the largest set of mutually LOCC incomparable ensembles represented by $r$-uniform hypergraphs for even $r\geq 2$, is exponential in the number of parties. We also demonstrate LOCC incomparability between two ensembles represented by 3-uniform hypergraphs where partial entropic criteria do not help in establishing incomparability. Further we characterize LOCC comparability of EPR graphs in a model where LOCC is restricted to teleportation and edge destruction. We show that this model is equivalent to one in which LOCC transformations are carried out through a sequence of operations where each operation adds at most one new EPR pair.

arXiv:0709.0063•Sep 1, 2007•1 citation
In this paper we investigate the global property of the states constructed through superposition of many states by using the concept of incomparability under LOCC as the inherent property of the states.In our work we are able to form a bridge between comparable and incomparable classes of states through linear superposition of a states and the concept of strong incomparability criterian under LOCC. PACS number(s): 03.67.Hk, 03.65.Ud, 03.65.Ta, 03.67.-a, 89.70+c.
Incomparability of pure bipartite entangled states under deterministic LOCC is a very strange phenomena. We find two possible ways of getting our desired pure entangled state which is incomparable with the given input state, by collective LOCC with certainty. The first one is by providing some pure entanglement through the lower dimensional maximally-entangled states or using further less amount of entanglement and the next one is by collective operation on two pairs which are individually incomparable. It is quite surprising that we are able to achieve maximally entangled states of any Schmidt rank from a finite number of 2x2 pure entangled states only by deterministic LOCC. We provide general theory for the case of 3x3 system of incomparable states by the above processes where incomparability seems to be the most hardest one.
The distribution of typical bipartite pure states is studied within the framework of state transformation via local operations and classical communication (LOCC). We report the statistics of comparable and incomparable states in different dimensions for single- and multicopy regimes, and we establish a connection between state transformation and the difference between the entanglement contents of the initial and the target states. From the analysis of catalyst resources, required to further otherwise impossible LOCC transformations between pairs, we demonstrate a universal pattern in the average and minimum entanglement of the randomly generated catalysts. Furthermore, we introduce a concept of hierarchy between different kinds of catalysts, and we show how they can not only aid in the conversion of incomparable states, but they can also act as a less costly resource toward this goal. We confirm the existence of catalysts, referred to as strong catalysts, which can activate LOCC transformation between pairs at the single-copy level, when it is initially impossible even with multiple copies.
Using graphs and hypergraphs to systematically model collections of arbitrary subsets of parties representing {\it ensembles (or collections)} of shared multipartite CAT states, we study transformations between such {\it ensembles} under {\it local operations and classical communication (LOCC)}. We show using partial entropic criteria, that any two such distinct ensembles represented by {\it rrr-uniform hypergraphs} with the same number of hyperedges (CAT states), are LOCC incomparable for even integers r≥2r\geq 2r≥2, generalizing results in \cite{mscthesis,sin:pal:kum:sri}. We show that the cardinality of the largest set of mutually LOCC incomparable ensembles represented by rrr-uniform hypergraphs for even r≥2r\geq 2r≥2, is exponential in the number of parties. We also demonstrate LOCC incomparability between two ensembles represented by 3-uniform hypergraphs where partial entropic criteria do not help in establishing incomparability. Further we characterize LOCC comparability of EPR graphs in a model where LOCC is restricted to teleportation and edge destruction. We show that this model is equivalent to one in which LOCC transformations are carried out through a sequence of operations where each operation adds at most one new EPR pair.