Quantum calculation method and device for Simon problem, equipment and medium

Abstract

The invention relates to a quantum computing method, device and equipment for a Simon problem and a medium, and the method comprises the steps: obtaining the number of original definition domain bits and the number of original value domain bits of a to-be-solved Simon problem function; sub-Simon problem functions with the same number are constructed on the basis of original definition domain bits and the number of the to-be-solved Simon problem function, and the definition domain bit of each sub-Simon problem function is a bit in an original definition domain; mapping the value domain of each sub-Simon problem function into a value domain of which the number of bits is 1 so as to obtain a corresponding Deutsch problem function; constructing a problem solving quantum circuit; respectively operating a problem solving quantum circuit corresponding to each sub-Simon problem function to obtain a corresponding sub-character to be solved; and sequentially combining the corresponding sub-characters to obtain a to-be-solved character string of the to-be-solved Simon problem function. According to the method, the requirement for the number of quantum bits is reduced, and the solving precision and efficiency are improved.

Description

Technical Field

[0001] The present invention relates to the field of quantum computing technology, and in particular to a quantum computing method, device, equipment and medium for Simon problem. Background Art

[0002] Quantum algorithms are algorithms that run on quantum computers and represent a cutting-edge computing technology. They use properties such as quantum superposition and quantum entanglement in quantum mechanics to solve problems that are difficult to solve with traditional algorithms. Compared with classical algorithms, quantum algorithms use quantum bits (Qubit) as the basic carrier of information and can explore multiple possible solutions at the same time, thereby achieving significant superiority over classical computing on specific problems.

[0003] So far, researchers have developed a series of quantum algorithms and achieved remarkable results in many fields. Among them, the Simon algorithm not only promoted the development of Fourier transform algorithms based on quantum computing, but also laid the foundation for the famous Shor algorithm. With the advantage of quantum parallelism, the Shor algorithm can theoretically efficiently decompose large integers in polynomial time, which has brought disruptive changes to the field of cryptography. The Simon algorithm also shows great potential in solving practical problems, especially in cryptography and coding. For example, the Simon algorithm can effectively crack encryption schemes based on Simon functions.

[0004] The Simon algorithm was proposed by Daniel Simon in 1994 to solve a specific problem, namely, to determine whether a black box function is a one-to-one function or a two-to-one function and find the corresponding binary string. Specifically, given a Boolean function ,in , is the range of values ​​that the independent variable can take, called the domain. is the range of the dependent variable value, called the range. This function satisfies the following properties: there is an unknown string , so that for all values ​​of the independent variable ,have , if and only if or ( represents modulo 2 addition, or XOR operation).

[0005] The goal of solving the Simon problem is to determine the string s based on the given domain and range. Currently, there are two main methods to solve the Simon problem: one is the classical algorithm, and the other is the Simon algorithm proposed by Daniel Simon based on quantum computing. The query complexity of using the classical algorithm to solve the Simon problem is O(2 n), the query complexity of using the Simon algorithm to solve the Simon problem is O(n). Compared with the classical computing method, the computing speed of the existing Simon algorithm is exponentially accelerated.

[0006] However, when the domain and range of the Simon problem are given, the number of quantum bits required to solve the Simon problem using the existing Simon algorithm is n+m. When n and m are large, the number of quantum bits required will increase significantly, which means that a large-scale general-purpose quantum computer is needed to complete the calculation. For today's quantum technology, the use of large-scale general-purpose quantum computers to solve the Simon problem will face many problems. First, it costs a lot of money to build and run such a computer; second, the computing efficiency is low, because the increase in the number of quantum bits will lead to a significant increase in the depth and complexity of the quantum circuit, thereby slowing down the calculation speed; in addition, quantum fidelity will be limited, and quantum bits are susceptible to noise and errors during operation, which will have a large negative impact on the accuracy of the calculation. Summary of the invention

[0007] In view of the technical problems existing in the prior art, the present invention proposes a quantum computing method, system and medium for solving the Simon problem, so as to reduce the demand for the number of quantum bits and improve the solution accuracy and efficiency.

[0008] In order to solve the above technical problem, according to one aspect of the present invention, the present invention provides a quantum computing method for solving the Simon problem, the method comprising the following steps: Obtain the number of bits in the original domain and the number of bits in the original range of the Simon problem function to be solved, wherein the original independent variable value in the original domain and the original dependent variable value in the original range are both binary numbers; Constructing the same number of sub-Simon problem functions based on the original domain bits and the number of original domain bits of the Simon problem function to be solved, wherein the domain bit of each sub-Simon problem function is a bit in the original domain, the range of each sub-Simon problem function is a sub-domain of the range of the Simon problem function to be solved, and each sub-Simon problem function includes a corresponding sub-character to be solved; Map the value range of each sub-Simon problem function to a value range with a bit number of 1 to obtain the corresponding Deutsch problem function; Constructing a problem-solving quantum circuit, wherein the problem-solving quantum circuit includes a Deutsch problem function solving unit and a Simon problem equation solving unit connected in sequence; Run the problem-solving quantum circuit corresponding to each sub-Simon problem function separately to obtain the corresponding sub-character to be solved; According to the position of the domain bit of the sub-Simon problem function in the original domain of the Simon problem function to be solved, the corresponding sub-characters to be solved are sequentially combined to obtain the character string to be solved of the Simon problem function to be solved.

[0009] Optionally, the step of constructing the same number of sub-Simon problem functions includes: Determine a first bit in the original domain bits of the to-be-solved Simon problem function as the domain bits of the sub-Simon problem function, and the remaining bits as the second bits of the second domain; Extracting the first digit value from the original independent variable value of the original definition domain of the Simon problem function to be solved to form the sub-independent variable value of the sub-Simon problem function; Sequentially extracting a second bit value from each original independent variable value of the original definition domain of the Simon problem function to be solved to form a corresponding second independent variable value; Combine each sub-independent variable value of the sub-Simon problem function with each second independent variable value in the order of their respective bits in the original definition domain to form an original independent variable value in the original definition domain; Acquire an original dependent variable value corresponding to the original independent variable value from the original value domain of the Simon problem function to be solved as a first original dependent variable value; A first original dependent variable value is determined from multiple first original dependent variable values ​​corresponding to each sub-independent variable value according to the same valuation function as the sub-dependent variable value corresponding to the sub-independent variable value, wherein the sub-dependent variable value corresponding to each sub-independent variable value constitutes the value range of the sub-Simon problem function.

[0010] Optionally, when constructing the same number of sub-Simon problem functions, each first bit in the original domain of the Simon problem function to be solved is used as the domain bit of a sub-Simon problem function in order from high to low or from low to high.

