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

arXiv:1003.0103

Twopartite, combinatorial approach to partial k-separability problem for general multipartite states

Roman Gielerak Marek Sawerwain

Published Mar 1, 2010• 1 citation
arXivHTMLPDF

Abstract

We describe a general methods to localize any sort of k-separability and therefore also the corresponding partial entanglement in genuinely multipartite mixed quantum states. Our methods are based exclusively on the known twopartite methods and some systematic procedures of combinatorial nature. Our methods are formalized in an algorithmic-like fashion and therefore they are easily implementable in a computer environments and might be effectively used for studying numerically these questions for sufficiently small systems

DOI
10.48550/arxiv.1003.0103

Related papers

Detecting and localizing multipartite entanglement by two-partite methods

Roman Gielerak, Marek Sawerwain

A notion of partial entanglement in multipartite systems is discussed. Some algorithms for detecting and localizing the introduced partial entanglement in general multipartite quantum states are presented. The main feature of the methods presented is that they are exclusively based on two-partite methods.

Metody Informatyki Stosowanej•Jan 1, 2010•0 citations

Criterion for k-separability in mixed multipartite states

Andreas Gabriel, Beatrix C. Hiesmayr, Marcus Huber

Using a recently introduced framework, we derive criteria for quantum k-separability, which are easily computed. In the case k=2, our criteria are equally strong to the best methods known so far, while in all other cases there are currently no comparable criteria known. We also show how the criteria can be implemented experimentally.

Quantum Information and Computation•Sep 1, 2010•44 citations

Bipartite separability and nonlocal quantum operations on graphs

Supriyo Dutta, Bibhas Adhikari, Subhashish Banerjee +1 more

In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for separability, although there are entangled states with positive partial transpose for which the degree criterion fails. Here we introduce the concept of partially symmetric graphs and degree symmetric graphs by using the well-known concept of partial transposition of a graph and degree criteria, respectively. Thus, we provide classes of bipartite separable states of dimension $m\ifmmode\times\else\texttimes\fi{}n$ arising from partially symmetric graphs. We identify partially asymmetric graphs that lack the property of partial symmetry. We develop a combinatorial procedure to create a partially asymmetric graph from a given partially symmetric graph. We show that this combinatorial operation can act as an entanglement generator for mixed states arising from partially symmetric graphs.

arXiv:1601.07704•Physical Review A•Jul 5, 2016•18 citations

Criterion for k-separability in mixed multipartite systems

Gabriel, Andreas, Beatrix C. Hiesmayr, Marcus Huber

Using a recently introduced framework, we derive criteria for quantum k-separability, which are very easily computed. In the case k = 2, our criteria are equally strong to the best methods known so far, while in all other cases there are currently no comparable criteria known. We also show how the criteria can be implemented experimentally.

arXiv:1002.2953•Feb 15, 2010•38 citations

Partial multipartite entanglement in the matrix product state formalism

Andreas Gabriel, V. Murg, Beatrix C. Hiesmayr

We present a method to apply the well-known matrix product state formalism to partially separable states in solid-state systems. The computational effort of our method is equal to the effort of the standard density matrix renormalization group (DMRG) algorithm. Consequently, it is applicable to all the usually considered condensed-matter systems where the DMRG algorithm is successful. We also show in exemplary cases that polymerization properties of ground states are closely connected to properties of partial separability, even if the ground state itself is not partially separable.

arXiv:1309.1058•Physical Review A•Nov 27, 2013•4 citations

k-separability criterion of mixed multipartite quantum states

Ting Gao, Yan Hong

The $k$-separability of mixed $n$-partite ($n\geq 3$) quantum states is mainly discussed in this paper. We obtain practical $k$-separability criteria to identify $k$-nonseparable mixed multipartite states in arbitrary dimensional quantum systems and detect genuine $n$-partite entanglement ($k=2$) and entanglement ($k=3$) which have previously not been identified. No optimization or eigenvalue evaluation is needed, our criteria can be evaluated by simple computations involving components of the density matrix and can be implemented in today's experiments.

•Apr 13, 2012•2 citations
We describe a general methods to localize any sort of k-separability and therefore also the corresponding partial entanglement in genuinely multipartite mixed quantum states. Our methods are based exclusively on the known twopartite methods and some systematic procedures of combinatorial nature. Our methods are formalized in an algorithmic-like fashion and therefore they are easily implementable in a computer environments and might be effectively used for studying numerically these questions for sufficiently small systems
In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for separability, although there are entangled states with positive partial transpose for which the degree criterion fails. Here we introduce the concept of partially symmetric graphs and degree symmetric graphs by using the well-known concept of partial transposition of a graph and degree criteria, respectively. Thus, we provide classes of bipartite separable states of dimension $m\ifmmode\times\else\texttimes\fi{}n$ arising from partially symmetric graphs. We identify partially asymmetric graphs that lack the property of partial symmetry. We develop a combinatorial procedure to create a partially asymmetric graph from a given partially symmetric graph. We show that this combinatorial operation can act as an entanglement generator for mixed states arising from partially symmetric graphs.
We present a method to apply the well-known matrix product state formalism to partially separable states in solid-state systems. The computational effort of our method is equal to the effort of the standard density matrix renormalization group (DMRG) algorithm. Consequently, it is applicable to all the usually considered condensed-matter systems where the DMRG algorithm is successful. We also show in exemplary cases that polymerization properties of ground states are closely connected to properties of partial separability, even if the ground state itself is not partially separable.
The kkk-separability of mixed nnn-partite (n≥3n\geq 3n≥3) quantum states is mainly discussed in this paper. We obtain practical kkk-separability criteria to identify kkk-nonseparable mixed multipartite states in arbitrary dimensional quantum systems and detect genuine nnn-partite entanglement (k=2k=2k=2) and entanglement (k=3k=3k=3) which have previously not been identified. No optimization or eigenvalue evaluation is needed, our criteria can be evaluated by simple computations involving components of the density matrix and can be implemented in today's experiments.