225 citations · 582 across the 52 of their papers we have counts for
Showing 2011 · quant-phShow all
2 papers · 2 filters
quant-ph2011★ 22 cited
A learning graph based quantum query algorithm for finding constant-size subgraphs
Troy Lee, Frederic Magniez, Miklos Santha
Let be a fixed -vertex graph with edges and minimum degree . We use the learning graph framework of Belovs to show that the bounded-error quantum query complexity…
quant-ph2011★ 9 cited
Hidden Symmetry Subgroup Problems
Thomas Decker, Gábor Ivanyos, Miklos Santha +1
We advocate a new approach of addressing hidden structure problems and finding efficient quantum algorithms. We introduce and investigate the Hidden Symmetry Subgroup Problem (HSSP…