Yanlin Chen

Yanlin Chen

Auto-generated profile, based on publicly available information

Yanlin Chen

QuICS

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 August 2026
Verified
Book Chapter
Open access
PDF file
LELynn Engelberts
Lynn Engelberts
YCYanlin Chen
Yanlin Chen
AGAmin Shiraz Gilani
Amin Shiraz Gilani
MHMaya-Iggy van Hoof
Maya-Iggy van Hoof
SJStacey Jeffery
Stacey Jeffery
RWRonald de Wolf
Ronald de Wolf
The assumed hardness of the Shortest Vector Problem (SVP) in high-dimensional lattices is one of the cornerstones of post-quantum cryptography. The fastest known heuristic attacks on SVP are via so-called sieving methods. While these still take exponential time in the dimension d, they are significantly faster than non-heuristic approaches and their heuristic assumptions are verified by extensive experiments. k-Tuple sieving is an iterative method where each iteration takes as input a large number of lattice vectors of a certain norm, and produces an equal number of lattice vectors of slightly smaller norm, by taking sums and differences of k of the input vectors. Iterating these “sieving steps” sufficiently many times produces a short lattice vector. The fastest attacks (both classical and quantum) are for \(k=2\), but taking larger k reduces the amount of memory required for the attack. In this paper we improve the quantum time complexity of 3-tuple sieving from \(2^{0.3098 d}\) to \(2^{0.2846 d}\), using a two-level amplitude amplification aided by a preprocessing step that associates the given lattice vectors with nearby “center points” to focus the search on the neighborhoods of these center points. Our algorithm uses \(2^{0.1887d}\) classical bits and QCRAM bits, and \(2^{o(d)}\) qubits. This is the fastest known quantum algorithm for SVP when total memory is limited to \(2^{0.1887d}\).

6 October 2025 in arXiv
Verified
Preprint
Open access
PDF file
AAAmira Abbas
Amira Abbas
YCYanlin Chen
Yanlin Chen
TNTuyen Nguyen
Tuyen Nguyen
RWRonald de Wolf
Ronald de Wolf
The technique of combining multiple votes to enhance the quality of a decision is the core of boosting algorithms in machine learning. In particular, boosting provably increases decision quality by combining multiple weak learners-hypotheses that are only slightly better than random guessing-into a single strong learner that classifies data well. There exist various versions of boosting algorithms, which we improve upon through the introduction of QuantumBoost. Inspired by classical work by Barak, Hardt and Kale, our QuantumBoost algorithm achieves the best known runtime over other boosting methods through two innovations. First, it uses a quantum algorithm to compute approximate Bregman projections faster. Second, it combines this with a lazy projection strategy, a technique from convex optimization where projections are performed infrequently rather than every iteration. To our knowledge, QuantumBoost is the first algorithm, classical or quantum, to successfully adopt a lazy projection strategy in the context of boosting.