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

arXiv:2510.01998

Erdos-Turan photonic Ising machines with record-high coupling resolution

Huaqiang Li, Guangfeng Wang, Erez Hasman, Bo Wang, Xianfeng Chen

Published Oct 2, 2025• 3 citations
arXivHTMLPDF

Abstract

Ising machines have emerged as promising platforms for efficiently tackling a wide range of combinatorial optimization problems relevant to resource allocation, statistical inference and deep learning, yet their practical utility is fundamentally constrained by the coarse resolution of spin-spin couplings (Jij). Current implementations, relying on direct modulation of physical parameters, achieve at most 256 discrete coupling levels, which severely hinder the faithfully modeling of arbitrary real-valued interactions in realistic applications. Here we present a novel photonic Ising machine that encodes spins in random lattices while programming couplings in the momentum space of light. By introducing the Sidon set-a mathematical structure ensuring pairwise difference uniqueness - and employing the Erdos-Turan bound, we establish an optical framework in which each spin pair can be assigned a unique Jij. This approach decouples the resolution limit from hardware modulation to the spatial precision in the momentum space of light. Experimentally, we demonstrate a record-high coupling resolution of 7,038 on a simple photonic platform, surpassing previous Ising machines. Our results highlight the power of uniting discrete mathematics with momentum-space photonics, paving the way toward scalable Ising machines capable of faithfully modeling real-world optimization problems.

DOI
10.48550/arxiv.2510.01998

Related papers

Photonic Ising Machines with Highest Coupling Resolution

Huaqiang Li, Guangfeng Wang, Erez Hasman +2 more

We present a novel photonic Ising machine based on Sidon set, which demonstrates a record-high coupling resolution. These results pave the way toward Ising machines capable of faithfully modeling real-world optimization problems.

Conference on Lasers and Electro-Optics•Jan 1, 2026•0 citations

Chip-scale wavelength-domain optical Ising machine

Xinyu Liu, Wenkai Zhang, Wenguang Xu +4 more

Ising problems are critical for a wide range of applications. Solving these problems on a photonic platform takes advantage of the unique properties of photons, such as high speed, low power consumption, and large bandwidth. Recently, there has been growing interest in using photonic platforms to accelerate the optimization of Ising models, paving the way for the development of ultrafast hardware in machine learning. However, these proposed systems face challenges in simultaneously achieving high spin scalability, encoding flexibility, and low system complexity. We propose a wavelength-domain optical Ising machine that utilizes optical signals at different wavelengths to represent distinct Ising spins for Ising simulation. We design and experimentally validate a chip-scale Ising machine capable of solving classical non-deterministic polynomial-time problems. The proposed Ising machine supports 32 spins and features 2 distinct coupling encoding schemes. Furthermore, we demonstrate the feasibility of scaling the system to 256 spins. This approach verifies the viability of performing Ising simulations in the wavelength dimension, offering substantial advantages in scalability. These advancements lay the groundwork for future large-scale expansion and practical applications in cloud computing.

Advanced Photonics Nexus•Aug 18, 2025•2 citations

Integrated photonic Ising machine with full connectivity for ultra-large-scale combinatorial optimization

Guanyu Chen, Ziyao Zhang, Yuan Gao +5 more

Abstract Ising machines can efficiently solve real-world combinatorial optimization problems. Among them, photonic Ising machines (PIMs) exploit the parallelism and broadband bandwidth of optical systems to outperform digital computers in certain metrics. However, the bulky footprint of conventional discrete components imposes significant limitations on the miniaturization of current PIMs. Meanwhile, the scalability of problem size and spin connectivity density is constrained by limited computational resources. To address these challenges, we proposed and demonstrated an integrated PIM (IPIM) based on a hybrid architecture on a silicon-based photonic platform with an optical component footprint of 0.065 mm², achieved success rates exceeding 90% in finding global optimal solutions across all three benchmark tests. To tackle the common challenge in PIMs, where large-scale and high-connectivity-density problems naturally incur high computational complexity, we developed a joint algorithm with sparsity, inverse sparsity, and decomposition operations (JA-SID). Using this approach, we successfully solved Ising problems with sparse and dense spin connectivity, involving 102,400 spins. In addition, we introduced an optimized parameter configuration scheme (OPCS), which reduced the iteration count by over 50% for slowly converging problems, thereby lowering time complexity and power consumption. In practice, we used the IPIM to successfully partition a Facebook social network with over 60,000 users, demonstrating its capability to handle ultra-large-scale real-world problems. Our research substantially extended the applicability of IPIM, offering a promising solution to the increasing global demand for computational resources.

•Sep 9, 2026•0 citations

Encoding Arbitrary Ising Hamiltonians on Spatial Photonic Ising Machines

Jason Sakellariou, Alexis Askitopoulos, Georgios Pastras +1 more

