Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This research proposes a novel method for encoding 3-uniform edge-ordered weighted hypergraphs into multiqubit quantum states, establishing an analytical link between hypergraph structural properties and the geometric measure of entanglement. By quantifying how vertex degrees and hyperedge weights influence entanglement across various graph topologies, the study provides a theoretical framework for leveraging specific graph structures in quantum programming tasks. These findings advance the intersection of discrete mathematics and quantum information theory, offering new tools for analyzing complex quantum correlations through combinatorial designs.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Three-uniform edge-ordered hypergraph quantum states: entanglement and its relation to hypergraph properties

arXiv2 min read

arXiv:2609.30399v1 Announce Type: new 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.

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.

arXiv:2609.30399 [quant-ph]

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

https://doi.org/10.48550/arXiv.2609.30399 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 · 212 words

Related coverage