520 citations · 2.5k across the 46 of their papers we have counts for
4 papers · 1 filter
Efficient quantum processing of ideals in finite rings
Pawel M. Wocjan, Stephen P. Jordan, Hamed Ahmadi +1
Suppose we are given black-box access to a finite ring R, and a list of generators for an ideal I in R. We show how to find an additive basis representation for I in poly(log |R|)…
Permutational Quantum Computing
Stephen P. Jordan
In topological quantum computation the geometric details of a particle trajectory are irrelevant; only the topology matters. Taking this one step further, we consider a model of co…
QMA-complete problems for stoquastic Hamiltonians and Markov matrices
Stephen P. Jordan, David Gosset, Peter J. Love
We show that finding the lowest eigenvalue of a 3-local symmetric stochastic matrix is QMA-complete. We also show that finding the highest energy of a stoquastic Hamiltonian is QMA…
Efficient quantum circuits for arbitrary sparse unitaries
Stephen P. Jordan, Pawel Wocjan
Arbitrary exponentially large unitaries cannot be implemented efficiently by quantum circuits. However, we show that quantum circuits can efficiently implement any unitary provided…