activity
20012008
most citedA note on the classical lower bound for a quantum walk algorithm

10 citations · 25 across the 8 of their papers we have counts for

collaborators
Showing 2001Show all

1 paper · 1 filter

quant-ph2001

Universal quantum computation with two- and three-qubit projective measurements

Stephen A. Fenner, Yong Zhang

We present a finite set of projective measurements that, together with quantum memory and preparation of the |0> state, suffice for universal quantum computation. This extends work…