PAPER / ARXIV:2609.05828

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

Juntai Zhou

Teoria dos grupos · cruzada Física quântica Complexidade computacional · cruzada

RESUMO

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.

NO MESMO MAPA

Papers relacionados

quant-ph18 de set. de 2026

Hardness of Pathfinding in a Welded Tree

David Miloschewsky , Supartha Podder

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

Papers relacionados

Hardness of Pathfinding in a Welded Tree

Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism

Marton's conjecture in polynomial time

Concise tensors with maximal symmetries

Improved Separations between Quantum and Classical Communication Complexity of Total Functions

Linear equations mod $n$ are pseudo-telepathic