Characterizing Translation-Invariant Bell Inequalities using Tropical Algebra and Graph Polytopes

Nonlocality is one of the key features of quantum physics, which is revealed through the violation of a Bell inequality. In large multipartite systems, nonlocality characterization quickly becomes a challenging task. A common practice is to make use of symmetries, low-order correlators, or exploiting local geometries, to restrict the class of inequalities. In this paper, we characterize translation-invariant (TI) Bell inequalities with finite-range correlators in one-dimensional geometries. We introduce a novel methodology based on tropical algebra tensor networks and highlight its connection to graph theory. Surprisingly, we find that the TI Bell polytope has a number of extremal points that can be uniformly upper-bounded with respect to the system size. We give an efficient method to list all vertices of the polytope for a particular system size, and characterize the tightness of a given TI Bell inequality. The connections highlighted in our work allow us to re-interpret concepts developed in the fields of tropical algebra and graph theory in the context of Bell nonlocality, and vice-versa. This work extends a parallel article [M. Hu \textit{et al.}, arXiv: 2208.02798 (2022)] on the same subject.

💡 Research Summary

The paper addresses the formidable problem of characterizing non‑local correlations in large multipartite quantum systems by focusing on translation‑invariant (TI) Bell inequalities with finite‑range correlators in a one‑dimensional geometry. After a concise review of Bell non‑locality, the authors introduce the correlator representation of behaviors and define the local polytope as the convex hull of deterministic local strategies (LDS). By imposing translation invariance, the full N‑party correlator vector becomes a tensor product of identical local tensors, which can be naturally encoded in a tropical algebraic tensor network.

In tropical algebra the usual addition and multiplication are replaced by min (⊕) and plus (⊙), turning the optimization of a Bell inequality into a min‑plus matrix problem. The authors construct a tropical matrix F whose entries encode the cost associated with each local input‑output assignment. The tropical eigenvalue λ(F) equals the minimal mean weight of a directed cycle in the associated weighted digraph ΓF and can be computed in O(m n) time using Karp’s algorithm. By shifting F to F′ = F – λ(F) the eigenvalue becomes zero, all cycles acquire non‑negative weight, and the Kleene plus F′⁺ yields the minimal weight of any path. A diagonal entry of F′⁺ equal to zero provides a tropical eigenvector, which the authors prove corresponds exactly to a vertex of the TI local polytope.

A central result is that the number of such vertices does not grow with the number of parties N; it is bounded by a constant that depends only on the number of measurement settings m and the interaction range r. Consequently, the authors present an O(1)‑in‑N algorithm to enumerate all vertices: compute λ(F), form F′, evaluate F′⁺, extract the eigenvectors, and map them back to the original correlator space. This dramatically improves over the naïve exponential enumeration.

The methodology is first applied to the nearest‑ and next‑nearest‑neighbor (TINN) case, where only two‑body correlators up to distance two are allowed. The authors then generalize to arbitrary finite range TI‑R polytopes, showing that the same bounded‑vertex property holds. Using the tropical eigenvectors they design new families of TI‑R Bell inequalities via a renormalization of the tropical tensors, allowing a systematic classification of tight (facet‑defining) inequalities.

A further insight is the connection between the critical graph of the tropical matrix and the facets of the polytope. Strongly connected components of the critical graph correspond to minimal cycles that define facets, providing a graph‑theoretic route to facet identification.

Overall, the paper establishes a novel bridge between tropical algebra, graph theory, and Bell non‑locality. It offers both a conceptual framework—interpreting Bell‑inequality optimization as a min‑plus eigenvalue problem—and practical tools: a constant‑time vertex enumeration algorithm and a systematic way to construct and certify tight TI Bell inequalities. These results open the door to efficient device‑independent certification in large, translation‑invariant quantum many‑body systems and suggest further extensions to higher dimensions, longer‑range interactions, and non‑translation‑invariant symmetries.