Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This research presents a novel quantum circuit synthesis method that efficiently prepares large-scale tensor network states using belief propagation-based disentanglers. By reducing the problem to local classical optimizations, the approach achieves high fidelities on systems ranging from 64 to 127 qubits without suffering from barren plateaus. The work demonstrates a practical pathway for transferring complex classical tensor network simulations onto near-term quantum hardware.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Belief Propagation-based Disentanglers for Tensor Network State Preparation

arXiv2 min read

arXiv:2608.21902v1 Announce Type: new 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.

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.

5+2+5 pages, 4+1+2 figures. Comments welcome!

arXiv:2608.21902 [quant-ph]

(or arXiv:2608.21902v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2608.21902 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 259 words

Related coverage