Pith. sign in

REVIEW 2 major objections 3 minor 31 references

For every Suzuki–Fisher Heisenberg Hamiltonian the spectral gap is at least 2μ, which turns into a polynomial-time quantum algorithm for ground energies.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review

2026-08-02 02:11 UTC pith:6AAQUUXT

load-bearing objection A tight spectral gap theorem for Lee-Yang Hamiltonians with a polished proof of the relative gap bound, but the extension of Fact 3 to the generalized Suzuki-Fisher class is only sketched and that sketch has a real hole on cyclic graphs. the 2 major comments →

arxiv 2607.14401 v1 pith:6AAQUUXT submitted 2026-07-15 quant-ph math-phmath.MP

Efficient quantum algorithm for Heisenberg spin systems

Sergey Bravyi , David Gosset , Yinchen Liu , Benjamin Wong This is my paper
classification quant-ph math-phmath.MP MSC 81P6882B20
keywords Suzuki-Fisher Hamiltonianspectral gapLee-Yang tensorquantum adiabatic algorithmground energy estimationbipartite Quantum MaxCutHeisenberg antiferromagnetzero-free polynomials
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper proves that every Hamiltonian in the Suzuki–Fisher family — ferromagnetic, Z-dominant Heisenberg-type interactions with nonnegative Z-fields — has a spectral gap of at least 2μ, where μ is the smallest Z-field. Because the gap is stable along a specially chosen adiabatic path, this yields a polynomial-time quantum algorithm that estimates the ground energy to additive error ε for any model in the family. The same argument covers the Heisenberg antiferromagnet on any bipartite graph, giving an efficient quantum algorithm for bipartite Quantum MaxCut. The proof is carried by Lee-Yang tensors: the Gibbs states of these models have generating polynomials with no zeros in the unit polydisk, and a new inequality converts this zero-free radius into a bound on eigenvalue ratios.

Core claim

The paper's central discovery is a universal gap statement: for every Suzuki-Fisher Hamiltonian H with μ = min_i μz_i ≥ 0, the first excited energy E2 is at least E1 + 2μ. If all μz_i > 0, the ground state is non-degenerate and separated by at least 2μ from all excited states. The bound is tight: the pure field Hamiltonian H = −μ Σ_i Z_i reaches equality. The proof reduces this to a relative-gap theorem for positive semidefinite Lee-Yang operators: if K has Lee-Yang radius r > 1, then λ2/λ1 ≤ r^{−2}. Applying this to the shifted Gibbs operator e^{βM/2} e^{−βH0} e^{βM/2}, which lies in LY(e^{βμ}), and taking β → 0 gives the advertised gap.

What carries the argument

The central object is a Lee-Yang tensor: a multi-qubit tensor whose multilinear generating polynomial has no zeros in the open polydisk of radius r. The key mechanism is the relative spectral gap theorem: a positive semidefinite operator K in LY(r) has a nondegenerate largest eigenvalue and satisfies λ2/λ1 ≤ r^{−2}. This is proved by forming the ratio function g = f_φ/f_ψ from two eigenvectors, using a squeezing lemma that forces α g(v) to reappear on a smaller polydisk, and combining the resulting diameter inequality with a Schwarz-lemma bound. A separate Gibbs-state fact — that e^{−βH0} ∈ LY(1) for Suzuki-Fisher Hamiltonians — connects this analytic machinery to spin systems.

Load-bearing premise

Everything rests on the Lee-Yang inclusion: for every shifted Suzuki–Fisher Hamiltonian H + μΣZ_i, the Gibbs operator e^{−β(H+μΣZ_i)} must have a generating polynomial with no zeros in the unit polydisk for every β ≥ 0; if that zero-freeness fails for any allowed coupling, the 2μ gap bound and the polynomial-time algorithm no longer follow.

What would settle it

