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

Optics Express

Programmable optoelectronic Ising machine for direct third-order optimization

Xuelong Ma, Zhentong Li, Qi Chen, Zhirong Fan, Zhoujuan Cui, Yangrui You, Zhaofeng Li, Zezhou Tan, JIAMING LV, Ye Xiao, Ming Li

Published Oct 28, 2026• 0 citations
Publisher

Abstract

Many combinatorial problems contain higher-order interactions, motivating physical solvers that implement these objectives without quadratization. We demonstrate an 88-spin programmable higher-order optoelectronic Ising machine that directly optimizes third-order objectives through a hybrid optoelectronic–FPGA loop. Time-multiplexed optoelectronic parametric oscillator pulses carry the evolving physical spin states, while the FPGA evaluates programmable third-order fields for reinjection. Direct higher-order optimization here refers to the complete feedback system, rather than intrinsic optical three-body interactions. Recorded spin and energy trajectories illustrate relaxation, alongside a phenomenological soft-spin simulation. The prototype is evaluated on third-order spin glasses and on reaching at least 98% clause satisfaction in 3-SAT benchmark instances. For this approximate target, the third-order implementation attains lower estimated time and energy to target than the quadratized second-order control over the tested sizes, while requiring fewer auxiliary spins. The experiment demonstrates programmable third-order optimization through the combination of physical spin dynamics and digital interaction-field evaluation.

DOI
10.1364/oe.615074

Related papers

Tripartite Kerr Soliton Ising Machine for Combinatorial Optimization

Nitesh Chauhan, Yan Jin, Jizhao Zang +1 more

We introduce and explore a Kerr soliton Ising machine with all-to-all connectivity and up to tripartite (cubic) interactions, unlocking efficient approaches for combinatorial optimization. The machine is an ensemble of solitons in a Kerr resonator, where a programmable optoelectronic feedback circuit generates amplitude mixing terms involving up to three arbitrary soliton spins in the system Hamiltonian. This capability offers a key advantage for solving canonical NP-complete problems like Boolean satisfiability (SAT) with three literal clauses, substantially reducing the spin overhead compared to quadratic-only Ising mappings. To explore our cubic Ising machine, we solve randomly generated 3-SAT instances of 250 variables and 1000 clauses, approaching the intrinsic satisfiability threshold. Our results highlight Kerr solitons as a flexible and energy-efficient analog computing substrate, with the potential to address challenges in combinatorial optimization, artificial intelligence, and machine learning.

Physical Review Letters•May 18, 2026•0 citations

Programmable optical differential Ising machines

Xin Ye, Wenjia Zhang, Jinmin Yang +1 more

Optical Ising machines provide a hardware approach for combinatorial optimization and physical-system emulation, but their scalability is limited by redundant matrix operations and analog modulation precision. Here we show a programmable optical differential Ising machine that directly evaluates Hamiltonian changes rather than the full Hamiltonian. Numerical simulations from 60 to 2000 spins show that 6-bit analog–digital conversion and 5-bit digital–analog conversion are sufficient to obtain solution quality close to high-precision digital references, with a phase-error tolerance of about 0.3–0.4 rad. Experiments on a dual-channel fiber-optic prototype reproduce phase-transition behavior in representative Ising models and solve MaxCut benchmarks through a multi-spin parallel tempering (PT) routine. The system reaches the best-known cut for the 800-spin G1 instance and 99.66% of the best-known cut for the 2000-spin G22 instance within fewer than 500 PT iterations. These results establish differential optical feedback as a route for scalable Ising-model computation. The authors develop a programmable optical differential Ising machine that directly computes Hamiltonian variations to eliminate redundant full-matrix calculations for Ising combinatorial optimization and physical system emulation. Simulations and fiber-optic prototype experiments verify that the hardware only requires 5-bit DACs and 6-bit ADCs with a phase-error tolerance of 0.3–0.4 rad, and it yields optimal MaxCut solutions for the 800-spin benchmark and 99.66% of the known optimum for the 2000-spin instance via multi-spin parallel tempering.

Communications Physics•Sep 1, 2026•0 citations

General-Purpose Programmable Photonic Circuit as an Ising Hamiltonian Computing Engine

José Roberto Rausell‐Campo, Nayem Al Kayed, Bhavin Shastri +1 more

Photonic Ising machines exploit the intrinsic parallelism and ultrafast speeds of optical hardware to accelerate ground-state searches for combinatorial optimization. By embedding this functionality into a reconfigurable, general-purpose hexagonal-mesh photonic processor, we obtain a scalable platform capable to address diverse optimization tasks. We present a novel optoelectronic Ising solver in which the programmable photonic chip performs on-chip matrix multiplications to evaluate the Hamiltonian, while an electronic simulated-annealing loop drives iterative spin updates. As a proof of concept, we implement our architecture on the 72-unit-cell SmartLight processor and experimentally solve a three-node ferromagnetic coupling problem with external bias. To our knowledge, this constitutes the first demonstration of an Ising machine on a general-purpose hexagonal photonic mesh, paving the way for integrated photonic accelerators in optical computing and signal processing systems.

