Quick Navigation
Topics
Quantum Optimization
Quantum Simulation
Quantum Max Cut for complete tripartite graphs
arXiv
Authors: Tea Štrekelj
Year
2025
Paper ID
16261
Status
Preprint
Abstract Read
~2 min
Abstract Words
97
Citations
N/A
Abstract
The Quantum Max-d-Cut (d-QMC) problem is a special instance of a 2-local Hamiltonian problem, representing the quantum analog of the classical Max-d-Cut problem. The d-QMC problem seeks the largest eigenvalue of a Hamiltonian defined on a graph with n vertices, where edges correspond to swap operators acting on \(mathbb{C}d\)otimes n. In recent years, progress has been made by investigating the algebraic structure of the d-QMC Hamiltonian. Building on this approach, this article solves the d-QMC problem for complete tripartite graphs for small local dimensions, d le 3.
Why This Paper Matters
- This paper contributes to the Quantum Simulation research area in the Quantum Articles archive.
- It adds a 2025 reference point for readers tracking recent quantum research.
- The Quantum Max-d-Cut (d-QMC) problem is a special instance of a 2-local Hamiltonian problem, representing the quantum analog of the classical Max-d-Cut problem.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.