19 citations · 22 across the 2 of their papers we have counts for
4 papers · 1 filter
The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts
Cristopher Moore, Daniel Rockmore, Alexander Russell +1
Many quantum algorithms, including Shor's celebrated factoring and discrete log algorithms, proceed by reduction to a Hidden Subgroup problem, in which an unknown subgroup H of a g…
The Hidden Subgroup Problem in Affine Groups: Basis Selection in Fourier Sampling
Cristopher Moore, Daniel Rockmore, Alexander Russell +1
Many quantum algorithms, including Shor's celebrated factoring and discrete log algorithms, proceed by reduction to a hidden subgroup problem, in which a subgroup H of a group G mu…
Computing with highly mixed states
Andris Ambainis, Leonard J. Schulman, Umesh Vazirani
We consider quantum computing in the k-qubit model where the starting state of a quantum computer consists of k qubits in a pure state and n-k qubits in a maximally mixed state. We…
Scalable NMR Quantum Computation
Leonard J. Schulman, Umesh Vazirani
Nuclear magnetic resonance offers an appealing prospect for implementation of quantum computers, because of the long coherence times associated with nuclear spins, and extensive la…