REVIEW 1 cited by
Graph theoretical proof of nonintegrability in quantum many-body systems : Application to the PXP model
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
read the original abstract
A rigorous proof of integrability or non-integrability in quantum many-body systems is among the most challenging tasks, as it involves demonstrating the presence or absence of local conserved quantities and deciphering the complex dynamics of the system. In this paper, we establish a graph-theoretical analysis as a comprehensive framework for proving the non-integrability of quantum systems. Exemplifying the PXP model, which is widely believed to be non-integrable, this work rigorously proves the absence of local conserved quantities, thereby confirming its non-integrability. This proof for the PXP model gives several important messages not only that the system is non-integrable, but also the quantum many body scaring observed in the model is not associate with the existence of local conserved quantities. From a graph-theoretical perspective, we also highlight its advantage, even in integrable systems, as the classification of local conserved quantities can be achieved by simply counting the number of isolated loops in the graphs. Our new approach is broadly applicable for establishing proofs of (non-)integrability in other quantum many-body systems, significantly simplifying the process of proving nonintegrability and giving numerous potential applications.
Forward citations
Cited by 1 Pith paper
-
Rigorous Test for Quantum Integrability and Nonintegrability
A quantum spin chain with finite-range interactions is nonintegrable if no 3-local operator almost commutes with the Hamiltonian, a condition that can be checked by a system-size-independent algorithm.
Discussion (0). Continue with ORCID to comment.