Pith. sign in

REVIEW 2 cited by

Conjectured Bounds for 2-Local Hamiltonians via Token Graphs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2506.03441 v2 pith:QAEV6KJD submitted 2025-06-03 quant-ph cs.DS

Conjectured Bounds for 2-Local Hamiltonians via Token Graphs

classification quant-ph cs.DS
keywords boundsgraphshamiltoniansconjecturesenergyradiispectraltoken
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We explain how the maximum energy of the Quantum MaxCut, XY, and EPR Hamiltonians on a graph $G$ are related to the spectral radii of the token graphs of $G$. From numerical study, we conjecture new bounds for these spectral radii based on properties of $G$. We show how these conjectures tighten the analysis of existing algorithms, implying state-of-the-art approximation ratios for all three Hamiltonians. Our conjectures also provide simple combinatorial bounds on the ground state energy of the antiferromagnetic Heisenberg model, which we prove for bipartite graphs.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. A 0.651-approximation to quantum Max Cut via Rydberg atoms

    quant-ph 2026-06 unverdicted novelty 7.0

    Hybrid Rydberg atom plus SDP algorithm achieves 0.651-approximation for quantum Max Cut, improving on the prior 0.614 SDP-only bound and remaining effective at 89% ground-state fidelity.

  2. Kikuchi Graphs of Random Hypergraphs are Approximately Johnson

    cs.DS 2026-06 unverdicted novelty 7.0

    Level-ℓ Kikuchi graphs of random 2r-uniform hypergraphs spectrally approximate those of the complete hypergraph at near-optimal sampling rates for r ≤ ℓ ≤ n/2.