A deterministic classical algorithm for the binary-error Learning-with-Errors problem, which is of independent cryptographic interest, and a full sample--time tradeoff that interpolates between exponential and polynomial runtime is established.
Abstract
We study vector subset sum over $\mathbb{F}_3^n$: given $m$ random vectors from $\mathbb{F}_3^n$, find a nonempty subset that sums to zero; the smaller $m$, the more difficult it is to find such a subset. Chen, Liu, and Zhandry (EUROCRYPT'22) introduced an efficient quantum algorithm that solves this problem when $m\approx n^2/2$, where a naive classical algorithm would require exponential time. Subsequently, Kothari, O'Donnell, and Wu (STOC'2026) gave an efficient classical algorithm that only requires $m \approx n^2/3$ vectors, thus removing the hope for an exponential quantum advantage in this parameter regime. Using the framework of Chen, Liu, and Zhandry, we give quantum algorithms that require much fewer input vectors, renewing the possibility of an exponential quantum speedup: for any fixed $\epsilon>0$, our quantum algorithm solves $\mathbb{F}_3$-subset sum in polynomial time with $m=\epsilon\cdot n^2$ vectors. More generally, we establish a full sample--time tradeoff that interpolates between exponential and polynomial runtime. The main ingredient is a deterministic classical algorithm for the binary-error Learning-with-Errors problem, which is of independent cryptographic interest. For this, we rigorously establish a sample--time tradeoff that was predicted by earlier algebraic heuristics. For vector subset sums over larger fields, we also significantly improve classical algorithms in Kothari, O'Donnell, and Wu (STOC'2026).
This work considers the property testing task of determining whether a function has Fourier dimension at most $k, or is $\epsilon$-far from being so, and shows that there is an $O(k/\sqrt{\epsilon})$-query quantum property tester for this problem, which is shown to be almost optimal.
We study quantum random self-reductions for linear problems over finite fields. Let $M\in\mathbb{F}^{n\times n}$ be an arbitrary matrix, and let $\mathcal{O}$ be an oracle that agrees with the linear map $x\mapsto Mx$ on an $\varepsilon$-fraction of inputs $x\sim\mathbb{F}^n$. Given coherent access to $\mathcal{O}$ and...
Vahid R. Asadi, Shuichi Hirahara, Nobutaka Shimizu· arXiv.org· 1 citation
We give a randomized algorithm that, for an $m\times n$ matrix whose columns have Euclidean norm at most one, finds a signing with discrepancy below $99$ in expected $\widetilde O(L_{\mathrm{in}}+n^\omega)$ bit operations, where $L_{\mathrm{in}}$ is the input encoding length and $\omega$ is the exponent of matrix multi...
A quantum-classical separation for Reed-Muller codes punctured at random points is proved, and an efficient classical algorithm under a stronger three-fold multiplication property is given, leaving intermediate regimes as candidates for quantum advantage.
This paper proves that the exact quantum query complexity of f is 4, and uses the same certificate to derive a valid, though not claimed tight, lower bound on the worst-case error of every algorithm using at most three queries.
Guo-Liang Xu, Hao-Ran Zhang, Meng-Fan Wu et al.· 0 citations
This paper presents a new randomized algorithm for solving the exact shortest vector problem. For the $n$-dimensional lattice $\mathcal L$, our algorithm runs in time and space $2^{n/2+o(n)}$. Our algorithm can be viewed as a $q$-ary analogue of the midpoint Hessian for an odd prime $q$; more precisely, we use the fact...
Minki Hhan· 3 citations· ⚡1
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.