9 citations · 12 across the 6 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
quant-ph2026
Near-optimal quantum query lower bounds on bipartiteness and expansion testing in the bounded-degree graph model
Chandrima Kayal, Sayantan Sen, Dániel Szabó
In this work, we study bipartiteness and expansion testing, two canonical problems in graph property testing in the bounded-degree model through the lens of quantum query complexit…
cs.DS2026
Private Graph Property Testing
Hendrik Fichtenberger, Abigail Gentle, Tamalika Mukherjee +1
Graph property testing asks whether a massive graph satisfies a given property, or is far from doing so, using only a sublinear number of queries to the graph. Since property teste…