Take a small Suzuki–Fisher Hamiltonian on n = 4 or 5 qubits with all Z-fields equal to 1, choose random edge coefficients satisfying Eq. (3) including nonzero Jxy and Jyx, and diagonalize it; finding E2 − E1 < 2 would refute Theorem 1. Alternatively, for moderate β, search the flattened tensor of e^{−βH0} for a zero inside the unit polydisk; such a zero would falsify the crucial Lee-Yang inclusion.

Watch this falsifier. Get emailed when new claim-graph text bears on it.

Share X Bluesky LinkedIn Reddit HN

If this is right

  • Ground energies of all Suzuki–Fisher Hamiltonians on arbitrary graphs can be estimated by a quantum algorithm in poly(n, J, 1/ε) time.
  • The same algorithm applies to the antiferromagnetic Heisenberg model (Quantum MaxCut) on any bipartite graph.
  • Strictly positive Z-fields guarantee a unique ground state with gap at least 2μ, making the ground state robust to perturbations below that scale.
  • The gap bound is saturated by H = −μΣZ_i, so no larger universal constant can replace 2μ for this family.
  • Any Hamiltonian whose shifted version H + μΣZ_i has Lee-Yang Gibbs states inherits the same 2μ bound.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The proof only uses the Lee-Yang inclusion for H + μΣZ_i, so the same 2μ bound would transfer to any other family with that property; checking the inclusion for new coupling classes is a direct route to broader gap theorems.
  • The relative-gap/zero-free-radius inequality is a standalone operator-theoretic statement; it could be tested on other positive semidefinite operators, such as transfer matrices or partition functions at complex parameters, to derive spectral information from complex zero locations.
  • Since the generalized Lee-Yang inclusion for off-diagonal couplings Jxy, Jyx is justified by a rotation argument, a numerical check of small random instances and their shifted Gibbs polynomials would either expose a counterexample or add confidence that the full class is covered.
  • A practical probe: run the adiabatic path on small bipartite Quantum MaxCut instances where exact gaps are known, and compare the actual minimum gap along the path with the conservative 2δ guarantee; a larger measured gap would suggest the runtime bound is not tight.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

2 major / 3 minor

Summary. The paper defines a class of Suzuki-Fisher (SF) Hamiltonians with anisotropic two-qubit couplings and non-negative Z-fields (Eqs. (1)-(3)). Its main result, Theorem 1, states that the spectral gap of any such Hamiltonian is at least 2μ, where μ is the smallest Z-field; this is tight and implies non-degeneracy when all Z-fields are positive. The proof is based on a new relative spectral gap theorem for positive semidefinite Lee-Yang operators (Theorem 2), proved via a squeezing argument and the Schwarz lemma. Theorem 1 is then used to give a polynomial-time quantum adiabatic algorithm for the ground energy of any SF Hamiltonian (Corollary 1) and, in particular, for bipartite Quantum MaxCut (Corollary 2).

Significance. If the proof is completed, this is a significant result: it gives a tight, parameter-free lower bound on the spectral gap for a broad family of Heisenberg-type models, a polynomial-time quantum algorithm for their ground energy, and a quantitative connection between Lee-Yang zero-free regions and spectral gaps that is likely to be useful elsewhere. Theorem 2 is a clean and self-contained statement, and the 2μ bound is saturated. The algorithmic corollary for bipartite Quantum MaxCut addresses a problem that has been posed as a challenge, and the paper also notes an independent related bound by Rayudu and Takahashi. The proof of Theorem 2 is elegant and appears correct.

