CN116089675A

CN116089675A - Quantum clustering method and device, electronic equipment and storage medium

Info

Publication number: CN116089675A
Application number: CN202111270638.3A
Authority: CN
Inventors: 方圆; 李蕾; 王伟
Original assignee: Origin Quantum Computing Technology Co Ltd
Current assignee: Origin Quantum Computing Technology Co Ltd
Priority date: 2021-10-29
Filing date: 2021-10-29
Publication date: 2023-05-09

Abstract

The invention discloses a quantum clustering method, a quantum clustering device, electronic equipment and a storage medium. The method comprises the following steps: acquiring a first data point in a first set, acquiring first similarity between the first data point and other data points in the first set according to a first preset sub-line, comparing the first similarity with a first preset threshold according to a second preset sub-line, acquiring the number of other data points in a preset neighborhood of the first data point according to a size relation between the first similarity and the first preset threshold, judging whether the number of other data points in the preset neighborhood of the first data point is larger than a second preset threshold, if so, marking the first data point as a core point, and marking other data points in the preset neighborhood of the first data point into a first cluster taking the first data point as a core. And the parallel advantage of quantum computation is exerted, and irregularly distributed data points are clustered according to the distance based on the quantum computation and a clustering algorithm.

Description

Quantum clustering method and device, electronic equipment and storage medium

Technical Field

The invention belongs to the field of quantum computing, and particularly relates to a quantum clustering method, a quantum clustering device, electronic equipment and a storage medium.

Background

Two cores of quantum computing are physical quantum computers and quantum algorithms. Under the development of quantum computer hardware, many quantum algorithms are in a theoretical derivation stage. The simulation of the classical computation on the quantum algorithm is also limited to a low-qubit quantum circuit, taking a full-amplitude algorithm as an example, when the number of qubits of the quantum circuit reaches 32, if the classical computation simulation is adopted, at least 64G memory is needed; simulating a quantum circuit of 33 qubits requires 128G of memory, and this exponentially increasing memory requirement severely limits the simulation effect of classical computation on quantum algorithms.

The core object of the current cluster is updated by using a quantum algorithm, the data belonging to the same class is found out through the distance value, and the clustering of the data is completed, so that the corresponding quantum algorithm is needed to realize the clustering process, and the technical blank is filled.

Disclosure of Invention

The invention aims to provide a quantum clustering method, a quantum clustering device, electronic equipment and a storage medium. The method solves the defects in the prior art, plays the parallel advantage of quantum computation, and clusters irregularly distributed data points according to distance based on quantum computation and a clustering algorithm.

In a first aspect, the present application provides a quantum clustering method, including:

obtaining a first data point in a first set, the first set comprising a plurality of data points;

acquiring first similarity between the first data point and other data points in the first set according to a first preset quantum circuit, wherein the similarity is determined by the distance between the different data points;

comparing the first similarity with a first preset threshold according to a second preset quantum circuit, and acquiring the number of other data points in a preset neighborhood of the first data point according to the magnitude relation between the first similarity and the first preset threshold;

judging whether the number of other data points in the preset neighborhood of the first data point is larger than a second preset threshold value or not;

if the data points are larger than the first data points, marking the first data points as core points, and marking other data points in a preset neighborhood of the first data points into a first cluster taking the first data points as cores.

Optionally, if the number of other data points in the preset neighborhood of the first data point is not greater than a preset threshold, the method further includes:

the first data point is marked as a non-core point, which is not the core of any cluster.

Optionally, after the marking other data points in the preset neighborhood of the first data point into the first cluster with the first data point as a core, the method further includes:

acquiring a second data point in the first set, the second data point being located at a different location than the first data point;

judging whether the number of other data points in the preset neighborhood of the second data point is larger than a preset threshold value or not;

if the data points are larger than the first data points, setting the second data points as core points, and dividing other data points in a preset neighborhood of the second data points into a second cluster taking the second data points as cores;

judging whether any data point in the second cluster is already divided into a first cluster taking the first data point as a core;

if yes, the first data point is taken as a core, and the first cluster and the second cluster are combined.

Optionally, the obtaining, according to a first preset sub-line, the first similarity between the first data point and other data points in the first set includes:

constructing a first preset quantum circuit according to preset quantum logic gates, wherein the preset quantum logic gates comprise an RX gate, a RY gate, an H gate and a controlled SWAP gate;

Preparing data points in the first set into quantum states respectively;

preparing the quantum state of the first data point and the quantum states of other data points in the first set onto the quantum circuit, and operating the quantum circuit;

and measuring a target quantum bit of the quantum circuit, and obtaining the similarity between the first data point and other data points in the first set according to the measurement result of the target quantum bit.

Optionally, the determining whether the number of other data points in the preset neighborhood of the first data point is greater than a preset threshold value includes:

mapping a first similarity greater than or equal to the first preset threshold to a first target value;

searching the number of the first similarity corresponding to the first target value according to a preset quantum search algorithm;

if the number of the first similarities corresponding to the first target value is larger than a preset threshold value, the number of the first similarities larger than or equal to the preset similarity is larger than the preset threshold value;

if the number of the first similarities corresponding to the first target value is not greater than the preset threshold, the number of the first similarities greater than or equal to the preset similarity is not greater than the preset threshold.

In a second aspect, the present application provides a quantum clustering device comprising:

An acquisition unit configured to acquire a first data point in a first set, the first set including a plurality of data points;

the computing unit is used for acquiring first similarity between the first data point and other data points in the first set according to a first preset quantum circuit, and the similarity is determined by the distance between the different data points;

the comparison unit is used for comparing the first similarity with a first preset threshold according to a second preset quantum circuit and acquiring the number of other data points in a preset neighborhood of the first data point according to the magnitude relation between the first similarity and the first preset threshold;

the judging unit is used for judging whether the number of other data points in the preset neighborhood of the first data point is larger than a second preset threshold value or not;

and the first marking unit is used for marking the first data point as a core point and marking other data points in a preset neighborhood of the first data point into a first cluster taking the first data point as a core if the judging unit judges that the first data point is the core point.

Optionally, the apparatus further comprises:

and the second marking unit is used for marking the first data point as a non-core point if the judging unit judges that the first data point is not the core of any cluster.

In a third aspect, an embodiment of the present application provides an electronic device, including a processor, a memory, a communication interface, and one or more programs, where the one or more programs are stored in the memory and configured to be executed by the processor, the programs including instructions for performing steps in the method described in the first aspect of the embodiment of the present application.

In a fourth aspect, embodiments of the present application provide a computer-readable storage medium, where the computer-readable storage medium stores a computer program for electronic data exchange, where the computer program causes a computer to perform some or all of the steps described in the method according to the first aspect of the embodiments of the present application.

In a fifth aspect, embodiments of the present application provide a computer program product, wherein the computer program product comprises a non-transitory computer readable storage medium storing a computer program, the computer program being operable to cause a computer to perform some or all of the steps described in the method according to the first aspect of the embodiments of the present application. The computer program product may be a software installation package.

In a sixth aspect, embodiments of the present application provide a quantum computer operating system, where the quantum computer operating system implements quantum clustering according to some or all of the steps described in the method according to the first aspect of the embodiments of the present application.

Compared with the prior art, the quantum clustering method provided by the application has the advantages that the first data point in the first set is obtained, the first similarity between the first data point and other data points in the first set is obtained according to the first preset quantum circuit, the first similarity is compared with the first preset threshold value according to the second preset quantum circuit, the number of other data points in the preset neighborhood of the first data point is obtained according to the size relation between the first similarity and the first preset threshold value, whether the number of other data points in the preset neighborhood of the first data point is larger than the second preset threshold value is judged, if so, the first data point is marked as a core point, and the other data points in the preset neighborhood of the first data point are marked into a first cluster taking the first data point as a core. By adopting the embodiment of the application, the parallel advantage of quantum computation can be exerted, and irregularly distributed data points are clustered according to distance based on quantum computation and a clustering algorithm.

Drawings

FIG. 1 is a schematic diagram of a process of a quantum clustering method according to an embodiment of the present application;

FIG. 2 is another schematic diagram of a flow of a quantum clustering method according to an embodiment of the present application;

FIG. 3 is a schematic diagram of quantum circuit modularization of the clustering process according to the embodiments of the present application;

FIG. 4 is a schematic diagram of a quantum circuit for preparing a quantum state according to an embodiment of the present application;

fig. 5 is a schematic diagram of a quantum circuit for calculating similarity according to an embodiment of the present application;

FIG. 6 is a quantum circuit schematic diagram of quantum state comparison provided herein;

fig. 7 is a schematic diagram of a modular quantum circuit corresponding to a Grover algorithm provided in the present application;

FIG. 8 is an iterative schematic of a Grover algorithm provided herein;

fig. 9 is a schematic structural diagram of a quantum clustering device provided in an embodiment of the present application;

fig. 10 is a hardware structure block diagram of a quantum clustering method computer terminal according to an embodiment of the present application.

Detailed Description

The embodiments described below by referring to the drawings are illustrative only and are not to be construed as limiting the invention.

The application provides a quantum clustering method, a device, electronic equipment and a storage medium, which exert the parallel advantage of quantum computation and divide data with higher similarity into the same cluster based on quantum computation and a clustering algorithm. It should be noted that, the quantum program referred to in the embodiments of the present application is a program written in a classical language to characterize qubits and their evolution, where qubits, quantum logic gates, and the like related to quantum computing are all represented by corresponding classical codes.

Quantum circuits, which are one embodiment of quantum programs, also weigh sub-logic circuits, are the most commonly used general quantum computing models, representing circuits that operate on qubits under an abstract concept, the composition of which includes qubits, circuits (timelines), and various quantum logic gates, and finally the results often need to be read out by quantum measurement operations. The quantum circuit may be presented in a sequence of quantum logic gates arranged in a certain execution timing sequence.

Unlike conventional circuits that are connected by metal lines to pass voltage or current signals, in quantum circuits, the circuits can be seen as being connected by time, i.e., the state of the qubit naturally evolves over time, as indicated by the hamiltonian operator, during which the circuit is operated until the quantum logic gate is encountered.

A quantum program is generally corresponding to a total quantum circuit, where the quantum program refers to the total quantum circuit, and the total number of qubits in the total quantum circuit is the same as the total number of qubits in the quantum program. It can be understood that: one quantum program may consist of a quantum circuit, a measurement operation for the quantum bits in the quantum circuit, a register to hold the measurement results, and a control flow node (jump instruction), and one quantum circuit may contain several tens to hundreds or even thousands of quantum logic gate operations. The execution process of the quantum program is a process of executing all quantum logic gates according to a certain time sequence. Note that the timing is the time sequence in which a single quantum logic gate is executed.

