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
fields
quant-ph 3representative citing papers
SQD-AA reduces total query complexity by more than 100x on model distributions and achieves the lowest T-gate counts with 3-4 orders shallower circuits than iQPE for molecular examples.
Quantum trajectory algorithm achieves additive O(T + log(1/ε)) query complexity for simulating dissipative Lindbladians.
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.
-
Sample-Based Quantum Diagonalization with Amplitude Amplification
SQD-AA reduces total query complexity by more than 100x on model distributions and achieves the lowest T-gate counts with 3-4 orders shallower circuits than iQPE for molecular examples.
-
Quantum algorithms based on quantum trajectories
Quantum trajectory algorithm achieves additive O(T + log(1/ε)) query complexity for simulating dissipative Lindbladians.