A recipe for initial points in variational compression of quantum time-evolution operators that provably converges to near-optimal O(N t polylog(N t/ε)) gate complexity for local translationally invariant Hamiltonians.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3representative citing papers
Generalized belief propagation approximates tensor network contractions via hierarchical region messages and fixed-point solutions, demonstrated on Ising, ice, AKLT, and random tensor networks.
citing papers explorer
-
Near-Optimal Quantum Time Evolution Circuits via Provably Convergent Compression
A recipe for initial points in variational compression of quantum time-evolution operators that provably converges to near-optimal O(N t polylog(N t/ε)) gate complexity for local translationally invariant Hamiltonians.
-
Contracting Tensor Networks with Generalized Belief Propagation
Generalized belief propagation approximates tensor network contractions via hierarchical region messages and fixed-point solutions, demonstrated on Ising, ice, AKLT, and random tensor networks.
- From Paper to Program: Externalizing and Diagnosing Knowledge Bottlenecks in AI-Assisted Quantum Many-Body Code Generation