120 citations · 298 across the 11 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
quant-ph2025★ 1 cited
Parallel Spooky Pebbling Makes Regev Factoring More Practical
Gregory D. Kahanamoku-Meyer, Seyoon Ragavan, Katherine Van Kirk
Pebble games, an abstraction from classical reversible computing, have found use in the design of quantum circuits for inherently sequential tasks. Gidney showed that allowing Hada…
quant-ph2025
A log-depth in-place quantum Fourier transform that rarely needs ancillas
Gregory D. Kahanamoku-Meyer, John Blue, Thiago Bergamaschi +2
When designing quantum circuits for a given unitary, it can be much cheaper to achieve a good approximation on most inputs than on all inputs. In this work we formalize this idea,…