🔬 mesoscale physics

Higher-Dimensional Information Lattice: Quantum State Characterization through Inclusion-Exclusion Local Information

This paper generalizes the one-dimensional information lattice to higher-dimensional geometries by introducing an inclusion-exclusion principle to uniquely assign local information to lattice vertices, thereby enabling the characterization of diverse quantum many-body states through position- and scale-resolved features such as localization lengths, critical exponents, and topological signatures.

Original authors: Ian Matthias Flór, Claudia Artiaco, Thomas Klein Kvorning, Jens H. Bardarson

Published 2026-02-23

📖 6 min read🧠 Deep dive

CC BY 4.0

Original authors: Ian Matthias Flór, Claudia Artiaco, Thomas Klein Kvorning, Jens H. Bardarson

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

The Big Idea: Mapping the "Information Landscape"

Imagine you have a giant, complex puzzle made of billions of tiny pieces (quantum particles). In physics, we want to understand how these pieces talk to each other. Do they only whisper to their immediate neighbors, or do they shout across the whole room?

For a long time, scientists had a tool called the Information Lattice to map these conversations, but it only worked for one-dimensional chains (like a single line of beads). It was like having a perfect map for a straight road, but useless for a city with loops, intersections, and roundabouts.

This paper introduces a new, upgraded map that works for 2D and 3D shapes (like a grid or a sphere). It solves a tricky problem: in a 2D grid, information can travel in loops. If you have three friends standing in a triangle, Friend A might know what Friend B knows, and Friend B knows what Friend C knows, but Friend A might also know what Friend C knows directly. This creates "double-counting" or redundancy.

The authors created a new mathematical rule called Inclusion-Exclusion to fix this. Think of it like a very smart accountant who knows exactly how to subtract the double-counted money so the final total is perfect.

The Core Concept: The "Information Lattice"

To understand the new map, let's use an analogy of detectives investigating a crime scene.

1. The Old Way (1D Chains)

Imagine a line of houses.

The Detective: Checks House 1. Then checks Houses 1 & 2 together. Then 1, 2, & 3.
The Logic: If checking "1 & 2" reveals new clues that "1" alone didn't have, that's new information. If checking "1, 2, & 3" reveals nothing new compared to "1 & 2," then the third house added no new clues.
The Map: This creates a neat triangle of data showing exactly where new clues appear.

2. The New Problem (2D Grids)

Now, imagine the houses are arranged in a square grid.

The Loop Problem: If you look at a square of four houses, the top-left house and the bottom-right house might share information because they are connected through the top-right and the bottom-left.
The Redundancy: If you just add up the clues from every small group, you might count the same clue three times! It's like three people in a room all saying, "It's raining," and you counting that as three separate weather reports.

3. The Solution: "Inclusion-Exclusion"

The authors invented a formula to fix the double-counting.

The Analogy: Imagine you are counting the total number of unique people in a room.
- You count everyone in Group A.
- You count everyone in Group B.
- BUT, you realize some people are in both groups. So, you subtract the overlap.
- Then you realize you subtracted the people in the center (who were in A, B, and C) too many times, so you add them back.
The Result: This "Inclusion-Exclusion" method gives you a Local Information value for every spot on the grid.
- Positive Value: This spot holds a unique secret that no smaller group knew.
- Negative Value: This spot is a "redundancy zone." It means the information here was already known by other overlapping groups. It's a "debt" in the information ledger.

What Did They Discover? (The Applications)

The authors tested this new map on four different types of quantum "cities" to see what the map revealed.

1. The "Frozen City" (Localized States)

The Scene: A city where everyone is stuck in their own house and barely talks to neighbors (like a disordered material).
The Map: The information is concentrated in tiny, isolated spots. As you look at larger and larger neighborhoods, the "new information" drops off like a cliff.
The Takeaway: The map can measure exactly how far the "whispers" travel before they die out. It defines the size of the "frozen" zones.

2. The "Busy Highway" (Critical States)

The Scene: A city with a massive, flowing traffic jam (a Fermi surface) where information flows freely in all directions.
The Map: The information doesn't just drop off; it flows in a specific direction, like a river.
The Takeaway: The map can predict the direction of the flow. It found that the information flows exactly where the "traffic" (electrons) is moving fastest. It's like the map can see the wind direction just by looking at how the leaves (information) are scattered.

