Skip to content
Preprint

Belief Propagation-based Disentanglers for Tensor Network State Preparation

Aug 2026 · 1 citation · ⚡ 1 influential · 8 references
Physics

TL;DR

A quantum circuit synthesis method for preparing a class of tensor network states tractable with belief propagation (BP), a tensor network gauging scheme which recently allowed for classical simulations at large scales.

Abstract

We develop a quantum circuit synthesis method for preparing a class of tensor network states. The scheme applies to states tractable with belief propagation (BP), a tensor network gauging scheme which recently allowed for classical simulations at large scales. The problem is reduced to independent, strictly local, classical variational optimizations: each nearest-neighbor two-qubit"disentangler"gate minimizes the entropy defined on an edge. Disentanglers drive the state to a product state and their Hermitian conjugate prepares the target. Each disentangling layer has depth at most $z+1$ (with $z$ the maximal number of nearest neighbors per site), the optimization has no barren plateaus, and the bond dimension stays bounded. As a demonstration, with only $3$-$5$ disentangling layers we prepare a $102$-qubit tree tensor network encoding a $17$-dimensional normal distribution and the transverse-field Ising model ground states on a $64$- to $127$-qubit heavy-hex lattice with fidelities of order $0.9-0.999$. The method opens new possibilities for quantum applications by transferring classical tensor network states onto hardware.

View source

Similar papers

Preprint Sep 2026

DMRG using Belief Propagation

Tensor networks have attracted much attention as a powerful tool for modeling quantum many-body systems. Their contraction is a significant challenge, however, especially in highly connected networks, as memory requirements become prohibitive and the optimal contraction order is increasingly hard to find. The belief pr...

Hendrik Kühne, C. Mendl · 0 citations
Preprint Sep 2026

Multivariate quantum state preparation with optimized tensor networks

SCENT (Spectral Clustering for Entanglement miNimizing Trees) is a protocol that utilizes efficiently-computable pairwise entanglement metrics to determine a suitable tree tensor network (TTN) structure, which is efficiently approximated using tensor cross-interpolation (TCI) and substantially outperforms MPS methods a...

Matthew L. Sims-Goh, L. Cincio, Annina Z. Lieberherr et al. · 2 citations
Preprint Oct 2026

Beyond Light Cones: State Preparation Complexity in Quantum Spin Glasses

We introduce a method for studying state preparation complexity in dense quantum $p$-spin Hamiltonians on $n$ qubits, going beyond bounds based only on circuit lightcones. The key input is the class's effective profile complexity, which is derived from the metric entropy of its Pauli profiles. These profiles record exp...

Omar Al-Ghattas, David Gamarnik, B. Kiani · 0 citations
Preprint Sep 2026

Disentangling QAOA: From Weakly Entangled Circuits to a Classical QUBO Solver

This work performs approximate matrix product state simulations for up to 50 qubits and 100 layers and quantifies entanglement by the bond dimension, showing that, in this regime, a substantial fraction of the optimization power of QAOA survives even in the complete absence of entanglement.

B. Bantysh, A. Chernyavskiy, Denis A. Kulikov et al. · 0 citations
Preprint Aug 2026

Sampling isometric tensor network states with monitored quantum circuits

Projected entangled pair states (PEPS) provide an efficient variational ansatz for two-dimensional quantum phases, but computing observables remains challenging because PEPS contraction is generally costly. Here, we parameterize two-dimensional quantum states using variational PEPS subject to isometric constraints and...

Yu-Qing Rong, Huanhai Zhou, Guo-Yi Zhu et al. · 0 citations
Preprint Aug 2026

Hamilton-Zero: A Neural Tensor-Network Foundation Model for Ground States of Arbitrary Quadratic Qubit Hamiltonians

It is demonstrated that this problem can be effectively amortized across an arbitrary and universal set of Hamiltonians by a foundation model with $\sim0.5$B variational parameters, trained with contemporary techniques from large language models and deep reinforcement learning.

Timothy Heightman, Elena Orlova, Philip Mantrov et al. · 1 citation · ⚡1

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.