[0011] Optionally, the valuation function is a maximum value function or a minimum value function. Correspondingly, the step of determining a first original dependent variable value as the sub-dependent variable value corresponding to the sub-independent variable value according to the same valuation function from a plurality of first original dependent variable values ​​corresponding to each sub-independent variable value includes: determining a first original dependent variable value with the largest or smallest value from a plurality of first original dependent variable values ​​corresponding to each sub-independent variable value as the sub-dependent variable value corresponding to the sub-independent variable value.

[0012] Optionally, when mapping the value range of a sub-Simon problem function to a value range with a bit number of 1, each sub-dependent variable value of the sub-Simon problem function is mapped to a binary value with a bit number of 1, and when two sub-dependent variable values ​​are the same, the mapping values ​​corresponding to each sub-dependent variable value are the same, and are binary values ​​0 or 1; when two sub-dependent variable values ​​are different, the mapping values ​​corresponding to each sub-dependent variable value are different, and are binary values ​​0 and 1 respectively.

[0013] Optionally, the Simon problem equation solving unit is a quantum gate or a combination of quantum gates that realizes flipping between quantum state 0 and quantum state 1.

[0014] Optionally, when respectively running the problem function solving quantum circuit corresponding to each sub-Simon problem function, the problem function solving quantum circuit of the sub-Simon problem function is run in a serial and / or parallel manner to obtain the corresponding sub-character to be sought.

[0015] According to another aspect of the present invention, the present invention also provides a quantum computing device for Simon problem, the device comprising a parameter acquisition module, a sub-Simon problem function construction module, a mapping module, a quantum circuit construction module, an operation module and a combination module, the parameter acquisition module is configured to acquire the number of original domain bits and the number of original range bits of the Simon problem function to be solved, wherein the original independent variable value in the original domain and the original dependent variable value in the original range are binary numbers respectively; the sub-Simon problem function construction module is configured to construct the same number of sub-Simon problem functions based on the original domain bits and the number of original domain bits of the Simon problem function to be solved, wherein the domain bit of each sub-Simon problem function is a bit in the original domain, and the range of each sub-Simon problem function is the number of bits in the Simon problem to be solved. n subdomains of the value domain of the Simon problem function, each Simon problem subfunction having a subcharacter to be sought; the mapping module is configured to map the value domain of each Simon problem subfunction to a value domain with a bit number of 1 to obtain a corresponding Deutsch problem function; the quantum circuit construction module is configured to construct a problem-solving quantum circuit, wherein the problem-solving quantum circuit comprises a Deutsch problem function solving unit and a Simon problem equation solving unit connected in sequence; the running module is configured to respectively run the problem-solving quantum circuit corresponding to each Simon problem subfunction to obtain a corresponding subcharacter to be sought; the combining module is configured to sequentially combine the corresponding subcharacters to be sought according to the positions of the domain bits of the Simon problem subfunction in the original domain of the Simon problem function to be solved to obtain a character string to be sought of the Simon problem function to be solved.

[0016] According to another aspect of the present invention, the present invention also provides an electronic device, including a processor and a memory, wherein the memory stores computer instructions, and when the processor runs the computer instructions, the aforementioned quantum computing method for the Simon problem is executed.

[0017] According to another aspect of the present invention, the present invention also provides a computer-readable storage medium, wherein the computer-readable storage medium stores computer instructions, and when the computer instructions are executed by a processor, the aforementioned quantum computing method for the Simon problem is executed.

[0018] The present invention combines the concept of distributed computing with quantum algorithms, breaking down the complex and resource-intensive Simon problem solving task into a series of small-scale, more manageable subtasks. Each subtask does not require auxiliary quantum bits and only requires one quantum bit, significantly reducing the demand for quantum resources. In addition, due to the small number of quantum bits used, the impact of line noise on the quantum state is also significantly reduced, thereby improving quantum fidelity and further improving the calculation accuracy of the solution. Since each subtask only requires one quantum bit, the efficient solution of the Simon problem can be achieved by flexibly setting serial, parallel and other calculation methods based on existing computing resources. BRIEF DESCRIPTION OF THE DRAWINGS

[0019] The preferred embodiments of the present invention will be further described in detail below with reference to the accompanying drawings, wherein: Figure 1 is a flow chart of a quantum computing method for Simon problem according to one embodiment of the present invention; Figure 2 is a flow chart of a method for constructing a sub-Simon problem function according to an embodiment of the present invention; Figure 3 is a quantum circuit diagram of a Deutsch problem function according to an embodiment of the present invention; Figure 4 is a schematic diagram of a problem-solving quantum circuit corresponding to a computing node according to an embodiment of the present invention; Figure 5 is a flow chart of a method for solving Simon problem based on multiple computing nodes and quantum circuits according to an embodiment of the present invention; Figure 6 is a schematic diagram of a quantum circuit used when applying the prior art to solve the Simon problem according to an embodiment of the present invention; Figure 7 is a principle block diagram of a quantum computing device for Simon problem according to one embodiment of the present invention; Figure 8is a principle block diagram of a quantum computing device for Simon problem according to another embodiment of the present invention; Fig. 9 It is a structural principle block diagram of an electronic device according to an embodiment of the present invention. DETAILED DESCRIPTION

[0020] In order to make the purpose, technical solution and advantages of the embodiments of the present invention clearer, the technical solution in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0021] In the following detailed description, reference may be made to the various specification drawings that are part of the present application and are used to illustrate specific embodiments of the present application. In the accompanying drawings, similar reference numerals describe substantially similar components in different figures. The various specific embodiments of the present application are described in sufficient detail below so that a person of ordinary skill in the art with relevant knowledge and skills in the art can implement the technical solutions of the present application. It should be understood that other embodiments may also be utilized or structural, logical or electrical changes may be made to the embodiments of the present application. In addition, the "first", "second", etc. in the names of the technical features of the present invention are not used to indicate sorting, but to distinguish different technical features of the same name.

[0022] In today's noisy intermediate-scale quantum (NISQ) era, the technical path to realize small-scale quantum processors is more feasible than building a large-scale general-purpose quantum computer. The concept of distributed quantum computing (DQC) is an innovative move that cleverly combines the essence of distributed systems with quantum information processing technology. The implementation of this architecture relies on carefully designed distributed quantum algorithms to ensure its effectiveness in practical applications.