3. The "Edge City" (Topological Superconductors)

The Scene: A city where the middle is quiet and frozen, but the border is a chaotic, super-fast highway.
The Map: The map separates the "quiet middle" from the "chaotic edge."
The Takeaway: It can isolate the information living only on the edge. It proves that the edge has a special, universal "vibe" (scaling law) that is different from the rest of the city, even if the city is huge.

4. The "Magic Puzzle" (Topological Order & Non-Abelian Anyons)

The Scene: A city built on magic rules (Toric Code). Here, the information isn't in the houses; it's in the loops connecting them.
The Twist: They introduced "defects" (glitches in the magic) that act like Non-Abelian Anyons. These are special particles that, if you swap them around, the whole system changes its state in a way that depends on the order you swapped them.
The Map: The map showed that when these special particles are far apart, they share a "hidden secret" (a fusion space). When you bring them together, the map shows a specific "debt" (negative information) that cancels out.
The Takeaway: This is huge for Quantum Computing. The map can track these "magic particles" and see if they are ready to be used for calculations. It acts like a GPS for quantum errors and quantum logic.

Why Does This Matter?

Think of the old way of studying quantum matter as trying to understand a forest by only counting the total number of trees. You know how many trees there are, but you don't know where the old growth is, where the saplings are, or how the roots are tangled.

This new Higher-Dimensional Information Lattice is like a 3D scanner for the forest.

It tells you where the information is stored (Position).
It tells you how big the information clusters are (Scale).
It fixes the math errors caused by loops and overlaps.

In short: This paper gives physicists a new, universal language to describe how quantum information is organized in complex, 2D, and 3D worlds. It helps us understand everything from why some materials conduct electricity perfectly to how to build a stable quantum computer that doesn't crash.

1. Problem Statement

Quantum information theory provides powerful tools for characterizing many-body states, primarily through the von Neumann entropy. However, the standard entropy is a global quantity that quantifies total correlations between a subsystem and its complement but fails to resolve where and at what scale information is distributed.

While the Information Lattice was previously developed for one-dimensional (1D) open-boundary chains to decompose information into position- and scale-resolved local contributions, generalizing this to higher dimensions (2D and beyond) presents intrinsic challenges:

Geometric Complexity: In 1D, subsystems are intervals with a natural ordering. In higher dimensions, subsystems can take various shapes (e.g., rectangles, circles), and there is no canonical hierarchy.
Overlap Redundancy: In higher dimensions (and periodic 1D chains), subsystems can overlap in loop-like configurations. This allows the same information to be accessible from multiple distinct overlapping regions. Consequently, information cannot be uniquely assigned to a single subsystem without double-counting, a phenomenon known as overlap redundancy.
Limitations of Existing Methods: Standard area-law scaling of entropy in higher dimensions often hides universal features (like topological order or critical exponents) in subleading terms, making them difficult to isolate without a spatially resolved framework.

2. Methodology: The Higher-Dimensional Information Lattice

The authors propose a generalization of the information lattice based on the Inclusion-Exclusion Principle.

A. Core Concept: Inclusion-Exclusion Local Information

The framework defines a set of convex subsystems $\{C_n^\ell\}$ labeled by a positional index $n$ and a multiscale index $\ell$ (representing spatial extent). The total information $I(\rho_{C_n^\ell})$ of a subsystem is decomposed into local contributions $i_n^\ell$ via a Möbius inversion of the lattice structure:

$i_n^\ell = I(\rho_{C_n^\ell}) - \sum I(\rho_{A_i}) + \sum I(\rho_{A_i \cap A_j}) - \dots$

Where $A_i$ are subsystems obtained by removing one layer of sites from $C_n^\ell$ .

Positive $i_n^\ell$ : Indicates a net gain of information unique to that specific scale and location, not inferable from smaller overlapping subsystems.
Negative $i_n^\ell$ : Signals overlap redundancy. It indicates that the information in the larger subsystem is already partially inferable from the joint distributions of its smaller, overlapping neighbors. This negative value acts as a "correction" to prevent overcounting.

