211 citations · 1.2k across the 74 of their papers we have counts for
5 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|)…
Sampling from the thermal quantum Gibbs state and evaluating partition functions with a quantum computer
David Poulin, Pawel Wocjan
We present a quantum algorithm to prepare the thermal Gibbs state of interacting quantum systems. This algorithm sets a universal upper bound D^alpha on the thermalization time of…
Fast Amplification of QMA
Daniel Nagaj, Pawel Wocjan, Yong Zhang
Given a verifier circuit for a problem in QMA, we show how to exponentially amplify the gap between its acceptance probabilities in the `yes' and `no' cases, with a method that is…
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…
Efficient Circuits for Quantum Walks
Chen-Fu Chiang, Daniel Nagaj, Pawel Wocjan
We present an efficient general method for realizing a quantum walk operator corresponding to an arbitrary sparse classical random walk. Our approach is based on Grover and Rudolph…