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:1605.03564 · Linear Algebra and its Applications

Combinatorial entanglement

Joshua Lockhart, Simone Severini B

Published Feb 24, 2021• 8 citations
arXivHTMLPDF
DOI
10.1016/j.laa.2021.02.014

Related papers

Bipartite Entanglement

John Watrous

Cambridge University Press eBooks•May 17, 2018•1 citation

Quantify Entanglement for Multipartite Quantum States

Zong‐Wen Yu, Su Hu, Chunlei Zhang

In this paper, we consider the problem of how to quantify entanglement for any multipartite quantum states. For bipartite pure states partial entropy is a good entanglement measure. By using partial entropy, we firstly introduce the Combinatorial Entropy of Fully entangled states (CEF) which can be used to quantify entanglement for any fully entangled pure states. In order to quantify entanglement for any multipartite states we also need another concept the Entanglement Combination (EC) which can be used to completely describe the entanglement between any parties of the given quantum states. Combining CEF with EC, we define the Combinatorial Entropy (CE) for any multipartite pure states and present some nice properties which indicate CE is a good entanglement measure. Finally, we point out the feasibility of extending these three concepts to mixed quantum states.

arXiv:0705.1308•May 9, 2007•0 citations

Multipartite entanglement

Ingemar Bengtsson, Karol Życzkowski

Cambridge University Press eBooks•Aug 14, 2017•17 citations

Combinatorial entanglement: detecting entanglement in quantum states using grid-labelled graphs

Joshua Lockhart, Otfried Gühne, Simone Severini B

Electronic Notes in Discrete Mathematics•Aug 1, 2017•1 citation

Quantum entanglements

Jeff Hecht

Nature Physics•Apr 1, 2007•7 citations

Multipartite entanglement configurations: Combinatorial offshoots into (hyper)graph theory and their ramifications

Sudebkumar Prasant Pal, Somesh Kumar, R. Srikanth

Computations in a distributed environment comprising a network of spatially separated nodes may require the exchange of classical and quantum information. The amount of classical communication may be reduced in such computations by using multipartite entanglement. Following the combinatorial approach developed in [25, 27], we study entanglement configurations over a set of nodes, where each entanglement configuration is a collection of multipartite entanglement (CAT or GHZ) states shared within different combinations of subsets of nodes. The main problem is to determine whether LOCC transformations can generate an entanglement configuration B from another entanglement configuration A, written as B < LOCC A. We characterize the resulting partial order introduced on unitarily equivalent classes of entanglement configurations due to LOCC transformations. This study includes the communication complexity of generating higher cardinality multipartite CAT states from smaller sized CAT state configurations. We also study classes of incomparable entanglement configurations where no pair (A, B) of configurations satisfies A < LOCC B. This leads us to investigate certain combinatorial properties of hypergraphs and hypertrees following initial results in [25, 27]. We study the unique reconstruction of vertex labelled r‐uniform hypertrees on n vertices, where r ⩽ n is a constant, and each hyperedge has the same number r, of vertices. We conclude by discussing several problems and open questions in the context of entanglement configurations.

AIP conference proceedings•Jan 1, 2006•4 citations
In this paper, we consider the problem of how to quantify entanglement for any multipartite quantum states. For bipartite pure states partial entropy is a good entanglement measure. By using partial entropy, we firstly introduce the Combinatorial Entropy of Fully entangled states (CEF) which can be used to quantify entanglement for any fully entangled pure states. In order to quantify entanglement for any multipartite states we also need another concept the Entanglement Combination (EC) which can be used to completely describe the entanglement between any parties of the given quantum states. Combining CEF with EC, we define the Combinatorial Entropy (CE) for any multipartite pure states and present some nice properties which indicate CE is a good entanglement measure. Finally, we point out the feasibility of extending these three concepts to mixed quantum states.
Computations in a distributed environment comprising a network of spatially separated nodes may require the exchange of classical and quantum information. The amount of classical communication may be reduced in such computations by using multipartite entanglement. Following the combinatorial approach developed in [25, 27], we study entanglement configurations over a set of nodes, where each entanglement configuration is a collection of multipartite entanglement (CAT or GHZ) states shared within different combinations of subsets of nodes. The main problem is to determine whether LOCC transformations can generate an entanglement configuration B from another entanglement configuration A, written as B < LOCC A. We characterize the resulting partial order introduced on unitarily equivalent classes of entanglement configurations due to LOCC transformations. This study includes the communication complexity of generating higher cardinality multipartite CAT states from smaller sized CAT state configurations. We also study classes of incomparable entanglement configurations where no pair (A, B) of configurations satisfies A < LOCC B. This leads us to investigate certain combinatorial properties of hypergraphs and hypertrees following initial results in [25, 27]. We study the unique reconstruction of vertex labelled r‐uniform hypertrees on n vertices, where r ⩽ n is a constant, and each hyperedge has the same number r, of vertices. We conclude by discussing several problems and open questions in the context of entanglement configurations.