Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Communications Physics

Solving Learning Parity with Noise on an Optical Coherent Ising Machine

Woji He, Bei Zhou, Qiming Du, Jinchen Xu, Zheng Shan

Published Sep 15, 2026• 0 citations
Publisher

Abstract

The Learning Parity with Noise (LPN) problem is a fundamental hard problem in cryptography and computational learning theory, whose difficulty increases sharply with the noise rate. Here we show that LPN can be reformulated as a combinatorial optimization problem and encoded into an Ising Hamiltonian, enabling solution by physical Ising solvers. As a proof of concept, we solve a structured large-scale case, in which each constraint involves at most two variables, with 512 variables and a 0.45 noise rate on an optical coherent Ising machine (CIM). Numerical experiments using simulated annealing on the same Hamiltonian formulation achieve substantially higher success rates than classical algebraic algorithms in the high-noise regime. This work establishes a physical-computing pathway for the LPN problem, demonstrating that hard algebraic problems can be addressed through Ising-model optimization.

DOI
10.1038/s42005-026-02868-1

Related papers

100,000-spin coherent Ising machine

Toshimori Honjo, Tomohiro Sonobe, Kensuke Inaba +9 more

Computers based on physical systems are increasingly anticipated to overcome the impending limitations on digital computer performance. One such computer is a coherent Ising machine (CIM) for solving combinatorial optimization problems. Here, we report a CIM with 100,512 degenerate optical parametric oscillator pulses working as the Ising spins. We show that the CIM delivers fine solutions to maximum cut problems of 100,000-node graphs drastically faster than standard simulated annealing. Moreover, the CIM, when operated near the phase transition point, provides some extremely good solutions and a very broad distribution. This characteristic will be useful for applications that require fast random sampling such as machine learning.

Science Advances•Sep 29, 2021•370 citations

Analysis of learning with errors problems with variational quantum algorithms

Jinfeng Zeng, Muxi Zheng, Hang Li +2 more

Abstract Variational Quantum Algorithms (VQAs) offer a promising approach to solving optimization problems on quantum computers. In this paper, we investigate the use of VQAs to solve the Learning With Errors (LWE) problem, a crucial challenge in post-quantum cryptography. We propose a VQA-based algorithm and a Quantum Approximate Optimization Algorithm (QAOA) for solving the Learning Parity with Noise (LPN) problem, a special case of LWE. We examine the sample complexity of combinatorial optimization methods for LPN and analyze the performance of these two variational quantum algorithms in terms of quantum resources. For the VQA algorithm, both the number of qubits and the circuit depth scale polynomially with the secret key length n . In the case of QAOA, the number of qubits matches the secret key length n , but the CNOT gate count increases exponentially with n . However, numerical simulations of the VQA-based algorithm show that choosing optimal ansatzes and optimization methods can significantly enhance success rates.

Europhysics Letters (EPL)•May 15, 2025•3 citations

The Learning Stabilizers with Noise Problem

Alexander Poremba, Yihui Quek, Peter W. Shor

Random classical codes have good error correcting properties, and yet they are notoriously hard to decode in practice. Despite many decades of extensive study, the fastest known algorithms still run in exponential time. The Learning Parity with Noise (LPN) problem, which can be seen as the task of decoding a random linear code in the presence of noise, has thus emerged as a prominent hardness assumption with numerous applications in both cryptography and learning theory. Is there a natural quantum analog of the LPN problem? In this work, we introduce the Learning Stabilizers with Noise (LSN) problem, the task of decoding a random stabilizer code in the presence of local depolarizing noise. We give both polynomial-time and exponential-time quantum algorithms for solving LSN in various depolarizing noise regimes, ranging from extremely low noise, to low constant noise rates, and even higher noise rates up to a threshold. Next, we provide concrete evidence that LSN is hard. First, we show that LSN includes LPN as a special case, which suggests that it is at least as hard as its classical counterpart. Second, we prove worst-case to average-case reductions for variants of LSN. We then ask: what is the computational complexity of solving LSN? Because the task features quantum inputs, its complexity cannot be characterized by traditional complexity classes. Instead, we show that the LSN problem lies in a recently introduced (distributional and oracle) unitary synthesis class. Finally, we identify several applications of our LSN assumption, ranging from the construction of quantum bit commitment schemes to the computational limitations of learning from quantum data.