[0023] See also Figure 1 , Figure 1 is a flow chart of a quantum computing method for the Simon problem according to an embodiment of the present invention. In the present invention, the Boolean function in the Simon problem to be solved is: , n is the number of binary bits of the original independent variable, referred to as the number of bits of the original domain, is called the original definition domain; m is the number of binary bits of the original dependent variable, referred to as the number of bits in the original range. , is called the original range; and satisfies: for all values ​​of the independent variable ,have , if and only if or , s is the string to be requested, , the Boolean function in the aforementioned Simon problem to be solved is referred to as the Simon problem function to be solved. The quantum computing method for the Simon problem of this embodiment includes the following steps: Step S1, obtaining the number of bits in the original domain and the number of bits in the original range of the Simon problem function to be solved, wherein the original independent variable value in the original domain and the original dependent variable value in the original range are binary numbers respectively.

[0024] Step S2, constructing the same number of sub-Simon problem functions based on the original domain bits and the number of the Simon problem function to be solved, wherein the domain bit of each sub-Simon problem function is a bit in the original domain, the range of each sub-Simon problem function is a subdomain of the range of the Simon problem function to be solved, and each sub-Simon problem function has a sub-character to be solved.

[0025] Step S3, mapping the value range of each sub-Simon problem function to a value range with a bit number of 1 to obtain a corresponding Deutsch problem function.

[0026] Step S4, constructing a problem-solving quantum circuit, wherein the problem-solving quantum circuit includes a Deutsch problem function solving unit and a Simon problem equation solving unit connected in sequence.

[0027] Step S5, respectively running the problem-solving quantum circuit corresponding to each sub-Simon problem function to obtain the corresponding sub-character to be solved.

[0028] Step S6, according to the position of the domain bits of the sub-Simon problem function in the original domain of the Simon problem function to be solved, sequentially combine the corresponding sub-characters to obtain the desired character string of the Simon problem function to be solved.

[0029] In the present invention, a computing task of running a problem function corresponding to a sub-Simon problem function to solve a quantum circuit can be called a computing node, and the problem functions corresponding to multiple sub-Simon problem functions in the present invention to solve quantum circuits can be run in serial by a quantum computing device or in parallel by multiple quantum computing devices. When a quantum computing device supports a large number of quantum bits, multiple problem functions can be run in parallel to solve quantum circuits.

[0030] In step S1, the original domain bit number n and the original range bit number m of the Simon problem function to be solved are obtained. In step S2, n sub-Simon problem functions are constructed. The domain bit of each sub-Simon problem function is one bit in the original domain. Figure 2 , Figure 2 1 is a flowchart of a method for constructing a sub-Simon problem function according to an embodiment of the present invention, which includes the following steps: Step S21, divide the original definition domain of the to-be-solved Simon problem function to obtain a composite definition domain. Specifically, determine a first bit in the bits of the original definition domain of the to-be-solved Simon problem function as the definition domain bit of the sub-Simon problem function, and the remaining bits as the second bits of the second definition domain; sequentially extract the first bit value 0 or 1 from each original independent variable value of the original definition domain, respectively constituting a sub-independent variable value of the sub-Simon problem function, so the sub-independent variable value is 0 or 1, and the definition domain of the sub-Simon problem function can be expressed as {0,1}; sequentially extract the second bit value from each original independent variable value of the original definition domain to form a corresponding second independent variable value, and all the second independent variable values ​​constitute the second definition domain, which can be expressed as {0,1} (n-1) . Wherein, when determining the domain bits of the sub-Simon problem function from the original domain bits of the Simon problem function to be solved, bits can be extracted from any position in the original domain of the Simon problem function to be solved as the domain bits of the sub-Simon problem function, and the domain bits of all sub-Simon problem functions corresponding to all computing nodes are not repeated, and the domain of the sub-Simon problem function and the second domain constitute a composite domain.

[0031] Step S22, based on the composite domain, the corresponding original dependent variable value is obtained from the original value domain of the Simon problem function to be solved as the first original dependent variable value. Specifically, each sub-independent variable value in the domain of the sub-Simon problem function is respectively combined with each second independent variable value in the second domain according to the position order of their respective bits in the original domain to form an original independent variable value in the original domain, and the corresponding original dependent variable value is obtained from the original value domain of the Simon problem function to be solved as the first original dependent variable value.

[0032] Step S23, determining the value range of the sub-Simon problem function. Specifically, a first original dependent variable value is determined from a plurality of first original dependent variable values ​​corresponding to each sub-independent variable value according to the same value function as the sub-dependent variable value corresponding to the sub-independent variable value, wherein the sub-dependent variable value corresponding to each sub-independent variable value constitutes the value range of the sub-Simon problem function of the target computing node, which can be expressed as {0,1}m .

[0033] In step S22 of this embodiment, a composite domain is obtained by compounding the domain of the sub-Simon problem function and the second domain. In one embodiment, the second domain is used as the first-level domain, the domain of the sub-Simon problem function is the second-level domain, and in the composite function corresponding to the composite domain, the dependent variable value obtained based on each independent variable value of the first-level domain is a sub-function based on the second-level domain. The number of sub-functions is determined by the number of binary bits of the independent variable value (i.e., the second independent variable value) in the first-level domain; with an independent variable value in the second-level domain, that is, a sub-independent variable value in the domain of the sub-Simon problem function, a unique original dependent variable value can be determined from the original value domain through the sub-function, which is named as the first original dependent variable value in the present invention.

[0034] The domain of the sub-Simon problem function in the present invention is {0,1}, and the sub-independent variables are 0 and 1 respectively, that is, the number of bits is 1. Since the original independent variable bits of the Simon problem function to be solved have n bits in total, the bits of the second independent variable in the second domain have n-1 bits in total. Therefore, the dependent variable value obtained based on each second independent variable value in the second domain is a sub-function, and the number of sub-functions is 2. (n-1) , each sub-Simon problem function has a sub-variable value corresponding to 2 (n-1) The first original dependent variable value.

[0035] In step S23, the value function is a maximum value function or a minimum value function. Correspondingly, when constructing the value range of the sub-Simon problem function, in the 2 corresponding to a sub-independent variable value (n-1) When a sub-dependent variable value as a sub-Simon problem function is determined from the first original dependent variable values, the first original dependent variable value with the largest or smallest dependent variable value is used as the sub-dependent variable value corresponding to the sub-independent variable value.

[0036] When constructing n sub-Simon problem functions, each first bit in the original definition domain of the to-be-solved Simon problem function is used as a domain bit of a sub-Simon problem function in order from high to low or from low to high.

