Lattice matter
Which properties of a lattice model no algorithm can compute or decide from its finite local rules: the critical gap exponents and the entanglement of translation-invariant quantum lattices, spontaneous magnetization and the decay of one specified thermal correlation in classical lattice models at a fixed positive temperature, and the speed of signals in a quasi-periodic spin chain.
Four works in eight archived versions · latest release
The question
Answered Are the critical exponents of lattice matter computable from its Hamiltonian?
Not in general.
The papersin reading order, with what each settled
-
Uncomputable critical exponents
Seth Douglas and Nidhal Mghirbi · version 2.1.0 · · 64 pages
Translation-invariant nearest-neighbour quantum Hamiltonians whose critical gap exponents are exactly the nonnegative reals, already in two dimensions; and robust laws of noisy media that no effective inquiry can learn beyond .
-
Matter that pays the price of perfection
Seth Douglas and Nidhal Mghirbi · version 1.0.0 · · 27 pages
Gapped translation-invariant lattices whose entanglement has any prescribed limit-computable logarithmic coefficient, and a referee cell that converts low energy into strategies for a nonlocal game. The game-driven material theorem is stated conditionally.
-
Spontaneous magnetization and thermal decay are undecidable at positive temperature
Seth Douglas and Nidhal Mghirbi · version 1.0.0 · · 36 pages
Spontaneous magnetization is undecidable at a fixed positive temperature for translation-invariant finite-range classical lattice models with strictly positive rational Boltzmann weights. A computable family on 2304 local states has maximal visible nine-colour Potts magnetization exactly zero or a fixed positive constant, attained in a translation-invariant Gibbs state. Its pressure in a uniform field is uniformly computable, but differentiability at zero field is undecidable with a fixed derivative-jump gap. Rational weights are asserted at zero field. We also prove undecidability of exponential decay of one specified thermal spin correlation, in every Gibbs state, on 512 local states. Both constructions couple critical visible spins to cellular-automaton replicas. Surjectivity cancels the collision corrections; nonsurjectivity gives strict subcritical bond domination and exponential decay of the specified correlation uniformly over states. The interaction range depends on the input, and the branches are fine-tuned at their critical or coexistence points. The results transfer to diagonal quantum interactions and survive a prescribed output-reset noise family, the same construction with reduced retention. Nonsurjective full-state uniqueness and exponential clustering of arbitrary local observables remain open.
-
Worst-case transport and light cones for quasi-periodic operators
Seth Douglas and Nidhal Mghirbi · version 2.0.1 · · 72 pages
At the worst phase rather than a typical one. For every real-analytic quasi-periodic potential with positive Lyapunov exponent on the spectrum and every frequency with , uniformly in the phase, the fastest upper transport exponent is at most the maximum over the spectrum of when , where is the Lyapunov exponent and the acceleration, with an explicit formula when ; so a finite keeps transport below ballistic at every phase, and the factor is attained. For the almost Mathieu operator, when is finite and greater than , where is the limsup along even denominators, the worst exponent is exactly : it is attained at the phase and on a dense set of phases, while almost every phase has . In the Aubry–André XY spin chain, for the specified observables, the light cone at a fixed site follows the typical law at almost every phase, and the light cone uniform over sites follows the worst-case law; an explicit computable chain has two different light-cone exponents, both of Turing degree . The Lyapunov exponent of a computable analytic potential is computable at every computable irrational frequency, and at one explicit frequency the transport exponent has degree exactly for every computable even potential in an explicit open neighbourhood of .
Posed by othersproblems printed by others that this line takes up
What is openzero questions
No open question of this line is listed yet.