arXiv:2410.18953•Leibniz international proceedings in informatics•Oct 24, 2024•11 citations

Physical coherent Ising machines for solving combinatorial optimization problems

Yoonhyuk Rah, Kyoungsik Yu

Abstract Coherent Ising machines (CIM) have shown promising potential as hardware solvers for tackling combinatorial optimization problems, where discrete variables are encoded onto physical states to form an Ising Hamiltonian. Various platforms, starting from optical parametric oscillators, have been proposed and demonstrated to implement an actual physical CIM. In this review article, we briefly introduce the basic operation principle of CIMs and review physical schemes focusing on MEMS-based nanophotonics.

Japanese Journal of Applied Physics•Feb 27, 2026•1 citation

Coherent Ising machines: models for architectures and applications

Edwin Ng, Tatsuhiro Onodera, Ryotatsu Yanagimoto +3 more

Coherent Ising machines (CIMs) are an experimentally promising class of physics-based computational architectures that embed hard combinatorial optimization problems into systems of coupled nonlinear optical oscillators. The solution-finding mechanisms employed by CIMs feature complicated dynamical bifurcations occurring on a network scale, posing significant challenges to the development of theory and models for their underlying principles of operation. These difficulties are especially pronounced in the ultra-low-power or quantum regimes where the benefits in computational efficiency over conventional optimization algorithms are expected to be largest. We discuss some of our recent approaches and results at this intersection of dynamical systems theory and quantum model reduction, which have highlighted some potentially useful architectures and applications on the horizon for CIMs.

AI and Optical Data Sciences•Mar 9, 2022•0 citations

A single shot coherent Ising machine based on a network of injection-locked multicore fiber lasers

Masoud Babaeian, Dan Trung Nguyen, Veysi Demir +6 more

Combinatorial optimization problems over large and complex systems have many applications in social networks, image processing, artificial intelligence, computational biology and a variety of other areas. Finding the optimized solution for such problems in general are usually in non-deterministic polynomial time (NP)-hard complexity class. Some NP-hard problems can be easily mapped to minimizing an Ising energy function. Here, we present an analog all-optical implementation of a coherent Ising machine (CIM) based on a network of injection-locked multicore fiber (MCF) lasers. The Zeeman terms and the mutual couplings appearing in the Ising Hamiltonians are implemented using spatial light modulators (SLMs). As a proof-of-principle, we demonstrate the use of optics to solve several Ising Hamiltonians for up to thirteen nodes. Overall, the average accuracy of the CIM to find the ground state energy was ~90% for 120 trials. The fundamental bottlenecks for the scalability and programmability of the presented CIM are discussed as well.