Asia Communications and Photonics Conference•Nov 5, 2025•0 citations

Large-scale coherent Ising machine based on optoelectronic parametric oscillator

Qizhuang Cen, Hao Ding, Tengfei Hao +8 more

Ising machines based on analog systems have the potential to accelerate the solution of ubiquitous combinatorial optimization problems. Although some artificial spins to support large-scale Ising machines have been reported, e.g., superconducting qubits in quantum annealers and short optical pulses in coherent Ising machines, the spin stability is fragile due to the ultra-low equivalent temperature or optical phase sensitivity. In this paper, we propose to use short microwave pulses generated from an optoelectronic parametric oscillator as the spins to implement a large-scale Ising machine with high stability. The proposed machine supports 25,600 spins and can operate continuously and stably for hours. Moreover, the proposed Ising machine is highly compatible with high-speed electronic devices for programmability, paving a low-cost, accurate, and easy-to-implement way toward solving real-world optimization problems.

Light Science & Applications•Nov 25, 2022•85 citations

Optomechanical Ising Machine

Elizaveta Soboleva, Semyon S. Rudyi, Andrei V. Ivanov

The Ising machine is a promising solver for quadratic unconstrained binary optimization problems. Its core principle is finding the global minimum of the Ising Hamiltonian in a physical system. We developed an alternative optomechanical platform for the Ising machine solver based on a hybrid optical-electrodynamical trap that enables controllable spatial bifurcation to create artificial spin states. In this work, we present a time-multiplexing architecture to solve combinatorial optimization problems on the developed optomechanical platform. Time division multiplexing allows for the scale spin network with Ising spin connections for different graph topologies. We also discuss advantages and challenges of the time-multiplexing concept for a levitodynamical platform with continuous dynamics.

IEEE Magnetics Letters•Jan 1, 2026•0 citations

Evaluating the Performance of Direct Higher-Order Formulations in Combinatorial Optimization Under Simulated Annealing

Kazuki Ikeuchi, Yoshiki Matsuda, Shu Tanaka

Ising machines, including quantum annealing machines, are promising next-generation computers for combinatorial optimization problems. However, due to hardware limitations, most Ising-type hardware can only solve objective functions expressed in linear or quadratic terms of binary variables. Therefore, problems with higher-order terms require an order-reduction process, which increases the number of variables and constraints and may degrade solution quality. In this study, we evaluate the effectiveness of directly solving such problems without order reduction by using a high-performance simulated annealing-based optimization solver capable of handling polynomial unconstrained binary optimization (PUBO) formulations. We compare its performance against a conventional quadratic unconstrained binary optimization (QUBO) solver on the same hardware platform. As benchmarks, we use the low autocorrelation binary sequence (LABS) problem and the vehicle routing problem with distance balancing, both of which naturally include higher-order interactions. Results show that the PUBO solver consistently achieves superior solution quality and stability compared to its QUBO counterpart, while maintaining comparable computational time and requiring no order-reduction compilation indicating potential advantages of directly handling higher-order terms in practical optimization problems.