[0037] In the present invention, a Simon problem function is divided into n (the number of bits in the original domain) sub-Simon problem functions, and the sub-character to be calculated of each sub-Simon problem function is a bit in the string to be calculated of the Simon problem function to be calculated. The present invention regards the calculation process of a sub-character to be calculated as a calculation task, also called a calculation node, corresponding to a physical quantum computing device, and each calculation node corresponds to a quantum bit.

[0038] For example, the method of constructing the sub-Simon problem function in order from low to high is as follows: (1) For the j-th sub-Simon problem function, when j = 0, select the n-1 bits on the left to divide the Simon problem function to be solved, and get 2 (n-1) sub-functions. When j=0, the function partitioning formula is as shown in the following expression 1-1. The jth bit starting from the lowest is used as the domain bit of the 0th sub-Simon problem function, and the n-1th bit of the higher bit is used as the second domain bit, thus obtaining the 0th sub-Simon problem function, that is: .

[0039] 1-1 Among them, k represents the sub-function number, , , and m k is a 1-bit binary number, representing the independent variable of the k-th sub-function, and also the binary value corresponding to the bit of the sub-independent variable of the 0-th sub-Simon problem function; , which are the remaining binary bits outside the domain bits of the 0th sub-Simon problem function, constitute the second domain bits, which are also the binary representation of k.

[0040] From the above expression, we can see that corresponding to the definition domain of the sub-Simon problem function, the same sub-independent variable value corresponds to 2 (n-1) sub-function, through a certain sub-independent variable value m k and a sub-function with a certain second argument value can be combined to form an original independent variable value of the Simon problem function to be solved, so that a specific dependent variable value can be determined from the original value range of the Simon problem function to be solved. Therefore, a sub-independent variable value corresponding to the sub-Simon problem function can be determined from the original value range of the Simon problem function to be solved. (n-1) dependent variable values, for the sake of distinction, these dependent variable values ​​are called the first original dependent variable values.

[0041] Then, based on the maximum value formula 1-2, the sub-Simon problem function of the j-th computing node is obtained: : 1-2 in .

[0042] That is, for a specific independent variable value m of the j-th sub-Simon problem function j , from 2 (n-1)The jth sub-Simon problem function is obtained by taking the maximum value from the first original dependent variable values ​​as the corresponding sub-dependent variable value. . Corresponding to j=0, the 0th sub-Simon problem function is expressed as .

[0043] (2) For the jth node , select j-1 bits on the right and nj bits on the left to divide the Simon problem function to be solved, and get 2 (n-1) sub-functions, when j=1,…,n-2, the function partitioning formula is as shown in the following expression 1-3, the j-th bit starting from the lowest bit is used as the domain bit of the 0-th sub-Simon problem function, and the nj bits higher than it and the j-1 bits lower than it are used as the second domain bits, thus obtaining the j-th sub-Simon problem function, that is: .

[0044] 1-3 Among them, k represents the sub-function number, , , and m k is a 1-bit binary number, representing the independent variable of the k-th sub-function, and also the binary value corresponding to the independent variable of the j-th sub-Simon problem function; and The remaining binary bits outside the domain bits of the j-th sub-Simon problem function constitute the second domain bits, which are also the binary representation of k.

[0045] From the above expression, we can see that corresponding to the definition domain of the sub-Simon problem function, the same sub-independent variable value corresponds to 2 (n-1) sub-function, through a certain sub-independent variable value m k and a sub-function with a certain second argument value can be combined to form an original independent variable value of the Simon problem function to be solved, so that a specific dependent variable value can be determined from the original value range of the Simon problem function to be solved. Therefore, a sub-independent variable value corresponding to the sub-Simon problem function can be determined from the original value range of the Simon problem function to be solved. (n-1) dependent variable values, for the sake of distinction, these dependent variable values ​​are called the first original dependent variable values.

[0046] Then, based on the maximum value formula 1-2, the sub-Simon problem function of the j-th computing node is obtained: .

[0047] (3) For the last sub-Simon problem function, j = n-1, select n-1 bits on the right to divide the Simon problem function to be solved, and get 2 (n-1) sub-functions, when j=n-1, the function partitioning general formula is as shown in the following expression 1-4, the jth bit (the highest bit in this embodiment) from the lowest is used as the domain bit of the n-1th sub-Simon problem function, and the lower n-1 bits are used as the second domain bits, so as to obtain the n-1th sub-Simon problem function, that is: .

[0048] 1-4 Among them, k represents the sub-function number, , , and m k is a 1-bit binary number, representing the independent variable of the k-th sub-function, and also the binary value corresponding to the bit of the sub-independent variable of the n-1-th sub-Simon problem function; , which are the remaining binary bits outside the domain bits of the n-1th sub-Simon problem function, constitute the second domain bits, which are also the binary representation of k.

[0049] The value of a sub-variable corresponding to the n-1th sub-Simon problem function can be determined from the original value range of the Simon problem function to be solved. (n-1) The first original dependent variable value.

[0050] Then, based on the maximum value formula 1-2, the sub-Simon problem function of the j-th computing node is obtained: .

[0051] In step S3, when mapping the value range of a sub-Simon problem function to a value range with a bit number of 1, each sub-dependent variable value of the sub-Simon problem function is mapped to a binary value, and when two sub-dependent variable values ​​are the same, the mapping value corresponding to each sub-dependent variable value is the same, such as a binary value of 0 or 1; when two sub-dependent variable values ​​are different, the mapping value corresponding to each sub-dependent variable value is different, which are binary values ​​0 and 1 respectively.

[0052] For the Simon problem with a domain and range of 1 bit each, it is equivalent to determining whether the Boolean function h jIs it a balanced function or a constant function? The balanced function means that for two input strings, the corresponding output strings are different, one is 0 and the other is 1. The constant function means that for two input strings, the corresponding output strings are the same. Corresponding to the Simon problem with a domain and range of 1 bit respectively, corresponding to two independent variable values, if the dependent variable values ​​are 0 and 1 respectively, that is, the two dependent variable values ​​are different, it is a balanced function. When the dependent variable values ​​are the same, either 0 or 1, it is a constant function. Realize the judgment of a Boolean function h j The function that determines whether it is a balanced function or a constant function is called the Deutsch problem function. Figure 3 , Figure 3 FIG. 1 is a schematic diagram of a quantum circuit of a Deutsch problem function according to an embodiment of the present invention. The quantum circuit of the Deutsch problem function acts on a quantum bit, wherein the module It is an Oracle (black box function, or query function) quantum circuit unit, which can realize the calculation of Deutsch problem function. Oracle can realize the following operations .

[0053] where the encoding function h is the phase of the input qubit j (y), therefore, in h j When (y)=0, the phase of the input quantum bit remains unchanged. j When (y)=1, the phase of the input quantum bit is flipped.

