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.
There is a planar graph almost as good as the complete graph
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
Quantum algorithms for triangle listing achieve time Õ(min(n^{5/4}t^{7/12} + n^{7/6}t^{7/9}, m + m^{3/4}t^{1/2}, n^{3/2}t^{1/2})) and enable ε-triangle cut sparsifiers of size Õ(n/ε²) in time Õ(T_q-list + √(mn)/ε).
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.
-
Quantum Algorithms for Triangle Cut Sparsification
Quantum algorithms for triangle listing achieve time Õ(min(n^{5/4}t^{7/12} + n^{7/6}t^{7/9}, m + m^{3/4}t^{1/2}, n^{3/2}t^{1/2})) and enable ε-triangle cut sparsifiers of size Õ(n/ε²) in time Õ(T_q-list + √(mn)/ε).