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:2512.21587

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

Ze Zheng, Yuegang Li, Hang Xu, Jingzheng Huang, Tailong Xiao, Guihua Zeng

Published Dec 25, 2025• 2 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2512.21587

Related papers

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

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

Fully Programmable Spatial Photonic Ising Machine by Focal Plane Division

Daniele Veraldi, Davide Pierangeli, Silvia Gentilini +10 more

Ising machines are an emerging class of hardware that promises ultrafast and energy-efficient solutions to NP-hard combinatorial optimization problems. Spatial photonic Ising machines (SPIMs) exploit optical computing in free space to accelerate the computation, showcasing parallelism, scalability, and low power consumption. However, current SPIMs can implement only a restricted class of problems. This partial programmability is a critical limitation that hampers their benchmark. Achieving full programmability of the device while preserving its scalability is an open challenge. Here, we report a fully programmable SPIM achieved through a novel operation method based on the division of the focal plane. In our scheme, a general Ising problem is decomposed into a set of Mattis Hamiltonians, whose energies are simultaneously computed optically by measuring the intensity on different regions of the camera sensor. Exploiting this concept, we experimentally demonstrate the computation with high success probability of ground-state solutions of up to 32-spin Ising models on unweighted maximum cut graphs with and without ferromagnetic bias. Simulations of the hardware prove a favorable scaling of the accuracy with the number of spin. Our fully programmable SPIM enables the implementation of many quadratic unconstrained binary optimization problems, further establishing SPIMs as a leading paradigm in non-von Neumann hardware.

arXiv:2410.10689•Physical Review Letters•Feb 14, 2025•36 citations

Wavelength-division multiplexing optical Ising simulator enabling fully programmable spin couplings and external magnetic fields

Li Luo, Zhiyi Mi, Junyi Huang +1 more

Recently various physical systems have been proposed for modeling Ising spin Hamiltonians appealing to solve combinatorial optimization problems with remarkable performance. However, how to implement arbitrary spin-spin interactions is a critical and challenging problem in unconventional Ising machines. Here, we propose a general gauge transformation scheme to enable arbitrary spin-spin interactions and external magnetic fields as well, by decomposing an Ising Hamiltonian into multiple Mattis-type interactions. With this scheme, a wavelength-division multiplexing spatial photonic Ising machine (SPIM) is developed to show the programmable capability of general spin coupling interactions. We exploit the wavelength-division multiplexing SPIM to simulate three spin systems: ± J models, Sherrington-Kirkpatrick models, and only locally connected J 1 - J 2 models and observe the phase transitions. We also demonstrate the ground-state search for solving Max-Cut problem with the wavelength-division multiplexing SPIM. These results promise the realization of ultrafast-speed and high–power efficiency Boltzmann sampling to a generalized large-scale Ising model.

arXiv:2303.11565•Science Advances•Dec 1, 2023•46 citations

General spatial photonic Ising machine based on the interaction matrix eigendecomposition method

Shaomeng Wang, Wenjia Zhang, Xin Ye +1 more

The spatial photonic Ising machine has achieved remarkable advancements in solving combinatorial optimization problems. However, it still remains a huge challenge to flexibly map an arbitrary problem to the Ising model. In this paper, we propose a general spatial photonic Ising machine based on the interaction matrix eigendecomposition method. The arbitrary interaction matrix can be configured in the two-dimensional Fourier transformation based spatial photonic Ising model by using values generated by matrix eigendecomposition. The error in the structural representation of the Hamiltonian decreases substantially with the growing number of eigenvalues utilized to form the Ising machine. In combination with the optimization algorithm, as low as ∼65% of the eigenvalues are required by intensity modulation to guarantee the best probability of optimal solution for a 20-vertex graph Max-cut problem, and this percentage decreases to below ∼20% for near-zero probability. The 4-spin experiments and error analysis demonstrate the Hamiltonian linear mapping and ergodic optimization. Our work provides a viable approach for spatial photonic Ising machines to solve arbitrary combinatorial optimization problems with the help of the multi-dimensional optical property.

arXiv:2306.10076•Applied Optics•Mar 20, 2024•13 citations

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

Huaqiang Li, Guangfeng Wang, Erez Hasman +2 more

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.

arXiv:2510.01998•Oct 2, 2025•3 citations
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.
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.
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.
Ising machines are an emerging class of hardware that promises ultrafast and energy-efficient solutions to NP-hard combinatorial optimization problems. Spatial photonic Ising machines (SPIMs) exploit optical computing in free space to accelerate the computation, showcasing parallelism, scalability, and low power consumption. However, current SPIMs can implement only a restricted class of problems. This partial programmability is a critical limitation that hampers their benchmark. Achieving full programmability of the device while preserving its scalability is an open challenge. Here, we report a fully programmable SPIM achieved through a novel operation method based on the division of the focal plane. In our scheme, a general Ising problem is decomposed into a set of Mattis Hamiltonians, whose energies are simultaneously computed optically by measuring the intensity on different regions of the camera sensor. Exploiting this concept, we experimentally demonstrate the computation with high success probability of ground-state solutions of up to 32-spin Ising models on unweighted maximum cut graphs with and without ferromagnetic bias. Simulations of the hardware prove a favorable scaling of the accuracy with the number of spin. Our fully programmable SPIM enables the implementation of many quadratic unconstrained binary optimization problems, further establishing SPIMs as a leading paradigm in non-von Neumann hardware.
Recently various physical systems have been proposed for modeling Ising spin Hamiltonians appealing to solve combinatorial optimization problems with remarkable performance. However, how to implement arbitrary spin-spin interactions is a critical and challenging problem in unconventional Ising machines. Here, we propose a general gauge transformation scheme to enable arbitrary spin-spin interactions and external magnetic fields as well, by decomposing an Ising Hamiltonian into multiple Mattis-type interactions. With this scheme, a wavelength-division multiplexing spatial photonic Ising machine (SPIM) is developed to show the programmable capability of general spin coupling interactions. We exploit the wavelength-division multiplexing SPIM to simulate three spin systems: ± J models, Sherrington-Kirkpatrick models, and only locally connected J 1 - J 2 models and observe the phase transitions. We also demonstrate the ground-state search for solving Max-Cut problem with the wavelength-division multiplexing SPIM. These results promise the realization of ultrafast-speed and high–power efficiency Boltzmann sampling to a generalized large-scale Ising model.
The spatial photonic Ising machine has achieved remarkable advancements in solving combinatorial optimization problems. However, it still remains a huge challenge to flexibly map an arbitrary problem to the Ising model. In this paper, we propose a general spatial photonic Ising machine based on the interaction matrix eigendecomposition method. The arbitrary interaction matrix can be configured in the two-dimensional Fourier transformation based spatial photonic Ising model by using values generated by matrix eigendecomposition. The error in the structural representation of the Hamiltonian decreases substantially with the growing number of eigenvalues utilized to form the Ising machine. In combination with the optimization algorithm, as low as ∼65% of the eigenvalues are required by intensity modulation to guarantee the best probability of optimal solution for a 20-vertex graph Max-cut problem, and this percentage decreases to below ∼20% for near-zero probability. The 4-spin experiments and error analysis demonstrate the Hamiltonian linear mapping and ergodic optimization. Our work provides a viable approach for spatial photonic Ising machines to solve arbitrary combinatorial optimization problems with the help of the multi-dimensional optical property.
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.