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

Coherent chiral computation without optical parametric oscillation

Yong‐Pan Gao, Pengfei Lu, Chuan Wang

Published Jun 27, 2022• 0 citations
arXivHTMLPDF

Abstract

The challenge posted by modern science is to find a way to compute the NP-hard problem. Here we present a coherent computation model based on the whispering-gallery mode micro-resonators. We introduce the optically connected micro-resonators array to simulate the dynamical evolution of the Ising model with full connection while the mode chirality of the micro-resonators works as the spins of each node in the Ising model. The relaxation time, the steady state distribution, and the mode connection of the Ising spin chain are simulated with the proposed optical system. Moreover, it is found that the current scheme could be used for searching the full solutions of the corresponding Ising problem. Numerical results show that the time required is constant time. Our approach achieves high accuracy and fast computation in the realization of unconventional optimization hardware.

DOI
10.48550/arxiv.2206.13060

Related papers

Combinatorial optimization with a network of degenerated optical parametric oscillators

Takahiro Inagaki, Kensuke Inaba, Toshimori Honjo +4 more

Various artificial spin systems with networked physical devices are now emerging as a way to simulate the Ising model. Combinatorial optimization problems for many applications can be mapped onto ground state search problems of the Ising model and solved efficiently with the artificial spin system. Here, we report a coherent Ising machine based on 2,048 networked degenerate optical parametric oscillators. All-to-all couplings were achieved with a measurement and feedback scheme to implement arbitrary graph structures with up to 2,048 nodes. The coherent Ising machine can simulate large-scale Ising model and obtain good solutions for the optimization of a 2,000-node complete graph.

OSA Advanced Photonics Congress•Jan 1, 2019•0 citations

Coherent Ising machine based on degenerate optical parametric oscillators

Zhe Wang, Alireza Marandi, Kai Wen +2 more

A degenerate optical parametric oscillator network is proposed to solve the NP-hard problem of finding a ground state of the Ising model. The underlying operating mechanism originates from the bistable output phase of each oscillator and the inherent preference of the network in selecting oscillation modes with the minimum photon decay rate. Computational experiments are performed on all instances reducible to the NP-hard MAX-CUT problems on cubic graphs of order up to 20. The numerical results reasonably suggest the effectiveness of the proposed network.

arXiv:1311.2696•Physical Review A•Dec 30, 2013•413 citations

A coherent Ising machine for 2000-node optimization problems

Takahiro Inagaki, Yoshitaka Haribara, Koji Igarashi +14 more

The analysis and optimization of complex systems can be reduced to mathematical problems collectively known as combinatorial optimization. Many such problems can be mapped onto ground-state search problems of the Ising model, and various artificial spin systems are now emerging as promising approaches. However, physical Ising machines have suffered from limited numbers of spin-spin couplings because of implementations based on localized spins, resulting in severe scalability problems. We report a 2000-spin network with all-to-all spin-spin couplings. Using a measurement and feedback scheme, we coupled time-multiplexed degenerate optical parametric oscillators to implement maximum cut problems on arbitrary graph topologies with up to 2000 nodes. Our coherent Ising machine outperformed simulated annealing in terms of accuracy and computation time for a 2000-node complete graph.

Science•Oct 21, 2016•835 citations

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

A poor man’s coherent Ising machine based on opto-electronic feedback systems for solving optimization problems

Fabian Böhm, Guy Verschaffelt, Guy Van der Sande

Coherent Ising machines (CIMs) constitute a promising approach to solve computationally hard optimization problems by mapping them to ground state searches of the Ising model and implementing them with optical artificial spin-networks. However, while CIMs promise speed-ups over conventional digital computers, they are still challenging to build and operate. Here, we propose and test a concept for a fully programmable CIM, which is based on opto-electronic oscillators subjected to self-feedback. Contrary to current CIM designs, the artificial spins are generated in a feedback induced bifurcation and encoded in the intensity of coherent states. This removes the necessity for nonlinear optical processes or large external cavities and offers significant advantages regarding stability, size and cost. We demonstrate a compact setup for solving MAXCUT optimization problems on regular and frustrated graphs with 100 spins and can report similar or better performance compared to CIMs based on degenerate optical parametric oscillators.

