Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This research introduces a novel linear map for four-party quantum systems that enforces uniformity in entanglement entropy without requiring maximal states, offering new insights into the algebraic structure of multipartite correlations. The study characterizes the asymptotic behavior and fixed points of this transformation using group-theoretic methods and numerical simulations on Haar-random unitary inputs. Such advancements deepen our theoretical understanding of quantum information resources essential for future scalable quantum computing architectures.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Equi-Entropic Maps for Four-Partite Quantum States

arXiv2 min read

arXiv:2607.25954v1 Announce Type: new Abstract: Absolutely maximally entangled states represent a highly constrained form of multipartite entanglement and play an important role in quantum information theory. We investigate a weaker form of uniformity of entanglement for four-party systems of local dimension $d>2$ that requires the three balanced bipartitions to have equal but not necessarily maximal linear entropy. We introduce a linear map $\Xi$ that enforces exact equality of entropies under reshuffling and partial transposition. The transformation arises as the asymptotic limit of an iterative averaging procedure and admits a group-theoretic description in terms of permutations of tensor indices. For Haar-random unitary inputs, a leading-moment analysis supported by numerical simulations predicts highly entangled outputs whose common entropy approaches the maximal value as the local dimension grows. We characterize the algebraic structure, fixed points, and asymptotic behavior of this map and its relation to two-unitary matrices and orthogonal Latin squares.

Abstract:Absolutely maximally entangled states represent a highly constrained form of multipartite entanglement and play an important role in quantum information theory. We investigate a weaker form of uniformity of entanglement for four-party systems of local dimension $d>2$ that requires the three balanced bipartitions to have equal but not necessarily maximal linear entropy. We introduce a linear map $\Xi$ that enforces exact equality of entropies under reshuffling and partial transposition. The transformation arises as the asymptotic limit of an iterative averaging procedure and admits a group-theoretic description in terms of permutations of tensor indices. For Haar-random unitary inputs, a leading-moment analysis supported by numerical simulations predicts highly entangled outputs whose common entropy approaches the maximal value as the local dimension grows. We characterize the algebraic structure, fixed points, and asymptotic behavior of this map and its relation to two-unitary matrices and orthogonal Latin squares.

arXiv:2607.25954 [quant-ph]

(or arXiv:2607.25954v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2607.25954 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 234 words

Related coverage