Quantum
Three-uniform edge-ordered hypergraph quantum states: entanglement and its relation to hypergraph properties
Publication: quant-ph updates on arXiv.org
Author: N. A. Susulovska, Kh. P. Gnatenko
Source published: 28/09/2026, 04:00:00 UTC
Briefing created: 28/09/2026, 04:22:34 UTC
Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 28/09/2026, 04:13:25 UTC.
Briefings
A new study proposes encoding 3-uniform edge-ordered weighted hypergraphs into multiqubit quantum states, deriving an analytical expression for the geometric measure of entanglement. The research establishes a direct link between local hypergraph structure, edge weights, and quantum entanglement, with entanglement explicitly dependent on vertex degrees for equally weighted hypergraphs. The study examines entanglement in chain, star, regular lattice, and binary-tree hypergraphs using quantum computing, aiming to enable quantum programming for hypergraph properties.
Key points
- The study derives an analytical expression for the geometric measure of entanglement in 3-uniform edge-ordered weighted hypergraph quantum states.
- For equally weighted hypergraphs, entanglement depends explicitly on the vertex degree, linking local structure to quantum entanglement levels.
Context and limitations
Results are based on theoretical analysis and quantum computing simulations; entanglement values for specific hypergraph types are quantified but not universally measured across all parameter sets.
Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 28/09/2026, 04:22:34 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.
View archived briefing on IPFS
bafybeieof4ztw5xoawwn2o6tj34bqziuh3o37rgo5e2yo7oovy4yaex6oe