major comments (2)
  1. [Section 1, Comment after Fact 3] The claimed reduction of Fact 3 from the case Jxy=Jyx=0 to the full SF(n) class is not justified. The Comment invokes a pair of edge-dependent Z-rotations for each edge, but a single qubit belongs to many edges; a valid reduction would require one global Z-rotation per qubit that simultaneously diagonalizes every incident edge interaction. Eq. (3) only imposes a per-edge condition and does not enforce the required consistency around cycles: the edge angles φ_e induced by each two-qubit interaction would need to satisfy ∑ φ_e ≡ 0 mod 2π on every cycle, which the per-edge inequality does not guarantee. Because Theorem 1 applies Fact 3 to H0 = H + μ Σ Zi for H in the general class, this step is load-bearing. If Fact 3 for the full generalized class is already a theorem in [14], the authors should state that precisely and quote the relevant statement; otherwise the Comment must be replaced b
  2. [Definition 1, Eq. (3)] The matrix inequality in Eq. (3) is undefined for general real coefficients Jxy, Jyx unless the matrix is symmetric. If it is meant in the Loewner order, the matrix must be symmetric (or only its symmetric part used); if it is meant entrywise or in spectral norm, the claimed simplification to Jz ≥ max(|Jxx|, |Jyy|) when Jxy=Jyx=0 should be stated accordingly. This ambiguity is not merely notational: it determines which Hamiltonians lie in SF(n) and whether the edge-wise diagonalization in the Comment is legitimate. Please define the partial order and make explicit any symmetry assumption on the coupling matrix.
minor comments (3)
  1. [Section 1, Fact 3] The text says 'A proof of all the above facts can be found in [17]'. Since Fact 3 is attributed to [14] and [17] is an author-preprint that itself restricts to Jxy=Jyx=0, please clarify exactly which statement in [14] proves Fact 3 for the general SF(n) used here.
  2. [Corollary 1] The sentence 'adiabatic evolution ... followed by measuring the energy of H(1)' should specify how the estimate E_QA is extracted from measurement outcomes, e.g., repeated energy measurements or phase estimation, and include the associated O(log(1/η)) repetitions in the stated runtime. This is a presentation issue, not a flaw in the underlying argument.
  3. [Abstract and text] There are several typographical issues: the abstract contains 'areLee-Yang' and 'Suzuki-FisherHamiltonian', and the matrix in Eq. (3) is typeset with stray carriage-return characters. These should be corrected in the final version.

Circularity Check

0 steps flagged

No significant circularity: the 2μ gap bound is derived from a new relative-spectral-gap theorem applied to Lee-Yang Gibbs states, not from a fitted or definitional identity.

full rationale

The derivation chain is: SF Hamiltonians (Def. 1, Eq. 3) -> Fact 3 (Gibbs states are LY(1)) -> Aβ∈LY(e^{βμ}) by variable rescaling -> Theorem 2 (relative spectral gap) -> β→0 gives E2−E1≥2μ. Eq. (4) is not used to define SF(n); the class is defined by the coupling norm condition Eq. (3), independent of the gap claim. Theorem 2 is proved in full in the paper from contraction closure (Fact 1) and the Schwarz lemma (Fact 4). The only external dependency is Fact 3, originally attributed to Suzuki-Fisher [14]; the sentence 'A proof of all the above facts can be found in [17]' is a same-author citation, but it is not a circular reduction because [17]'s Lee-Yang result is a parameter-free theorem that does not assume the target gap bound and is externally checkable. The Comment's edgewise Z-rotation reduction for the generalized SF class is a proof sketch; if the local rotations cannot be combined in the Asano-contraction argument, that would be a correctness gap, not a circularity. There are no fitted parameters renamed as predictions and no uniqueness theorem imported from the authors. The Corollary 1 path has a possible sign/typo issue, but again that is an algorithmic-correctness matter, not circularity.

Axiom & Free-Parameter Ledger

0 free parameters · 5 axioms · 0 invented entities

No free parameters are fitted. The paper relies on the Lee-Yang tensor framework imported from prior work ([14,17,29,30]) and the adiabatic theorem; no new entities are postulated.

axioms (5)
  • domain assumption Fact 1: LY-class is closed under tensor contraction when r_i r_j > 1
    Used to show K^m and K^m|0⟩ are in LY(r) in the proof of Theorem 2; cited from Refs. [29,30], not proved here.
  • domain assumption Fact 2: LY-class is closed under limits of nonzero tensors
    Used to conclude the power-method limit ψ is in LY(r); cited from prior work.
  • domain assumption Fact 3: Gibbs states of Suzuki-Fisher Hamiltonians lie in LY(1)
    Load-bearing for Theorem 1: e^{-βH0}∈LY(1) is what allows A_β∈LY(e^{βμ}). The paper cites [14,17]; the extension to Jxy,Jyx terms is only sketched in the Comment.
  • standard math Fact 4: Schwarz lemma on the unit disk
    Used to prove Eq. (16) in Theorem 2.
  • standard math Adiabatic theorem
    Used in Corollary 1 to turn the gap lower bound into a poly-time algorithm; cited [18].