arXiv:2510.24237•IEEE Access•Jan 1, 2026•5 citations
Many combinatorial problems contain higher-order interactions, motivating physical solvers that implement these objectives without quadratization. We demonstrate an 88-spin programmable higher-order optoelectronic Ising machine that directly optimizes third-order objectives through a hybrid optoelectronic–FPGA loop. Time-multiplexed optoelectronic parametric oscillator pulses carry the evolving physical spin states, while the FPGA evaluates programmable third-order fields for reinjection. Direct higher-order optimization here refers to the complete feedback system, rather than intrinsic optical three-body interactions. Recorded spin and energy trajectories illustrate relaxation, alongside a phenomenological soft-spin simulation. The prototype is evaluated on third-order spin glasses and on reaching at least 98% clause satisfaction in 3-SAT benchmark instances. For this approximate target, the third-order implementation attains lower estimated time and energy to target than the quadratized second-order control over the tested sizes, while requiring fewer auxiliary spins. The experiment demonstrates programmable third-order optimization through the combination of physical spin dynamics and digital interaction-field evaluation.
We introduce and explore a Kerr soliton Ising machine with all-to-all connectivity and up to tripartite (cubic) interactions, unlocking efficient approaches for combinatorial optimization. The machine is an ensemble of solitons in a Kerr resonator, where a programmable optoelectronic feedback circuit generates amplitude mixing terms involving up to three arbitrary soliton spins in the system Hamiltonian. This capability offers a key advantage for solving canonical NP-complete problems like Boolean satisfiability (SAT) with three literal clauses, substantially reducing the spin overhead compared to quadratic-only Ising mappings. To explore our cubic Ising machine, we solve randomly generated 3-SAT instances of 250 variables and 1000 clauses, approaching the intrinsic satisfiability threshold. Our results highlight Kerr solitons as a flexible and energy-efficient analog computing substrate, with the potential to address challenges in combinatorial optimization, artificial intelligence, and machine learning.
Optical Ising machines provide a hardware approach for combinatorial optimization and physical-system emulation, but their scalability is limited by redundant matrix operations and analog modulation precision. Here we show a programmable optical differential Ising machine that directly evaluates Hamiltonian changes rather than the full Hamiltonian. Numerical simulations from 60 to 2000 spins show that 6-bit analog–digital conversion and 5-bit digital–analog conversion are sufficient to obtain solution quality close to high-precision digital references, with a phase-error tolerance of about 0.3–0.4 rad. Experiments on a dual-channel fiber-optic prototype reproduce phase-transition behavior in representative Ising models and solve MaxCut benchmarks through a multi-spin parallel tempering (PT) routine. The system reaches the best-known cut for the 800-spin G1 instance and 99.66% of the best-known cut for the 2000-spin G22 instance within fewer than 500 PT iterations. These results establish differential optical feedback as a route for scalable Ising-model computation. The authors develop a programmable optical differential Ising machine that directly computes Hamiltonian variations to eliminate redundant full-matrix calculations for Ising combinatorial optimization and physical system emulation. Simulations and fiber-optic prototype experiments verify that the hardware only requires 5-bit DACs and 6-bit ADCs with a phase-error tolerance of 0.3–0.4 rad, and it yields optimal MaxCut solutions for the 800-spin benchmark and 99.66% of the known optimum for the 2000-spin instance via multi-spin parallel tempering.
Photonic Ising machines exploit the intrinsic parallelism and ultrafast speeds of optical hardware to accelerate ground-state searches for combinatorial optimization. By embedding this functionality into a reconfigurable, general-purpose hexagonal-mesh photonic processor, we obtain a scalable platform capable to address diverse optimization tasks. We present a novel optoelectronic Ising solver in which the programmable photonic chip performs on-chip matrix multiplications to evaluate the Hamiltonian, while an electronic simulated-annealing loop drives iterative spin updates. As a proof of concept, we implement our architecture on the 72-unit-cell SmartLight processor and experimentally solve a three-node ferromagnetic coupling problem with external bias. To our knowledge, this constitutes the first demonstration of an Ising machine on a general-purpose hexagonal photonic mesh, paving the way for integrated photonic accelerators in optical computing and signal processing systems.
Ising machines based on analog systems have the potential to accelerate the solution of ubiquitous combinatorial optimization problems. Although some artificial spins to support large-scale Ising machines have been reported, e.g., superconducting qubits in quantum annealers and short optical pulses in coherent Ising machines, the spin stability is fragile due to the ultra-low equivalent temperature or optical phase sensitivity. In this paper, we propose to use short microwave pulses generated from an optoelectronic parametric oscillator as the spins to implement a large-scale Ising machine with high stability. The proposed machine supports 25,600 spins and can operate continuously and stably for hours. Moreover, the proposed Ising machine is highly compatible with high-speed electronic devices for programmability, paving a low-cost, accurate, and easy-to-implement way toward solving real-world optimization problems.
The Ising machine is a promising solver for quadratic unconstrained binary optimization problems. Its core principle is finding the global minimum of the Ising Hamiltonian in a physical system. We developed an alternative optomechanical platform for the Ising machine solver based on a hybrid optical-electrodynamical trap that enables controllable spatial bifurcation to create artificial spin states. In this work, we present a time-multiplexing architecture to solve combinatorial optimization problems on the developed optomechanical platform. Time division multiplexing allows for the scale spin network with Ising spin connections for different graph topologies. We also discuss advantages and challenges of the time-multiplexing concept for a levitodynamical platform with continuous dynamics.
Ising machines, including quantum annealing machines, are promising next-generation computers for combinatorial optimization problems. However, due to hardware limitations, most Ising-type hardware can only solve objective functions expressed in linear or quadratic terms of binary variables. Therefore, problems with higher-order terms require an order-reduction process, which increases the number of variables and constraints and may degrade solution quality. In this study, we evaluate the effectiveness of directly solving such problems without order reduction by using a high-performance simulated annealing-based optimization solver capable of handling polynomial unconstrained binary optimization (PUBO) formulations. We compare its performance against a conventional quadratic unconstrained binary optimization (QUBO) solver on the same hardware platform. As benchmarks, we use the low autocorrelation binary sequence (LABS) problem and the vehicle routing problem with distance balancing, both of which naturally include higher-order interactions. Results show that the PUBO solver consistently achieves superior solution quality and stability compared to its QUBO counterpart, while maintaining comparable computational time and requiring no order-reduction compilation indicating potential advantages of directly handling higher-order terms in practical optimization problems.