[0054] In this quantum circuit, the input quantum bit is initialized to obtain the initial state for: .

[0055] Generate superposition state using Hadamard gate for: .

[0056] The quantum state after passing through Oracle's quantum circuit unit for: .

[0057] If h j (y)=0, the phase remains unchanged. If h j When (y)=1, the phase is reversed.

[0058] The Hadamard gate is used to convert phase information into amplitude, and the quantum state obtained is for: .

[0059] The calculation results are: .

[0060] At this time, if the quantum bit is measured, the measurement result is , we can know that h j (y) is a constant function, if the measurement result is , we can know that h j (y) is the equilibrium function.

[0061] For the Simon problem function of the present invention, the measurement results and the string s to be requested satisfy , and in the process of solving the equation, when there are two solutions, 0 and 1, the non-zero solution is the solution of the equation. Since the output quantum state of the Deutsch problem function quantum circuit is 0 or 1, Figure 3 After solving the quantum circuit of the Deutsch problem function shown in the figure, a quantum gate or combination of quantum gates is added to achieve the flipping between quantum state 0 and quantum state 1. The quantum state of the measurement result is the character to be solved, so there is no need to solve the equation. The quantum gate that achieves the flipping between quantum state 0 and quantum state 1 is, for example, an X gate, an RX (pi) gate, U3 (pi, 0, 0), etc. It can also be a combination of quantum gates, such as HHX, HHHHX, etc.

[0062] Therefore, see Figure 4 , Figure 4 FIG. 8 is a schematic diagram of a problem solving quantum circuit corresponding to a computing node according to an embodiment of the present invention, comprising a Deutsch problem function solving unit 80 and a Simon problem equation solving unit 81 connected in sequence. The Simon problem equation solving unit 81 in the present invention is an X gate. The structure of the Deutsch problem function solving unit 80 is as follows: Figure 3 As shown, no further description is given here.

[0063] In step S5, after running the problem-solving quantum circuit corresponding to each sub-Simon problem function, the quantum state is measured, and the measured quantum state is the sub-character to be solved. For example, when the measured quantum state is When the corresponding sub-character to be found is 0, when the measured quantum state is , the corresponding character to be found is 1.

[0064] Figure 5 1 is a flow chart of a method for solving Simon's problem based on multiple computing nodes and quantum circuits according to an embodiment of the present invention. Figure 4 , the method comprises the following steps: Step S101, let j=0.

[0065] Step S102, initializing the jth quantum bit to a ground state. In one embodiment, the ground state after initialization is state.

[0066] Step S103, according to the above Figure 2 The method shown generates the j-th sub-Simon problem function .

[0067] Step S104: convert the j-th Simon problem function into a Deutsch problem function h j :{0,1}→{0,1}.

[0068] Step S105, executing a Hadamard gate on the j-th quantum bit.

[0069] Step S106, executing ,in .

[0070] Step S107, executing the Hadamard gate on the j-th quantum bit.

[0071] Step S108, executing an X gate on the j-th quantum bit.

[0072] Step S109, measure the quantum bit and use the measurement result as the sub-character S to be determined j . S j ∈{0,1}.

[0073] Step S110, determine whether j=n-1 is satisfied. If so, execute step S111. If not, in step S112, set j=j+1 and return to step S102.

[0074] Step S111, sum up n substrings S j Get the string s of the Simon problem to be solved. Among them, s∈{0,1} n .

[0075] Among them, step S105 to step S109 is an evolution and measurement process, and the measurement result Either 0 or 1.

[0076] exist Figure 5 In the processing method shown, the sub-characters corresponding to each sub-Simon problem function are obtained in a serial manner through a quantum bit. However, it can be known that the sub-characters of multiple sub-Simon problem functions can also be obtained simultaneously in parallel through multiple quantum bits.

[0077] The technical solution of the present invention is exemplarily described below through a specific embodiment.

[0078] In the Simon problem in this embodiment, n=4, m=4, assuming that the string to be solved is s=1001, the truth table of the Boolean function f corresponding to the Simon problem in this embodiment is shown in Table 1 below.

[0079] Table 1: Truth table of the Simon problem function to be solved

[0080] In Table 1, x is the original independent variable, and f(x) is the original dependent variable. The number of binary bits in the original domain is 4, and the number of binary bits in the original range is 4. According to the above method of constructing the sub-Simon problem function, the highest bit in the original domain is used as the domain of the 0th sub-Simon problem function, and the remaining 3 bits in the original domain are used as the second bit of the second domain, thus obtaining 2 3 =8 sub-functions, represented by f 0 000 、f 0 001 、f 0 010 、f 0 011 , f 0 100 、f 0 101 、f 0 110 and f 0 111 , where the superscript 0 represents the 0th sub-Simon problem function, and the subscripts 000 to 111 represent a specific second independent variable value in the second domain, which can also be considered as the binary representation of the sub-function serial number. Each sub-independent variable and each second independent variable value in the domain of the sub-Simon problem function are combined to form an original independent variable value in the original domain, and the corresponding first original dependent variable value is obtained from the original value domain. The true values ​​corresponding to the 8 sub-functions are shown below.

[0081] Table 2: The first sub-function f 0 000 The truth table of

[0082] Table 3: The second sub-function f 0 001 The truth table of

[0083] Table 4: The third sub-function f0 010 The truth table of

[0084] Table 5: The fourth sub-function f 0 011 The truth table of

[0085] Table 6: The fifth sub-function f 0 100 The truth table of

[0086] Table 7: The sixth sub-function f 0 101 The truth table of

[0087] Table 8: The seventh sub-function f 0 110 The truth table of

[0088] Table 9: The 8th sub-function f 0 111 The truth table of

[0089] According to the above 8 sub-functions, corresponding to each independent variable value 0 and 1, the maximum value is taken from the 8 first original dependent variable values ​​as the sub-dependent variable value, and the 0th sub-Simon problem function is obtained . Its truth table is shown in Table 10 below.

[0090] Table 10: Functions for the 0th sub-Simon problem The truth table of

[0091] Based on Table 10, for the 0th sub-Simon problem function The value range of is mapped, and each sub-dependent variable value is mapped to a binary number. In this embodiment, the first sub-dependent variable value is mapped to the binary number 0. Then the second sub-dependent variable value is compared to see if it is the same as the first sub-dependent variable value. If they are different, they are mapped to 1, and if they are the same, they are mapped to 0. In this embodiment, the first sub-dependent variable value 1110 is the same as the second sub-dependent variable value 1110, so the second mapping value is also 0, thereby obtaining a new function, namely the 0th Deutsch problem function , its truth table is shown in Table 11 below.

