Similar Items: Heisenberg-limited Hamiltonian learning without short-time control
- Many Hamiltonians Are Sparsifiable
- Contrastive Identification and Generation in the Limit
- Randomized $k$-server in polynomial time
- Smallest suffixient set maintenance in near-real-time
- Solving Hypergraph Laplacian Systems in Almost-Linear Time
- Near-Linear Time Generalized Sinkhorn Algorithms for Bounded Genus Graphs