It should be noted that in classical computation, the most basic unit is a bit, and the most basic control mode is a logic gate, and the purpose of the control circuit can be achieved by a combination of logic gates. Similarly, the way in which the qubits are handled is a quantum logic gate. Quantum logic gate is used to make quantumThe state evolves, and the quantum logic gate is the basis for forming a quantum circuit, and the quantum logic gate includes single-bit quantum logic gates (or single-bit quantum logic gates, abbreviated as "single gate"), such as Hadamard gates (H gate, ada Ma Men), bery-X gates (X gate), bery-Y gates (Y gate), bery-Z gates (Z gate), RX gates, RY gates, RZ gates, and the like; two-bit quantum logic gates (or double quantum logic gates, simply "double gates"), such as CNOT gates, CR gates, SWAP gates, ISWAP gates, and the like; multi-bit quantum logic gates (or multi-quantum logic gates, simply "multi-gates"), such as Toffoli gates, and the like. Quantum logic gates are typically represented using unitary matrices, which are not only in matrix form, but also an operation and transformation. The effect of a general quantum logic gate on a quantum state is calculated by multiplying the unitary matrix by the matrix corresponding to the right vector of the quantum state. For example, the quantum state right vector |0 >The corresponding vector is

Quantum state right vector |1>The corresponding vector is +.>

Quantum states, i.e., the logical states of a qubit. In the quantum algorithm (or weighing subroutine), for the quantum states of a group of quantum bits contained in the quantum circuit, a binary expression mode is adopted, for example, the group of quantum bits are q0, q1 and q2, the 0 th, 1 st and 2 nd quantum bits are represented, the q2q1q0 are ordered from high order to low order in the binary expression mode, the quantum states corresponding to the group of quantum bits are in total number of 2 quantum bits to the power of the total number of the quantum bits, namely 8 eigenstates (determined states): i000>、|001>、|010>、|011>、|100>、|101>、|110>、|111>The bits of each quantum state correspond to the qubits, e.g. |001>In the state, 001 corresponds to q2q1q0, |from high to low>Is a dirac symbol. For a bit q containing N quanta ₀ 、q ₁ 、…、q _n 、…、q _N-1 The order of the binary representation quantum states is q _N-1 q _N-2 …、q ₁ q ₀ 。

Described in terms of a single qubit, the logic state ψ of a single qubit may be at |0>State, |1>State, |0>State sum |1>The superimposed state (uncertainty state) of the states can be expressed in particular as ψ=a|0>+b|1>Where a and b are complex numbers representing the amplitude (probability amplitude) of the quantum states, the square of the modulus of the amplitude represents the probability, |a| ² 、|b| ² Respectively indicate that the logic state is |0 >State, |1>Probability of state, |a| ² +|b| ² =1. In short, a quantum state is an superposition of eigenstates, when the probability of the other states is 0, i.e. in a uniquely defined eigenstate.

Clustering algorithms are machine learning techniques that involve grouping of data points, and given a set of data points, one can use the clustering algorithm to divide each data point into a particular cluster. In some cases, data points in the same group should have similar attributes and/or features, while data points in different groups should have highly different attributes and/or features, further, when grouping clusters for a group of data points, more densely distributed points may also be grouped into the same cluster.

Referring to fig. 1, a schematic flow diagram of a quantum clustering method provided in an embodiment of the present application includes:

101. obtaining a first data point in a first set, the first set comprising a plurality of data points;

in this embodiment, the first set includes a plurality of data points, each data point corresponds to a coordinate position, that is, the first set includes a plurality of data points representing coordinate positions, which are intended to be divided into the same region, that is, clusters, by using the method, the first set can be regarded as a plane, on which a plurality of points are irregularly distributed, and the points with more concentrated distribution are divided into the same clusters.

102. Acquiring first similarity between the first data point and other data points in the first set according to a first preset quantum circuit, wherein the similarity is determined by the distance between the different data points;

in this embodiment, clustering processing based on quantum computation is implemented according to a preset quantum clustering circuit, as shown in fig. 3, a quantum circuit modularization schematic diagram of the clustering processing in this application includes a quantum state preparation Quantum State Preparation module, a similarity computing SWAP module, a quantum state comparison CMP module, a quantum state search Grover module, and a measurement module.

Specifically, the quantum state preparation module-based circuit can be used for quantum state processing of two-dimensional data by using quantum logic gates RX gate and RY gate as shown in FIG. 4, if the coordinates of two data points are respectively

The two data points can be generally selected as a data point to be clustered and a cluster center, and the rotation angle parameters of the logic gates RX and RY are determined as follows:

wherein θ ₀₀ According to x ₀ The angle is expressed to obtain theta ₀₁ According to y ₀ The angle is expressed to obtain theta ₁₀ According to x ₁ The angle is expressed to obtain theta ₁₁ According to y ₁ And performing angle representation.

Further, the similarity calculation module may be as shown in fig. 5:

