works on

From the 1 of 9 linked papers with an AI index.

most citedDiagonal Isometric Form for Tensor Network States in Two Dimensions

2 citations · 2 across the 3 of their papers we have counts for

collaborators

9 papers

cond-mat.str-el2026

Emergence of a monopole phase in the Heisenberg model on the triangular lattice for small magnetic fields

Sasank Budaraju, Shi Feng, Josef Willsher +3

The authors use variational Monte Carlo to map the ground‑state phase diagram of the J1‑J2 Heisenberg model on a triangular lattice under small Zeeman fields, revealing a monopole‑…

quant-ph2026

Information-theoretic principle of emergent 1-form symmetries

Yu-Jie Liu, Wen-Tao Xu, Frank Pollmann +1

Higher-form symmetries act on sub-dimensional spatial manifolds of a quantum system. They can emerge as an exact symmetry at low energies even when they are explicitly broken at th…

cond-mat.str-el20262 cited

Diagonal Isometric Form for Tensor Network States in Two Dimensions

Benjamin Sappler, Masataka Kawano, Michael P Zaletel +1

Isometric tensor network states (isoTNS) generalize the isometric form of the one-dimensional matrix product states (MPS) to tensor networks in two and higher dimensions. Here, we…

quant-ph2026

Skeleton of isometric Tensor Network States for Abelian String-Net Models

Julian Boesl, Yu-Jie Liu, Frank Pollmann +1

We construct parametrized isometric tensor network states -- referred to as skeletons -- that allow us to explore phases of abelian topological order and can be efficiently impleme…

quant-ph2026

Holographic Representation of One-Dimensional Many-Body Quantum States via Isometric Tensor Networks

Kaito Kobayashi, Benjamin Sappler, Frank Pollmann

Tensor network methods, most prominently matrix product states (MPS), have become fundamental tools in modern quantum many-body physics. While MPS and extensions like the multiscal…

quant-ph2026

Entanglement Barriers from Computational Complexity: Matrix-Product-State Approach to Satisfiability

Tim Pokart, Frank Pollmann, Jan Carl Budich

We approach the 3-SAT satisfiability problem with the quantum-inspired method of imaginary time propagation (ITP) applied to matrix product states (MPS) on a classical computer. Th…