249 citations · 389 across the 11 of their papers we have counts for
Showing 2002 · quant-phShow all
3 papers · 2 filters
quant-ph2002★ 40 cited
A 2 rebit gate universal for quantum computing
Terry Rudolph, Lov Grover
We show, within the circuit model, how any quantum computation can be efficiently performed using states with only real amplitudes (a result known within the Quantum Turing Machine…
quant-ph2002★ 249 cited
Creating superpositions that correspond to efficiently integrable probability distributions
Lov Grover, Terry Rudolph
We give a simple and efficient process for generating a quantum superposition of states which form a discrete approximation of any efficiently integrable (such as log concave) prob…
quant-ph2002
An Improved Quantum Scheduling Algorithm
Lov K. Grover
The scheduling problem consists of finding a common 1 in two remotely located N bit strings. Denote the number of 1s in the string with the fewer 1s by epsilon*N. Classically, it n…