PreprintarXiv licencearXiv
On the sample complexity of the generalized hidden shift problem over arbitrary finite groups
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.
Related
- Arbitrary-Accuracy Neural Approximation with Optimal Neuron Count and Near-Optimal Bit Complexity
- The Quality of Lattice Sequences for Arbitrary Sample Size
- Certificate Complexity of Elementary Symmetric Boolean Functions of Arbitrary Degree
- Accumulated-Variance Functionals of Hidden Markov and Semi-Markov Processes: Finite-Sample Upper and Lower Bounds
- The narrow escape problem in arbitrary dimension
BibTeX
@misc{zhou2026sample,
title = {{On the sample complexity of the generalized hidden shift problem over arbitrary finite groups}},
author = {Juntai Zhou},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.05828},
eprint = {2609.05828},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.05828},
}
RIS
TY - UNPB
TI - On the sample complexity of the generalized hidden shift problem over arbitrary finite groups
AU - Juntai Zhou
PY - 2026
DA - 2026/09/05
PB - arXiv
DO - 10.48550/arxiv.2609.05828
UR - https://arxiv.org/abs/2609.05828
AB - 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.
ER -