Proves max eigenvalue of level-k Kikuchi graph Laplacian is at most m+k for any graph with m edges, confirming conjectures and giving 0.614 approx ratio for Quantum Max Cut.
Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Sharp Bounds on the Eigenvalues of Kikuchi Graphs and Applications to Quantum Max Cut
Proves max eigenvalue of level-k Kikuchi graph Laplacian is at most m+k for any graph with m edges, confirming conjectures and giving 0.614 approx ratio for Quantum Max Cut.