Non-symmetric GHZ states: weighted hypergraph and controlled-unitary graph representations
Hrachya Zakaryan, Konstantinos-Rafail Revis, and Zahra Raissi

TL;DR
This paper introduces a graph-theoretic framework for non-symmetric GHZ states, enabling their characterization, stabilization, and extension to qudit systems, which were previously lacking formal representations.
Contribution
It establishes LU equivalence of non-symmetric GHZ states to weighted hypergraphs and CU graphs, and demonstrates efficient stabilization methods.
Findings
Non-symmetric GHZ states are LU equivalent to weighted hypergraphs and CU graphs.
Efficient stabilization of these states is possible with local operations and a single ancilla.
Framework extends to qudit systems, enabling systematic analysis of multipartite entanglement.
Abstract
Non-symmetric GHZ states (-GHZ), defined by unequal superpositions of and , naturally emerge in experiments due to decoherence, control errors, and state preparation imperfections. Despite their relevance in quantum communication, relativistic quantum information, and quantum teleportation, these states lack a stabilizer formalism and a graph representation, hindering their theoretical and experimental analysis. We establish a graph-theoretic framework for non-symmetric GHZ states, proving their local unitary (LU) equivalence to two structures: fully connected weighted hypergraphs with controlled-phase interactions and star-shaped controlled-unitary (CU) graphs. While weighted hypergraphs generally lack stabilizer descriptions, we demonstrate that non-symmetric GHZ states can be efficiently stabilized using local operations and a single ancilla,…
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
TopicsMatrix Theory and Algorithms · Graph theory and applications
