Any n-qubit QC Hamiltonian sparsifies to Õ(n/ε²) terms preserving all state energies within 1±ε using invariant subspace decomposition and the Alon-Kozma operator inequality.
Lin, and Peter Manohar
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
A near-optimal recovery algorithm for noisy k-XOR achieves the information-theoretic sample scaling with optimal noise dependence and is matched by low-degree lower bounds.
citing papers explorer
-
Quantum Cut Sparsifiers
Any n-qubit QC Hamiltonian sparsifies to Õ(n/ε²) terms preserving all state energies within 1±ε using invariant subspace decomposition and the Alon-Kozma operator inequality.
-
Near Optimal Algorithms for Noisy $k$-XOR under Low-Degree Heuristic
A near-optimal recovery algorithm for noisy k-XOR achieves the information-theoretic sample scaling with optimal noise dependence and is matched by low-degree lower bounds.