When is there a multipartite maximum entangled state?
Runyao Duan, Yaoyun Shi

TL;DR
This paper investigates the existence of a maximum entangled state in multipartite quantum systems, establishing a necessary and sufficient condition based on the system dimensions, and employs algebraic complexity theory in the proof.
Contribution
It proves that a maximum entangled state exists if and only if the largest subsystem dimension is at least the product of the other dimensions, linking quantum information to algebraic complexity.
Findings
Maximum entangled state exists when $d_1 \\ge \\prod_{i=2}^n d_i$
The condition is both necessary and sufficient
Uses algebraic complexity theory in the proof
Abstract
For a multipartite quantum system of the dimension , , is there an entangled state {\em maximum} in the sense that all other states in the system can be obtained from the state through local quantum operations and classical communications (LOCC)? When , such state exists. We show that this condition is also necessary. Our proof, somewhat surprisingly, uses results from algebraic complexity theory.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Quantum Computing Algorithms and Architecture · Computability, Logic, AI Algorithms