in this embodiment, quantum state processing is performed according to the quantum logic gates RX and RY, and then similarity calculation is performed through the controlled SWAP gate, where the quantum circuit for performing similarity calculation is shown in fig. 5, fig. 5 is the quantum logic gate operation after fig. 4, and fig. 5 includes an H gate, the controlled SWAP gate, and a measurement operation M, where the H gate is used to place the quantum state prepared in fig. 4 in an overlapped state, and the controlled SWAP gate is used to calculate the similarity between q-1 and q-2 and transfer the similarity to q-0, and measure the quantum state of q-0.

Specifically, the coordinates of the data to be clustered are represented by a vector u pointing to the data to be clustered from the cluster center by using the coordinate position of the cluster center as an origin, and are unitized according to a formula 5 to facilitate calculation, and the entanglement state is defined according to a formula 6

Defining entanglement state |phi according to equation 7>The normalized coefficient Z is defined according to equation 8, the similarity D _i As shown in the formula 9, the following is specific:

wherein u= (u) ₀ ,u ₁ ,...,u _n )，

And m is the total number of data to be aggregated, and is the j-th vector of the c-th cluster.

Further, the method comprises the steps of,

and |phi>The entangled state results D are obtained after controlled SWAP gate operation as follows:

the probability of q-0 to get |0> is measured as:

Then it can be derived from equation 11 and equation 9:

D _i ＝2P(|0>) -1 equation 12

From the derivation of equation 12 above, the similarity can be obtained by measuring the quantum state of the q-0 qubit.

103. Comparing the first similarity with a first preset threshold according to a second preset quantum circuit, and acquiring the number of other data points in a preset neighborhood of the first data point according to the magnitude relation between the first similarity and the first preset threshold;

in this embodiment, the first similarity obtained by the method according to embodiment 102 is compared with a first preset threshold to obtain the number of first similarities greater than the preset minimum similarity, where the number of first similarities satisfying the condition is other data points included in the preset neighborhood of the first data point.

The first preset threshold is a similarity corresponding to a distance from the first data point to a preset neighborhood boundary, and illustratively, the third data point, the fourth data point and the fifth data point are data points in the first set, if the first similarity of the third data point is greater than the first preset threshold, the third data point is located in the preset neighborhood, if the first similarity of the fourth data point is equal to the first preset threshold, the fourth data point is located on the boundary of the preset neighborhood, and if the fifth data point is less than the first preset threshold, the fifth data point is located outside the preset neighborhood.

Specifically, taking a comparison of two quantum states as an example, the two quantum states may include: taking the first quantum state and the second quantum state as the first quantum state by taking the first similarity, and taking the second quantum state as the first preset threshold value as an example: in order to realize the comparison of greater than relation between quantum states by quantum computing, the comparison can be realized by constructing quantum circuits with corresponding functions, and one construction mode can be as follows:

taking fig. 6 as an example, the quantum circuit for quantum state comparison provided in the embodiment of the present application is shown as a quantum logic gate, which sequentially includes: the virtual control CNOT gate, the virtual control OR gate, the real control Toffoli gate, the X gate, the real control OR gate, the virtual control Toffoli gate, the X gate and the CNOT gate are controlled by the quantum bit corresponding to the solid in the real control diagram, and the virtual control diagram is controlled by the quantum bit corresponding to the hollow.

FIG. 6 is a corresponding quantum circuit when two quantum states satisfy a greater than relationship, and it can be understood that the data points within the preset neighborhood obtained from the circuit comparison do not include the data points at the neighborhood boundary. If the desired data point comprises a point located on a neighborhood boundary, changing the greater than relationship to greater than or equal to the relationship, i.e., the first quantum state is greater than or equal to the second quantum state, in the quantum circuit corresponding to the relation greater than or equal to the relation, the adopted first quantum logic gate is replaced by a virtual control CNOT gate: the X gate acting on a 1 and the Toffoli gate acting on p 1, q 1, a 1, which are virtually controlled by p 1, remain unchanged.

Further, if the desired point is located within the neighborhood and does not include a point on the neighborhood boundary, a first qubit for storing the first quantum state, a second qubit for storing the second quantum state, a third qubit for storing carry information, and a fourth qubit for storing the comparison result are acquired.

Wherein the first qubit is provided with n bits: q 1]、q[2]、…、q[n]Storing the first quantum state correspondingly: i i ₁ >、|i ₂ >、…、|i _n >The method comprises the steps of carrying out a first treatment on the surface of the Wherein n is a positive integer;

the second qubit is provided with (n+m) bits: p1]、p[2]、…、p[n]、…、p[n+m]Correspondingly storing the second quantum state: i j ₁ >、|j ₂ >、…、|j _n >、…、|j _n+m >The method comprises the steps of carrying out a first treatment on the surface of the Wherein m is a non-negative integer;

the third quantum bit is used for storing carry information after each bit of the first quantum state is compared with each bit of the second quantum state, and is provided with n bits: a 1 ]、a[2]、…、a[n]Carry information is stored specifically in the corresponding quantum state: i a ₁ >、|a ₂ >、…、|a _n >Taking a relation greater than that as an example, comparing from the lowest position, if one bit of the first quantum state is greater than the corresponding bit of the second quantum state, carrying information is obtained as 1, otherwise, the carrying information is 0;

the fourth qubit is used for storing whether the first quantum state and the second quantum state meet the comparison result of the relation greater than or equal to 1 bit: q [ cmp ], the comparison result is specifically stored in the corresponding quantum state |c >.

