اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدWeighted phase-space simulations of feedback coherent Ising machines
62
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
A new technique is demonstrated for carrying out exact positive-P phase-space simulations of the coherent Ising machine quantum computer. By suitable design of the coupling matrix, general hard optimization problems can be solved. Here, quantum simulations of a feedback type of photonic parametric network are carried out, which is the implementation of the coherent Ising machine. Results for success rates are obtained using a weighted algorithm for quantum simulations of quantum feedback devices.
قيم البحث
اقرأ أيضاً
The coherent Ising machine is expected to find a near-optimal solution in various combinatorial optimization problems, which has been experimentally confirmed with optical parametric oscillators (OPOs) and a field programmable gate array (FPGA) circu
it. The similar mathematical models were proposed three decades ago by J. J. Hopfield, et al. in the context of classical neural networks. In this article, we compare the computational performance of both models.
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 netwo
rk coupling rate is increased from below to above threshold, however, the eigenvectors with a smallest eigenvalue of Ising coupling matrix [J_ij] 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 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 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.
We present the quantum theory of coherent Ising machines based on networks of degenerate optical parametric oscillators (DOPOs). In a simple model consisting of two coupled DOPOs, both positive-$P$ representation and truncated Wigner representation
predict quantum correlation and inseparability between the two DOPOs in spite of the open-dissipative nature of the system. Here, we apply the truncated Wigner representation method to coherent Ising machines with thermal, vacuum, and squeezed reservoir fields. We find that the probability of finding the ground state of a one-dimensional Ising model increases substantially as a result of reducing excess thermal noise and squeezing the incident vacuum fluctuation on the out-coupling port.
Ising machines use physics to naturally guide a dynamical system towards an optimal state which can be read out as a heuristical solution to a combinatorial optimization problem. Such designs that use nature as a computing mechanism can lead to highe
r performance and/or lower operation costs. Quantum annealers are a prominent example of such efforts. However, existing Ising machines are generally bulky and energy intensive. Such disadvantages might lead to intrinsic advantages at some larger scale in the future. But for now, integrated electronic designs allow more immediate applications. We propose one such design that uses bistable nodes, coupled with programmable and variable strengths. The design is fully CMOS compatible for on-chip applications and demonstrates competitive solution quality and significantly superior execution time and energy.
We introduce a methodology for generating benchmark problem sets for Ising machines---devices designed to solve discrete optimization problems cast as Ising models. In our approach, linear systems of equations are cast as Ising cost functions. While
linear systems are easily solvable, the corresponding optimization problems are known to exhibit some of the salient features of NP-hardness, such as strong exponential scaling of heuristic solvers runtimes and extensive distances between ground and low-lying excited states. We show how the proposed technique, which we refer to as `equation planting, can serve as a useful tool for evaluating the utility of Ising solvers functioning either as optimizers or as ground-state samplers. We further argue that equation-planted problems can be used to probe the mechanisms underlying the operation of Ising machines.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
