Quantum
A Quasipolynomial Quantum Algorithm for the Vector Dihedral Coset Problem with Smooth Modulus
Publication: quant-ph updates on arXiv.org
Author: Aparna Gupte
Source published: 17/11/2026, 05:00:00 UTC
Briefing created: 17/11/2026, 08:32:53 UTC
Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 17/11/2026, 08:28:24 UTC.
Briefings
A new quantum algorithm solves the vector dihedral coset problem over Z_q^n when the modulus q is B-smooth, achieving quasipolynomial time and sample complexity. The method reduces the modulus by one prime factor at a time using a sieving procedure based on Ivanyos-Santha's algorithm. This work extends prior results for power-of-two moduli and addresses the extrapolated dihedral coset problem, though it does not provide a new attack on LWE due to sample complexity constraints.
Key points
- The algorithm solves the vector dihedral coset problem over Z_q^n for smooth moduli using quasipolynomial time and sample complexity.
- The method relies on a sieving procedure that clears non-linear terms via Ivanyos-Santha's algorithm to find non-zero vectors in F_p^l.
Context
This research extends previous results for power-of-two moduli and addresses the extrapolated dihedral coset problem, though it does not provide a new attack on LWE due to sample complexity constraints.
Limitations
The algorithm requires quasipolynomially many samples, whereas the known reduction from LWE to EDCP provides only polynomially many clean samples. The main algorithm was obtained in a GPT-5.6 conversation, and the author is responsible for all statements, proofs, and correctness.
Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 17/11/2026, 08:32:53 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.
View archived briefing on IPFS
bafybeifjallzqymm5wbsmkcrxdjfti34ee66edz7o3ofdognb3lm6ccv4a