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
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Tensor-network compression of nearest-neighbor circuits plus four-type measurements yields 0.4-4.7% error on 8-qubit Hubbard energy gaps and enables QPE-type runs on IBM devices up to 52 qubits with over 4000 two-qubit gates.
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.
-
Tensor-based phase difference estimation on time series analysis
Tensor-network compression of nearest-neighbor circuits plus four-type measurements yields 0.4-4.7% error on 8-qubit Hubbard energy gaps and enables QPE-type runs on IBM devices up to 52 qubits with over 4000 two-qubit gates.