Photonic Ising machines constitute an emergent new paradigm of computation geared toward tackling combinatorial optimization problems that can be reduced to the problem of finding the ground state of an Ising model. Spatial photonic Ising machines (SPIMs) have proven advantageous for simulating fully connected large-scale spin systems. Fine control of a general interaction matrix J has been accomplished so far only through matrix decomposition methods. We introduce and experimentally validate a SPIM instance that enables direct control over the full interaction matrix, allowing the encoding of Ising Hamiltonians with arbitrary couplings and connectivity. We demonstrate the conformity of the experimentally measured Ising energy with the theoretically expected value and then proceed to solve both the unweighted and weighted graph partitioning problems, showcasing a systematic convergence to an optimal solution via simulated annealing. Our approach significantly expands the applicability of SPIMs for real-world applications, as it is more efficient than matrix decomposition methods in the case of sparse problems. It paves the way to encoding the full range of NP problems that are known to be equivalent to Ising models on SPIM devices.

arXiv:2407.09161•Physical Review Letters•May 20, 2025•15 citations

Incorporating rank-free coupling and external field via an incoherent modulated spatial photonic Ising machine

Ze Zheng, Yuegang Li, Hang Xu +3 more

Spatial photonic Ising machines offer a novel optical platform for optimization and spin-model simulation, but existing diffraction-based schemes rely on auxiliary spins or multiplexing to encode high-rank couplings and external fields, reducing either speed or spin count. We demonstrate an amplitude-only, rank-free spatial photonic Ising machine in which arbitrary Ising Hamiltonians are encoded as Hadamard products on aligned amplitude and binary spatial modulators and read out by a single-pixel intensity measurement. The machine directly programs fully connected 797-spin Ising models with external fields at nearly 9-bit precision and operates at a constant iteration rate of ~200 Hz. By removing zero-valued product terms, the same architecture scales to sparse problems and experimentally solves a Max-Cut instance on a 424,108-vertex Mobius ladder graph. We also observe the phase transition of the Sherrington-Kirkpatrick model, demonstrating programmable optical simulation beyond low-rank couplings. These results establish amplitude modulation as a scalable route to programmable photonic Ising machines.

arXiv:2512.21587•Dec 25, 2025•2 citations

Ising accelerator with a reconfigurable interferometric photonic processor

Rausell-Campo, José Roberto, Kayed, Nayem Al, Pérez-Lppez, Daniel +3 more

The general-purpose programmable photonic processors offer a scalable and reconfigurable solution for a wide range of RF and optical applications. Therefore, implementing photonic Ising machines using programmable processors leverages the advantages of high speed and parallelism, enabling efficient hardware acceleration for finding ground-state solutions to combinatorial optimization problems. In this work, we demonstrate a novel programmable photonic Ising solver based on a hexagonal mesh general-purpose programmable photonic platform. The integrated system allows reconfigurable matrix multiplication and computes the Hamiltonian iteratively using an annealing algorithm that facilitates spin updates and effectively searches for the ground state. As a proof of concept, we experimentally solve two benchmark optimization problems, a fundamental three-node ferromagnetic coupling problem with external bias that demonstrates nontrivial spin interactions, and a four-node Max-Cut problem with arbitrary coupling matrices. Furthermore, to establish a large-scale capability, we emulated Ising problems with sizes up to N = 50, achieving success probabilities exceeding 80\%. Additionally, we examined the impact of errors, such as phase and coupling, on the performance of the programmable photonic Ising machine. Our general-purpose photonic Ising machine paves the way for implementing large-scale, programmable architectures for solving optimization problems.