Determining a corresponding first quantum logic gate for generating carry information and a corresponding second quantum logic gate for generating a comparison result according to the carry information according to each bit of the first quantum state and the second quantum state which are greater than the relation;

first bit i for the first quantum state ₁ >First bit of the second quantum state |j ₁ >Determining the action on the |i ₁ >Corresponding first qubit, the |j ₁ >The first quantum logic gate of the corresponding second quantum bit and the first third quantum bit is a virtual control CNOT gate; the function of the virtual control CNOT gate is as follows: at |j ₁ >＝|0>The CNOT gate is executed at the time, namely: at |j ₁ >＝|0>And |i ₁ >＝|1>(see |i) ₁ >Greater than |j ₁ >) At the time, the third qubit is first bit a 1]Quantum state |a of (a) ₁ >From |0>Overturn to be |1 >Thereby obtaining carry information 1 of the first bit and storing it.

The kth bit i for the first quantum state _k >The kth bit |j of the second quantum state _k >Determining the effect on i _k >Corresponding first qubit, |j _k >The first quantum logic gates of the corresponding second qubit, the (k-1) th and the kth third qubit are virtual control OR gates and real control Toffoli gates; wherein k is an integer and 1 < k < n; the virtual control OR gate has the following functions: at |j _k >＝|0>The OR gate is executed at the time, namely: i j _k >＝|0>At |i _k >＝|1>Or |a _k-1 >＝|1>When the (k-1) th bit has carry information of 1, the k-th bit a [ k ]]Quantum state |a of (a) _k >From |0>Overturn to be |1>Thereby obtaining the carry information 1 of the kth bit; the function of the actual control Toffoli gate is as follows: at |j _k >＝|1>The Toffoli gate is executed at that time, namely: i j _k >＝|1>At |i _k >＝|1>And |a _k-1 >＝|1>At the time, the kth bit a [ k ]]Quantum state |a of (a) _k >From |0>Overturn to be |1>Thereby obtaining the carry information 1 of the kth bit.

The nth bit i for the first quantum state _n >The nth bit |j of the second quantum state _n >To (n+m) th bit |j _n+m >Determining the effect on j _n >To |j _n+m >First quantum logic of corresponding second quantum bitThe gate being an X gate and acting on i _n >Corresponding first qubit, |j _n >To |j _n+m >The first quantum logic gates of the corresponding second, (n-1) and nth third qubits are real-control OR gates and virtual-control Toffoli gates; wherein, first, for the second qubit p [ n ] ]To p [ n+m ]]Adding an X gate to correspond to the second quantum state |j _n >To |j _n+m >Turning over and adding p [ n ]]To p [ n+m ]]The real-control OR gate, namely: at |j _n >To |j _n+m >All are |1>In the state, execution acts on q [ n ]]、a[n-1]And a [ n ]]The OR gate of (c) acts as: at |i _n >＝|1>Or |a _n-1 >＝|1>When the nth bit a [ n ]]Quantum state |a of (a) _n >From |0>Overturn to be |1>Thereby obtaining carry information 1 of the nth bit; then, p [ n ] is added]Virtual control, p [ n+1 ]]To p [ n+m ]]The Toffoli gate in real control, namely: at |j _n >＝|0>、|j _n+1 >To |j _n+m >All are |1>When executing action on q [ n ]]、a[n-1]And a [ n ]]The Toffoli gate of (c) acts as: at |i _n >＝|1>And |a _n-1 >＝|1>When the nth bit a [ n ]]Quantum state |a of (a) _n >From |0>Overturn to be |1>Thereby obtaining carry information 1 of the nth bit; it can be seen that if the extra qubit |j _n+1 >To |j _n+m >At least one bit is |1>(indicating that the second quantum state is necessarily larger than the first quantum state), at least one bit becomes |0 after the X gate is turned over>So that the OR gate and Toffoli gate are not implemented, the n-th bit carry information is still 0, indicating no carry; if |j _n+1 >To |j _n+m >All are |0>At |j _n >＝|0>When the X gate is turned over, the X gate turns over to be |1>Performing an OR gate; at |j _n >＝|1>When the X gate is turned over, the Y gate is turned over _n >Becomes |0>、|j _n+1 >To |j _n+m >All become |1>At this time, the Toffoli gate is performed. Further, it may be performed at OR gate OR Toffoli gate, and then at p [ n ] ]To p [ n+m ]]And adding an X gate to realize the recovery of the second quantum state. Determining a second quantum logic gate acting on the nth third qubit and the fourth qubit as a CNOT gate for generating a comparison result from carry information. Wherein an addition is made to act on a [ n ] after the OR gate OR the Toffoli gate is implemented]And q [ cmp ]]CNOT gate of a [ n ]]Carry information stored to q [ cmp ]]Is a kind of medium.

And operating the quantum circuit, measuring target quantum bits contained in the quantum circuit, and comparing the first similarity with a first preset threshold value to determine whether the greater than relation is met. Specifically, the quantum state |c > of the fourth qubit may be measured as a comparison result; and determining whether the first quantum state and the second quantum state accord with a relation greater than that according to the comparison result. In the computer arts, a true value true is generally indicated by 1, which is exemplary of determining that the first quantum state and the second quantum state meet a greater than relationship if the measured comparison result is a |1> state; if the state is |0>, this means that the first quantum state and the second quantum state are determined not to satisfy a greater than relationship. I.e. if the measured comparison result is in the state |1>, the point is located in the preset neighborhood, and if the measured comparison result is in the state |0>, the point is not located in the preset neighborhood.

