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

Journal of Applied Physics

Statistical mechanics of CDMA multiuser detector implemented in coherent Ising machine

Toru Aonishi, Kazushi Mimura, Masato Okada, Y. Yamamoto

Published Dec 17, 2018• 9 citations
Publisher

Abstract

The scalability and computational ability of the coherent Ising machine (CIM) have made it attract attention as one of the most effective Ising computing architectures for solving large-scale optimization problems. However, the theory and techniques of equilibrium classical thermodynamics cannot be directly applied to the CIM because it is an open-dissipative system. In an attempt to adapt the theory and techniques to the CIM, we have used a canonical frustrated model of Ising computation called the CDMA (Code Division Multiple Access) multiuser detector. Here, we derive a macroscopic equation to estimate the critical value of the spreading factor for achieving a low bit error rate as a function of the normalized pump rate in the CIM-implemented CDMA multiuser detector.

DOI
10.1063/1.5041998

Related papers

Coherent Ising machines—Quantum optics and neural network Perspectives

Y. Yamamoto, T. Leleu, Surya Ganguli +1 more

A coherent Ising machine (CIM) is a network of optical parametric oscillators (OPOs), in which the “strongest” collective mode of oscillation at well above threshold corresponds to an optimum solution of a given Ising problem. When a pump rate or network coupling rate is increased from below to above threshold, however, the eigenvectors with the smallest eigenvalue of the Ising coupling matrix [Jij] appear near threshold and impede the machine to relax to true ground states. Two complementary approaches to attack this problem are described here. One approach is to utilize the squeezed/anti-squeezed vacuum noise of OPOs below threshold to produce coherent spreading over numerous local minima via quantum noise correlation, which could enable the machine to access either true ground states or excited states with eigen-energies close enough to that of ground states above threshold. The other approach is to implement a real-time error correction feedback loop so that the machine migrates from one local minimum to another during an explorative search for ground states. Finally, a set of qualitative analogies connecting the CIM and traditional computer science techniques are pointed out. In particular, belief propagation and survey propagation used in combinatorial optimization are touched upon.

arXiv:2006.05649•Applied Physics Letters•Oct 19, 2020•96 citations

Coherent Ising machines based on optical parametric oscillators

Hideo Mabuchi, Surya Ganguli, Daniel Wennberg +3 more

Coherent Ising Machines (CIMs) are an emerging class of computational architectures that embed hard combinatorial optimization problems in the continuous dynamics of a physical system with analog degrees of freedom. While crisp theoretical results on the ultimate performance and scaling of such architectures are lacking, large-scale experimental prototypes have begun to exhibit promising results in practice. Our team at Stanford has begun to study the fundamental properties of CIM dynamics using a combination of techniques from statistical physics, random matrices, and dynamical systems theory. Many connections to recent work in neuroscience and deep learning are noted. Our work focuses specifically on CIMs that utilize the nonlinear threshold behavior of optical parametric oscillators to effect a soft (potentially glassy) transition between linear and binary dynamical regimes.

AI and Optical Data Sciences•Mar 4, 2021•0 citations

Coherent Ising machines: models for architectures and applications

Edwin Ng, Tatsuhiro Onodera, Ryotatsu Yanagimoto +3 more

Coherent Ising machines (CIMs) are an experimentally promising class of physics-based computational architectures that embed hard combinatorial optimization problems into systems of coupled nonlinear optical oscillators. The solution-finding mechanisms employed by CIMs feature complicated dynamical bifurcations occurring on a network scale, posing significant challenges to the development of theory and models for their underlying principles of operation. These difficulties are especially pronounced in the ultra-low-power or quantum regimes where the benefits in computational efficiency over conventional optimization algorithms are expected to be largest. We discuss some of our recent approaches and results at this intersection of dynamical systems theory and quantum model reduction, which have highlighted some potentially useful architectures and applications on the horizon for CIMs.

AI and Optical Data Sciences•Mar 9, 2022•0 citations

Performance Dependence of Optical-Loop-Based Coherent Ising Machine on Operating Conditions

Kyo Inoue, Shogo Kitahara, Koji Igarashi

Coherent Ising machines (CIMs) are optical computers designed to solve combinatorial optimization problems based on the Ising model. Among several variants, the optical-loop-based CIM, which utilizes optical pulses with binary phases circulating in a loop equipped with a pulse-pumped phase-sensitive amplifier (PSA) and a measurement feedback circuit, has experimentally demonstrated high performance in terms of the number of pulses and connectivity. This study numerically investigates the dependence of its calculation performance on operating conditions such as the noise level, coupling strength between pulses, and PSA pump increment rate. The CIM solving Max-Cut problems is simulated using a difference equation based on a traveling-wave model under various operating conditions. The results indicate that noise is not a critical factor, there is an optimal condition for the coupling strength, depending on the graph structure, and slower pump-increment rate leads to higher scores. Under optimal conditions, the simulation produces better calculation results than those previously reported in an experimental study.

IEEE Journal of Quantum Electronics•Jun 25, 2025•0 citations

Mean field analysis of reverse annealing for code-division multiple-access multiuser detection

Shunta Arai, Masayuki Ohzeki, Kazuyuki Tanaka

Code-division multiple-access (CDMA) multiuser detection is a kind of signal recovery problem. The main problem of CDMA multiuser detection is to estimate the original signal from the degraded information. In CDMA multiuser detection, the first-order phase transition happens. The first-order phase transition degrades the estimation performance. To avoid or mitigate the first-order phase transition, we apply adiabatic reverse annealing (ARA) to CDMA multiuser detection. In ARA, we introduce the initial Hamiltonian, which corresponds to the prior information of the original signal into quantum annealing (QA) formulation. The ground state of the initial Hamiltonian is the initial candidate solution. By using the prior information of the original signal, ARA enhances the performance of QA for CDMA multiuser detection. We evaluate the typical ARA performance of CDMA multiuser detection by means of statistical mechanics using the replica method. At first, we consider the oracle cases where the initial candidate solution is randomly generated with a fixed fraction of the original signal in the initial state. In the oracle cases, the first-order phase transition can be avoided or mitigated by ARA if we prepare for the proper initial candidate solution. We validate our theoretical analysis with quantum Monte Carlo simulations. The theoretical results to avoid the first-order phase transition are consistent with the numerical results. Next, we consider the practical cases where we prepare for the initial candidate solution obtained by commonly used algorithms. We show that the practical algorithms can exceed the threshold to avoid the first-order phase transition. Finally, we test the performance of ARA with the initial candidate solution obtained by the practical algorithm. In this case, ARA cannot avoid the first-order phase transition even if the initial candidate solution exceeds the threshold to avoid the first-order phase transition.

arXiv:2004.11066•Physical Review Research•Jul 2, 2021•42 citations

Frustration Elimination and Excited State Search in Coherent Ising Machines

Zheng-Yang Zhou, Clemens Gneiting, J. Q. You +1 more

Frustration, that is, the impossibility of satisfying the energetic preferences between all spin pairs simultaneously, underlies the complexity of many fundamental properties in spin systems, including the computational difficulty in determining their ground states. Coherent Ising machines (CIMs) have been proposed as a promising analog computational approach to efficiently find different degenerate ground states of large and complex Ising models. However, CIMs also face challenges in solving frustrated Ising models: frustration not only reduces the probability of finding good solutions, but it also prohibits the leveraging of quantum effects in doing so. To circumvent these detrimental effects of frustration, we show how frustrated Ising models can be mapped to frustration-free CIM configurations by including ancillary modes and modifying the coupling protocol used in current CIM designs. Such frustration elimination may empower current CIMs to benefit from quantum effects in dealing with frustrated Ising models. In addition, these ancillary modes can also enable error detection and searching for excited states.

