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

Spin Simulators based on Exciton-Polariton Waveguide Networks

Kevin Dini, Simone Zanotti, T. C. H. Liew

Published Nov 4, 2026• 1 citation
arXivHTMLPDF

Abstract

Many NP-hard optimization problems can be mapped onto interacting spin systems, whose ground state encodes the optimal solution. Polaritonic implementations based on gain-dissipative dynamics have recently emerged as promising analog computing platforms owing to their intrinsic parallelism and ultrafast operation. However, existing approaches are hindered by two fundamental limitations: maintaining the homogeneous amplitudes required for faithful problem encoding remains challenging in realistic physical systems, and most architectures are restricted to nearest-neighbour interactions, severely limiting the variety of optimization problems that can be efficiently addressed. We introduce a feasible polaritonic XY simulator based on a reconfigurable waveguide platform that overcomes both limitations. Our approach guarantees amplitude homogeneity while enabling the implementa- tion of arbitrary symmetric coupling matrices, thereby allowing the direct encoding of a wide variety of XY Hamiltonians. These results establish a practical architecture for programmable polaritonic spin simulators and pave the way towards scalable optical hardware for analog optimisation.

DOI
10.48550/arxiv.2611.06087

Related papers

Global optimization of spin Hamiltonians with gain-dissipative systems

Kirill P. Kalinin, Natalia G. Berloff

Recently, several platforms were proposed and demonstrated a proof-of-principle for finding the global minimum of the spin Hamiltonians such as the Ising and XY models using gain-dissipative quantum and classical systems. The implementation of dynamical adjustment of the gain and coupling strengths has been established as a vital feedback mechanism for analog Hamiltonian physical systems that aim to simulate spin Hamiltonians. Based on the principle of operation of such simulators we develop a novel class of gain-dissipative algorithms for global optimisation of NP-hard problems and show its performance in comparison with the classical global optimisation algorithms. These systems can be used to study the ground state and statistical properties of spin systems and as a direct benchmark for the performance testing of the gain-dissipative physical simulators. Our theoretical and numerical estimations suggest that for large problem sizes the analog simulator when built might outperform the classical computer computations by several orders of magnitude under certain assumptions about the simulator operation.

arXiv:1807.00699•Scientific Reports•Dec 6, 2018•64 citations

Optical resonators constitute a universal spin simulator

Wouter Verstraelen, T. C. H. Liew

NP-hard computational problems can be efficiently recast as finding the ground state of an effective spin model. However, to date no convenient setup exists that can universally simulate all of them, even for a fixed problem size. Here we present such a setup, the universal homogeneous spin simulator (UHSS) using a series of optical (or polaritonic) resonators arranged in a chain using the geometry based on the one introduced in [Phys. Rev. Appl. 21, 024057 (2024)]. We demonstrate by example how the simulator solves Hamiltonian cycle and traveling salesman problems, and show that it generalizes to any NP-hard problem of arbitrary size. This approach works because it allows arbitrary long-range interactions in the spin model to be mapped on an optical system with only nearest-neighbor physical interactions.

arXiv:2409.10010•Physical review. B./Physical review. B•Jan 14, 2025•1 citation

Gain-dissipative simulators for large-scale hard classical optimisation

Kirill P. Kalinin, Natalia G. Berloff

Recently several gain-dissipative platforms based on the network of optical parametric oscillators, lasers and various non-equilibrium Bose-Einstein condensates have been proposed as analog Hamiltonian simulators for solving large-scale hard optimisation problems. The parameters of such problems depend on the node occupancies that are not a priory known, which limits the applicability of the gain-dissipative simulators to the classes of problems easily solvable by classical computations. We show how to overcome this difficulty and formulate algorithms for solving the NP-hard large-scale optimisation problems such as constant modulus continuous quadratic optimisation for any general matrix. We show that to solve such problems any gain-dissipative simulator has to implement a feedback mechanism for the dynamical adjustment of the gain, so that occupancy of each node is the same. Based on the principle of operation of such simulators we propose a novel class of classical gain-dissipative algorithms and show its advantage in comparison with classical algorithms. The estimates of the time operation of the physical implementation of the gain-dissipative simulators for large matrices show the speed-up of the several orders of magnitude in comparison with classical computations.

•Apr 24, 2018•3 citations

Programmable and reconfigurable photonic simulator for classical X Y models

Jiayi Ouyang, Yuxuan Liao, Xue Feng +6 more

The ability to simulate XY models of classical spins is rather important, since e.g. it is related to solving NP-hard optimization problems. This study uses a photonic simulator to realize XY Hamiltonians with arbitrary spin connections and coupling strengths. The key unit is an optical system for vector-matrix multiplication that can perform arbitrary transformations of complex matrices. The Berezinskii-Kosterlitz-Thouless transition and ground-state search of several XY models are demonstrated experimentally. Thus this Letter provides an effective alternative approach for investigating such models and solving continuous quadratic optimization problems with optical systems.

arXiv:2401.08055•Physical Review Applied•Aug 1, 2024•6 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

Networks of non-equilibrium condensates for global optimization

Kirill P. Kalinin, Natalia G. Berloff

