Quick Navigation
Topics
Quantum Simulation
Lee-Yang tensors and Hamiltonian complexity
arXiv
Authors: Benjamin Wong, Sergey Bravyi, David Gosset, Yinchen Liu
Year
2026
Paper ID
2917
Status
Preprint
Abstract Read
~2 min
Abstract Words
216
Citations
N/A
Abstract
A complex tensor with n binary indices can be identified with a multilinear polynomial in n complex variables. We say it is a Lee-Yang tensor with radius r if the polynomial is nonzero whenever all variables lie in the open disk of radius r. In this work we study quantum states and observables which are Lee-Yang tensors when expressed in the computational basis. We first review their basic properties, including closure under tensor contraction and certain quantum operations. We show that quantum states with Lee-Yang radius r > 1 can be prepared by quasipolynomial-sized circuits. We also show that every Hermitian operator with Lee-Yang radius r > 1 has a unique principal eigenvector. These results suggest that r = 1 is a key threshold for quantum states and observables. Finally, we consider a family of two-local Hamiltonians where every interaction term energetically favors a deformed EPR state |00rangle + s|11rangle for some 0 leq s leq 1. We numerically investigate this model and find that on all graphs considered the Lee-Yang radius of the ground state is at least r = 1/sqrt{s} while the spectral gap between the two smallest eigenvalues is at least 1-s2. We conjecture that these lower bounds hold more generally; in particular, this would provide an efficient quantum adiabatic algorithm for the quantum Max-Cut problem on uniformly weighted bipartite graphs.
Why This Paper Matters
- This paper contributes to the Quantum Simulation research area in the Quantum Articles archive.
- It adds a 2026 reference point for readers tracking recent quantum research.
- A complex tensor with n binary indices can be identified with a multilinear polynomial in n complex variables.
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.