A Note on the Quantum Query Complexity of the Hidden Subgroup Problem

Simple item page
dc.creatorWindfeldt, Troels
dc.date2004-04-11
dc.date.accessioned2026-07-07T06:09:32Z
dc.date.available2026-07-07T06:09:32Z
dc.descriptionWe 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.
dc.description11 pages
dc.identifierhttps://arxiv.org/abs/quant-ph/0404067
dc.identifierhttp://arxiv.org/abs/quant-ph/0404067
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/91991
dc.subjectQuantum Physics
dc.titleA Note on the Quantum Query Complexity of the Hidden Subgroup Problem
dc.typetext

Files

Collections

arXiv