Recently several gain-dissipative platforms based on the networks of optical parametric oscillators, lasers and various non-equilibrium Bose–Einstein condensates have been proposed and realised as analogue Hamiltonian simulators for solving large-scale hard optimisation problems. However, in these realisations the parameters of the problem depend on the node occupancies that are not known a priori , which limits the applicability of the gain-dissipative simulators to the classes of problems easily solvable by classical computations. We show how to overcome this difficulty and formulate the principles of operation of such simulators for solving the NP-hard large-scale optimisation problems such as constant modulus continuous quadratic optimisation and quadratic binary optimisation for any general matrix. To solve such problems any gain-dissipative simulator has to implement a feedback mechanism for the dynamical adjustment of the gain and coupling strengths.

arXiv:1805.01371•New Journal of Physics•Oct 16, 2018•51 citations
Many NP-hard optimization problems can be mapped onto interacting spin systems, whose ground state encodes the optimal solution. Polaritonic implementations based on gain-dissipative dynamics have recently emerged as promising analog computing platforms owing to their intrinsic parallelism and ultrafast operation. However, existing approaches are hindered by two fundamental limitations: maintaining the homogeneous amplitudes required for faithful problem encoding remains challenging in realistic physical systems, and most architectures are restricted to nearest-neighbour interactions, severely limiting the variety of optimization problems that can be efficiently addressed. We introduce a feasible polaritonic XY simulator based on a reconfigurable waveguide platform that overcomes both limitations. Our approach guarantees amplitude homogeneity while enabling the implementa- tion of arbitrary symmetric coupling matrices, thereby allowing the direct encoding of a wide variety of XY Hamiltonians. These results establish a practical architecture for programmable polaritonic spin simulators and pave the way towards scalable optical hardware for analog optimisation.
Recently, several platforms were proposed and demonstrated a proof-of-principle for finding the global minimum of the spin Hamiltonians such as the Ising and XY models using gain-dissipative quantum and classical systems. The implementation of dynamical adjustment of the gain and coupling strengths has been established as a vital feedback mechanism for analog Hamiltonian physical systems that aim to simulate spin Hamiltonians. Based on the principle of operation of such simulators we develop a novel class of gain-dissipative algorithms for global optimisation of NP-hard problems and show its performance in comparison with the classical global optimisation algorithms. These systems can be used to study the ground state and statistical properties of spin systems and as a direct benchmark for the performance testing of the gain-dissipative physical simulators. Our theoretical and numerical estimations suggest that for large problem sizes the analog simulator when built might outperform the classical computer computations by several orders of magnitude under certain assumptions about the simulator operation.
NP-hard computational problems can be efficiently recast as finding the ground state of an effective spin model. However, to date no convenient setup exists that can universally simulate all of them, even for a fixed problem size. Here we present such a setup, the universal homogeneous spin simulator (UHSS) using a series of optical (or polaritonic) resonators arranged in a chain using the geometry based on the one introduced in [Phys. Rev. Appl. 21, 024057 (2024)]. We demonstrate by example how the simulator solves Hamiltonian cycle and traveling salesman problems, and show that it generalizes to any NP-hard problem of arbitrary size. This approach works because it allows arbitrary long-range interactions in the spin model to be mapped on an optical system with only nearest-neighbor physical interactions.
Recently several gain-dissipative platforms based on the network of optical parametric oscillators, lasers and various non-equilibrium Bose-Einstein condensates have been proposed as analog Hamiltonian simulators for solving large-scale hard optimisation problems. The parameters of such problems depend on the node occupancies that are not a priory known, which limits the applicability of the gain-dissipative simulators to the classes of problems easily solvable by classical computations. We show how to overcome this difficulty and formulate algorithms for solving the NP-hard large-scale optimisation problems such as constant modulus continuous quadratic optimisation for any general matrix. We show that to solve such problems any gain-dissipative simulator has to implement a feedback mechanism for the dynamical adjustment of the gain, so that occupancy of each node is the same. Based on the principle of operation of such simulators we propose a novel class of classical gain-dissipative algorithms and show its advantage in comparison with classical algorithms. The estimates of the time operation of the physical implementation of the gain-dissipative simulators for large matrices show the speed-up of the several orders of magnitude in comparison with classical computations.
The ability to simulate XY models of classical spins is rather important, since e.g. it is related to solving NP-hard optimization problems. This study uses a photonic simulator to realize XY Hamiltonians with arbitrary spin connections and coupling strengths. The key unit is an optical system for vector-matrix multiplication that can perform arbitrary transformations of complex matrices. The Berezinskii-Kosterlitz-Thouless transition and ground-state search of several XY models are demonstrated experimentally. Thus this Letter provides an effective alternative approach for investigating such models and solving continuous quadratic optimization problems with optical systems.
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.
Recently several gain-dissipative platforms based on the networks of optical parametric oscillators, lasers and various non-equilibrium Bose–Einstein condensates have been proposed and realised as analogue Hamiltonian simulators for solving large-scale hard optimisation problems. However, in these realisations the parameters of the problem depend on the node occupancies that are not known a priori , which limits the applicability of the gain-dissipative simulators to the classes of problems easily solvable by classical computations. We show how to overcome this difficulty and formulate the principles of operation of such simulators for solving the NP-hard large-scale optimisation problems such as constant modulus continuous quadratic optimisation and quadratic binary optimisation for any general matrix. To solve such problems any gain-dissipative simulator has to implement a feedback mechanism for the dynamical adjustment of the gain and coupling strengths.