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)/ε).
Quantum speedup for sampling random spanning trees
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
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)/ε).