Metraipolis › archive › dc_47a923780813
Solving the MAX-$k$-CUT problem for hypergraphs with quantum computing — arXiv:2610.41678
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.41678
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-02T08:08:21.391Z
- SHA-256 of the archived text
290c2be380b283fe4e082c28439070a7db614db6556bf9a74287cdd8779449a7- Stable URL of this page
https://metraipolis.com/documento/dc_47a923780813
How to cite
Solving the MAX-$k$-CUT problem for hypergraphs with quantum computing — arXiv:2610.41678 — arXiv (en), https://arxiv.org/abs/2610.41678 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_47a923780813 (Metraipolis archive dc_47a923780813, sha256 290c2be380b283fe4e082c28439070a7db614db6556bf9a74287cdd8779449a7)
BibTeX
@misc{dc47a923780813,
title = {Solving the MAX-$k$-CUT problem for hypergraphs with quantum computing — arXiv:2610.41678},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.41678},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_47a923780813; sha256 290c2be380b283fe4e082c28439070a7db614db6556bf9a74287cdd8779449a7},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41678. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We investigate the MAX-$k$-CUT problem on hypergraphs by considering their representation as spin systems with Ising interactions. The corresponding cost Hamiltonian for MAX-$k$-CUT problem on hypergraphs is reduced to an Ising Hamiltonian with pairwise interactions. This reduction simplifies the solution of the MAX-$k$-CUT problem using quantum computing. As illustrative examples, a 3-uniform tight-star hypergraph and a sunflower hypergraph are considered. The corresponding Hamiltonians are constructed, and quantum protocols for the MAX-$k$-CUT problems are presented. The MAX-3-CUT and MAX-4-CUT instances are investigated for these hypergraphs by varying the number of Quantum Approximate Optimization Algorithm (QAOA) layers from (p=2) to (p=15) with quantum computing on IBM's Qiskit AerSimulator. Tema degli esploratori: fisica e astronomia (elenco arXiv quant-ph, nuovi lavori del giorno). Categorie arXiv: Quantum Physics (quant-ph). Pagina del lavoro: https://arxiv.org/abs/2610.41678 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-02T07:47:00.759Z dalla pagina https://arxiv.org/list/quant-ph/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).