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

IEEE International Conference on Nanotechnology (IEEE-NANO)

A coherent Ising machine based on a network of 100,000 degenerate optical parametric oscillator pulses

Toshimori Honjo, Kensuke Inaba, Takahiro Inagaki, Takuya Ikuta, Yasuhiro Yamada, Hiroki Takesue

Published Jul 4, 2022• 6 citations
Publisher

Abstract

Coherent Ising machines (CIMs) are increasingly anticipated as a new computer that can solve combinatorial optimization problems. CIMs use degenerate optical parametric oscillator pulses as artificial spins. We constructed a 100,512-spin coherent Ising machine, the world's largest. Our CIM can find good solutions to maximum cut problems of 100,000-node graphs ~1000 times faster than simulated annealing. Furthermore, it provides both very good scores and a broad distribution when we operate it near the phase transition point.

DOI
10.1109/nano54668.2022.9928658

Related papers

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•340 citations

Finding independent sets in large-scale graphs with a coherent Ising machine

Hiroki Takesue, Kensuke Inaba, Toshimori Honjo +6 more

Combinatorial optimizers using physical systems, or "Ising machines," have been intensively studied as a way of computation that is more efficient than current digital computers. Here, we demonstrate that a coherent Ising machine (CIM) based on degenerate optical parametric oscillator (DOPO) pulses can find solutions to large-scale maximum independent set problems, which is an essential optimization problem that is closely related to real-world optimization tasks. We implemented a stable external field for each Ising spin as an interaction between a DOPO pulse and a group of ferromagnetically coupled auxiliary pulses. Consequently, the CIM delivered independent sets for dense graphs with up to 40,000 nodes. We compared the performance of the CIM with that of optimized simulated annealing algorithm implemented on a digital computer and found that the CIM outperformed the central processing unit (CPU) in terms of the time needed to obtain good approximate solutions when the graph size exceeded several thousand nodes.

Science Advances•Feb 14, 2025•22 citations

Solving large-scale optimization problems with coherent Ising machine

Hiroki Takesue, Takahiro Inagaki, Kensuke Inaba +1 more

We report a coherent Ising machine (CIM), which is a network of degenerate optical parametric oscillators for simulating the Ising model. Using a long-distance fiber cavity that includes a telecom-band phase sensitive amplifier, we generated large number of degenerate optical parametric oscillator (DOPO) pulses multiplexed in time domain, which represent the Ising spins. By using a measurement and feedback scheme, we could implement all-to-all coupling among 2048 DOPOs. We experimentally confirmed that the CIM could find solutions to maximum cut problems for graphs with as many as 2000 nodes.

Conference on Lasers and Electro-Optics Pacific Rim (CLEO-PR)•Jul 1, 2017•1 citation

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

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•799 citations

A coherent Ising machine with quantum measurement and feedback control

Yoshitaka Haribara, Y. Yamamoto, Ken‐ichi Kawarabayashi +1 more

Combinatorial optimization problems are computationally hard in general, but they are ubiquitous in our modern life. A coherent Ising machine (CIM) based on a multiple-pulse degenerate optical parametric oscillator (DOPO) is an alternative approach to solve these problems by a specialized physical computing system. To evaluate its potential performance, computational experiments are performed on maximum cut (MAX-CUT) problems against traditional algorithms such as semidefinite programming relaxation of Goemans-Williamson and simulated annealing by Kirkpatrick, et al. The numerical results empirically suggest that the almost constant computation time is required to obtain the reasonably accurate solutions of MAX-CUT problems on a CIM with the number of vertices up to $2 \times 10^4$ and the number of edges up to $10^8$.

•Jan 28, 2015•5 citations
Coherent Ising machines (CIMs) are increasingly anticipated as a new computer that can solve combinatorial optimization problems. CIMs use degenerate optical parametric oscillator pulses as artificial spins. We constructed a 100,512-spin coherent Ising machine, the world's largest. Our CIM can find good solutions to maximum cut problems of 100,000-node graphs ~1000 times faster than simulated annealing. Furthermore, it provides both very good scores and a broad distribution when we operate it near the phase transition point.
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.
Combinatorial optimizers using physical systems, or "Ising machines," have been intensively studied as a way of computation that is more efficient than current digital computers. Here, we demonstrate that a coherent Ising machine (CIM) based on degenerate optical parametric oscillator (DOPO) pulses can find solutions to large-scale maximum independent set problems, which is an essential optimization problem that is closely related to real-world optimization tasks. We implemented a stable external field for each Ising spin as an interaction between a DOPO pulse and a group of ferromagnetically coupled auxiliary pulses. Consequently, the CIM delivered independent sets for dense graphs with up to 40,000 nodes. We compared the performance of the CIM with that of optimized simulated annealing algorithm implemented on a digital computer and found that the CIM outperformed the central processing unit (CPU) in terms of the time needed to obtain good approximate solutions when the graph size exceeded several thousand nodes.
We report a coherent Ising machine (CIM), which is a network of degenerate optical parametric oscillators for simulating the Ising model. Using a long-distance fiber cavity that includes a telecom-band phase sensitive amplifier, we generated large number of degenerate optical parametric oscillator (DOPO) pulses multiplexed in time domain, which represent the Ising spins. By using a measurement and feedback scheme, we could implement all-to-all coupling among 2048 DOPOs. We experimentally confirmed that the CIM could find solutions to maximum cut problems for graphs with as many as 2000 nodes.
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.
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.
Combinatorial optimization problems are computationally hard in general, but they are ubiquitous in our modern life. A coherent Ising machine (CIM) based on a multiple-pulse degenerate optical parametric oscillator (DOPO) is an alternative approach to solve these problems by a specialized physical computing system. To evaluate its potential performance, computational experiments are performed on maximum cut (MAX-CUT) problems against traditional algorithms such as semidefinite programming relaxation of Goemans-Williamson and simulated annealing by Kirkpatrick, et al. The numerical results empirically suggest that the almost constant computation time is required to obtain the reasonably accurate solutions of MAX-CUT problems on a CIM with the number of vertices up to 2×1042 \times 10^42×104 and the number of edges up to 10810^8108.