most citedFor Distinguishing Conjugate Hidden Subgroups, the Pretty Good Measurement is as Good as it Gets

20 citations · 33 across the 5 of their papers we have counts for

collaborators

5 papers

quant-ph20054 cited

Explicit Multiregister Measurements for Hidden Subgroup Problems

Cristopher Moore, Alexander Russell

We present an explicit measurement in the Fourier basis that solves an important case of the Hidden Subgroup Problem, including the case to which Graph Isomorphism reduces. This en…

quant-ph20053 cited

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…

quant-ph200520 cited

For Distinguishing Conjugate Hidden Subgroups, the Pretty Good Measurement is as Good as it Gets

Cristopher Moore, Alexander Russell

Recently Bacon, Childs and van Dam showed that the ``pretty good measurement'' (PGM) is optimal for the Hidden Subgroup Problem on the dihedral group D_n in the case where the hidd…

quant-ph20052 cited

The Symmetric Group Defies Strong Fourier Sampling: Part I

Cristopher Moore, Alexander Russell, Leonard J. Schulman

We resolve the question of whether Fourier sampling can efficiently solve the hidden subgroup problem. Specifically, we show that the hidden subgroup problem over the symmetric gro…

cs.DS20044 cited

Approximation Algorithms for Minimum PCR Primer Set Selection with Amplification Length and Uniqueness Constraints

K. Konwar, I. Mandoiu, A. Russell +1

A critical problem in the emerging high-throughput genotyping protocols is to minimize the number of polymerase chain reaction (PCR) primers required to amplify the single nucleoti…