Nature Communications•Aug 6, 2019•100 citations
The Learning Parity with Noise (LPN) problem is a fundamental hard problem in cryptography and computational learning theory, whose difficulty increases sharply with the noise rate. Here we show that LPN can be reformulated as a combinatorial optimization problem and encoded into an Ising Hamiltonian, enabling solution by physical Ising solvers. As a proof of concept, we solve a structured large-scale case, in which each constraint involves at most two variables, with 512 variables and a 0.45 noise rate on an optical coherent Ising machine (CIM). Numerical experiments using simulated annealing on the same Hamiltonian formulation achieve substantially higher success rates than classical algebraic algorithms in the high-noise regime. This work establishes a physical-computing pathway for the LPN problem, demonstrating that hard algebraic problems can be addressed through Ising-model optimization.
Computers based on physical systems are increasingly anticipated to overcome the impending limitations on digital computer performance. One such computer is a coherent Ising machine (CIM) for solving combinatorial optimization problems. Here, we report a CIM with 100,512 degenerate optical parametric oscillator pulses working as the Ising spins. We show that the CIM delivers fine solutions to maximum cut problems of 100,000-node graphs drastically faster than standard simulated annealing. Moreover, the CIM, when operated near the phase transition point, provides some extremely good solutions and a very broad distribution. This characteristic will be useful for applications that require fast random sampling such as machine learning.
Abstract Variational Quantum Algorithms (VQAs) offer a promising approach to solving optimization problems on quantum computers. In this paper, we investigate the use of VQAs to solve the Learning With Errors (LWE) problem, a crucial challenge in post-quantum cryptography. We propose a VQA-based algorithm and a Quantum Approximate Optimization Algorithm (QAOA) for solving the Learning Parity with Noise (LPN) problem, a special case of LWE. We examine the sample complexity of combinatorial optimization methods for LPN and analyze the performance of these two variational quantum algorithms in terms of quantum resources. For the VQA algorithm, both the number of qubits and the circuit depth scale polynomially with the secret key length n . In the case of QAOA, the number of qubits matches the secret key length n , but the CNOT gate count increases exponentially with n . However, numerical simulations of the VQA-based algorithm show that choosing optimal ansatzes and optimization methods can significantly enhance success rates.
Random classical codes have good error correcting properties, and yet they are notoriously hard to decode in practice. Despite many decades of extensive study, the fastest known algorithms still run in exponential time. The Learning Parity with Noise (LPN) problem, which can be seen as the task of decoding a random linear code in the presence of noise, has thus emerged as a prominent hardness assumption with numerous applications in both cryptography and learning theory. Is there a natural quantum analog of the LPN problem? In this work, we introduce the Learning Stabilizers with Noise (LSN) problem, the task of decoding a random stabilizer code in the presence of local depolarizing noise. We give both polynomial-time and exponential-time quantum algorithms for solving LSN in various depolarizing noise regimes, ranging from extremely low noise, to low constant noise rates, and even higher noise rates up to a threshold. Next, we provide concrete evidence that LSN is hard. First, we show that LSN includes LPN as a special case, which suggests that it is at least as hard as its classical counterpart. Second, we prove worst-case to average-case reductions for variants of LSN. We then ask: what is the computational complexity of solving LSN? Because the task features quantum inputs, its complexity cannot be characterized by traditional complexity classes. Instead, we show that the LSN problem lies in a recently introduced (distributional and oracle) unitary synthesis class. Finally, we identify several applications of our LSN assumption, ranging from the construction of quantum bit commitment schemes to the computational limitations of learning from quantum data.
Abstract Coherent Ising machines (CIM) have shown promising potential as hardware solvers for tackling combinatorial optimization problems, where discrete variables are encoded onto physical states to form an Ising Hamiltonian. Various platforms, starting from optical parametric oscillators, have been proposed and demonstrated to implement an actual physical CIM. In this review article, we briefly introduce the basic operation principle of CIMs and review physical schemes focusing on MEMS-based nanophotonics.
Coherent Ising machines (CIMs) are an experimentally promising class of physics-based computational architectures that embed hard combinatorial optimization problems into systems of coupled nonlinear optical oscillators. The solution-finding mechanisms employed by CIMs feature complicated dynamical bifurcations occurring on a network scale, posing significant challenges to the development of theory and models for their underlying principles of operation. These difficulties are especially pronounced in the ultra-low-power or quantum regimes where the benefits in computational efficiency over conventional optimization algorithms are expected to be largest. We discuss some of our recent approaches and results at this intersection of dynamical systems theory and quantum model reduction, which have highlighted some potentially useful architectures and applications on the horizon for CIMs.
Combinatorial optimization problems over large and complex systems have many applications in social networks, image processing, artificial intelligence, computational biology and a variety of other areas. Finding the optimized solution for such problems in general are usually in non-deterministic polynomial time (NP)-hard complexity class. Some NP-hard problems can be easily mapped to minimizing an Ising energy function. Here, we present an analog all-optical implementation of a coherent Ising machine (CIM) based on a network of injection-locked multicore fiber (MCF) lasers. The Zeeman terms and the mutual couplings appearing in the Ising Hamiltonians are implemented using spatial light modulators (SLMs). As a proof-of-principle, we demonstrate the use of optics to solve several Ising Hamiltonians for up to thirteen nodes. Overall, the average accuracy of the CIM to find the ground state energy was ~90% for 120 trials. The fundamental bottlenecks for the scalability and programmability of the presented CIM are discussed as well.