Work

Hidden shift problem for complex functions

Year: 2025

Type: preprint

Abstract: 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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2507.19440

Authors: Adonsou, Serge, Bruin, Peter, Ozols, Maris, Stokvis, Joppe

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: Universiteit Leiden, Nederlandse Organisatie voor Wetenschappelijk Onderzoek

Awards: Quantum Software Consortium, G420050720, Higher-Dimensional HIdden Shift Problems

OpenAlex ID: W4416410500

Cites:

Cited by:

Related to: