The quantum query complexity of the abelian hidden subgroup problem - Archive ouverte HAL
Article Dans Une Revue Theoretical Computer Science Année : 2007

Dates et versions

hal-04647082 , version 1 (13-07-2024)

Identifiants

Citer

Pascal Koiran, Vincent Nesme, Natacha Portier. The quantum query complexity of the abelian hidden subgroup problem. Theoretical Computer Science, 2007, 380 (1-2), pp.115-126. ⟨10.1016/j.tcs.2007.02.057⟩. ⟨hal-04647082⟩
23 Consultations
0 Téléchargements

Altmetric

Partager

More