[0092] Table 11: Functions for the 0th Deutsch question The truth table of

[0093] Based on the 0th Deutsch problem function ,implement Figure 4 The quantum circuit with one quantum bit is shown in Figure 1. The measured quantum state is 1, so the corresponding sub-character .

[0094] Similarly, for the Simon problem function to be solved in this embodiment, the second bit on the left is used as the domain bit of the first sub-Simon problem function, and the 1 bit on the left and the 2 bits on the right are used as the second bit of the second domain, thereby obtaining 8 sub-functions: . Thus, we get the first sub-Simon problem function The truth table of is shown below 12.

[0095] Table 12: Functions for the first sub-Simon problem The truth table of

[0096] Based on Table 12, for the first sub-Simon problem function By mapping the value range of , we get a new function, namely the first Deutsch problem function , its truth table is shown in Table 13 below.

[0097] Table 13: Functions for the 1st Deutsch question The truth table of

[0098] Based on the 1st Deutsch problem function ,implement Figure 4 The quantum circuit with one quantum bit is shown in the figure. The measured quantum state is 0, so the corresponding sub-character .

[0099] Similarly, for the Simon problem function to be solved in this embodiment, the third bit on the left is used as the domain bit of the second sub-Simon problem function, and the 2 bits on the left and 1 bit on the right are used as the second bit of the second domain, thereby obtaining 8 sub-functions: . Thus, we get the second sub-Simon problem function The truth table of is shown in 14 below.

[0100] Table 14: Second sub-Simon problem function The truth table of

[0101] Based on Table 14, for the second sub-Simon problem function By mapping the value range of , we get a new function, namely the second Deutsch problem function , its truth table is shown in Table 15 below.

[0102] Table 15: Functions for the 2nd Deutsch question The truth table of

[0103] Based on the 2nd Deutsch problem function ,implement Figure 4 The quantum circuit of 1 qubit shown in the figure has a measured quantum state of 0, so the corresponding sub-character .

[0104] Similarly, for the Simon problem function to be solved in this embodiment, the first bit on the right is used as the domain bit of the third sub-Simon problem function, and the three bits on the left are used as the second bits of the second domain, thereby obtaining eight sub-functions: . Thus, we get the third sub-Simon problem function The truth table of is shown below 16.

[0105] Table 16: Functions for the third sub-Simon problem The truth table of

[0106] Based on Table 16, for the third sub-Simon problem function By mapping the value range of , we get a new function, namely the third Deutsch problem function , its truth table is shown in Table 17 below.

[0107] Table 17: Functions for the 3rd Deutsch question The truth table of

[0108] Based on the 3rd Deutsch problem function ,implement Figure 4 The quantum circuit with 1 qubit shown in the figure has a measured quantum state of 1, so the corresponding sub-character .

[0109] Finally, the corresponding sub-characters to be solved are combined according to the position order of each sub-Simon problem function domain bit in the original domain to obtain the string s to be solved of the Simon problem function to be solved in this embodiment. .

[0110] From the above calculation process, it can be seen that for a Simon problem with a domain bit number of 4, since it is divided into 4 sub-problems, each sub-problem only needs to execute a 1-qubit quantum circuit to obtain a sub-character. Therefore, when a 1-qubit quantum circuit for 4 sub-problems is executed simultaneously in parallel, only 4 qubits are needed. When a 1-qubit quantum circuit for 4 sub-problems is executed sequentially in serial mode, 1 qubit can complete the calculation task.

[0111] See also Figure 6 , Figure 6 FIG. 1 is a schematic diagram of a quantum circuit used when applying the prior art to solve the Simon problem according to an embodiment of the present invention. When the prior art Simon problem quantum computing method is used to solve the aforementioned Simon problem to be solved, B in the quantum circuit f The module is an Oracle (black box function, or query function) quantum circuit unit that implements the Simon problem function. Oracle can implement . Four qubits are needed as computational qubits, and another four as auxiliary qubits, which means eight qubits are needed to solve the problem.

[0112] A universal quantum solution to the Simon problem satisfies the measurement results Orthogonality with the string s to be determined, so an equation is obtained based on the measurement results of each time To solve the string s in the Simon problem, we need to perform at least n-1 times to obtain n-1 different measurement results. , and then a system of equations is obtained to solve the string s to be found. Corresponding to the above embodiment, it is necessary to execute 4 times Figure 6 The quantum circuit shown obtains a measurement result each time it is executed. An equation is constructed based on each measurement result, and then the system of equations consisting of four equations is solved to obtain the desired string s.

[0113] However, the method provided by the present invention obtains the sub-character after each execution of the quantum circuit, thereby eliminating the calculation process of solving the equation group and significantly improving the solution efficiency.

[0114] The present invention combines the concept of distributed computing with quantum algorithms, breaking down the complex and resource-intensive Simon problem into a series of small-scale, more manageable subtasks, each of which requires only one quantum bit, significantly reducing the demand for quantum resources and computing costs. In addition, since the number of quantum bits used is reduced, the impact of line noise on the quantum state is also significantly reduced, thereby improving quantum fidelity and, in turn, improving the computational accuracy of the solution. Since each subtask requires only one quantum bit, the efficient solution of the Simon problem can be achieved by flexibly setting serial, parallel, and other computing methods based on existing computing resources.

[0115] In another aspect, the invention provides a quantum computing device for the Simon problem, see Figure 7 , Figure 7 1 is a principle block diagram of a quantum computing device for Simon problem according to an embodiment of the present invention. In this embodiment, a quantum computing device for Simon problem (hereinafter referred to as computing device) 10 includes a parameter acquisition module 1, a sub-Simon problem function construction module 2, a mapping module 3, a quantum circuit construction module 4, an operation module 5 and a combination module 6, wherein the parameter acquisition module 1 is configured to obtain the original domain bit number and the original range bit number of the Simon problem function to be solved, wherein the Simon problem function to be solved is: , the original independent variable value in the original definition domain and the original dependent variable value in the original value range are binary numbers, n is the number of binary bits in the original definition domain, and m is the number of binary bits in the original value range. , and satisfies: for all independent variable values ,have , if and only if or , s is the string to be requested, . The sub-Simon problem function construction module 2 is connected to the parameter acquisition module 1, and is configured to construct the same number of sub-Simon problem functions based on the original domain bits and the number of the Simon problem functions to be solved, wherein the domain bit of each sub-Simon problem function is a bit in the original domain, the value range of each sub-Simon problem function is a subdomain of the value range of the Simon problem function to be solved, and each sub-Simon problem function has a sub-character to be solved. The mapping module 3 is connected to the sub-Simon problem function construction module 2, and is configured to map the value range of each sub-Simon problem function to a value range with a bit number of 1 to obtain a corresponding Deutsch problem function. The quantum circuit construction module 4 is connected to the mapping module 3, and is configured to construct a problem solving quantum circuit, and the problem solving quantum circuit includes a Deutsch problem function solving unit and a Simon problem equation solving unit connected in sequence. The running module 5 is connected to the quantum circuit construction module 4, and is configured to respectively run the problem function solving quantum circuit corresponding to each sub-Simon problem function to obtain the corresponding sub-character to be solved. The combination module 6 is connected to the running module 5, and is configured to sequentially combine the corresponding sub-strings to be solved according to the positions of the domain bits of the sub-Simon problem functions in the original domain of the Simon problem function to be solved, so as to obtain the string to be solved of the Simon problem function to be solved.

