Belief Propagation-based Disentanglers for Tensor Network State Preparation

• URL: http://arxiv.org/abs/2608.21902v1
• Date: Sat, 22 Aug 2026 10:26:02 GMT
• Title: Belief Propagation-based Disentanglers for Tensor Network State Preparation
• Abstract summary: We develop a quantum circuit synthesis method for preparing a class of tensor network states.<n>The problem is reduced to independent, strictly local, classical variational optimizations.<n>The method opens new possibilities for quantum applications by transferring classical tensor network states onto hardware.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Quantum-classical crossover in fault-tolerant quantum dynamics simulation [56.198154828333685]
  We introduce a scalable fault-tolerant framework that combines coherent observable estimation with a space-time-efficient implementation of non-Clifford rotations.<n>A benchmark against state-of-the-art tensor-network and variational Monte Carlo algorithms reveals a concrete crossover for mixed-field Ising dynamics.
  arXiv  Detail & Related papers  (2026-07-17T16:54:25Z)
• Wavelet Variance Equipartition as a Threshold for World-Model Quality and Quantum Kernel TN-Simulability [0.0]
  We identify the wavelet scaling exponent $$ as a critical diagnostic.<n>We establish $= 1/2$ as a sharp transition boundary for the classical simulability of amplitude-encoded quantum kernels.<n>We prove this variance scales strictly as $Var[X] = (d-2)$.
  arXiv  Detail & Related papers  (2026-05-12T05:41:12Z)
• Disentangling Tensor Network States with Deep Neural Network [20.1390115178447]
  We introduce a variational wave-function ansatz that integrates deep neural networks with tensor-network architectures.<n>In the $$TNS framework, a neural network serves as a disentangler of the wave-function, transforming the physical degrees of freedom into renormalized variables with much less entanglement.<n>This construction yields a compact yet highly expressive representation of strongly correlated quantum states.
  arXiv  Detail & Related papers  (2026-03-15T15:09:00Z)
• Tensor Decomposition Networks for Fast Machine Learning Interatomic Potential Computations [48.46721044282335]
  tensor decomposition networks (TDNs) achieve competitive performance with dramatic speedup in computations.<n>We evaluate TDNs on PubChemQCR, a newly curated molecular relaxation dataset containing 105 million DFT-calculated snapshots.<n>Results show that TDNs achieve competitive performance with dramatic speedup in computations.
  arXiv  Detail & Related papers  (2025-07-01T18:46:27Z)
• Hybrid between biologically inspired and quantum inspired many-body states [0.0]
  We construct variational many-body ansatz from a simple network of perceptrains.<n>The network can be thought of as a neural network with a few distinct features inherited from tensor networks.
  arXiv  Detail & Related papers  (2025-06-05T13:57:48Z)
• Far from Perfect: Quantum Error Correction with (Hyperinvariant) Evenbly Codes [38.729065908701585]
  We introduce a new class of qubit codes that we call Evenbly codes.<n>Our work indicates that Evenbly codes may show promise for practical quantum computing applications.
  arXiv  Detail & Related papers  (2024-07-16T17:18:13Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Tensor Network States with Low-Rank Tensors [6.385624548310884]
  We introduce the idea of imposing low-rank constraints on the tensors that compose the tensor network. With this modification, the time and complexities for the network optimization can be substantially reduced. We find that choosing the tensor rank $r$ to be on the order of the bond $m$, is sufficient to obtain high-accuracy groundstate approximations.
  arXiv  Detail & Related papers  (2022-05-30T17:58:16Z)
• Scalable Lipschitz Residual Networks with Convex Potential Flows [120.27516256281359]
  We show that using convex potentials in a residual network gradient flow provides a built-in $1$-Lipschitz transformation. A comprehensive set of experiments on CIFAR-10 demonstrates the scalability of our architecture and the benefit of our approach for $ell$ provable defenses.
  arXiv  Detail & Related papers  (2021-10-25T07:12:53Z)
• A quantum algorithm for training wide and deep classical neural networks [72.2614468437919]
  We show that conditions amenable to classical trainability via gradient descent coincide with those necessary for efficiently solving quantum linear systems. We numerically demonstrate that the MNIST image dataset satisfies such conditions. We provide empirical evidence for $O(log n)$ training of a convolutional neural network with pooling.
  arXiv  Detail & Related papers  (2021-07-19T23:41:03Z)
• Optimization at the boundary of the tensor network variety [2.1839191255085995]
  tensor network states form a variational ansatz class widely used in the study of quantum many-body systems. Recent work has shown that states on the boundary of this variety can yield more efficient representations for states of physical interest. We show how to optimize over this class in order to find ground states of local Hamiltonians.
  arXiv  Detail & Related papers  (2020-06-30T16:58:55Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.