Programmable Isin machine and method for solving combinatorial optimization problem and cryptography problem

Abstract

The invention provides a programmable Isin machine and a method for solving a combinatorial optimization problem and a cryptography problem. The programmable Isin machine comprises a first electro-optical modulator, a long optical fiber, a photoelectric detector, a programming module and a frequency mixer which are sequentially and annularly connected, the laser pulse generating device is connected with the input of the first electro-optical modulator; and the local oscillator source is connected with the input of the mixer. According to the programmable Isin machine, super-large-scale Isin spinning can be achieved, the advantages of being large in bandwidth and free of electromagnetic interference are achieved, by means of a programmable device, programmable connection between any spinning can be achieved, two-phase pulse spinning electric signals with specifically-distributed phases are generated, the signals correspond to the minimum gain of the programmable Isin machine, and the self-spinning performance of the programmable Isin machine is improved. The minimum gain corresponds to the optimal solution of the combinatorial optimization problem and the cryptography problem.

Description

technical field [0001] The invention relates to the technical field of microwave photonics, in particular to a programmable Ising machine and a method for solving combination optimization problems and cryptography problems. Background technique [0002] Combinatorial optimization problem is a very common problem in modern production and life. The research and solution of combinatorial optimization problem is an important topic in many fields including finance, drug research and development, traffic control, circuit design, and artificial intelligence. For example, in railway transportation, the problem of train marshalling planning is a kind of super-large-scale organizational optimization problem. Efficient train marshalling can not only ensure the delivery of goods at the most economical speed, but also ensure that the point-to-line capacity of the entire line is coordinated and utilized. Fully tap the potential of railway transportation, improve transportation efficiency,...

AI Technical Summary

Problems solved by technology

Current research shows that there is no efficient algorithm that can solve NP-hard or NP-complete problems exactly in polynomial time

With the increasing scale of combinatorial optimization problems, under the condition of limited computing resources, it is still difficult for traditional computers to guarantee the expected solution within a tolerable time.

Images