Quantum Hidden Subgroup Algorithms: The Devil Is in the Details

Abstract

We conjecture that one of the main obstacles to creating new non-abelian quantum hidden subgroup algorithms is the correct choice of a transversal.

5 pages, to appear in April 2004 Proceedings of SPIE on Quantum Information and Computation

References in corpus (2)

• Quantum factoring, discrete logarithms and the hidden subgroup problem
• Countinuous Quantum Hidden Subgroup Algorithms

Cited by in corpus (1)

• Finite key performance of satellite quantum key distribution under practical constraints