AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (4.4 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access | Just Accepted

Quantum annealing-assisted framework for Search-LWE: a proof-of-concept study on a real quantum computer

Chunlei Hong1, Zhi Pei3, Yidan Chen2, Shuaizhi Xiong1, Yiliang Han4, Shuaishuai Zhu4, Yibo Li5, Chao Wang1,2( )

1 Key Laboratory of Specialty Fiber Optics and Optical Access Networks, Shanghai University, Shanghai 200444, China

2 National and Local Joint Laboratory of Cyberspace Security Technology, Zhengzhou 450000, China

3 College of Software Engineering, Zhengzhou University of Light Industry, Zhengzhou 450002, China

4 Department of the College of Cryptographic Engineering, Engineering University of PAP, Xi’an 710086, China

5 School of Mathematics and Statistics, Hubei University of Education, Wuhan 430205, China

Show Author Information

Abstract

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.

References

【1】
【1】
 
 
Tsinghua Science and Technology

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Hong C, Pei Z, Chen Y, et al. Quantum annealing-assisted framework for Search-LWE: a proof-of-concept study on a real quantum computer. Tsinghua Science and Technology, 2026, https://doi.org/10.26599/TST.2026.9010101

104

Views

2

Downloads

0

Crossref

0

Web of Science

0

Scopus

0

CSCD

Received: 01 April 2026
Revised: 25 August 2026
Accepted: 13 November 2026
Available online: 18 November 2026

© The author(s) 2026.

The articles published in this open access journal are distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/).