3 papers
quant-ph2026
An Improved Quantum Algorithm for 3-Tuple Lattice Sieving
Lynn Engelberts, Yanlin Chen, Amin Shiraz Gilani +3
The assumed hardness of the Shortest Vector Problem in high-dimensional lattices is one of the cornerstones of post-quantum cryptography. The fastest known heuristic attacks on SVP…
quant-ph2025
QuantumBoost: A lazy, yet fast, quantum algorithm for learning with weak hypotheses
Amira Abbas, Yanlin Chen, Tuyen Nguyen +1
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 de…
quant-ph2025
Getting almost all the bits from a quantum random access code
Han-Hsuan Lin, Ronald de Wolf
A quantum random access code (QRAC) is a map that encodes -bit strings into -qubit quantum states , in a way that allows us to recover any one bit of…