Quantum Algorithms for Gowers Norm Estimation, Polynomial Testing, and Arithmetic Progression Counting over Finite Abelian Groups
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909718727884800 |
|---|---|
| author | Kuo, En-Jui |
| author_facet | Kuo, En-Jui |
| contents | We propose a family of quantum algorithms for estimating Gowers uniformity norms $ U^k $ over finite abelian groups and demonstrate their applications to testing polynomial structure and counting arithmetic progressions. Building on recent work for estimating the $ U^2 $-norm over $ \mathbb{F}_2^n $, we generalize the construction to arbitrary finite fields and abelian groups for higher values of $ k $. Our algorithms prepare quantum states encoding finite differences and apply Fourier sampling to estimate uniformity norms, enabling efficient detection of structural correlations.
As a key application, we show that for certain degrees $ d = 4, 5, 6 $ and under appropriate conditions on the underlying field, there exist quasipolynomial-time quantum algorithms that distinguish whether a bounded function $ f(x) $ is a degree-$ d $ phase polynomial or far from any such structure. These algorithms leverage recent inverse theorems for Gowers norms, together with amplitude estimation, to reveal higher-order algebraic correlations.
We also develop a quantum method for estimating the number of 3-term arithmetic progressions in Boolean functions $ f : \mathbb{F}_p^n \to \{0,1\} $, based on estimating the $ U^2 $-norm. Though not as query-efficient as Grover-based counting, our approach provides a structure-sensitive alternative aligned with additive combinatorics.
Finally, we demonstrate that our techniques remain valid under certain quantum noise models, due to the shift-invariance of Gowers norms. This enables noise-resilient implementations within the NISQ regime and suggests that Gowers-norm-based quantum algorithms may serve as robust primitives for quantum property testing, learning, and pseudorandomness. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_01231 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Quantum Algorithms for Gowers Norm Estimation, Polynomial Testing, and Arithmetic Progression Counting over Finite Abelian Groups Kuo, En-Jui Quantum Physics Combinatorics Number Theory We propose a family of quantum algorithms for estimating Gowers uniformity norms $ U^k $ over finite abelian groups and demonstrate their applications to testing polynomial structure and counting arithmetic progressions. Building on recent work for estimating the $ U^2 $-norm over $ \mathbb{F}_2^n $, we generalize the construction to arbitrary finite fields and abelian groups for higher values of $ k $. Our algorithms prepare quantum states encoding finite differences and apply Fourier sampling to estimate uniformity norms, enabling efficient detection of structural correlations. As a key application, we show that for certain degrees $ d = 4, 5, 6 $ and under appropriate conditions on the underlying field, there exist quasipolynomial-time quantum algorithms that distinguish whether a bounded function $ f(x) $ is a degree-$ d $ phase polynomial or far from any such structure. These algorithms leverage recent inverse theorems for Gowers norms, together with amplitude estimation, to reveal higher-order algebraic correlations. We also develop a quantum method for estimating the number of 3-term arithmetic progressions in Boolean functions $ f : \mathbb{F}_p^n \to \{0,1\} $, based on estimating the $ U^2 $-norm. Though not as query-efficient as Grover-based counting, our approach provides a structure-sensitive alternative aligned with additive combinatorics. Finally, we demonstrate that our techniques remain valid under certain quantum noise models, due to the shift-invariance of Gowers norms. This enables noise-resilient implementations within the NISQ regime and suggests that Gowers-norm-based quantum algorithms may serve as robust primitives for quantum property testing, learning, and pseudorandomness. |
| title | Quantum Algorithms for Gowers Norm Estimation, Polynomial Testing, and Arithmetic Progression Counting over Finite Abelian Groups |
| topic | Quantum Physics Combinatorics Number Theory |
| url | https://arxiv.org/abs/2508.01231 |