104. Judging whether the number of other data points in the preset neighborhood of the first data point is larger than a second preset threshold value or not;

in this embodiment, the number of first similarities greater than or equal to the preset minimum similarity is searched, and the number of first similarities satisfying the condition is the number of other data points included in the preset neighborhood of the first data point.

Specifically, if 8 points are added to the first set except for the first data point and are numbered with 0-7, if the points corresponding to 4, 5, 6 and 7 meet the conditions, since eight points are added, the corresponding binary is 111, 3 qubits are needed to be encoded into the quantum state, and 3 bits together represent 3 times of data (0 to 7, corresponding to |000> to |111> states) of 2, 8 probability data are output in total.

Then |000>: output |0> |001>: output |0>, |010>: output |0> |011>: output |0> |100>: output |1> |101>: output |1> |110>: output |1> |111>: output |1>; thereby obtaining the probability that each quantum state contained in the superposition state |phi > is larger than the target value is 00, 1. Since the elements are 7 at maximum, binary 111, 3 qubits are required to be encoded into the quantum states, and 3 bits together represent 3 data (0 to 7, corresponding to |000> to |111> states) of 2, 8 probability data are output in total. The first set corresponds to a first superposition state |φ >:

Quantum states |000>, |001>, |010>, |011> with

amplitude

0, 1, 2, 3, the indexes of quantum states |100>, |101>, |110>, |111> with the amplitude of 1 respectively correspond to the indexes of 4, 5, 6 and 7, and the indexes of the indexes are 0, 1 and 1. And finding out an index value corresponding to the probability 1 according to the 8 probability values, and further finding out element values 4, 5, 6 and 7 corresponding to the index value, namely the data points included in the preset neighborhood.

Taking the first set as an example, if the result quantum state |000 is output>To |111>And the probability of it being within a preset neighborhood. A probability of 0 indicates that the data point is not within the preset neighborhood, and a probability of 1 indicates that the data point is within the preset neighborhood. From the following components

That is, f (0) =0, f (1) =0, f (2) =0, f (3) =0, f (4) =1, f (5) =1, f (6) =1, f (7) =1, and only the index x corresponding to f (x) =1 needs to be found, and the corresponding element can be found according to the index.

The first set corresponds to a first superposition state |φ >:

quantum states |000>, |001>, |010>, |011> with amplitude 0 correspond to 1, 2, 3, 4, each element has a corresponding index of 0 to 7, the corresponding probability of each index is 0, 00, 1. According to the 8 probability values, an index value corresponding to the probability 1 is found, and then element values (4, 5, 6 and 7) corresponding to the index value are found, namely data points included in a preset neighborhood.

First, a second superposition state |ψ > is created as shown in equation 13:

wherein N is the number of probability values output. Taking set a as an example, n=8.

Setting the first Oracle operator o, where the operator is used for the corresponding quantum state inversion phase when f (x) =1, as shown in formula 14:

a second operator G (Grover operator) is defined for expanding the amplitude of the quantum state of the inversion phase as shown in equation 15:

g= (2|ψ > < ψ| -I) O equation 15

Wherein O is

Without loss of generality, all x-constituent quantum states of f (x) =1 are assumed to be as shown in equation 16:

then, the quantum state composed of all x of f (x) =0 is as shown in formula 17:

Where M represents the number of solutions in the set, |α > represents the quantum superposition of all non-solutions, |β > represents the quantum superposition of all solutions, i.e., the final quantum state.

Wherein n=2 ⁿ . Therefore |ψ>Can be represented by equation 18:

the Grover algorithm is applied using equation 19:

o (a|α > +b|β) =a|α > -b|β > equation 19

For simple calculation, set up

It can be obtained that |ψ > after the second operator G acts once is as shown in formula 20:

further, it is obtained that |ψ > after the second operator G is applied k times is as shown in formula 21:

the usable image is shown in fig. 8, and the use of G multiple times can let |ψ>Continuously approach |beta>. Finally, measurement |psi is carried out>It can obtain |beta with high probability>I.e., an index of f (x) =1. By way of example, a modular quantum circuit diagram for a Grover algorithm is shown in fig. 7, as will be appreciated by those skilled in the art,

representing a quantum logic gate module (including an H gate) creating an overlaid state, the Oracle workspace corresponds to a first Oracle operator o and G corresponds to a second Grover operator.

105. If the data points are larger than the first data points, marking the first data points as core points, and marking other data points in a preset neighborhood of the first data points into a first cluster taking the first data points as cores.

In this embodiment, if a certain data point, that is, a preset neighborhood of a first data point, includes a certain number of data points, the data points distributed in the preset neighborhood are considered to be relatively concentrated, the first data point is taken as a center point, a preset neighborhood formed by taking a preset distance as a radius is taken as a cluster, in the implementation process, whether the number of data points, of which the distances between all data points in the first set and the first data point are smaller than the preset distance, is larger than a preset threshold value is judged, if the number is larger than the preset threshold value, the first data point is marked as a core point, other data points in the preset neighborhood of the first data point are marked into a first cluster taking the first data point as a core, and if the number is not larger than the preset threshold value, the first data point is marked as a non-core point, and the non-core point is not taken as a core of any cluster.