B. Implementation in 2D

The authors explicitly implement this for rectangular subsystems on a 2D square lattice.

Subsystems are defined by bottom-left coordinates $(n_x, n_y)$ and scales $(\ell_x, \ell_y)$ .
The inclusion-exclusion formula (Eq. 10) involves alternating sums of von Neumann informations of the target rectangle, its immediate smaller neighbors, their pairwise intersections, and higher-order intersections.
Quasi-1D Reductions: By summing over one spatial axis (e.g., summing over $n_y$ ), the authors derive "quasi-1D" local information quantities. These retain non-negativity and allow for the extraction of direction-dependent properties (e.g., correlation lengths along $x$ vs. $y$ ).

3. Key Contributions

Theoretical Framework: Established a rigorous, universal information-theoretic framework for decomposing quantum states in arbitrary dimensions, resolving the ambiguity of information assignment in the presence of overlapping subsystems.
Handling Redundancy: Introduced the concept of negative local information as a physical signature of overlap redundancy (non-local correlations shared across distinct regions), linking this to interaction information in classical multivariate statistics.
Universal Diagnostics: Demonstrated that this decomposition isolates universal features of quantum phases (localized, critical, topological) that are often obscured in standard entropy calculations.

4. Results and Applications

The framework was applied to several distinct quantum many-body states:

A. Anderson Model (Localized vs. Critical)

Localized Phase ( $W \neq 0$ ): The local information decays exponentially with scale. The authors define direction-dependent correlation decay lengths ( $\lambda_x, \lambda_y$ ) via least-squares fits, providing a system-agnostic measure of anisotropic localization.
Critical Phase ( $W = 0$ ): The information decays algebraically ( $I \propto \ell^{-2}$ ). Crucially, the framework identifies a dominant information propagation direction that aligns with the average Fermi velocity orientation. This suggests the information lattice can map the geometry of the Fermi surface in gapless systems.

B. Chiral $p_x + i p_y$ Superconductor (Edge Modes)

The framework successfully separates bulk and edge contributions.
Bulk: Shows exponential decay (gapped).
Edge: Shows algebraic decay ( $\propto \ell^{-2}$ ) characteristic of a 1D conformal field theory.
Scaling Constant: The extracted scaling coefficient $\alpha$ matches the theoretical prediction for a single chiral Majorana fermion ( $\alpha = 1/(12 \ln 2)$ ), confirming the method's ability to detect universal edge physics.

C. Toric Code (Topological Order)

Infinite Plane: Information is strictly local, residing entirely in 2D "plaquette" and "star" constraints (1 bit each). No information exists at larger scales, reflecting the local nature of the constraints.
Open Boundaries: The framework captures string condensation at the boundary. It reveals a global redundancy where the sum of inclusion-exclusion values over the full boundary yields $-\gamma$ (where $\gamma$ is the topological entanglement entropy). This provides a direct, local derivation of the topological term without requiring global entropy subtractions.
Non-Abelian Defects: The lattice resolves non-Abelian fusion channels. For twist defects (Ising anyons), the information lattice shows a reduction of $0.5$ bits for a single twist, with the "missing" information recovered only when both twists are enclosed. This visualizes the non-local fusion space $\tau \otimes \tau = 1 \oplus \epsilon$ .

5. Significance and Future Outlook

Universal Characterization: The method provides a unified language to describe diverse quantum phases (localized, critical, topological) based on the spatial and scale distribution of information, rather than just total entropy.
Algorithmic Potential: The hydrodynamic-like continuity equations for information flow in 1D suggest that this 2D framework could lead to efficient time-evolution algorithms for higher-dimensional systems by discarding irrelevant long-range correlations.
Diagnostic Power: It offers a new way to detect topological order, edge modes, and non-Abelian anyons through local measurements and information decomposition, potentially applicable to mixed states and noisy quantum devices.
Future Directions: The authors suggest extending this to interacting Fermi surfaces, domain walls between topological orders, and developing information-lattice algorithms for dynamical simulations in higher dimensions.

In summary, this work transforms the complexity of higher-dimensional geometry into a structured, position- and scale-resolved map of quantum information, offering a powerful new tool for diagnosing the universal properties of quantum matter.