Search arXivSearch

arXiv · 2410.10763

How to realize compact and non-compact localized states in disorder-free hypercube networks

Abstract

We present a method for realizing various zero-energy localized states on disorder-free hypercube graphs. Previous works have already indicated that disorder is not essential for observing localization phenomena in noninteracting systems, with some prominent examples including the 1D Aubry-André model, characterized solely by incommensurate potentials, or 2D incommensurate Moiré lattices, which exhibit localization due to the flat band spectrum. Moreover, flat band systems with translational invariance can also possess so-called compact localized states, characterized by exactly zero amplitude outside a finite region of the lattice. Here, we demonstrate that both compact and non-compact (i.e., Anderson-like) localized states naturally emerge in disorder-free hypercubes, which can be systematically constructed using Cartan products. This construction ensures the robustness of these localized states against perturbations. Furthermore, we show that the hypercubes can be associated with the Fock space of interacting spin systems exhibiting localization. Viewing localization from the hypercube perspective, with its inherently simple eigenspace structure, offers a clearer and more intuitive understanding of the underlying Fock-space many-body localization phenomena. Our findings can be readily tested on existing experimental platforms, where hypercube graphs can be emulated, e.g., by photonic networks of coupled optical cavities or waveguides. The results can pave the way for the development of novel quantum information protocols and enable effective simulation of quantum many-body localization phenomena.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ievgen I. Arkhipov, Fabrizio Minganti, Franco Nori. 2025-07-01. How to realize compact and non-compact localized states in disorder-free hypercube networks. https://doi.org/10.1103/4s2w-y1xx

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

KEEP EXPLORING

Related papers

The critical slowing down in training diffusion models

Computational sampling has been central to the sciences since the mid-20th century. While machine-learning-based approaches have recently enabled major advances, their behavior remains poorly understood, with limited theoretical control over when and why they succeed. Here we provide such insight for diffusion models---a class of generative schemes highly effective in practice---by analyzing their application to the $O(n)$ model of statistical field theory in the Gaussian limit $n \to \infty$. In this analytically tractable setting, we show that training a score model with a one-layer network architecture matching the exact solution exhibits a form of critical slowing down in parameter learning. This slowing down also impacts the generation process, indicating that the well-known difficulties of sampling near criticality persist even for learned generative models. To overcome this bottleneck, we consider the power of architectural depth. We find that using a two-layer architecture drastically reduces the critical slowing down, with the training time scaling logarithmically rather than quadratically with system size. Using a Fourier implementation of the architecture, we further show that this acceleration in training time can be achieved without drastically increasing operational complexity. Taken together, these results demonstrate that diffusion models can overcome the critical slowing down through appropriate architectural design, and establish a controlled framework for understanding and improving learned sampling methods in statistical physics and beyond.

cond-mat.dis-nn

Switching diffusivity selects Pareto tail exponent in random growth with redistribution

Random multiplicative growth with redistribution generates stationary Pareto wealth tails in the Bouchaud-Mézard model, but assumes a fixed multiplicative noise intensity. This is restrictive for physical and financial growth processes, where volatility (diffusivity) is often fluctuating. We replace the constant noise intensity by a switching diffusivity and ask how these fluctuations select the Pareto stationary tail. For a geometric Brownian motion with switching diffusivity, the long-time Gaussian limit holds when the redraw law has finite mean and variance. The asymptotic variance retains a contribution from diffusivity persistence. With redistribution and a general redraw law, the stationary large-wealth problem is characterized by a spectral condition for admissible algebraic modes. For a two-state diffusivity, an exact tail analysis gives a Pareto exponent interpolating between the high-diffusivity slow-refresh limit and the mean-diffusivity fast-refresh Bouchaud-Mézard limit.

cond-mat.dis-nn

Signatures of Nonergodicity in Sparse Random Matrices

The prevalence of sparsity in the Fock space graph of interacting many-body systems motivates an investigation into the spectral statistics of sparse random matrices with on-site disorder. We numerically determine the delocalization-localization transition in the ground state as a function of the sparsity. The short-range energy correlation in the bulk indicates that the Anderson transition at infinite temperature occurs at the critical percolation limit of the sparse graph. By analytically deriving the energy moments and calculating the shifted kurtosis, we show that the critical sparsity threshold matches the Anderson transition. Furthermore, long-range energy correlations in the bulk spectrum reveal a Thouless energy scale, suggesting a broad nonergodic regime within the delocalized phase.

cond-mat.dis-nn