[0116] The operation module 5 in this embodiment is, for example, a quantum simulator implemented by a classical computing device, or a quantum real machine. When the operation module 5 supports one quantum bit, the operation module 5 runs the problem-solving quantum circuit in sequence, and sends the measurement results to the combination module 6. The combination module 6 uses each measurement result (quantum 0 state or quantum 1 state) as the corresponding sub-character, and combines the sub-character strings of all sub-Simon problem functions to obtain the character string of the Simon problem function to be solved. When the operation module 5 supports multiple quantum bits, the operation module 5 determines the calculation strategy of parallel operation and serial operation according to the number of quantum bits and the number of sub-Simon problem functions, and runs the problem-solving quantum circuit of the sub-Simon problem function according to the calculation strategy.

[0117] See also Figure 8 , Figure 8It is a principle block diagram of a quantum computing device for Simon problem according to another embodiment of the present invention. The operation module 5 in the computing device 10 in this embodiment includes multiple quantum computing units, and the quantum computing unit is a quantum simulator implemented by a classical computing device, and can also be a quantum real machine. As shown in the figure, the first quantum computing unit 51, the second quantum computing unit 52, and the t-th quantum computing unit 5t. The quantum circuit construction module 4 is connected to each quantum computing unit respectively. In one embodiment, the quantum circuit construction module 4 sends the problem-solving quantum circuit of the sub-Simon problem function to the corresponding quantum computing unit respectively, and each quantum computing unit runs the problem-solving quantum circuit and sends the measurement result to the combination module 6. The combination module 6 uses each measurement result (quantum 0 state or quantum 1 state) as the corresponding sub-character, and then combines all the sub-characters to obtain the string of the Simon problem function to be solved.

[0118] On the other hand, an embodiment of the present invention further provides an electronic device, see Fig. 9 , Fig. 9 is a block diagram of the structure principle of an electronic device according to an embodiment of the present invention. Fig. 9 As shown, the electronic device includes a processor and a memory, wherein the memory stores computer instructions, and when the processor runs the computer instructions, the quantum computing method for the Simon problem provided by the present invention is executed.

[0119] Specifically, the processor 601 may include a central processing unit (CPU) or a graphics processing unit (GPU), or an application specific integrated circuit (ASIC), or may be configured to implement one or more integrated circuits of an embodiment of the present invention. The memory 602 may include a memory for data or instructions. For example, the memory 602 may be at least one of the following: a hard disk drive (HDD), a read-only memory (ROM), a random access memory (RAM), a floppy disk drive, a flash memory, an optical disk, a magneto-optical disk, a tape, a universal serial bus (USB) drive, or other physical / tangible memory storage device. For another example, the memory 602 includes a removable or non-removable (or fixed) medium. For another example, the memory 602 may be inside or outside the integrated gateway disaster recovery device. The memory 602 may be a non-volatile solid-state memory. In other words, typically the memory 602 includes a tangible (non-transitory) computer-readable storage medium (such as a memory device) encoded with executable instructions, wherein when the stored executable instructions are executed by the processor 601 (such as executed by one or more processors), the quantum computing method for the Simon problem in an embodiment of the present invention can be implemented.

[0120] In one example, Fig. 9 The electronic device shown may also include a communication interface 603 and a bus 610. The processor 601, the memory 602, and the communication interface 603 are connected and communicate with each other via the bus 610. The communication interface 603 is mainly used to implement communication between modules, devices, units, and / or devices in the electronic device.

[0121] The bus 610 includes hardware, software or both, and can couple the components of the online data traffic billing device to each other. For example, the bus may include at least one of the following: an accelerated graphics port (AGP) or other graphics bus, an enhanced industrial standard architecture (EISA) bus, a front-side bus (FSB), a hypertransport (HT) interconnect, an industrial standard architecture (ISA) bus, an infinite bandwidth interconnect, a low pin count (LPC) bus, a memory bus, a microchannel architecture (MCA) bus, a peripheral component interconnect (PCI) bus, a PCI-Express (PCI-X) bus, a serial advanced technology attachment (SATA) bus, a video electronics standard association local (VLB) bus or other suitable bus. The bus 610 may include one or more buses. Although the embodiments of the present invention describe or show a specific bus, the embodiments of the present invention may consider any suitable bus or interconnection method.

[0122] On the other hand, an embodiment of the present invention further provides a computer-readable storage medium, on which computer program instructions are stored, and when the computer program instructions are executed by a processor, the aforementioned quantum computing method for the Simon problem is implemented. The computer-readable storage medium is, for example, a classical computer-readable storage medium, such as a read-only memory (ROM), a random access memory (RAM), a disk storage medium device, an optical storage medium device, a flash memory device, an electrical, optical or other physical / tangible memory storage device, or a storage medium for storing quantum information and readable by a quantum computer, such as a quantum random access memory (QRAM). QRAM can be regarded as a quantum version of RAM in a classical computer. Through QRAM, a quantum superposition state containing information can be created. Compared with RAM, which needs to be read one by one, superimposed data can be read with superimposed addresses. QRAM can be implemented in physical ways such as optics, semiconductor quantum dots, superconducting circuits, ion traps, etc.

[0123] The flowchart and / or block diagram of the method and system of the embodiment of the present invention are described above by way of example, and various aspects of the related aspects are described. It should be understood that each box or combination thereof in the flowchart and / or block diagram can be implemented by computer program instructions, or by dedicated hardware that performs a specified function or action, or by a combination of dedicated hardware and computer instructions. When implemented in hardware, it can be, for example, an electronic circuit, an application-specific integrated circuit (ASIC), appropriate firmware, a plug-in, a function card, etc.; when implemented in software, it is a program or code segment used to perform the required task. The program or code segment can be stored in a memory, or transmitted on a transmission medium or a communication link via a data signal carried in a carrier. The code segment can be downloaded via a computer network such as the Internet, an intranet, etc.