Nature Communications•Aug 8, 2019•231 citations

Combinatorial Optimization with Coherent Ising Machines based on Degenerate Optical Parametric Oscillators

Y. Yamamoto

The basic concept, principle and implementation of coherent Ising machines are presented. A fully programmable 100 spin machine with all-to-all connections solves ground states and randomly samples low-energy excited states of NP-hard Ising problems.

Frontiers in Optics•Jan 1, 2016•0 citations
The challenge posted by modern science is to find a way to compute the NP-hard problem. Here we present a coherent computation model based on the whispering-gallery mode micro-resonators. We introduce the optically connected micro-resonators array to simulate the dynamical evolution of the Ising model with full connection while the mode chirality of the micro-resonators works as the spins of each node in the Ising model. The relaxation time, the steady state distribution, and the mode connection of the Ising spin chain are simulated with the proposed optical system. Moreover, it is found that the current scheme could be used for searching the full solutions of the corresponding Ising problem. Numerical results show that the time required is constant time. Our approach achieves high accuracy and fast computation in the realization of unconventional optimization hardware.
Various artificial spin systems with networked physical devices are now emerging as a way to simulate the Ising model. Combinatorial optimization problems for many applications can be mapped onto ground state search problems of the Ising model and solved efficiently with the artificial spin system. Here, we report a coherent Ising machine based on 2,048 networked degenerate optical parametric oscillators. All-to-all couplings were achieved with a measurement and feedback scheme to implement arbitrary graph structures with up to 2,048 nodes. The coherent Ising machine can simulate large-scale Ising model and obtain good solutions for the optimization of a 2,000-node complete graph.
A degenerate optical parametric oscillator network is proposed to solve the NP-hard problem of finding a ground state of the Ising model. The underlying operating mechanism originates from the bistable output phase of each oscillator and the inherent preference of the network in selecting oscillation modes with the minimum photon decay rate. Computational experiments are performed on all instances reducible to the NP-hard MAX-CUT problems on cubic graphs of order up to 20. The numerical results reasonably suggest the effectiveness of the proposed network.
The analysis and optimization of complex systems can be reduced to mathematical problems collectively known as combinatorial optimization. Many such problems can be mapped onto ground-state search problems of the Ising model, and various artificial spin systems are now emerging as promising approaches. However, physical Ising machines have suffered from limited numbers of spin-spin couplings because of implementations based on localized spins, resulting in severe scalability problems. We report a 2000-spin network with all-to-all spin-spin couplings. Using a measurement and feedback scheme, we coupled time-multiplexed degenerate optical parametric oscillators to implement maximum cut problems on arbitrary graph topologies with up to 2000 nodes. Our coherent Ising machine outperformed simulated annealing in terms of accuracy and computation time for a 2000-node complete graph.
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.
Coherent Ising machines (CIMs) constitute a promising approach to solve computationally hard optimization problems by mapping them to ground state searches of the Ising model and implementing them with optical artificial spin-networks. However, while CIMs promise speed-ups over conventional digital computers, they are still challenging to build and operate. Here, we propose and test a concept for a fully programmable CIM, which is based on opto-electronic oscillators subjected to self-feedback. Contrary to current CIM designs, the artificial spins are generated in a feedback induced bifurcation and encoded in the intensity of coherent states. This removes the necessity for nonlinear optical processes or large external cavities and offers significant advantages regarding stability, size and cost. We demonstrate a compact setup for solving MAXCUT optimization problems on regular and frustrated graphs with 100 spins and can report similar or better performance compared to CIMs based on degenerate optical parametric oscillators.