2 citations · 3 across the 2 of their papers we have counts for
4 papers
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…
The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth
Gregory D. Kahanamoku-Meyer, Seyoon Ragavan, Vinod Vaikuntanathan +1
We present a compact quantum circuit for factoring a large class of integers, including some whose classical hardness is expected to be equivalent to RSA (but not including RSA int…
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,…
Fast quantum integer multiplication with zero ancillas
Gregory D. Kahanamoku-Meyer, Norman Y. Yao
The multiplication of superpositions of numbers is a core operation in many quantum algorithms. The standard method for multiplication (both classical and quantum) has a runtime qu…