Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2007.07667

Local iterative block-diagonalization of gapped Hamiltonians: a new tool in singular perturbation theory

Simone Del Vecchio·Juerg Froehlich·Alessandro Pizzo·Stefano Rossi
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper the local iterative Lie-Schwinger block-diagonalization method, introduced in [FP], [DFPR1], and [DFPR2] for quantum chains, is extended to higher-dimensional quantum lattice systems with Hamiltonians that can be written as the sum of an unperturbed gapped operator, consisting of a sum of on-site terms, and a perturbation consisting of bounded interaction potentials of short range mutltiplied by a real coupling constant t. Our goal is to prove that the spectral gap above the ground-state energy of such Hamiltonians persists for sufficiently small values of |t|, independently of the size of the lattice. New ideas and concepts are necessary to extend our method to systems in dimension d > 1: As in our earlier work, a sequence of local block-diagonalization steps based on judiciously chosen unitary conjugations of the original Hamiltonian is introduced. The supports of effective interaction potentials generated in the course of these block-diagonalization steps can be identified with what we call minimal rectangles contained in the lattice, a concept that serves to tackle combinatorial problems that arise in the course of iterating the block-diagonalization steps. For a given minimal rectangle, control of the effective interaction potentials generated in each block-diagonalization step with support in the given rectangle is achieved by exploiting a variety of rather subtle mechanisms which include, for example, the use of weighted sums of paths consisting of overlapping rectangles and of large denominators, expressed in terms of sums of orthogonal projections, that serve to control analogous sums of projections in the numerators resulting from the unitary conjugations of the interaction potential terms involved in the local block-diagonalization step.

Explore related subjects

math-phmath.MP

Keep this discovery

BibTeXRIS

Simone Del Vecchio, Juerg Froehlich, Alessandro Pizzo, Stefano Rossi. 2020-07-15. Local iterative block-diagonalization of gapped Hamiltonians: a new tool in singular perturbation theory. https://doi.org/10.1063/5.0084552

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Why we should condition denoising diffusion generative models on windows of past observations

Data assimilation (DA) is, traditionally, a cycling process that relies on time-dependent priors to propagate information from past observations to future cycles. Using denoising diffusion generative modeling for DA is challenging because standard approaches use a fixed training data set, which in turn leads to a static prior that ignores information from past observations. Because past observations are ignored, DA systems with static priors lead to larger posterior errors than cycling DA systems. Incorporating time-dependent priors into generative models, however, requires expensive and frequent retraining. Motivated by linear systems theory - where the dependence of a prediction of a Kalman filter on past observations decays exponentially - we condition diffusion models on short windows of past observations. Specifically, we describe training procedures for two frameworks: a diffusion DA system predicting the current state given a set of past observations, and a diffusion ``direct observation prediction'' (DOP) system, predicting future observations given a set of past observations. Using a canonical linear system, we show that both systems can achieve the minimal posterior error characteristic of a fully-cycled DA/DOP system, without re-training, provided the time windows are long enough. The linear setup ensures analytical tractability, avoids confounding neural network training errors, and confirms that conditioning on windows of past observations is required for efficient and accurate diffusion-based DA or DOP.

math-ph↗
arXiv2026

The kinematic structures and the inertial geometry of a moving charge

We ask how much of the geometry a charged particle moves in is fixed by its motion, and how much a particle must bring. We ask of a symplectic structure only that it relate velocity to momentum as Hamilton's equations do, and we ask it of every energy at once. In particular, we show that the structures meeting that demand are the canonical one and its twists by a closed two-form of the base. A field provides the two-form, a particle the multiplier before it, which we identify constitutively with its charge. Thus, a single energy governs a family of structures, and each particle takes the one its charge fixes. We then ask what a particle must bring to be given a momentum, and we show that the degree of that map settles the degree at which a field enters Newton's Second Law. An antisymmetric bilinear form returns no Lorentz force, whilst a Randers metric returns one --- a length whose difference from a Riemannian one is linear in the velocity. Moreover, we find that metric already within the twisted structure, as its primitive over a level of the free energy, and its law of transport to be nonlinear, no affine connection being known to serve. Under an indefinite signature the length parts from the dynamics, and the extremals turn from shortest to longest. On the round sphere a monopole flux leaves no such metric, whilst the transport remains and prequantisation, given a unit of action, restricts the charge to a lattice. In this manner, we conclude that each charge-to-mass ratio receives a geometry of its own, so that by a functionalist criterion none of them is the spacetime of a charged particle.

math-ph↗