Quick Navigation
Topics
Quantum Optimization
Quantum Simulation
Entanglement Theory Quantum Correlations
Quantum State Preparation Representation
A Lovász theta lower bound on Quantum Max Cut
arXiv
Authors: Felix Huber
Year
2025
Paper ID
36323
Status
Preprint
Abstract Read
~2 min
Abstract Words
90
Citations
N/A
Abstract
We prove a lower bound to quantum Max Cut of a graph in terms of the Lovász theta function of its complement. For a graph with m edges, qmc(G) geq tfrac{m}{4}big\(1 + tfrac{8}{3π}tfrac{1}{vartheta(bar{G}\) -1} big), with the bound achieved by a product state. The proof extends a result by Balla, Janzer, and Sudakov on classical Max Cut and is also inspired by the randomized rounding method of Gharibian and Parekh. The bound outperforms the classical bound when applied to quantum Max Cut.
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.
- We prove a lower bound to quantum Max Cut of a graph in terms of the Lovász theta function of its complement.
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.