Abstract
The variational quantum algorithm (VQA) is a hybrid classical–quantum algorithm. It can actually run in an intermediate-scale quantum device where the number of available qubits is too limited to perform quantum error correction, so it is one of the most promising quantum algorithms in the noisy intermediate-scale quantum era. In this paper, two ideas for solving the learning with errors problem (LWE) using VQA are proposed. First, after reducing the LWE problem into the bounded distance decoding problem, the quantum approximation optimization algorithm (QAOA) is introduced to improve classical methods. Second, after the LWE problem is reduced into the unique shortest vector problem, the variational quantum eigensolver (VQE) is used to solve it, and the number of qubits required is calculated in detail. Small-scale experiments are carried out for the two LWE variational quantum algorithms, and the experiments show that VQA improves the quality of the classical solutions.
Funder
National Natural Science Foundation of China
Subject
General Physics and Astronomy
Reference31 articles.
1. Generating hard instances of lattice problems (extended abstract);Ajtai;Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing (STOC ’96),1996
2. A public-key cryptosystem with worst-case/average-case equivalence;Ajtai;Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing (STOC ’97),1997
3. NTRU: A ring-based public key cryptosystem;Hoffstein,1998
4. On lattices, learning with errors, random linear codes, and cryptography;Regev;Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing (STOC ’05),2005
5. Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems;Applebaum,2009
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献