Cédric Pilatte

activity

20182026

most citedUnconditional correctness of recent quantum algorithms for factoring and computing discrete logarithms

5 citations · 12 across the 5 of their papers we have counts for

collaborators

Showing math.NTShow all

4 papers · 1 filter

math.NT2026

Improved bounds for the Fourier uniformity conjecture

Cédric Pilatte

Let $λ$ denote the Liouville function. We prove that $X \leq x < 2 X \sum α \in R / Z sup x \leq n < x + H \sum λ (n) e (n α) = o (H X)$ as…

math.NT2024★ 5 cited

Unconditional correctness of recent quantum algorithms for factoring and computing discrete logarithms

Cédric Pilatte

In 1994, Shor introduced his famous quantum algorithm to factor integers and compute discrete logarithms in polynomial time. In 2023, Regev proposed a multi-dimensional version of…

math.NT2023

Improved bounds for the two-point logarithmic Chowla conjecture

Cédric Pilatte

Let $λ$ be the Liouville function, defined as $λ (n) := (- 1)^{Ω (n)}$ where $Ω (n)$ is the number of prime factors of $n$ with multiplicity. In 2021, Helfgott and Radziwiłł proved tha…

math.NT2023★ 2 cited

A solution to the Erdős-Sárközy-Sós problem on asymptotic Sidon bases of order 3

Cédric Pilatte

A set $S \subset N$ is a Sidon set if all pairwise sums $s_{1} + s_{2}$ (for $s_{1}, s_{2} \in S$ , $s_{1} \leq s_{2}$ ) are distinct. A set $S \subset N$ is an asymptotic basis of o…