Isin solver based on graph convolutional neural network and method for realizing Isin model

A convolutional neural network and convolutional network technology, applied in the field of implementing Ising model and Ising solver, can solve the problems of CNN processing difficulties and the inability to extract information about the connection relationship between nodes and nodes.

Pending Publication Date: 2022-05-06
上海图灵智算量子科技有限公司
View PDF3 Cites 1 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

For this kind of data with a topological structure, CNN is very difficult to process, and it cannot extract the connection relationshi

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Isin solver based on graph convolutional neural network and method for realizing Isin model
  • Isin solver based on graph convolutional neural network and method for realizing Isin model
  • Isin solver based on graph convolutional neural network and method for realizing Isin model

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0064] Below in conjunction with each embodiment, the scheme of the present invention is clearly and completely set forth, and the described embodiment is only the embodiment that the present invention is used for describing and illustrating but not all embodiments, based on these embodiments, people in the art The solutions obtained by technicians without creative work belong to the protection scope of the present invention.

[0065] A statement about combinatorial optimization. The field of combinatorial optimization deals with settings in which a large number of yes / no decisions have to be made, each set of decisions yielding a corresponding objective function value, such as a cost or profit value, that is to be optimized. Combinatorial optimization problems include maximum cut problem and maximum independent set problem, minimum vertex cover problem, maximum clique problem and set cover problem. Exact solutions are not feasible in all cases for sufficiently large systems ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention relates to an Isin solver based on a graph convolutional neural network and a method for realizing an Isin model. The first module in the two core modules is used for the configuration of a graph convolutional network architecture, and the second module is used for the optimization of an equivalent loss function of the Isin Hamiltonian amount. The structure of the graph network is constructed in the first module according to the form of the Isin Hamiltonian quantity. And in the second module, due to the binary property of the Isin Hamiltonian ground state solution and the arbitrariness of the output value of the final convolutional layer, function processing is performed on the output value of the final convolutional layer. An Isin solver using a graph neural network is designed on the basis that a sufficiently strong association action is performed on a GCN structure and a Hamiltonian of quantum annealing, and an NP-hard problem containing large-scale variables can be solved.

Description

technical field [0001] The present invention mainly relates to the technical field of graph convolutional neural network, more precisely, relates to an Ising solver based on graph convolutional neural network and a method for realizing the Ising model. Background technique [0002] Typical combinatorial optimization problems are NP-hard problems, usually including the maximum cut problem (Max-Cut), the maximum independent set problem (MIS), the minimum vertex cover problem, the maximum clique problem and the set cover problem, in biomedicine, financial strategy And traffic planning, circuit design and other aspects have a wide range of applications. The more common solver is the quantum annealer produced by D-wave, but due to the limitation of its hardware structure, this annealer cannot solve large-scale problems, and its calculation speed does not have sufficient advantages compared with simulated annealing. In view of the disadvantages of traditional techniques, it is ve...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06N3/04G06N3/08G06N10/00G06F17/16
CPCG06N3/04G06N10/00G06N3/08G06F17/16G06N3/048G06N3/045
Inventor 方波
Owner 上海图灵智算量子科技有限公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap