Transient time of an Ising machine based on injection-locked laser network

Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We numerically study the dynamics and frequency response of the recently proposed Ising machine based on the polarization degrees of freedom of an injection-locked laser network (Utsunomiya et al 2011 Opt. Express 19 18091). We simulate various anti-ferromagnetic Ising problems, including the ones with symmetric Ising and Zeeman coefficients, which enable us to study the problem size up to M = 1000. Transient time, to reach a steady-state polarization configuration after a given Ising problem is mapped onto the system, is inversely proportional to the locking bandwidth and does not scale exponentially with the problem size. In the Fourier analysis with first-order linearization approximation, we find that the cut-off frequency of a system's response is almost identical to the locking bandwidth, which supports the time-domain analysis. It is also shown that the Zeeman term, which is created by the horizontally polarized injection signal from the master laser, serves as an initial driving force on the system and contributes to the transient time in addition to the inverse locking bandwidth.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Transient time of an Ising machine based on injection-locked laser network does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Transient time of an Ising machine based on injection-locked laser network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Transient time of an Ising machine based on injection-locked laser network will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-1641659

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.