reviewed 2026-08-02 · how reviews work

0 comments
Cite this review

Pith. "Pith review of Efficient quantum algorithm for Heisenberg spin systems." pith.science (2026). https://pith.science/paper/6AAQUUXT

@misc{pith2026260714401,
  author       = {Pith},
  title        = {Pith review of: Efficient quantum algorithm for Heisenberg spin systems},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/6AAQUUXT}},
  note         = {Machine review of arXiv:2607.14401}
}
Share X Bluesky LinkedIn Reddit HN
read the original abstract

We consider a broad family of Heisenberg-type quantum spin systems that were studied by Suzuki and Fisher in 1971. This family includes, for example, the Heisenberg antiferromagnet on any bipartite graph. The ground and Gibbs states of these models are Lee-Yang tensors with radius 1: they are associated with multilinear polynomials that possess an extraordinary zero-freeness property inside the unit polydisk in the complex plane. For each Hamiltonian in this family we show that the spectral gap between the first-excited and ground-state energies is lower bounded by $2\mu$, where $\mu$ is the magnetic field along the $Z$ direction. Using this result we obtain an efficient quantum adiabatic algorithm for the ground energy of any model in this family. The proof is based on a new inequality that relates the spectral gap of a positive semidefinite operator to its Lee-Yang radius -- a quantitative strengthening of prior work of the authors that may find applications elsewhere.

discussion (0)

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

Reference graph

Works this paper leans on