[0124] The above embodiments are only used to illustrate the present invention, but not to limit the present invention. Ordinary technicians in the relevant technical field can make various changes and modifications without departing from the scope of the present invention. Therefore, all equivalent technical solutions should also fall within the scope of the present invention.

Claims

1. A quantum computing method for the Simon problem, characterized in that: The method comprises: Obtain the number of bits in the original domain and the number of bits in the original range of the Simon problem function to be solved, wherein the original independent variable value in the original domain and the original dependent variable value in the original range are both binary numbers; Constructing the same number of sub-Simon problem functions based on the original domain bits and the number of original domain bits of the Simon problem function to be solved, wherein the domain bit of each sub-Simon problem function is a bit in the original domain, the range of each sub-Simon problem function is a sub-domain of the range of the Simon problem function to be solved, and each sub-Simon problem function includes a corresponding sub-character to be solved; Map the value range of each sub-Simon problem function to a value range with a bit number of 1 to obtain the corresponding Deutsch problem function; Constructing a problem-solving quantum circuit, wherein the problem-solving quantum circuit includes a Deutsch problem function solving unit and a Simon problem equation solving unit connected in sequence; Run the problem-solving quantum circuit corresponding to each sub-Simon problem function respectively to obtain the corresponding sub-character to be solved; According to the positions of the domain bits of the sub-Simon problem function in the original domain of the Simon problem function to be solved, the corresponding sub-characters are sequentially combined to obtain the desired character string of the Simon problem function to be solved.

2. The quantum computing method for Simon problem according to claim 1, characterized in that: The steps to construct the same number of sub-Simon problem functions include: Determine a first bit in the original domain bits of the to-be-solved Simon problem function as the domain bits of the sub-Simon problem function, and the remaining bits as the second bits of the second domain; Extracting the first digit value from the original independent variable value of the original definition domain of the Simon problem function to be solved to form the sub-independent variable value of the sub-Simon problem function; Sequentially extracting a second bit value from each original independent variable value of the original definition domain of the Simon problem function to be solved to form a corresponding second independent variable value; Combine each sub-independent variable value of the sub-Simon problem function with each second independent variable value in the order of their respective bits in the original definition domain to form an original independent variable value in the original definition domain; Acquire an original dependent variable value corresponding to the original independent variable value from the original value domain of the Simon problem function to be solved as a first original dependent variable value; A first original dependent variable value is determined from multiple first original dependent variable values ​​corresponding to each sub-independent variable value according to the same valuation function as the sub-dependent variable value corresponding to the sub-independent variable value, wherein the sub-dependent variable value corresponding to each sub-independent variable value constitutes the value range of the sub-Simon problem function.

3. The quantum computing method for Simon problem according to claim 2, characterized in that: The step of constructing the same number of sub-Simon problem functions includes: in order from high to low or from low to high, taking each first bit in the original definition domain of the Simon problem function to be solved as a domain bit of a sub-Simon problem function.

4. The quantum computing method for Simon problem according to claim 2 or 3, characterized in that: The valuation function is a maximum value function or a minimum value function. Correspondingly, the step of determining a first original dependent variable value as the sub-dependent variable value corresponding to the sub-independent variable value according to the same valuation function from a plurality of first original dependent variable values ​​corresponding to each sub-independent variable value includes: determining a first original dependent variable value with the largest or smallest value from a plurality of first original dependent variable values ​​corresponding to each sub-independent variable value as the sub-dependent variable value corresponding to the sub-independent variable value.

5. The quantum computing method for Simon problem according to claim 1, characterized in that: The step of mapping the value range of a sub-Simon problem function to a value range with a bit number of 1 includes: mapping each sub-dependent variable value of the sub-Simon problem function to a binary value with a bit number of 1, and when two sub-dependent variable values ​​are the same, the mapping value corresponding to each sub-dependent variable value is the same, and is a binary value of 0 or 1; when two sub-dependent variable values ​​are different, the mapping value corresponding to each sub-dependent variable value is different, and is a binary value of 0 and 1 respectively.

6. The quantum computing method for Simon problem according to claim 1, characterized in that: The Simon problem equation solving unit is a quantum gate or a combination of quantum gates that realizes the flipping between quantum 0 state and quantum 1 state.

7. The quantum computing method for the Simon problem according to claim 1, wherein the step of respectively running the problem function corresponding to each sub-Simon problem function to solve the quantum circuit comprises: The problem function of the sub-Simon problem function is run in a serial and / or parallel manner to solve the quantum circuit to obtain the corresponding sub-character to be solved.

8. A quantum computing device for the Simon problem, characterized in that: The device comprises: A parameter acquisition module is configured to acquire the number of bits in the original domain and the number of bits in the original range of the function to be solved for the Simon problem, wherein the original independent variable value in the original domain and the original dependent variable value in the original range are both binary numbers; a sub-Simon problem function construction module, configured to construct the same number of sub-Simon problem functions based on the original domain bits and the number of original domain bits of the Simon problem function to be solved, wherein the domain bit of each sub-Simon problem function is a bit in the original domain, the range of each sub-Simon problem function is a sub-domain of the range of the Simon problem function to be solved, and each sub-Simon problem function includes a corresponding sub-character to be solved; A mapping module configured to map the value range of each sub-Simon problem function to a value range with a bit number of 1 to obtain a corresponding Deutsch problem function; A quantum circuit construction module, configured to construct a problem-solving quantum circuit, wherein the problem-solving quantum circuit includes a Deutsch problem function solving unit and a Simon problem equation solving unit connected in sequence; An operation module is configured to respectively operate the problem-solving quantum circuit corresponding to each sub-Simon problem function to obtain the corresponding sub-character to be solved; The combination module is configured to sequentially combine corresponding sub-characters according to the positions of the domain bits of the sub-Simon problem function in the original domain of the Simon problem function to be solved to obtain the required character string of the Simon problem function to be solved.

9. An electronic device comprising a processor and a memory, characterized in that: The memory stores computer instructions, and when the processor runs the computer instructions, the quantum computing method for the Simon problem according to any one of claims 1 to 7 is performed.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer instructions, and when the computer instructions are executed by a processor, the quantum computing method for the Simon problem according to any one of claims 1 to 7 is executed.

Images