CN114529002B - Aggregation dividing method, device, terminal and storage medium of quantum communication map - Google Patents
Aggregation dividing method, device, terminal and storage medium of quantum communication map Download PDFInfo
- Publication number
- CN114529002B CN114529002B CN202011236044.6A CN202011236044A CN114529002B CN 114529002 B CN114529002 B CN 114529002B CN 202011236044 A CN202011236044 A CN 202011236044A CN 114529002 B CN114529002 B CN 114529002B
- Authority
- CN
- China
- Prior art keywords
- node
- map
- spectrum
- nodes
- quantum
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000004891 communication Methods 0.000 title claims abstract description 142
- 238000000034 method Methods 0.000 title claims abstract description 33
- 238000003860 storage Methods 0.000 title claims abstract description 14
- 230000002776 aggregation Effects 0.000 title claims description 13
- 238000004220 aggregation Methods 0.000 title description 9
- 238000001228 spectrum Methods 0.000 claims abstract description 190
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 25
- 238000011156 evaluation Methods 0.000 claims description 15
- 238000005192 partition Methods 0.000 claims description 15
- 239000002096 quantum dot Substances 0.000 claims description 10
- 238000000638 solvent extraction Methods 0.000 claims description 9
- 238000004364 calculation method Methods 0.000 claims description 6
- 238000004590 computer program Methods 0.000 claims description 6
- 238000005054 agglomeration Methods 0.000 claims description 4
- 230000000694 effects Effects 0.000 abstract description 7
- 238000013461 design Methods 0.000 abstract description 5
- 238000010586 diagram Methods 0.000 description 8
- 238000011160 research Methods 0.000 description 3
- 238000005457 optimization Methods 0.000 description 2
- 230000002441 reversible effect Effects 0.000 description 2
- 230000003247 decreasing effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000005281 excited state Effects 0.000 description 1
- 230000005283 ground state Effects 0.000 description 1
- 230000002452 interceptive effect Effects 0.000 description 1
- 239000011159 matrix material Substances 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
- 238000000844 transformation Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N10/00—Quantum computing, i.e. information processing based on quantum-mechanical phenomena
Landscapes
- Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Mathematical Analysis (AREA)
- Computing Systems (AREA)
- Evolutionary Computation (AREA)
- Condensed Matter Physics & Semiconductors (AREA)
- Computational Mathematics (AREA)
- Mathematical Optimization (AREA)
- Pure & Applied Mathematics (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Mathematical Physics (AREA)
- Software Systems (AREA)
- Artificial Intelligence (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The embodiment of the application provides a cluster dividing method, a cluster dividing device, a terminal and a storage medium for quantum communication maps, wherein the quantum communication maps are divided into a plurality of non-communicated target sub-map clusters according to the in-line intermediacy of all the connecting lines and the node intermediacy of all the map nodes in the quantum communication maps by calculating the in-line intermediacy of all the connecting lines in the quantum communication maps and calculating the node intermediacy of all the map nodes in the quantum communication maps. Therefore, the quantum communication spectrum is divided into a plurality of non-communication target sub-spectrum clusters, so that subsequent quantum algorithm design can be conveniently and independently carried out based on each non-communication target sub-spectrum cluster, and the algorithm operation effect is improved.
Description
Technical Field
The application relates to the technical field of quantum computing, in particular to a method, a device, a terminal and a storage medium for clustering and dividing a quantum communication map.
Background
With the popularization of quantum computing technology, quantum chips for performing quantum computing have become an important object of research. Compared with a traditional integrated chip, the quantum chip has strong parallel computing capability, and the parallel computing capability is exponentially improved along with the number of bits (quantum bit number) of the quantum chip.
In the related art, quantum algorithms are simulated in quantum circuits and require methods for implementing quantum computation that run on quantum chips. When quantum algorithms are compiled onto quantum chips, the structure of the quantum chip is typically designed based on a quantum connectivity map of the quantum algorithm that is pre-generated. However, when connected cluster structures exist in the equivalent molecular connected clusters, because the connection between the cluster structures is more sparse than the connection between the clusters, if a path connecting the nodes of the clusters of two different clusters is to be found, the selection is less, if all the connected paths are calculated, the number of times of all the connected paths is counted, and the number of times of the connected lines between the cluster structures is obviously higher than the number of the connected lines inside the cluster, resulting in poor algorithm operation effect.
Disclosure of Invention
Based on the defects of the existing design, the application provides a method, a device, a terminal and a storage medium for grouping and dividing a quantum communication spectrum, which divide the quantum communication spectrum into a plurality of non-communicated target sub-spectrum clusters, so that subsequent quantum algorithm design can be conveniently carried out based on each non-communicated target sub-spectrum cluster independently, and the algorithm operation effect is improved.
According to a first aspect of the present application, there is provided a method of cluster partitioning of a quantum connectivity map, the method comprising:
acquiring a quantum communication spectrum of a target quantum algorithm, wherein the quantum communication spectrum comprises a plurality of spectrum nodes and connecting lines between the two spectrum nodes, the spectrum nodes are used for representing logic bits in the target quantum algorithm, and the connecting lines are used for representing quantum bit logic gates between the two logic bits;
calculating the in-line intermediaries of all the connecting lines in the quantum communication map, and calculating the node intermediaries of all the map nodes in the quantum communication map;
and dividing the quantum communication spectrum into a plurality of non-communicated target sub-spectrum clusters according to the in-line intermediaries of all the connecting lines and the node intermediaries of all the spectrum nodes.
In a possible implementation manner of the first aspect, the step of calculating a link intermediacy of all links in the quantum communication map includes:
calculating the shortest communication path of every two spectrum nodes in the quantum communication spectrum;
and calculating the in-line intermediacy of the connecting line between every two map nodes based on the shortest communication path.
In a possible implementation manner of the first aspect, the step of calculating a shortest communication path between every two map nodes in the quantum communication map includes:
for each spectrum node, initializing and endowing the spectrum node with a first distance of 0 and a first node weight of 1 with other spectrum nodes in the quantum communication spectrum;
for each other first map node adjacent to the map node, giving a second distance between each first map node and the map node as the first distance plus 1, giving a second node weight as the first node weight, and marking a path formed by connecting the first map node to the map node as the shortest path between the map node and the first map node;
and for each second spectrum node adjacent to the first spectrum node, giving a third distance of the second spectrum node as the second distance plus 1, giving a third node weight as the second node weight, and marking a path formed by connecting the second spectrum node to the first spectrum node and connecting the first spectrum node to the spectrum node as the shortest path between the spectrum node and the second spectrum node.
In a possible implementation manner of the first aspect, the step of calculating a link intermediacy of a link between every two map nodes based on the shortest communication path includes:
acquiring all leaf nodes associated with a root node in the shortest communication path, and calculating a first connection score of all connection lines between the leaf nodes and adjacent nodes of the leaf nodes;
traversing from the leaf node farthest from the root node, respectively calculating second link scores of links between every two adjacent leaf nodes, and obtaining the second link scores of all links until the root node is reached;
and summing the first connection scores and all the second connection scores to obtain the connection intermediacy of the connection between every two map nodes.
In a possible implementation manner of the first aspect, the step of calculating node intermediaries of all map nodes in the quantum connectivity map includes:
calculating the total number of shortest communication paths through each graph node;
and obtaining node intermediacy of each map node based on the total number of the shortest communication paths passing through each map node.
In a possible implementation manner of the first aspect, the step of dividing the quantum communication map into a plurality of non-communicating target sub-map clusters according to in-line intermediaries of all the connecting lines and node intermediaries of all the map nodes includes:
Obtaining target map nodes with medium values in nodes larger than the maximum medium value in the connecting lines of all the connecting lines;
calculating the point-to-middle degree of the target map node, and calculating the split middle degree of the target map node according to the point-to-middle degree;
if the split intermediaries of the target graph nodes are larger than the maximum link intermediaries, performing point splitting operation on the target graph nodes, otherwise, performing link removing operation on the target graph nodes;
after the point splitting operation or the connection line removing operation is executed, detecting whether the quantum communication map is split into non-communication subgraphs;
if the quantum communication map is detected to be split into a non-communication subgraph, calculating a split partition evaluation value of the split non-communication subgraph by using a Modularity function;
and recalculating the in-line intermediaries of all the connecting lines according to the division evaluation values, and returning to the step of executing the node intermediaries of all the spectrum nodes in the quantum communication spectrum until the completely non-communicated target sub-spectrum clusters are obtained so as to divide the quantum communication spectrum into a plurality of non-communicated target sub-spectrum clusters.
In a possible implementation manner of the first aspect, the step of calculating a point-to-middle degree of the target graph node and calculating a split middle degree of the target graph node according to the point-to-middle degree includes:
calculating the total number of shortest paths of the connecting lines passing through the target map node and each adjacent map node of the target map node, and taking the total number of shortest paths as the point-to-intermediate degree of the target map node;
determining two selected map nodes corresponding to the lowest point-to-medium degree as a summary map node, wherein the point-to-medium degree of the summary map node is the added value of the point-to-medium degree of the two selected map nodes;
for a subgraph formed by all adjacent map nodes of the target map node, respectively replacing the connection lines between the adjacent map nodes and the corresponding map nodes by the corresponding map nodes and the corresponding map nodes, and taking the addition value of the point-to-intermediate degree between the corresponding map nodes and the corresponding map nodes as the point-to-intermediate degree from the corresponding map node to the corresponding map nodes;
repeatedly executing the step of determining two selected map nodes corresponding to the lowest point pair medium as a summary map node for preset times, wherein the preset times are the degree of the target map node minus 2;
After the step of determining two selected spectrum nodes corresponding to the lowest point pair intermediaries as one summary spectrum node is executed for a preset number of times, two final spectrum nodes are obtained, and the sum of the point pair intermediaries between the two final spectrum nodes is determined as the split intermediaries of the target spectrum node.
In a possible implementation manner of the first aspect, the step of calculating the partition evaluation value of the split non-connected subgraph using a Modularity function includes:
obtaining the sum of the number of split subgraphs of the split non-connected subgraphs, the number of connecting lines in each non-connected subgraph and the connectivity of all map nodes in each non-connected subgraph;
calculating a division evaluation value of the split non-connected subgraph by using a Modularity function based on the sum of the split subgraph number of the split non-connected subgraph, the connection line number inside each non-connected subgraph and the connectivity of all map nodes inside each non-connected subgraph.
According to a second aspect of the present application, there is provided a cluster partitioning device for a quantum connectivity map, the device comprising:
the quantum communication spectrum comprises a plurality of spectrum nodes and connecting lines between the two spectrum nodes, wherein the spectrum nodes are used for representing logic bits in the target quantum algorithm, and the connecting lines are used for representing quantum bit logic gates between the two logic bits;
The calculation module is used for calculating the in-line intermediaries of all the connecting lines in the quantum communication spectrum and calculating the node intermediaries of all the spectrum nodes in the quantum communication spectrum;
the division module is used for dividing the quantum communication spectrum into a plurality of non-communicated target sub-spectrum clusters according to the in-line intermediaries of all the connecting lines and the node intermediaries of all the spectrum nodes.
According to a third aspect of the present application there is provided a computer terminal comprising a machine-readable storage medium having stored therein a computer program and a processor arranged to run the computer program to perform the method of cluster division of a quantum connectivity map according to the first aspect or any one of the possible implementations of the first aspect.
According to a fourth aspect of the present application, there is provided a computer readable storage medium having a computer program stored therein, which when executed by a computer, implements the method for cluster division of a quantum connectivity map according to the first aspect or any one of the possible embodiments of the first aspect.
Based on any one of the above aspects, the quantum communication spectrum is divided into a plurality of non-connected target sub-spectrum clusters according to the in-line intermediaries of all the links and the node intermediaries of all the spectrum nodes by calculating the in-line intermediaries of all the links in the quantum communication spectrum and calculating the node intermediaries of all the spectrum nodes in the quantum communication spectrum. Therefore, the quantum communication spectrum is divided into a plurality of non-communication target sub-spectrum clusters, so that subsequent quantum algorithm design can be conveniently and independently carried out based on each non-communication target sub-spectrum cluster, and the algorithm operation effect is improved.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are needed in the embodiments will be briefly described below, it being understood that the following drawings only illustrate some embodiments of the present application and therefore should not be considered limiting the scope, and that other related drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 shows a flow diagram of a cluster partitioning method of a quantum connectivity map provided in an embodiment of the present application;
fig. 2 shows a schematic flow chart of substeps of step S120 shown in fig. 1;
fig. 3 shows a schematic flow chart of substeps of step S130 shown in fig. 1;
fig. 4 shows a functional block diagram of a cluster partition device of a quantum communication map provided in an embodiment of the present application;
fig. 5 is a schematic block diagram of the component structure of a computer terminal for implementing the cluster division of the quantum communication spectrum according to the embodiment of the present application.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the embodiments of the present application more clear, the technical solutions of the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present application, and it should be understood that the accompanying drawings in the present application are only for the purpose of illustration and description, and are not intended to limit the protection scope of the present application. In addition, it should be understood that the schematic drawings are not drawn to scale. A flowchart, as used in this application, illustrates operations implemented according to some embodiments of the present application.
It should be understood that the operations of the flow diagrams may be implemented out of order and that steps without logical context may be performed in reverse order or concurrently. Moreover, one or more other operations may be added to the flow diagrams and one or more operations may be removed from the flow diagrams as directed by those skilled in the art.
Referring to fig. 1, an interactive flow chart of a cluster partition method of a quantum communication spectrum provided in the embodiment of the present application is shown, and it should be understood that in other embodiments, the sequence of part of the steps in the cluster partition method of the quantum communication spectrum may be interchanged according to actual needs, or part of the steps may be omitted or deleted. The detailed steps of the agglomeration dividing method of the quantum communication map are described as follows.
And S110, acquiring a quantum communication map of the target quantum algorithm.
In this embodiment, the quantum connectivity graph may include a plurality of graph nodes, which may be used to represent logical bits in the target quantum algorithm, and a connection between two graph nodes, which may be used to represent a qubit logic gate between two logical bits.
The quantum connectivity map may be obtained based on the number of logical bits in the target quantum algorithm and the number of qubit logic gates applied on any two qubits. Among them, qubits may refer to a physical system that may be in the ground state |0>, the excited state |1>, and the superimposed state (α|0> +β|1 >) at the same time. Mathematically, a qubit can be represented by a state vector over the hilbert space. Quantum circuits are implemented by manipulating several qubits simultaneously.
Quantum circuits are a representation of quantum programs, which may consist of a series of qubits initially in the |0> state followed by a number of quantum logic gates, ending with a measurement operation (not necessarily every bit needs to be measured). In general, each quantum program can be ultimately decomposed into a quantum program consisting of only a basic sequence of quantum logic gates. In addition, the qubit logic gate may refer to some reversible unitary transformations, which may be used to manipulate a number of qubits, so that the qubits evolve toward a target state, and the final state of evolution is the result of quantum computation.
Step S120, calculating the in-line intermediaries of all the connecting lines in the quantum communication map, and calculating the node intermediaries of all the map nodes in the quantum communication map.
In this embodiment, the in-line intermediacy of the connection may measure an indicator of the likelihood that a connection belongs to an inter-cluster connection. According to the research of the inventor, the phenomenon that aggregation occurs in the quantum communication spectrum generally means that the number of the interconnections between spectrum nodes in a plurality of sub-spectrums in the quantum communication spectrum is larger than the number of the interconnections between node connections between sub-spectrums. If two sub-maps are connected by fewer inter-cluster wires, then all paths from one intra-cluster node to another must pass through these fewer wires than the number of intra-cluster nodes. Because the number of links is smaller, the number of alternative routes is smaller, so that the number of routes is greater than the number of routes between nodes within the cluster that route the interior of the cluster, which is related to the degree of intermediacy of the links.
And step S130, dividing the quantum communication spectrum into a plurality of non-communicated target sub-spectrum clusters according to the in-line intermediaries of all the connecting lines and the node intermediaries of all the spectrum nodes.
In this embodiment, by dividing the quantum communication spectrum into a plurality of non-communication target sub-spectrum clusters, each non-communication target sub-spectrum cluster can be processed individually, for example, the corresponding communication degree optimization, cross-connection optimization, and the like are performed on each non-communication target sub-spectrum cluster.
Based on the above steps, the embodiment calculates the in-line intermediaries of all the links in the quantum communication spectrum and calculates the node intermediaries of all the spectrum nodes in the quantum communication spectrum, thereby dividing the quantum communication spectrum into a plurality of non-connected target sub-spectrum clusters according to the in-line intermediaries of all the links and the node intermediaries of all the spectrum nodes. Therefore, the quantum communication spectrum is divided into a plurality of non-communication target sub-spectrum clusters, so that subsequent quantum algorithm design can be conveniently and independently carried out based on each non-communication target sub-spectrum cluster, and the algorithm operation effect is improved.
In one possible implementation, for step S120, in an implementation of calculating the in-line intermediaries of all the wires in the quantum connectivity map, please refer to fig. 2 in combination, this may be achieved through the following exemplary sub-steps, which are described in detail below.
And a substep S121, calculating the shortest communication path of every two spectrum nodes in the quantum communication spectrum.
For example, for each graph node, a first distance ds in the quantum connectivity graph, given to that graph node from other graph nodes, may be initialized to 0, with a first node weight ws of 1.
On the basis, for each other first graph node adjacent to the graph node, a second distance between each first graph node and the graph node can be given as a first distance plus 1, a second node weight is given as a first node weight, and a path formed by connecting the first graph node to the graph node is marked as the shortest path between the graph node and the first graph node. For example, for each other first graph node i adjacent to the graph node s, the second distance di=ds+1, the second node weight wi=ws=1, and all graph nodes s > other first graph nodes i are marked as the shortest communication path between the two graph nodes.
Further, for each second graph node adjacent to the first graph node, a third distance of the second graph node is given as a second distance plus 1, a third node weight is given as a second node weight, and a path formed by connecting the second graph node to the first graph node and connecting the first graph node to the graph node is marked as a shortest path between the graph node and the second graph node. For example, for each second graph node j adjacent to the first graph node i, if the second graph node j is not assigned a third distance, the third distance dj=di+1 and the third node weight wj=wi are assigned, and s >. I > j is labeled as one shortest communication path from s to j.
In a substep S122, a link intermediate value of the link between every two map nodes is calculated based on the shortest communication path.
For example, all leaf nodes t associated with the root node s in the shortest communication path are first acquired, and first link scores of links between all the connected leaf nodes t and adjacent nodes of the leaf nodes t are calculated. Wherein the first link score is the quotient of the node weight of the neighboring node and the node weight of the leaf node t.
Then, the traversal is started from the leaf node t farthest from the root node s, and each two adjacent leaf nodes are calculatedAnd (3) obtaining second link scores of the links between t until reaching the root node s. For example, for adjacent leaf node i and leaf node j, leaf node i is closer to root node s than leaf node j, a second link score connecting links of leaf node i and leaf node j is calculated
Thus, the first link scores and all the second link scores can be summed to obtain the link intermediacy of each map node and other map nodes in the quantum communication map.
In one possible implementation, still with respect to step S120, in an implementation of calculating node intermediaries for all map nodes in a quantum connectivity map, still referring to fig. 2, this may be achieved by the following exemplary sub-steps, described in detail below.
In a substep S123, the total number of shortest communication paths passing through each map node is calculated.
In this embodiment, regarding the shortest communication path passing through each spectrum node, the determination may be made with reference to the shortest communication path in the quantum communication spectrum for each two spectrum nodes in the substep S111, which is not described herein.
Substep S124 obtains node intermediacy for each graph node based on the total number of shortest communication paths through each graph node.
In this embodiment, the node intermediate value of each graph node may be equal to the total number of the shortest communication paths passing through each graph node, or may be equal to a weighted value of the total number of the shortest communication paths passing through each graph node and a preset coefficient, which is not particularly limited herein.
The node intermediacy of each map node can be obtained by the following calculation formula:
wherein Γ (v) is the number of all map nodes in all the lines with v as the end point and n is the part of the subgraph, c B (v)，c B (e) Representing the node intermediaries and the link intermediaries, respectively, which define the problem when to perform the point splitting operation, since the total number of shortest paths from n1 to n2 after dividing the adjacencies of the graph node v into two parts n1, n2 must be smaller than the node intermediaries of the graph node v, it is only possible to consider performing the point splitting operation when the node intermediaries of the subsequent graph nodes are larger than the link intermediaries.
Therefore, the problem of when and how to execute the point splitting operation can be solved by calculating the node intermediacy of each map node, if a plurality of high intermediacy connecting lines can be positioned, the connecting lines are the connection between clusters, and the quantum communication map can be divided into a plurality of non-communication clusters by removing the connecting lines, so that the cluster division is completed.
In one possible implementation, for step S130, please refer to fig. 3 in combination, this may be achieved by the following exemplary sub-steps, which are described in detail below.
And step S131, obtaining target map nodes with medium in nodes larger than the maximum medium in the connecting lines in all map nodes.
Sub-step S132, calculating point-to-middle degree of the target map node, and calculating split middle degree of the target map node according to the point-to-middle degree.
For example, in one possible example, sub-step S132 may be implemented by the following exemplary embodiments.
(1) And calculating the total number of shortest paths of the connecting lines of each adjacent map node passing through the target map node and the target map node, and taking the total number of the shortest paths as the point-to-intermediate degree of the target map node.
In this embodiment, the point-to-intermediate degree is a local index, and for a target map node v, the point-to-intermediate degree of any adjacent map node { u, w } is the total number of shortest paths passing through all the connecting lines { u, v } and { w, v }.
(2) And determining two selected map nodes corresponding to the lowest point pair intermediacy as a summary map node.
In this embodiment, the point-to-middle value of the summary map node may be the added value of the point-to-middle values of two selected map nodes.
(3) And for a subgraph formed by all adjacent map nodes of the target map node, respectively replacing the connecting lines between all adjacent map nodes and the corresponding map nodes by the corresponding map nodes and the corresponding auxiliary map nodes, and taking the addition value of the point-to-intermediate value between the corresponding auxiliary map node and the two selected map nodes as the point-to-intermediate value from the corresponding auxiliary map node to the corresponding map nodes.
(4) And repeatedly executing the steps of determining two selected map nodes corresponding to the lowest point pair medium as one summary map node for a preset number of times.
In this embodiment, the preset number of times is the degree of the target map node minus 2.
(5) After the step of determining two selected spectrum nodes corresponding to the lowest point-to-middle degree as one summary spectrum node is executed for a preset number of times, two final spectrum nodes are obtained, and the sum of the point-to-middle degree between the two final spectrum nodes is determined as the split middle degree of the target spectrum node.
For example, after obtaining the point-to-middle degree, by selecting the two selected map nodes { u, w } of the lowest point-to-middle degree, then sum u, w into one sum map node uw, which sums the point-to-middle degrees of the map nodes uw to the point-to-middle degrees of the two selected map nodes { u, w }.
For the subgraph formed by all adjacent map nodes of the target map node v, { uw, x } can be used for replacing connection between the adjacent map nodes and the homing map nodes respectively, and the point-to-intermediate degree between all auxiliary map nodes x and u, w is added to obtain the point-to-intermediate degree from the auxiliary map node x to the homing map node uw.
And then, repeatedly determining two selected map nodes corresponding to the lowest point pair intermediate degree as a summary map node k-2 times, wherein k is the degree of the target map node.
Thus, two final spectrum nodes can be finally obtained, the sum of the point-to-intermediate degree between the two final spectrum nodes can be determined as the split intermediate degree of the target spectrum node, and the two final spectrum nodes comprise nodes which are connected with the two final spectrum nodes respectively after the nodes are split into two parts.
Sub-step S133, if the split medium of the target graph node is greater than the maximum link medium, performing a point split operation on the target graph node, otherwise performing a link removal operation on the target graph node.
In this embodiment, the point splitting operation is performed on the target graph node only when the splitting agent of the target graph node is greater than the maximum linking agent, otherwise the link removing operation is performed on the target graph node.
And step S134, after the point splitting operation or the connection line removing operation is performed, detecting whether the quantum communication map is split into unconnected subgraphs.
For example, in performing a point splitting operation, one graph node v may be split into two parts v1, v2. The original v adjacent spectrum nodes can be respectively connected with v1 and v2 in a certain way, and the quantum communication spectrum can be divided into a plurality of non-communicated clusters by splitting high-intermediate points.
Sub-step S135, if the quantum connectivity graph is detected to be split into non-connected subgraphs, calculating a split non-connected subgraph split evaluation value using a Modularity function.
By agglomeration is meant that there are several sub-graphs in a quantum connectivity graph, the internal connectivity of which is typically higher than the connectivity between the sub-graphs, since in the course of performing the aforementioned steps, each step may require the removal of a link or the splitting of a graph node during the point splitting operation or the link removal operation, thus gradually dividing the quantum connectivity graph into smaller parts, which is a hierarchical process. For example, a large quantum connectivity graph is first divided into two and then divided into two smaller subgraphs, resulting in a set of divisions where all clusters have only one graph node. On this basis, in order to guarantee the subsequent algorithm operation effect, it is finally necessary to evaluate which level is better to divide by a Modularity function. In general, the Modularity function is generally increased and then decreased, and has a plurality of peaks, and at the highest peak, the optimal position for division is the highest peak. If the Modularity function does not have this behavior, or the peak is too low, then it can be assumed that no conglomerate structure is present.
For example, in this embodiment, the sum of the number of split sub-graphs of the split non-connected sub-graphs, the number of connection lines inside each non-connected sub-graph, and the connectivity of all graph nodes inside each non-connected sub-graph may be obtained.
On the basis, the division evaluation value of the split non-connected subgraphs is calculated by adopting a Modularity function based on the sum of the split subgraphs of the split non-connected subgraphs, the number of connecting lines in each non-connected subgraph and the connectivity of all map nodes in each non-connected subgraph.
For example, when the clusters are divided, a standard needs to be specified, in the absence of the standard, the whole quantum communication spectrum can be a cluster, and each spectrum node can be a cluster, so that an index needs to be defined to measure the degree of division, and the inventor considers that the connection between clusters is weaker than the connection inside the clusters through research, so that a Modularity function Q is defined as follows:
wherein A is ij Is the true connected matrix of the algorithm, P ij In the sense of (1) assuming that the degree of connectivity k is current up to all nodes i The probability of a connection between nodes i and j for a completely random graph is And P is ij ＝2mp ij Is the expected value for the presence of a wire. Based on this, the Modularity function Q can also be attributed as follows:
wherein n is c Is the number of clusters, l c Is the total number of lines inside the cluster, d c Is the sum of the connectivity of all nodes inside the cluster. If the Modularity function has peaks, it can be generally understood that the partitioning selects the preferred node at the peak.
And a sub-step S136 of recalculating the in-line intermediaries of all the connecting lines according to the division evaluation value, and returning to the step of executing the node intermediaries of all the spectrum nodes in the quantum communication spectrum until the completely non-communicated target sub-spectrum aggregation is obtained so as to divide the quantum communication spectrum into a plurality of non-communicated target sub-spectrum aggregation.
In this embodiment, after the partition evaluation value is obtained, a new cluster may be formed by partitioning after selecting a preferred node, and then the in-line intermediaries of all the in-line may be recalculated or the above steps may be continued until a target sub-cluster that is not connected at all is obtained, so as to partition the quantum communication spectrum into a plurality of target sub-clusters that are not connected.
Based on the same inventive concept, please refer to fig. 4, which is a schematic diagram illustrating functional modules of the cluster partition device 110 of the quantum communication spectrum provided in the embodiment of the present application, where the functional modules of the cluster partition device 110 of the quantum communication spectrum may be partitioned according to the above-mentioned method embodiment. For example, each functional module may be divided corresponding to each function, or two or more functions may be integrated in one processing module. The integrated modules may be implemented in hardware or in software functional modules. It should be noted that, in the embodiment of the present application, the division of the modules is schematic, which is merely a logic function division, and other division manners may be implemented in actual implementation. For example, in the case of dividing each functional module by using a corresponding function, the cluster dividing device 110 of the quantum communication map shown in fig. 4 is only one device schematic. The cluster dividing device 110 of the quantum communication spectrum may include an acquisition module 111, a calculation module 112, and a dividing module 113, and the functions of each functional module of the cluster dividing device 110 of the quantum communication spectrum are described in detail below.
The obtaining module 111 is configured to obtain a quantum connectivity graph of the target quantum algorithm, where the quantum connectivity graph includes a plurality of graph nodes and a connection line between two graph nodes, and the graph nodes are used to represent logic bits in the target quantum algorithm, and the connection line is used to represent a quantum bit logic gate between two logic bits. It is understood that the acquisition module 111 may be used to perform the step S110 described above, and reference may be made to the details of the implementation of the acquisition module 111 regarding the step S110 described above.
The calculation module 112 is configured to calculate the in-line intermediaries of all the links in the quantum communication map, and calculate the node intermediaries of all the map nodes in the quantum communication map. It will be appreciated that the computing module 112 may be configured to perform step S120 described above, and reference may be made to the details of step S120 regarding the implementation of the computing module 112.
The division module 113 is configured to divide the quantum communication spectrum into a plurality of non-communication target sub-spectrum clusters according to the in-line intermediaries of all the links and the node intermediaries of all the spectrum nodes. It is understood that the dividing module 113 may be used to perform the above step S130, and reference may be made to the above description of the step S130 for the detailed implementation of the dividing module 113.
In one possible implementation, the computing module 112 is specifically configured to:
calculating the shortest communication path of every two spectrum nodes in the quantum communication spectrum;
and calculating the in-line intermediacy of the connection line between every two map nodes based on the shortest communication path.
In one possible implementation, the computing module 112 is specifically configured to:
for each spectrum node, initializing and endowing the spectrum node with a first distance of 0 and a first node weight of 1 in the quantum communication spectrum with other spectrum nodes;
for each other first map node adjacent to the map node, giving a second distance between each first map node and the map node as a first distance plus 1, and giving a second node weight as a first node weight, and marking a path formed by connecting the first map node to the map node as a shortest path between the map node and the first map node;
and for each second spectrum node adjacent to the first spectrum node, giving a third distance of the second spectrum node as the second distance plus 1, giving a third node weight as the second node weight, and marking a path formed by connecting the second spectrum node to the first spectrum node and connecting the first spectrum node to the spectrum node as the shortest path between the spectrum node and the second spectrum node.
In one possible implementation, the computing module 112 is specifically configured to:
acquiring all leaf nodes associated with a root node in the shortest communication path, and calculating first connection scores of connection lines between all connected leaf nodes and adjacent nodes of the leaf nodes;
traversing from the leaf node farthest from the root node, respectively calculating second link scores of links between every two adjacent leaf nodes, and obtaining the second link scores of all links until the root node is reached;
and summing the first connection scores and all the second connection scores to obtain the connection intermediacy of the connection between every two map nodes.
In one possible implementation, the computing module 112 is specifically configured to:
calculating the total number of shortest communication paths through each graph node;
the node intermediaries for each graph node are obtained based on the total number of shortest connected paths through each graph node.
In one possible implementation, the dividing module 113 is specifically configured to:
obtaining target map nodes in which the medium in the nodes is larger than the maximum medium in the connecting lines in all map nodes;
calculating the point-to-middle degree of the target map node, and calculating the split middle degree of the target map node according to the point-to-middle degree;
If the split medium of the target graph node is larger than the maximum link medium, performing point splitting operation on the target graph node, otherwise, performing link removing operation on the target graph node;
after the point splitting operation or the connection line removing operation is executed, detecting whether the quantum communication map is split into non-communication subgraphs;
if the quantum communication graph is detected to be split into the non-communication subgraphs, calculating a split non-communication subgraph partition evaluation value by using a Modularity function;
and recalculating the in-line intermediaries of all the connecting lines according to the division evaluation value, and returning to the step of executing the node intermediaries of all the spectrum nodes in the quantum communication spectrum until the completely non-communicated target sub-spectrum aggregation is obtained so as to divide the quantum communication spectrum into a plurality of non-communicated target sub-spectrum aggregation.
In one possible implementation, the dividing module 113 is specifically configured to:
calculating the total number of shortest paths of the connecting lines of each adjacent map node passing through the target map node and the target map node, and taking the total number of shortest paths as the point-to-intermediate degree of the target map node;
determining two selected map nodes corresponding to the lowest point-to-medium degree as a summary map node, wherein the point-to-medium degree of the summary map node is the added value of the point-to-medium degree of the two selected map nodes;
For a subgraph formed by all adjacent map nodes of the target map node, respectively replacing all the adjacent map nodes by the homing map node and the auxiliary map node to be respectively connected with the connecting lines between the homing map nodes, and taking the addition value of the point-to-intermediate value between the auxiliary map node and two selected map nodes as the point-to-intermediate value from the auxiliary map node to the homing map node;
repeatedly executing the steps of determining two selected map nodes corresponding to the lowest point pair medium as a summary map node for preset times, wherein the preset times are the degree of the target map node minus 2;
after the step of determining two selected spectrum nodes corresponding to the lowest point-to-middle degree as one summary spectrum node is executed for a preset number of times, two final spectrum nodes are obtained, and the sum of the point-to-middle degree between the two final spectrum nodes is determined as the split middle degree of the target spectrum node.
In one possible implementation, the dividing module 113 is specifically configured to:
obtaining the sum of the number of split sub-graphs of the split non-connected sub-graphs, the number of connecting lines in each non-connected sub-graph and the connectivity of all map nodes in each non-connected sub-graph;
And calculating a division evaluation value of the split non-connected subgraph by using a Modularity function based on the sum of the number of split subgraphs of the split non-connected subgraphs, the number of connecting lines in each non-connected subgraph and the connectivity of all map nodes in each non-connected subgraph.
Referring to fig. 5, a schematic block diagram of a computer terminal 100 for performing the above-described aggregation partitioning method of quantum connectivity maps according to an embodiment of the present application is shown, and the computer terminal 100 may include an aggregation partitioning device 110 of the quantum connectivity maps, a machine-readable storage medium 120, and a processor 130.
In this embodiment, the machine-readable storage medium 120 and the processor 130 are both located in the computer terminal 100 and are separately provided. However, it should be understood that the machine-readable storage medium 120 may also be separate from the computer terminal 100 and accessible by the processor 130 through a bus interface. In the alternative, machine-readable storage medium 120 may be integrated into processor 130, and may be, for example, a cache and/or general purpose registers.
The cluster partition device 110 of the quantum connectivity map may include software function modules (e.g., the acquisition module 111, the calculation module 112, and the partition module 113 shown in fig. 4) stored in the machine-readable storage medium 120, which when executed by the processor 130, implement the cluster partition method of the quantum connectivity map provided by the foregoing method embodiments.
Since the computer terminal 100 provided in the embodiment of the present application is another implementation form of the embodiment of the cluster division method of the quantum communication spectrum executed by the computer terminal 100, and the computer terminal 100 may be used to execute the cluster division method of the quantum communication spectrum provided in the embodiment of the present application, the technical effects that can be obtained by the method may refer to the embodiment of the present application, and will not be described herein.
The embodiments described above are only some, but not all, of the embodiments of the present application. The components of the embodiments of the present application, as generally described and illustrated in the figures, may be arranged and designed in a wide variety of different configurations. Accordingly, the detailed description of the embodiments of the present application provided in the drawings is not intended to limit the scope of protection of the application, but is merely representative of selected embodiments of the application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims. Moreover, all other embodiments that can be made by a person skilled in the art, based on the embodiments of the present application, without making any inventive effort, shall fall within the scope of protection of the present application.
Claims (11)
1. A method for cluster partitioning of a quantum connectivity map, the method comprising:
Acquiring a quantum communication spectrum of a target quantum algorithm, wherein the quantum communication spectrum comprises a plurality of spectrum nodes and connecting lines between the two spectrum nodes, the spectrum nodes are used for representing logic bits in the target quantum algorithm, and the connecting lines are used for representing quantum bit logic gates between the two logic bits;
calculating the in-line intermediaries of all the connecting lines in the quantum communication spectrum, and calculating the node intermediaries of all the spectrum nodes in the quantum communication spectrum, wherein the in-line intermediaries are indexes for measuring the possibility that one connecting line belongs to the inter-cluster connection;
and dividing the quantum communication spectrum into a plurality of non-communicated target sub-spectrum clusters according to the in-line intermediaries of all the connecting lines and the node intermediaries of all the spectrum nodes.
2. The method of claim 1, wherein the step of calculating the in-line intermediacy of all the wires in the quantum connectivity map comprises:
calculating the shortest communication path of every two spectrum nodes in the quantum communication spectrum;
and calculating the in-line intermediacy of the connecting line between every two map nodes based on the shortest communication path.
3. The method of claim 2, wherein the step of calculating the shortest communication path between every two spectrum nodes in the quantum communication spectrum comprises:
for each spectrum node, initializing and endowing the spectrum node with a first distance of 0 and a first node weight of 1 with other spectrum nodes in the quantum communication spectrum;
for each other first map node adjacent to the map node, giving a second distance between each first map node and the map node as the first distance plus 1, giving a second node weight as the first node weight, and marking a path formed by connecting the first map node to the map node as the shortest path between the map node and the first map node;
and for each second spectrum node adjacent to the first spectrum node, giving a third distance of the second spectrum node as the second distance plus 1, giving a third node weight as the second node weight, and marking a path formed by connecting the second spectrum node to the first spectrum node and connecting the first spectrum node to the spectrum node as the shortest path between the spectrum node and the second spectrum node.
4. The method of cluster division of quantum connectivity atlas according to claim 2, wherein the step of calculating in-line intermediacy of a line between every two atlas nodes based on the shortest connectivity path comprises:
acquiring all leaf nodes associated with a root node in the shortest communication path, and calculating a first connection score of all connection lines between the leaf nodes and adjacent nodes of the leaf nodes;
traversing from the leaf node farthest from the root node, respectively calculating second link scores of links between every two adjacent leaf nodes, and obtaining the second link scores of all links until the root node is reached;
and summing the first connection scores and all the second connection scores to obtain the connection intermediacy of the connection between every two map nodes.
5. The method of claim 1, wherein the step of calculating node intermediaries of all map nodes in the quantum connectivity map comprises:
calculating the total number of shortest communication paths through each graph node;
and obtaining node intermediacy of each map node based on the total number of the shortest communication paths passing through each map node.
6. The method of claim 1, wherein the step of dividing the quantum communication map into a plurality of non-connected target sub-map clusters according to in-line intermediaries of all the links and node intermediaries of all the map nodes comprises:
obtaining target map nodes with medium values in nodes larger than the maximum medium value in the connecting lines of all the connecting lines;
calculating the point-to-middle degree of the target map node, and calculating the split middle degree of the target map node according to the point-to-middle degree;
if the split intermediaries of the target graph nodes are larger than the maximum link intermediaries, performing point splitting operation on the target graph nodes, otherwise, performing link removing operation on the target graph nodes;
after the point splitting operation or the connection line removing operation is executed, detecting whether the quantum communication map is split into non-communication subgraphs;
if the quantum communication map is detected to be split into a non-communication subgraph, calculating a split partition evaluation value of the split non-communication subgraph by using a Modularity function;
And recalculating the in-line intermediaries of all the connecting lines according to the division evaluation values, and returning to the step of executing the node intermediaries of all the spectrum nodes in the quantum communication spectrum until the completely non-communicated target sub-spectrum clusters are obtained so as to divide the quantum communication spectrum into a plurality of non-communicated target sub-spectrum clusters.
7. The method of quantum communication map agglomeration partition according to claim 6, wherein said step of calculating a point-to-middle degree of said target map node and calculating a split middle degree of said target map node based on said point-to-middle degree comprises:
calculating the total number of shortest paths of the connecting lines passing through the target map node and each adjacent map node of the target map node, and taking the total number of shortest paths as the point-to-intermediate degree of the target map node;
determining two selected map nodes corresponding to the lowest point-to-medium degree as a summary map node, wherein the point-to-medium degree of the summary map node is the added value of the point-to-medium degree of the two selected map nodes;
for a subgraph formed by all adjacent map nodes of the target map node, respectively replacing the connecting lines between the adjacent map nodes and the corresponding map nodes by the corresponding map nodes and the corresponding map nodes, and taking the addition value of the point-to-intermediate degree between the corresponding map nodes and the corresponding map nodes as the point-to-intermediate degree between the corresponding map nodes and the corresponding map nodes;
Repeatedly executing the step of determining two selected map nodes corresponding to the lowest point pair medium as a summary map node for preset times, wherein the preset times are the degree of the target map node minus 2;
after the step of determining two selected spectrum nodes corresponding to the lowest point pair intermediaries as one summary spectrum node is executed for a preset number of times, two final spectrum nodes are obtained, and the sum of the point pair intermediaries between the two final spectrum nodes is determined as the split intermediaries of the target spectrum node.
8. The method of cluster division of quantum connected graphs according to claim 6, wherein the step of calculating the division evaluation value of the split non-connected subgraphs using a Modularity function comprises:
obtaining the sum of the number of split subgraphs of the split non-connected subgraphs, the number of connecting lines in each non-connected subgraph and the connectivity of all map nodes in each non-connected subgraph;
calculating a division evaluation value of the split non-connected subgraph by using a Modularity function based on the sum of the split subgraph number of the split non-connected subgraph, the connection line number inside each non-connected subgraph and the connectivity of all map nodes inside each non-connected subgraph.
9. A device for the agglomeration and partitioning of a quantum connectivity map, the device comprising:
the quantum communication spectrum comprises a plurality of spectrum nodes and connecting lines between the two spectrum nodes, wherein the spectrum nodes are used for representing logic bits in the target quantum algorithm, and the connecting lines are used for representing quantum bit logic gates between the two logic bits;
the calculation module is used for calculating the in-line intermediaries of all the connecting lines in the quantum communication spectrum and calculating the node intermediaries of all the spectrum nodes in the quantum communication spectrum, wherein the in-line intermediaries are indexes for measuring the possibility that one connecting line belongs to the inter-cluster connection;
the division module is used for dividing the quantum communication spectrum into a plurality of non-communicated target sub-spectrum clusters according to the in-line intermediaries of all the connecting lines and the node intermediaries of all the spectrum nodes.
10. A computer terminal comprising a machine-readable storage medium having stored therein a computer program and a processor arranged to run the computer program to perform the method of cluster division of a quantum connectivity map as claimed in any one of claims 1 to 8.
11. A computer-readable storage medium, in which a computer program is stored which, when executed by a computer, implements the cluster division method of the quantum connectivity map of any one of claims 1 to 8.
Priority Applications (4)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011236044.6A CN114529002B (en) | 2020-11-09 | 2020-11-09 | Aggregation dividing method, device, terminal and storage medium of quantum communication map |
| US18/029,569 US11934919B2 (en) | 2020-09-30 | 2021-09-29 | Method, apparatus, terminal and storage medium for quantum topology graph optimization |
| PCT/CN2021/121735 WO2022068880A1 (en) | 2020-09-30 | 2021-09-29 | Quantum topology graph optimization method and apparatus, terminal, and storage medium |
| EP21874535.4A EP4224377A1 (en) | 2020-09-30 | 2021-09-29 | Quantum topology graph optimization method and apparatus, terminal, and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011236044.6A CN114529002B (en) | 2020-11-09 | 2020-11-09 | Aggregation dividing method, device, terminal and storage medium of quantum communication map |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114529002A CN114529002A (en) | 2022-05-24 |
| CN114529002B true CN114529002B (en) | 2024-04-12 |
Family
ID=81618471
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011236044.6A Active CN114529002B (en) | 2020-09-30 | 2020-11-09 | Aggregation dividing method, device, terminal and storage medium of quantum communication map |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114529002B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2023232039A1 (en) * | 2022-05-30 | 2023-12-07 | 本源量子计算科技（合肥）股份有限公司 | Method and apparatus for optimizing quantum bit read signal, and quantum computer |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2901048A1 (en) * | 2014-08-20 | 2016-02-20 | Lockheed Martin Corporation | Heuristic graph embedding methods for adiabatic quantum computation optimization |
| CN106301868A (en) * | 2015-06-12 | 2017-01-04 | 华为技术有限公司 | The method and apparatus determining the importance of network node |
| CN109800883A (en) * | 2019-01-25 | 2019-05-24 | 合肥本源量子计算科技有限责任公司 | Quantum machine learning framework establishment method, apparatus and quantum computer |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11455564B2 (en) * | 2018-10-21 | 2022-09-27 | President And Fellows Of Harvard College | Qubit allocation for noisy intermediate-scale quantum computers |
| US11537926B2 (en) * | 2019-01-17 | 2022-12-27 | D-Wave Systems Inc. | Systems and methods for hybrid algorithms using cluster contraction |
| US11748665B2 (en) * | 2019-04-03 | 2023-09-05 | International Business Machines Corporation | Quantum feature kernel alignment |
-
2020
- 2020-11-09 CN CN202011236044.6A patent/CN114529002B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2901048A1 (en) * | 2014-08-20 | 2016-02-20 | Lockheed Martin Corporation | Heuristic graph embedding methods for adiabatic quantum computation optimization |
| CN106301868A (en) * | 2015-06-12 | 2017-01-04 | 华为技术有限公司 | The method and apparatus determining the importance of network node |
| CN109800883A (en) * | 2019-01-25 | 2019-05-24 | 合肥本源量子计算科技有限责任公司 | Quantum machine learning framework establishment method, apparatus and quantum computer |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114529002A (en) | 2022-05-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110276442B (en) | Searching method and device of neural network architecture | |
| CN112381231B (en) | Quantum topological graph optimization method, device, terminal and storage medium | |
| US10997528B2 (en) | Unsupervised model evaluation method, apparatus, server, and computer-readable storage medium | |
| CN114529002B (en) | Aggregation dividing method, device, terminal and storage medium of quantum communication map | |
| CN114239198B (en) | Power grid subgraph division method and device based on parallel optimization | |
| CN113255892B (en) | Decoupled network structure searching method, device and readable storage medium | |
| CN110929218A (en) | Difference minimization random grouping method and system | |
| TW202134869A (en) | Enhancing memory utilization and throughput in executing a computational graph | |
| CN104111887A (en) | Software fault prediction system and method based on Logistic model | |
| CN107220346B (en) | High-dimensional incomplete data feature selection method | |
| CN114529001B (en) | Index evaluation method and device for quantum algorithm, terminal and storage medium | |
| CN114511089B (en) | Quantum connectivity spectrum connectivity optimization method, device, terminal and storage medium | |
| US20240005190A1 (en) | Method, apparatus, terminal and storage medium for quantum topology graph optimization | |
| CN114492811B (en) | Quantum connectivity map optimization method, device, terminal and storage medium | |
| CN113706459B (en) | Detection and simulation repair device for abnormal brain area of autism patient | |
| CN114580345A (en) | Circuit simulation method and device, computer equipment and computer readable storage medium | |
| CN115878437A (en) | Application performance test method, method and device for establishing performance test model | |
| CN114692565A (en) | Method, system and equipment for detecting quality of multi-characteristic-parameter high-speed board card in design stage | |
| CN114690782A (en) | Method, device, equipment and storage medium for planning flight path of unmanned ship | |
| CN113505827B (en) | Machine learning classification method | |
| CN110705695A (en) | Method, device, equipment and storage medium for searching model structure | |
| CN116578425B (en) | Load balancing method and system based on rasterization | |
| CN115293083B (en) | Integrated circuit time sequence prediction method and device, electronic equipment and storage medium | |
| CN113869514B (en) | Multi-knowledge integration and optimization method based on genetic algorithm | |
| CN116842073B (en) | Graph data mining method and device and electronic equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Country or region after: China Address after: 230000, floor 6, E2 building, phase II, innovation industrial park, No. 2800, innovation Avenue, high tech Zone, Hefei, Anhui Province Applicant after: Benyuan Quantum Computing Technology (Hefei) Co.,Ltd. Address before: 230000, floor 6, E2 building, phase II, innovation industrial park, No. 2800, innovation Avenue, high tech Zone, Hefei, Anhui Province Applicant before: ORIGIN QUANTUM COMPUTING COMPANY, LIMITED, HEFEI Country or region before: China |
|
| CB03 | Change of inventor or designer information | ||
| CB03 | Change of inventor or designer information |
Inventor after: Kong Weicheng Inventor before: Kong Weicheng |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |