Work

On the sample complexity of the generalized hidden shift problem over arbitrary finite groups

Year: 2026

Type: preprint

Abstract: We formulate the generalized hidden shift problem over arbitrary finite groups and obtain upper and lower bounds for the sample complexity in terms of group theoretic data.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2609.05828

Author: Zhou, Juntai

Institution: University of Illinois Urbana-Champaign

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: National Science Foundation

Award: FET: Small: NSF-NSERC: Fundamental limits on quantum communications

OpenAlex ID: W7212000800

Cites:

Cited by:

Related to: 10