arXiv:2402.15090•Physical Review Letters•Mar 5, 2025•8 citations
The scalability and computational ability of the coherent Ising machine (CIM) have made it attract attention as one of the most effective Ising computing architectures for solving large-scale optimization problems. However, the theory and techniques of equilibrium classical thermodynamics cannot be directly applied to the CIM because it is an open-dissipative system. In an attempt to adapt the theory and techniques to the CIM, we have used a canonical frustrated model of Ising computation called the CDMA (Code Division Multiple Access) multiuser detector. Here, we derive a macroscopic equation to estimate the critical value of the spreading factor for achieving a low bit error rate as a function of the normalized pump rate in the CIM-implemented CDMA multiuser detector.
A coherent Ising machine (CIM) is a network of optical parametric oscillators (OPOs), in which the “strongest” collective mode of oscillation at well above threshold corresponds to an optimum solution of a given Ising problem. When a pump rate or network coupling rate is increased from below to above threshold, however, the eigenvectors with the smallest eigenvalue of the Ising coupling matrix [Jij] appear near threshold and impede the machine to relax to true ground states. Two complementary approaches to attack this problem are described here. One approach is to utilize the squeezed/anti-squeezed vacuum noise of OPOs below threshold to produce coherent spreading over numerous local minima via quantum noise correlation, which could enable the machine to access either true ground states or excited states with eigen-energies close enough to that of ground states above threshold. The other approach is to implement a real-time error correction feedback loop so that the machine migrates from one local minimum to another during an explorative search for ground states. Finally, a set of qualitative analogies connecting the CIM and traditional computer science techniques are pointed out. In particular, belief propagation and survey propagation used in combinatorial optimization are touched upon.
Coherent Ising Machines (CIMs) are an emerging class of computational architectures that embed hard combinatorial optimization problems in the continuous dynamics of a physical system with analog degrees of freedom. While crisp theoretical results on the ultimate performance and scaling of such architectures are lacking, large-scale experimental prototypes have begun to exhibit promising results in practice. Our team at Stanford has begun to study the fundamental properties of CIM dynamics using a combination of techniques from statistical physics, random matrices, and dynamical systems theory. Many connections to recent work in neuroscience and deep learning are noted. Our work focuses specifically on CIMs that utilize the nonlinear threshold behavior of optical parametric oscillators to effect a soft (potentially glassy) transition between linear and binary dynamical regimes.
Coherent Ising machines (CIMs) are an experimentally promising class of physics-based computational architectures that embed hard combinatorial optimization problems into systems of coupled nonlinear optical oscillators. The solution-finding mechanisms employed by CIMs feature complicated dynamical bifurcations occurring on a network scale, posing significant challenges to the development of theory and models for their underlying principles of operation. These difficulties are especially pronounced in the ultra-low-power or quantum regimes where the benefits in computational efficiency over conventional optimization algorithms are expected to be largest. We discuss some of our recent approaches and results at this intersection of dynamical systems theory and quantum model reduction, which have highlighted some potentially useful architectures and applications on the horizon for CIMs.
Coherent Ising machines (CIMs) are optical computers designed to solve combinatorial optimization problems based on the Ising model. Among several variants, the optical-loop-based CIM, which utilizes optical pulses with binary phases circulating in a loop equipped with a pulse-pumped phase-sensitive amplifier (PSA) and a measurement feedback circuit, has experimentally demonstrated high performance in terms of the number of pulses and connectivity. This study numerically investigates the dependence of its calculation performance on operating conditions such as the noise level, coupling strength between pulses, and PSA pump increment rate. The CIM solving Max-Cut problems is simulated using a difference equation based on a traveling-wave model under various operating conditions. The results indicate that noise is not a critical factor, there is an optimal condition for the coupling strength, depending on the graph structure, and slower pump-increment rate leads to higher scores. Under optimal conditions, the simulation produces better calculation results than those previously reported in an experimental study.
Code-division multiple-access (CDMA) multiuser detection is a kind of signal recovery problem. The main problem of CDMA multiuser detection is to estimate the original signal from the degraded information. In CDMA multiuser detection, the first-order phase transition happens. The first-order phase transition degrades the estimation performance. To avoid or mitigate the first-order phase transition, we apply adiabatic reverse annealing (ARA) to CDMA multiuser detection. In ARA, we introduce the initial Hamiltonian, which corresponds to the prior information of the original signal into quantum annealing (QA) formulation. The ground state of the initial Hamiltonian is the initial candidate solution. By using the prior information of the original signal, ARA enhances the performance of QA for CDMA multiuser detection. We evaluate the typical ARA performance of CDMA multiuser detection by means of statistical mechanics using the replica method. At first, we consider the oracle cases where the initial candidate solution is randomly generated with a fixed fraction of the original signal in the initial state. In the oracle cases, the first-order phase transition can be avoided or mitigated by ARA if we prepare for the proper initial candidate solution. We validate our theoretical analysis with quantum Monte Carlo simulations. The theoretical results to avoid the first-order phase transition are consistent with the numerical results. Next, we consider the practical cases where we prepare for the initial candidate solution obtained by commonly used algorithms. We show that the practical algorithms can exceed the threshold to avoid the first-order phase transition. Finally, we test the performance of ARA with the initial candidate solution obtained by the practical algorithm. In this case, ARA cannot avoid the first-order phase transition even if the initial candidate solution exceeds the threshold to avoid the first-order phase transition.
Frustration, that is, the impossibility of satisfying the energetic preferences between all spin pairs simultaneously, underlies the complexity of many fundamental properties in spin systems, including the computational difficulty in determining their ground states. Coherent Ising machines (CIMs) have been proposed as a promising analog computational approach to efficiently find different degenerate ground states of large and complex Ising models. However, CIMs also face challenges in solving frustrated Ising models: frustration not only reduces the probability of finding good solutions, but it also prohibits the leveraging of quantum effects in doing so. To circumvent these detrimental effects of frustration, we show how frustrated Ising models can be mapped to frustration-free CIM configurations by including ancillary modes and modifying the coupling protocol used in current CIM designs. Such frustration elimination may empower current CIMs to benefit from quantum effects in dealing with frustrated Ising models. In addition, these ancillary modes can also enable error detection and searching for excited states.