Based on fig. 1, the embodiment of the present application further introduces a cluster merging situation, specifically referring to fig. 2, another flow chart of the quantum clustering method provided in the embodiment of the present application includes:

201. acquiring a second data point in the first set, the second data point being located at a different location than the first data point;

202. Judging whether the number of other data points in the preset neighborhood of the second data point is larger than a preset threshold value or not;

203. if the data points are larger than the first data points, setting the second data points as core points, and dividing other data points in a preset neighborhood of the second data points into a second cluster taking the second data points as cores;

204. judging whether any data point in the second cluster is already divided into a first cluster taking the first data point as a core;

205. if yes, the first data point is taken as a core, and the first cluster and the second cluster are combined.

In this embodiment, since the data points included in the preset neighborhood of a certain data point are limited, the concentration degree of the data point distribution outside the preset neighborhood still may still meet the requirement of being able to be divided into the same cluster, and then the data points outside the preset neighborhood may be integrated into the preset neighborhood to generate a new cluster.

Specifically, the present embodiment performs the method as described in the previous embodiments 101-105 once for all data points included in the first set until all points are marked as core points or non-core points. And after the first data point is marked as a core point, acquiring a second data point in the first set, wherein the second data point is different from the first data point in position and is not marked, judging whether the number of other data points in a preset neighborhood of the second data point is larger than a preset threshold value, if not, marking the second data point as a non-core point, continuing to traverse other unmarked points, and if so, taking the second data point as a core, and dividing a circular area with a preset distance as a radius into second clusters. If the second cluster is crossed with the data points included in the first cluster, namely, the points in a certain first set are located in the areas of the first cluster and the second cluster at the same time, the second cluster is combined with the first cluster, the core point of the previous generated cluster is used as a new core point, or the coordinates of all the points included in the new cluster are calculated to perform weighted average calculation so as to obtain a new coordinate position, and the data point closest to the coordinate position is used as the new core point, so that the application does not require.

In this embodiment, a first data point in a first set is obtained, a first similarity between the first data point and other data points in the first set is obtained according to a first preset sub-line, the first similarity is compared with a first preset threshold value according to a second preset sub-line, the number of other data points in a preset neighborhood of the first data point is obtained according to a size relationship between the first similarity and the first preset threshold value, whether the number of other data points in the preset neighborhood of the first data point is larger than a second preset threshold value is judged, if so, the first data point is marked as a core point, and other data points in the preset neighborhood of the first data point are marked into a first cluster taking the first data point as a core. And the parallel advantage of quantum computation is exerted, and irregularly distributed data points are clustered according to the distance based on the quantum computation and a clustering algorithm.

The foregoing describes the present invention from a method perspective, and the following further describes the present invention from a device perspective, with particular reference to fig. 9, including:

an acquisition unit 901 for acquiring a first data point in a first set, the first set comprising a plurality of data points;

The calculating unit 902 is configured to obtain, according to a first preset sub-line, a first similarity between the first data point and other data points in the first set, where the similarity is determined by a distance between different data points;

the comparing unit 903 is configured to compare the first similarity with a first preset threshold according to a second preset quantum circuit, and obtain the number of other data points in a preset neighborhood of the first data point according to a magnitude relation between the first similarity and the first preset threshold;

a judging unit 904, configured to judge whether the number of other data points in the preset neighborhood of the first data point is greater than a second preset threshold;

and a first marking unit 905, configured to mark the first data point as a core point and mark other data points in a preset neighborhood of the first data point into a first cluster using the first data point as a core if the judging unit judges that the first data point is the core point.

Optionally, the apparatus further comprises: and a second marking unit 906, configured to mark the first data point as a non-core point if the judging unit judges that the first data point is not a core of any cluster.

It may be seen that an obtaining unit 901 is configured to obtain a first data point in a first set, where the first set includes a plurality of data points, a calculating unit 902 is configured to obtain, according to a first preset sub-line, a first similarity between the first data point and other data points in the first set, where the similarity is determined by a distance between different data points, a comparing unit 903 is configured to compare, according to a second preset sub-line, the first similarity with a first preset threshold, and obtain, according to a magnitude relation between the first similarity and the first preset threshold, a number of other data points in a preset neighborhood of the first data point, a judging unit 904 is configured to judge whether the number of other data points in the preset neighborhood of the first data point is greater than a second preset threshold, and a first marking unit 905 is configured to mark the first data point as a core point and to divide the other data points in the preset neighborhood of the first data point into a first cluster using the first data point as a core. The method plays a parallel advantage of quantum computation, and data points distributed irregularly are clustered according to distance based on quantum computation and a clustering algorithm.

The following describes the operation of the computer terminal in detail by taking it as an example. Fig. 10 is a hardware structure block diagram of a computer terminal of a quantum clustering method according to an embodiment of the present invention. As shown in fig. 10, the computer terminal may include one or more (only one is shown in fig. 10) processors 1001 (the processor 1001 may include, but is not limited to, a microprocessor MCU or a processing device such as a programmable logic device FPGA) and a memory 1002 for storing data, and optionally, a transmission device 1003 for a communication function and an input-output device 1004. It will be appreciated by those skilled in the art that the configuration shown in fig. 10 is merely illustrative and is not intended to limit the configuration of the computer terminal described above. For example, the computer terminal may also include more or fewer components than shown in fig. 10, or have a different configuration than shown in fig. 10.

