Answers are grounded in this paper and cite their sources.
The Learning With Errors (LWE) problem is fundamental in post-quantum cryptography, and its hardness ensures the security of many lattice-based cryptosystems. This paper proposes a quantum-classical framework for solving Search-LWE instances on real quantum annealing hardware using quantum tunneling to explore a restricted correction space around the Babai solution. First, the Search-LWE is formulated as a lattice decoding problem, and the restricted binary correction space around the Babai solution is encoded into an Ising Hamiltonian. Then, forward and reverse quantum annealing are implemented on the D-Wave Advantage2 to explore the correction space. In particular, reverse quantum annealing uses the Babai solution as the initial state for quantum annealing. The outputs of both quantum annealing schemes are refined by a classical local search to improve solution quality. Experimental results show that both quantum annealing approaches obtain lattice candidates with smaller residual error norms than the Babai solution for a consider-able number of tested instances. Simulated annealing further confirms the effectiveness of the Ising formulation. Moreover, our framework demonstrates successful secret recovery for Search-LWE instances with dimensions up to 15 on D-Wave Advantage2. These results provide a proof of concept on quantum hardware, but do not demonstrate a practical threat to cryptographically relevant LWE-based cryptosystems.
No takes yet. Share an insight, caveat, or question.
Hong et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: