A Note on the Quantum Query Complexity of the Hidden Subgroup Problem
Quantum Physics
2007-05-23 v1
Abstract
We are concerned with the Hidden Subgroup Problem for finite groups. We present a simplified analysis of a quantum algorithm proposed by Hallgren, Russell and Ta-Shma as well as a detailed proof of a lower bound on the probability of success of the algorithm.
Keywords
Cite
@article{arxiv.quant-ph/0404067,
title = {A Note on the Quantum Query Complexity of the Hidden Subgroup Problem},
author = {Troels Windfeldt},
journal= {arXiv preprint arXiv:quant-ph/0404067},
year = {2007}
}
Comments
11 pages