Quantum-Classical Hybrid Algorithm for Solving the Learning-With-Errors Problem on NISQ Devices

Abstract

The Learning-With-Errors (LWE) problem is a fundamental computational challenge with implications for post-quantum cryptography and computational learning theory. Here we propose a quantum-classical hybrid algorithm with Ising model to address LWE, transforming it into the Shortest Vector Problem and using variable qubits to encode lattice vectors into an Ising Hamiltonian. By identifying low-energy Hamiltonian levels, the solution is extracted, making the method suitable for noisy intermediate-scale quantum devices. The required number of qubits is less than $m(m+1)$, where $m$ is the number of samples. Our heuristic algorithm's time complexity depends on the specific quantum eigensolver used to find low-energy levels, and the performance when using the Quantum Approximate Optimization Algorithm is investigated. We validate the algorithm by solving a $2$-dimensional LWE problem on a $5$-qubit quantum device, demonstrating its potential for solving meaningful LWE instances on near-term quantum devices.

References in corpus (7)

• A Quantum Approximate Optimization Algorithm
• Learning with Errors is easy with quantum samples
• Factoring integers with sublinear resources on a superconducting quantum processor
• Two quantum Ising algorithms for the Shortest Vector Problem: one for now and one for later
• Not-so-adiabatic quantum computation for the shortest vector problem
• Variational quantum solutions to the Shortest Vector Problem
• Quantum solvability of noisy linear problems by divide-and-conquer strategy

Cited by in corpus (1)

• Constraint-Aware Quantum Optimization via Hamming Weight Operators