31 extracted references · 5 linked inside Pith

  1. [1]

    On the computational complexity of ising spin glass models.Journal of Physics A: Mathematical and General, 15(10):3241–3253, 1982

    Francisco Barahona. On the computational complexity of ising spin glass models.Journal of Physics A: Mathematical and General, 15(10):3241–3253, 1982

    1982

  2. [2]

    Kitaev, Alexander Shen, and Mikhail N

    Alexei Y. Kitaev, Alexander Shen, and Mikhail N. Vyalyi.Classical and Quantum Computa- tion. American Mathematical Society, 2002

    2002

  3. [3]

    Anyons in an exactly solved model and beyond.Annals of Physics, 321(1):2–111, 2006

    Alexei Kitaev. Anyons in an exactly solved model and beyond.Annals of Physics, 321(1):2–111, 2006

    2006

  4. [4]

    Free fermions in disguise.Journal of Physics A: Mathematical and Theoretical, 52(33):335002, 2019

    Paul Fendley. Free fermions in disguise.Journal of Physics A: Mathematical and Theoretical, 52(33):335002, 2019

    2019

  5. [5]

    Classical algorithms, correlation decay, and complex zeros of partition functions of quantum many-body systems

    Aram W Harrow, Saeed Mehraban, and Mehdi Soleimanifar. Classical algorithms, correlation decay, and complex zeros of partition functions of quantum many-body systems. InProceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, pages 378–386, 2020

    2020

  6. [6]

    High-temperature gibbs states are unentangled and efficiently preparable

    Ainesh Bakshi, Allen Liu, Ankur Moitra, and Ewin Tang. High-temperature gibbs states are unentangled and efficiently preparable. In2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), pages 1027–1036. IEEE, 2024

    2024

  7. [7]

    Polynomial-time approximation algorithms for the ising model.SIAM Journal on computing, 22(5):1087–1116, 1993

    Mark Jerrum and Alistair Sinclair. Polynomial-time approximation algorithms for the ising model.SIAM Journal on computing, 22(5):1087–1116, 1993

    1993

  8. [8]

    Monte carlo simulation of stoquastic hamiltonians.arXiv preprint arXiv:1402.2295, 2014

    Sergey Bravyi. Monte carlo simulation of stoquastic hamiltonians.arXiv preprint arXiv:1402.2295, 2014

    Pith/arXiv arXiv 2014

  9. [9]

    Polynomial-time classical simulation of quantum ferromag- nets.arXiv preprint arXiv:1612.05602, 2016

    Sergey Bravyi and David Gosset. Polynomial-time classical simulation of quantum ferromag- nets.arXiv preprint arXiv:1612.05602, 2016

    Pith/arXiv arXiv 2016

  10. [10]

    Evaluating the evidence for exponential quantum advantage in ground-state quantum chemistry.Nature communications, 14(1):1952, 2023

    Seunghoon Lee, Joonho Lee, Huanchen Zhai, Yu Tong, Alexander M Dalzell, Ashutosh Kumar, Phillip Helms, Johnnie Gray, Zhi-Hao Cui, Wenyuan Liu, et al. Evaluating the evidence for exponential quantum advantage in ground-state quantum chemistry.Nature communications, 14(1):1952, 2023

    1952

  11. [11]

    Hunting for quantum-classical crossover in condensed matter problems.npj Quantum Infor- mation, 10(1):45, 2024

    Nobuyuki Yoshioka, Tsuyoshi Okubo, Yasunari Suzuki, Yuki Koizumi, and Wataru Mizukami. Hunting for quantum-classical crossover in condensed matter problems.npj Quantum Infor- mation, 10(1):45, 2024

    2024

  12. [12]

    An efficient and exact noncommu- tative quantum gibbs sampler.arXiv preprint arXiv:2311.09207, 2023

    Chi-Fang Chen, Michael J Kastoryano, and Andr´ as Gily´ en. An efficient and exact noncommu- tative quantum gibbs sampler.arXiv preprint arXiv:2311.09207, 2023

    arXiv 2023

  13. [13]

    Quantum generalizations of glauber and metropolis dynamics.arXiv preprint arXiv:2405.20322, 2024

    Andr´ as Gily´ en, Chi-Fang Chen, Joao F Doriguello, and Michael J Kastoryano. Quantum generalizations of glauber and metropolis dynamics.arXiv preprint arXiv:2405.20322, 2024

    arXiv 2024

  14. [14]

    Zeros of the partition function for the heisenberg, ferro- electric, and general ising models.Journal of Mathematical Physics, 12(2):235–246, 1971

    Masuo Suzuki and Michael E Fisher. Zeros of the partition function for the heisenberg, ferro- electric, and general ising models.Journal of Mathematical Physics, 12(2):235–246, 1971

    1971

  15. [15]

    An improved approximation algorithm for quantum max-cut on triangle-free graphs.Quantum, 7:1180, 2023

    Robbie King. An improved approximation algorithm for quantum max-cut on triangle-free graphs.Quantum, 7:1180, 2023. 9

    2023

  16. [16]

    Improved approximation algorithms for the epr hamiltonian

    Nathan Ju and Ansh Nagda. Improved approximation algorithms for the epr hamiltonian. arXiv preprint arXiv:2504.10712, 2025

    Pith/arXiv arXiv 2025

  17. [17]

    Lee-yang tensors and hamil- tonian complexity.arXiv preprint arXiv:2602.03605, 2026

    Benjamin Wong, Sergey Bravyi, David Gosset, and Yinchen Liu. Lee-yang tensors and hamil- tonian complexity.arXiv preprint arXiv:2602.03605, 2026

    arXiv 2026

  18. [18]

    Adiabatic theorem revisited: The unexpectedly good performance of adiabatic passage.Physical Review A, 103(6):062215, 2021

    Albert Benseny and Klaus Mølmer. Adiabatic theorem revisited: The unexpectedly good performance of adiabatic passage.Physical Review A, 103(6):062215, 2021

    2021

  19. [19]

    Almost optimal classical approximation algorithms for a quantum generalization of Max-Cut

    Sevag Gharibian and Ojas Parekh. Almost optimal classical approximation algorithms for a quantum generalization of Max-Cut. volume 145, pages 31:1–31:17. Schloss Dagstuhl – Leibniz- Zentrum f¨ ur Informatik, 2019

    2019

  20. [20]

    Application of the level-2 quantum Lasserre hierarchy in quantum approximation algorithms.LIPIcs, Volume 198, ICALP 2021, 198:102:1–102:20, 2021

    Ojas Parekh and Kevin Thompson. Application of the level-2 quantum Lasserre hierarchy in quantum approximation algorithms.LIPIcs, Volume 198, ICALP 2021, 198:102:1–102:20, 2021

    2021

  21. [21]

    An improved approximation algorithm for quantum max-cut on triangle-free graphs.Quantum, 7:1180, November 2023

    Robbie King. An improved approximation algorithm for quantum max-cut on triangle-free graphs.Quantum, 7:1180, November 2023

    2023

  22. [22]

    Optimizing quantum circuit parameters via sdp.arXiv preprint arXiv:2209.00789, 2022

    Eunou Lee. Optimizing quantum circuit parameters via sdp.arXiv preprint arXiv:2209.00789, 2022

    Pith/arXiv arXiv 2022

  23. [23]

    An improved quantum Max Cut approximation via matching, 2024

    Eunou Lee and Ojas Parekh. An improved quantum Max Cut approximation via matching, 2024

    2024

  24. [24]

    Monogamy of entanglement bounds and improved approximation algorithms for qudit Hamiltonians, 2025

    Zackary Jorquera, Alexandra Kolla, Steven Kordonowy, Juspreet Singh Sandhu, and Stuart Wayland. Monogamy of entanglement bounds and improved approximation algorithms for qudit Hamiltonians, 2025

    2025

  25. [25]

    Improved algorithms for quantum MaxCut via partially entangled matchings, 2025

    Anuj Apte, Eunou Lee, Kunal Marwaha, Ojas Parekh, and James Sud. Improved algorithms for quantum MaxCut via partially entangled matchings, 2025

    2025

  26. [26]

    Conjectured bounds for 2-local Hamiltonians via token graphs, 2025

    Anuj Apte, Ojas Parekh, and James Sud. Conjectured bounds for 2-local Hamiltonians via token graphs, 2025

    2025

  27. [27]

    Guest column: The 7 faces of quantum np.ACM SIGACT News, 54(4):54–91, 2024

    Sevag Gharibian. Guest column: The 7 faces of quantum np.ACM SIGACT News, 54(4):54–91, 2024

    2024

  28. [28]

    A 0.8395-approximation algorithm for the epr problem.arXiv preprint arXiv:2512.09896, 2025

    Anuj Apte, Eunou Lee, Kunal Marwaha, Ojas Parekh, Lennart Sinjorgo, and James Sud. A 0.8395-approximation algorithm for the epr problem.arXiv preprint arXiv:2512.09896, 2025

    arXiv 2025

  29. [29]

    Theorems on the partition functions of the Heisenberg ferromagnets.Journal of the Physical Society of Japan, 29(2):350–359, 1970

    Taro Asano. Theorems on the partition functions of the Heisenberg ferromagnets.Journal of the Physical Society of Japan, 29(2):350–359, 1970

    1970

  30. [30]

    Characterization of Lee-Yang polynomials.Annals of Mathematics, pages 589– 603, 2010

    David Ruelle. Characterization of Lee-Yang polynomials.Annals of Mathematics, pages 589– 603, 2010

    2010

  31. [31]

    Spectral gap of lee-yang hamiltonians.arxiv preprint arxiv:2607.10765, 2026

    Chaithanya Rayudu and Jun Takahashi. Spectral gap of lee-yang hamiltonians.arxiv preprint arxiv:2607.10765, 2026. 10

    Pith/arXiv arXiv 2026

This paper was first reviewed by deepseek-v4-flash on August 2, 2026.