The memory 1002 may be used to store software programs and modules of application software, such as program instructions/modules corresponding to the quantum clustering method in the embodiments of the present application, and the processor 1001 executes the software programs and modules stored in the memory 1002, thereby performing various functional applications and data processing, that is, implementing the method described above. The memory 1002 may include high-speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some examples, the memory 1002 may further include memory located remotely from the processor 1001, which may be connected to the computer terminal via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.

The transmission device 1003 is used to receive or transmit data via a network. Specific examples of the network described above may include a wireless network provided by a communication provider of a computer terminal. In one example, the transmission apparatus 1003 includes a network adapter (Network Interface Controller, NIC) that can connect to other network devices through a base station so as to communicate with the internet. In one example, the transmission device 1003 may be a Radio Frequency (RF) module for communicating with the internet wirelessly. The embodiment of the application also provides a computer readable storage medium, wherein the computer readable storage medium stores a computer program for electronic data exchange, and the computer program makes a computer execute part or all of the steps of any one of the above method embodiments, and the computer includes an electronic device. And the parallel advantage of quantum computation is exerted, and irregularly distributed data points are clustered according to the distance based on the quantum computation and a clustering algorithm.

Embodiments of the present application also provide a computer program product comprising a non-transitory computer-readable storage medium storing a computer program operable to cause a computer to perform some or all of the steps of any one of the methods described in the method embodiments above. The computer program product may be a software installation package, said computer comprising an electronic device.

The embodiment of the application also provides a quantum computer operating system which realizes the quantum clustering processing according to part or all of the steps of any one of the methods described in the embodiment of the method.

It should be noted that, for simplicity of description, the foregoing method embodiments are all expressed as a series of action combinations, but it should be understood by those skilled in the art that the present application is not limited by the order of actions described, as some steps may be performed in other order or simultaneously in accordance with the present application. Further, those skilled in the art will also appreciate that the embodiments described in the specification are all preferred embodiments, and that the acts and modules referred to are not necessarily required in the present application.

In the foregoing embodiments, the descriptions of the embodiments are emphasized, and for parts of one embodiment that are not described in detail, reference may be made to related descriptions of other embodiments.

In the several embodiments provided in this application, it should be understood that the disclosed apparatus may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, such as the above-described division of units, merely a division of logic functions, and there may be additional manners of dividing in actual implementation, such as multiple units or components may be combined or integrated into another system, or some features may be omitted, or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be an indirect coupling or communication connection via some interfaces, devices or units, or may be in electrical or other forms.

The units described above as separate components may or may not be physically separate, and components shown as units may or may not be physical units, may be located in one place, or may be distributed over a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

In addition, each functional unit in each embodiment of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in software functional units.

The integrated units described above, if implemented in the form of software functional units and sold or used as stand-alone products, may be stored in a computer readable memory. Based on such understanding, the technical solution of the present application may be embodied in essence or a part contributing to the prior art or all or part of the technical solution in the form of a software product stored in a memory, including several instructions for causing a computer device (which may be a personal computer, a server or a network device, etc.) to perform all or part of the steps of the above-mentioned method of the various embodiments of the present application. And the aforementioned memory includes: a U-disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a removable hard disk, a magnetic disk, or an optical disk, or other various media capable of storing program codes.

Those of ordinary skill in the art will appreciate that all or a portion of the steps in the various methods of the above embodiments may be implemented by a program that instructs associated hardware, and the program may be stored in a computer readable memory, which may include: flash disk, read-Only Memory (ROM), random access Memory (Random Access Memory, RAM), magnetic disk or optical disk.

The foregoing has outlined rather broadly the more detailed description of embodiments of the present application, wherein specific examples are provided herein to illustrate the principles and embodiments of the present application, the above examples being provided solely to assist in the understanding of the methods of the present application and the core ideas thereof; meanwhile, as those skilled in the art will have modifications in the specific embodiments and application scope in accordance with the ideas of the present application, the present description should not be construed as limiting the present application in view of the above.

Claims

1. A quantum clustering method, the method comprising:

2. The method of claim 1, wherein if the number of other data points in the predetermined neighborhood of the first data point is not greater than a predetermined threshold, the method further comprises:

3. The method of claim 1, wherein after the grouping other data points in the predetermined neighborhood of the first data point into the first cluster with the first data point as a core, the method further comprises:

4. The method of claim 1, wherein the obtaining a first similarity of the first data point to other data points in the first set according to a first preset quantum wire comprises:

preparing data points in the first set into quantum states respectively;

5. The method of claim 1, wherein determining whether the number of other data points in the predetermined neighborhood of the first data point is greater than a predetermined threshold comprises:

6. A quantum clustering device, the device comprising:

7. The apparatus of claim 6, wherein the apparatus further comprises:

8. An electronic device comprising a processor, a memory, a communication interface, and one or more programs stored in the memory and configured to be executed by the processor, the programs comprising instructions for performing the steps in the method of any of claims 1-5.

9. A computer readable storage medium, characterized in that the computer readable storage medium stores a computer program, which is executed by a processor to implement the method of any of claims 1-5.

10. A quantum computer operating system implementing quantum clustering according to the method of any one of claims 1-5.