Exploring pure quantum states with maximally mixed reductions
Ludovic Arnaud, Nicolas J. Cerf

TL;DR
This paper characterizes multipartite entanglement in pure quantum states with maximally mixed reductions, linking it to quantum error correction, and explores the limitations of symmetric states in achieving high entanglement.
Contribution
It introduces bounds on the size of maximally mixed reductions in pure states, connects these states to quantum error-correcting codes, and analyzes symmetry constraints on entanglement.
Findings
Existence of multipartite entangled states with at least 18.9% of the system size in maximally mixed reductions.
Symmetric states cannot have all maximally mixed reductions for k>1, limiting their entanglement.
Numerical analysis reveals specific patterns in Bloch vectors that may allow high entanglement despite symmetry constraints.
Abstract
We investigate multipartite entanglement for composite quantum systems in a pure state. Using the generalized Bloch representation for n-qubit states, we express the condition that all k-qubit reductions of the whole system are maximally mixed, reflecting maximum bipartite entanglement across all k vs. n-k bipartitions. As a special case, we examine the class of balanced pure states, which are constructed from a subset of the Pauli group P_n that is isomorphic to Z_2^n. This makes a connection with the theory of quantum error-correcting codes and provides bounds on the largest allowed k for fixed n. In particular, the ratio k/n can be lower and upper bounded in the asymptotic regime, implying that there must exist multipartite entangled states with at least k=0.189 n when . We also analyze symmetric states as another natural class of states with high multipartite…
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.
