arXiv:2609.30399
Three-uniform edge-ordered hypergraph quantum states: entanglement and its relation to hypergraph properties
N. A. Susulovska, Kh. P. Gnatenko
Abstract
The encoding of 3-uniform edge-ordered weighted hypergraphs into multiqubit quantum states is proposed. We derive an analytical expression for the geometric measure of entanglement of hypergraph quantum states and establish its relation to hypergraph properties. The results establish a direct connection between the local structure of hypergraphs, hyperedge weights, and the entanglement of the corresponding quantum states. For equally weighted hypergraphs, it is shown that the entanglement depends explicitly on the vertex degree. The dependence of entanglement on hypergraph parameters is studied analytically and using quantum computing. Hypergraph states associated with chain, star, regular lattice, and binary-tree hypergraphs are examined, and their entanglement is quantified using quantum computing. These results open up the possibility of studying hypergraph properties with quantum programming.
AI Summary
The paper studies how local hypergraph connectivity and edge weights determine single-qubit-versus-rest entanglement in states generated by three-qubit Pauli rotations. It defines weighted, edge-ordered 3-uniform hypergraph states by applying $U_{ijk}(\theta_{ijk})=\exp(-i\theta_{ijk}Z_iZ_jY_k)$ to $|+\rangle^{\otimes n}$. Because some overlapping gates do not commute, the construction retains information about their application order. For specified chain, star, regular-lattice and binary-tree constructions, the paper reports $\langle X_l\rangle=\prod_{e\ni l}\cos(2\theta_e)$ and $\langle Y_l\rangle=\langle Z_l\rangle=0$. Using the pure-state relation between a qubit’s Bloch-vector length and its bipartite geometric entanglement, this gives $E_l=\tfrac12[1-\prod_{e\ni l}|\cos(2\theta_e)|]$. For equal weights, $E_l=\tfrac12[1-|\cos(2\theta)|^{d_l}]$, where $d_l$ is the vertex degree. Thus the reported entanglement depends only on incident edge weights, reaches its maximum $1/2$ when an incident weight is $\pi/4$, and vanishes when all incident weights are integer multiples of $\pi/2$. The paper provides gate decompositions and estimates entanglement through local Pauli measurements in noiseless IBM AerSimulator simulations. Examples include five- and seven-qubit chains and stars, a 21-qubit lattice, and a 31-qubit tree; the simulated values agree with the analytical expressions. The analysis concerns the specified connectivity and gate-ordering patterns and single-qubit bipartitions, rather than geometric entanglement relative to fully separable multipartite states. The computational demonstrations use an ideal simulator, not quantum hardware or a noise model.
Central claim may not hold: The derived entanglement formula concerns a single-qubit-versus-rest partition, rather than the optimization over fully separable multiqubit states initially introduced. The entanglement formula requires structural restrictions absent from the abstract: an allowed four-qubit, three-edge example has zero single-qubit entanglement where the degree-only formula predicts 1/2. The claimed one-to-one encoding fails because commuting-edge reorderings and allowed weight shifts by pi can produce the same physical state. The single-overlap chain simulation discussion and caption incorrectly identify q1 as degree 2, although its defining equation gives it degree 1.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 13 pages, 13 figures