arXiv:2511.13284•Nov 17, 2025•1 citation
Ising machines have emerged as promising platforms for efficiently tackling a wide range of combinatorial optimization problems relevant to resource allocation, statistical inference and deep learning, yet their practical utility is fundamentally constrained by the coarse resolution of spin-spin couplings (Jij). Current implementations, relying on direct modulation of physical parameters, achieve at most 256 discrete coupling levels, which severely hinder the faithfully modeling of arbitrary real-valued interactions in realistic applications. Here we present a novel photonic Ising machine that encodes spins in random lattices while programming couplings in the momentum space of light. By introducing the Sidon set-a mathematical structure ensuring pairwise difference uniqueness - and employing the Erdos-Turan bound, we establish an optical framework in which each spin pair can be assigned a unique Jij. This approach decouples the resolution limit from hardware modulation to the spatial precision in the momentum space of light. Experimentally, we demonstrate a record-high coupling resolution of 7,038 on a simple photonic platform, surpassing previous Ising machines. Our results highlight the power of uniting discrete mathematics with momentum-space photonics, paving the way toward scalable Ising machines capable of faithfully modeling real-world optimization problems.
Ising problems are critical for a wide range of applications. Solving these problems on a photonic platform takes advantage of the unique properties of photons, such as high speed, low power consumption, and large bandwidth. Recently, there has been growing interest in using photonic platforms to accelerate the optimization of Ising models, paving the way for the development of ultrafast hardware in machine learning. However, these proposed systems face challenges in simultaneously achieving high spin scalability, encoding flexibility, and low system complexity. We propose a wavelength-domain optical Ising machine that utilizes optical signals at different wavelengths to represent distinct Ising spins for Ising simulation. We design and experimentally validate a chip-scale Ising machine capable of solving classical non-deterministic polynomial-time problems. The proposed Ising machine supports 32 spins and features 2 distinct coupling encoding schemes. Furthermore, we demonstrate the feasibility of scaling the system to 256 spins. This approach verifies the viability of performing Ising simulations in the wavelength dimension, offering substantial advantages in scalability. These advancements lay the groundwork for future large-scale expansion and practical applications in cloud computing.
Abstract Ising machines can efficiently solve real-world combinatorial optimization problems. Among them, photonic Ising machines (PIMs) exploit the parallelism and broadband bandwidth of optical systems to outperform digital computers in certain metrics. However, the bulky footprint of conventional discrete components imposes significant limitations on the miniaturization of current PIMs. Meanwhile, the scalability of problem size and spin connectivity density is constrained by limited computational resources. To address these challenges, we proposed and demonstrated an integrated PIM (IPIM) based on a hybrid architecture on a silicon-based photonic platform with an optical component footprint of 0.065 mm², achieved success rates exceeding 90% in finding global optimal solutions across all three benchmark tests. To tackle the common challenge in PIMs, where large-scale and high-connectivity-density problems naturally incur high computational complexity, we developed a joint algorithm with sparsity, inverse sparsity, and decomposition operations (JA-SID). Using this approach, we successfully solved Ising problems with sparse and dense spin connectivity, involving 102,400 spins. In addition, we introduced an optimized parameter configuration scheme (OPCS), which reduced the iteration count by over 50% for slowly converging problems, thereby lowering time complexity and power consumption. In practice, we used the IPIM to successfully partition a Facebook social network with over 60,000 users, demonstrating its capability to handle ultra-large-scale real-world problems. Our research substantially extended the applicability of IPIM, offering a promising solution to the increasing global demand for computational resources.
Photonic Ising machines constitute an emergent new paradigm of computation geared toward tackling combinatorial optimization problems that can be reduced to the problem of finding the ground state of an Ising model. Spatial photonic Ising machines (SPIMs) have proven advantageous for simulating fully connected large-scale spin systems. Fine control of a general interaction matrix J has been accomplished so far only through matrix decomposition methods. We introduce and experimentally validate a SPIM instance that enables direct control over the full interaction matrix, allowing the encoding of Ising Hamiltonians with arbitrary couplings and connectivity. We demonstrate the conformity of the experimentally measured Ising energy with the theoretically expected value and then proceed to solve both the unweighted and weighted graph partitioning problems, showcasing a systematic convergence to an optimal solution via simulated annealing. Our approach significantly expands the applicability of SPIMs for real-world applications, as it is more efficient than matrix decomposition methods in the case of sparse problems. It paves the way to encoding the full range of NP problems that are known to be equivalent to Ising models on SPIM devices.
Spatial photonic Ising machines offer a novel optical platform for optimization and spin-model simulation, but existing diffraction-based schemes rely on auxiliary spins or multiplexing to encode high-rank couplings and external fields, reducing either speed or spin count. We demonstrate an amplitude-only, rank-free spatial photonic Ising machine in which arbitrary Ising Hamiltonians are encoded as Hadamard products on aligned amplitude and binary spatial modulators and read out by a single-pixel intensity measurement. The machine directly programs fully connected 797-spin Ising models with external fields at nearly 9-bit precision and operates at a constant iteration rate of ~200 Hz. By removing zero-valued product terms, the same architecture scales to sparse problems and experimentally solves a Max-Cut instance on a 424,108-vertex Mobius ladder graph. We also observe the phase transition of the Sherrington-Kirkpatrick model, demonstrating programmable optical simulation beyond low-rank couplings. These results establish amplitude modulation as a scalable route to programmable photonic Ising machines.
The general-purpose programmable photonic processors offer a scalable and reconfigurable solution for a wide range of RF and optical applications. Therefore, implementing photonic Ising machines using programmable processors leverages the advantages of high speed and parallelism, enabling efficient hardware acceleration for finding ground-state solutions to combinatorial optimization problems. In this work, we demonstrate a novel programmable photonic Ising solver based on a hexagonal mesh general-purpose programmable photonic platform. The integrated system allows reconfigurable matrix multiplication and computes the Hamiltonian iteratively using an annealing algorithm that facilitates spin updates and effectively searches for the ground state. As a proof of concept, we experimentally solve two benchmark optimization problems, a fundamental three-node ferromagnetic coupling problem with external bias that demonstrates nontrivial spin interactions, and a four-node Max-Cut problem with arbitrary coupling matrices. Furthermore, to establish a large-scale capability, we emulated Ising problems with sizes up to N = 50, achieving success probabilities exceeding 80\%. Additionally, we examined the impact of errors, such as phase and coupling, on the performance of the programmable photonic Ising machine. Our general-purpose photonic Ising machine paves the way for implementing large-scale, programmable architectures for solving optimization problems.