ترغب بنشر مسار تعليمي؟ اضغط هنا

We theoretically and numerically study the quantum dynamics of two degenerate optical parametric oscillators with mutual injections. The cavity mode in the optical coupling path between the two oscillator facets is explicitly considered. Stochastic e quations for the oscillators and mutual injection path based on the positive $P$ representation are derived. The system of two gradually pumped oscillators with out-of-phase mutual injections is simulated, and its quantum state is investigated. When the incoherent loss of the oscillators other than the mutual injections is small, the squeezed quadratic amplitudes $hat{p}$ in the oscillators are positively correlated near the oscillation threshold. It indicates finite quantum correlation, estimated via Gaussian quantum discord, and the entanglement between the intracavity subharmonic fields. When the loss in the injection path is low, each oscillator around the phase transition point forms macroscopic superposition even under a small pump noise. It suggests that the squeezed field stored in the low-loss injection path weakens the decoherence in the oscillators.
Finding the ground states of the Ising Hamiltonian [1] maps to various combinatorial optimization problems in biology, medicine, wireless communications, artificial intelligence, and social network. So far no efficient classical and quantum algorithm is known for these problems, and intensive research is focused on creating physical systems - Ising machines - capable of finding the absolute or approximate ground states of the Ising Hamiltonian [2-6]. Here we report a novel Ising machine using a network of degenerate optical parametric oscillators (OPOs). Spins are represented with above-threshold binary phases of the OPOs and the Ising couplings are realized by mutual injections [7]. The network is implemented in a single OPO ring cavity with multiple trains of femtosecond pulses and configurable mutual couplings, and operates at room temperature. We programed the smallest non-deterministic polynomial time (NP)- hard Ising problem on the machine, and in 1000 runs of the machine no computational error was detected.
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا