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.
Chain Length and CSPs Learnable with Few Queries , booktitle =
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
years
2026 4verdicts
UNVERDICTED 4representative citing papers
Dynamic programming over non-redundant constraints yields 4^n time for an NP-hard IA fragment and asymptotically matches the o(n)^n bound for RCC.
Authors reframe gadget reductions for CSP non-redundancy using hypergraph projections and shrinking factors to obtain improved super-linear lower bounds for select predicates, with SAT solvers used to discover reductions automatically.
Many r-local Hamiltonians, including Pauli strings, random high-rank operators, and high-rank operators, admit sparsifications with o(n^r) terms that (1±ε)-approximate the original Hamiltonian on all states.
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.
-
Towards Single Exponential Time for Temporal and Spatial Reasoning: A Study via Redundancy and Dynamic Programming
Dynamic programming over non-redundant constraints yields 4^n time for an NP-hard IA fragment and asymptotically matches the o(n)^n bound for RCC.
-
Super-linear Lower Bounds for CSP Non-Redundancy via Shrinking Instances
Authors reframe gadget reductions for CSP non-redundancy using hypergraph projections and shrinking factors to obtain improved super-linear lower bounds for select predicates, with SAT solvers used to discover reductions automatically.
-
Many Hamiltonians Are Sparsifiable
Many r-local Hamiltonians, including Pauli strings, random high-rank operators, and high-rank operators, admit sparsifications with o(n^r) terms that (1±ε)-approximate the original Hamiltonian on all states.