Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2507.19440 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866918104415600640 |
|---|---|
| author | Adonsou, Serge Bruin, Peter Ozols, Maris Stokvis, Joppe |
| author_facet | Adonsou, Serge Bruin, Peter Ozols, Maris Stokvis, Joppe |
| contents | We study quantum algorithms for the hidden shift problem of complex scalar- and vector-valued functions on finite abelian groups. Given oracle access to a shifted function and the Fourier transform of the unshifted function, the goal is to find the hidden shift. We analyze the success probability of our algorithms when using a constant number of queries. For bent functions, they succeed with probability 1, while for arbitrary functions the success probability depends on the `bentness' of the function. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_19440 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Hidden shift problem for complex functions Adonsou, Serge Bruin, Peter Ozols, Maris Stokvis, Joppe Quantum Physics 68Q12 We study quantum algorithms for the hidden shift problem of complex scalar- and vector-valued functions on finite abelian groups. Given oracle access to a shifted function and the Fourier transform of the unshifted function, the goal is to find the hidden shift. We analyze the success probability of our algorithms when using a constant number of queries. For bent functions, they succeed with probability 1, while for arbitrary functions the success probability depends on the `bentness' of the function. |
| title | Hidden shift problem for complex functions |
| topic | Quantum Physics 68Q12 |
| url | https://arxiv.org/abs/2507.19440 |