Method, device, equipment and storage medium for determining processing parameters
By minimizing the optimization function and iterative processing methods, the processing parameters of the quantum signal processing circuit are determined, which solves the problem of inefficiency in the prior art, and improves the calculation efficiency of the quantum signal processing circuit and the performance of Hamiltonian simulation.
Patent Information
- Application Number
- CN202211296061.8
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-10-21
- Publication Date
- 2024-11-29
- Estimated Expiration
- 2042-10-21
AI Technical Summary
Existing quantum signal processing circuits have inefficiency in processing parameter calculations, especially when the objective function is complex, which affects the efficiency of subsequent applications such as Hamiltonian simulations.
By obtaining the target polynomial corresponding to the target quantum signal processing circuit, using the minimization optimization function to determine the processing parameters, combining the parity parameters, satisfying the termination conditions to obtain the processing parameters, and iterative processing methods are adopted to improve the computing efficiency.
It realizes more efficient quantum signal processing circuit processing parameter calculation, improves the efficiency of Hamiltonian simulation and other applications, and provides a wider scope of application under the upper limit of complexity, eliminates the problem of hyperparameter selection, and improves the calculation speed. .
Smart Images

Figure CN115829040B_ABST
Abstract
Description
Technical Field
[0001] The present disclosure relates to the field of computer technology, and in particular to the field of quantum computing. Background Art
[0002] At present, the theory of quantum signal processing has been proposed, which has achieved the asymptotic optimum of algorithm complexity in the problem of Hamiltonian simulation, and has thus made great achievements; the derived quantum bitization (Qubitization) and quantum singular value transformation (Quantum Singular Value Transformation) algorithms have attracted more scholars to study as quantum algorithm tools and templates. However, when these theories are applied to specific practical problems, the only problem that must be faced at the algorithm level is the calculation of the processing parameters of the quantum signal processing circuit (such as the symmetric quantum signal processing circuit) targeted by the quantum signal processing algorithm. Summary of the invention
[0003] The present disclosure provides a method, an apparatus, a device and a storage medium for determining processing parameters of a quantum signal processing circuit.
[0004] According to one aspect of the present disclosure, a method for determining processing parameters of a quantum signal processing circuit is provided, comprising:
[0005] Obtaining a target polynomial f(x) corresponding to a target quantum signal processing circuit, wherein the target polynomial f(x) is used to determine a processing effect of the target quantum signal processing circuit performing signal processing on a signal parameter x;
[0006] Minimize the optimization function Among them, the optimization function is based on the target polynomial f(x) and the quantum signal processing function Determined, the quantum signal processing function is an expression based on the target quantum signal processing circuit income; represents a processing parameter of the target quantum signal processing circuit, p represents a parity parameter, and the value of p is related to the parity of the target polynomial f(x);
[0007] In minimizing the optimization function In the process of determining that the termination condition is met, the target processing parameters of the target quantum signal processing circuit based on the target polynomial are obtained. Among them, the target processing parameters The encoding includes the processing effect of the target quantum signal processing circuit on the signal parameter x.
[0008] According to another aspect of the present disclosure, there is provided a device for determining a processing parameter of a quantum signal processing circuit, comprising:
[0009] An acquisition unit, used to acquire a target polynomial f(x) corresponding to a target quantum signal processing circuit, wherein the target polynomial f(x) is used to determine a processing effect of the target quantum signal processing circuit performing signal processing on a signal parameter x;
[0010] Processing unit for minimizing the optimization function Among them, the optimization function is based on the target polynomial f(x) and the quantum signal processing function Determined, the quantum signal processing function is an expression based on the target quantum signal processing circuit income; represents the processing parameters of the target quantum signal processing circuit, p represents the parity parameter, and the value of p is related to the parity of the target polynomial f(x); in minimizing the optimization function In the process of determining that the termination condition is met, the target processing parameters of the target quantum signal processing circuit based on the target polynomial are obtained. Among them, the target processing parameters The encoding includes the processing effect of the target quantum signal processing circuit on the signal parameter x.
[0011] According to another aspect of the present disclosure, there is provided an electronic device, comprising:
[0012] at least one processor; and
[0013] a memory communicatively connected to the at least one processor; wherein,
[0014] The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to execute the method of any embodiment of the present disclosure.
[0015] According to another aspect of the present disclosure, a non-transitory computer-readable storage medium storing computer instructions is provided, wherein the computer instructions are used to enable the computer to execute the method according to any embodiment of the present disclosure.
[0016] According to another aspect of the present disclosure, a computer program product is provided, including a computer program. When the computer program is executed by a processor, the method according to any one of the embodiments of the present disclosure is implemented.
[0017] The disclosed solution provides a more efficient solution for calculating the processing parameters of a target quantum signal processing circuit, thus laying a foundation for improving the efficiency of subsequent applications, such as Hamiltonian simulation.
[0018] It should be understood that the content described in this section is not intended to identify the key or important features of the embodiments of the present disclosure, nor is it intended to limit the scope of the present disclosure. Other features of the present disclosure will become easily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS
[0019] The accompanying drawings are used to better understand the present solution and do not constitute a limitation of the present disclosure.
[0020] Figure 1 is a schematic flow chart of a method for determining processing parameters of a quantum signal processing circuit according to an embodiment of the present disclosure;
[0021] Figure 2 It is a schematic diagram of the implementation flow of a method for determining processing parameters of a quantum signal processing circuit according to an embodiment of the present disclosure in a specific embodiment;
[0022] Figure 3 is a schematic diagram of the structure of a device for determining processing parameters of a quantum signal processing circuit according to an embodiment of the present disclosure;
[0023] Figure 4 The block diagram is a block diagram of an electronic device used to implement the method for determining processing parameters of a quantum signal processing circuit according to an embodiment of the present disclosure. DETAILED DESCRIPTION
[0024] The following is a description of exemplary embodiments of the present disclosure in conjunction with the accompanying drawings, including various details of the embodiments of the present disclosure to facilitate understanding, which should be considered as merely exemplary. Therefore, it should be recognized by those of ordinary skill in the art that various changes and modifications may be made to the embodiments described herein without departing from the scope and spirit of the present disclosure. Similarly, for the sake of clarity and conciseness, descriptions of well-known functions and structures are omitted in the following description.
[0025] In recent years, quantum computing has become an important direction of research and development in academia and industry. Compared with traditional computing, quantum computing has shown significant advantages in solving problems such as large number decomposition; and quantum simulation has important significance in many fields such as physics, chemistry, biology, and information: such as developing new batteries, preparing various catalysts, exploring new pharmaceuticals, developing new materials, exploring chemical molecular structures and quantum precision measurements. When Benioff and Feynman first conceived of quantum computers, they proposed simulating the evolution of quantum systems, or in other words, to achieve Hamiltonian simulation of quantum systems.
[0026] At present, the theory of quantum signal processing has been proposed, which has achieved the asymptotic optimum of algorithm complexity in the problem of Hamiltonian simulation, and has thus made great achievements; the derived quantum bitization (Qubitization) and quantum singular value transformation (Quantum Singular Value Transformation) algorithms have attracted more scholars to study as quantum algorithm tools and templates. However, when these theories are applied to specific practical problems, the only problem that must be faced at the algorithm level is the calculation of the processing parameters of quantum signal processing circuits (such as symmetric quantum signal processing circuits).
[0027] The processing parameter calculation algorithms of early quantum signal processing circuits (such as symmetric quantum signal processing circuits) are all based on polynomial root-finding, which becomes less effective when the target function (i.e., the target polynomial mentioned above) becomes complex; therefore, there is an urgent need for a more efficient processing parameter calculation algorithm for symmetric quantum signal processing circuits, so as to improve the calculation speed and thus improve the efficiency of subsequent applications, such as Hamiltonian simulation efficiency.
[0028] Based on this, the present disclosure provides a more efficient solution for determining processing parameters of a target quantum signal processing circuit (especially a symmetric quantum signal processing circuit).
[0029] Specifically, Figure 1 is a schematic flow chart of a method for determining processing parameters of a quantum signal processing circuit according to an embodiment of the present disclosure. The method can be optionally applied to a classical computing device, such as a personal computer, a server, a server cluster, or other electronic device with classical computing capabilities. The method includes at least part of the following contents. Figure 1 As shown, the method includes:
[0030] Step S101: Obtain a target polynomial f(x) corresponding to a target quantum signal processing circuit.
[0031] Here, the target polynomial f(x) may specifically be a predetermined function, which is used to determine the processing effect of the target quantum signal processing circuit performing signal processing on the signal parameter x.
[0032] Step S102: Minimize the optimization function
[0033] Here, the optimization function is based on the target polynomial f(x) and the quantum signal processing function Determined.
[0034] Furthermore, the quantum signal processing function is an expression based on the target quantum signal processing circuit income; represents a processing parameter of the target quantum signal processing circuit, p represents a parity parameter, and the value of p is related to the parity of the target polynomial f(x).
[0035] Step S103: Minimize the optimization function In the process of determining that the termination condition is met, the target processing parameters of the target quantum signal processing circuit based on the target polynomial are obtained.
[0036] Here, the target processing parameters The encoding includes the processing effect of the target quantum signal processing circuit on the signal parameter x.
[0037] In this way, the disclosed solution provides a more efficient solution for calculating the processing parameters of the target quantum signal processing circuit, thus laying a foundation for improving the efficiency of subsequent applications, such as Hamiltonian simulation.
[0038] In addition, the disclosed solution has broader requirements for the target polynomial, and the target polynomial applicable to the disclosed solution has a higher upper limit of complexity than the optimal solution in the industry in the past. Therefore, the disclosed solution has the advantages of both wide range and strong computing power.
[0039] Moreover, the disclosed solution omits the difficulty of hyperparameter selection, thereby further improving the efficiency of obtaining processing parameters.
[0040] In a specific example, the parity parameter p can be represented by 0 or 1, and in this case, the parity parameter p = 0 or 1. It can be understood that in practical applications, other values can be used to represent parity, and the disclosed solution is not limited to this.
[0041] In a specific example, the target polynomial f(x) (which can be abbreviated as f) can be used to evaluate the processing effect of quantum signal processing in the following way. Specifically, a preset calculation accuracy ∈ is set, and the target processing parameter is found and a parity parameter p, such that Here, the value of the parity parameter p is related to the target polynomial f(x), so as to obtain the target processing parameter based on the target polynomial f(x)
[0042] In a specific example of the disclosed solution, the target quantum signal processing circuit is a quantum signal processing circuit with symmetric processing parameters. In other words, the disclosed solution can obtain processing parameters of a symmetric quantum signal processing circuit based on a target polynomial. In this way, the disclosed solution provides a more efficient solution for determining processing parameters of a symmetric quantum signal processing circuit, thus laying a foundation for improving the efficiency of subsequent applications, such as Hamiltonian simulation.
[0043] It can be understood that, when the target quantum signal processing circuit is a symmetric quantum signal processing circuit, the quantum signal processing function It is specifically a symmetric quantum signal processing function.
[0044] In a specific example of the disclosed solution, the quantum signal processing function The expression of the target quantum signal processing circuit In other words, the quantum signal processing function is an expression based on the target quantum signal processing circuit The traces obtained.
[0045] For example, in one specific example, the quantum signal processing function Target quantum signal processing circuit The trace (denoted as ) have the following relationship:
[0046]
[0047] That is to say, in practical applications, the calculation of quantum signal processing functions Equivalent to computationally symmetric quantum signal processing circuits trace
[0048] In this way, the disclosed solution provides a more efficient parameter calculation solution for the target quantum signal processing circuit, thus laying a foundation for improving the efficiency of subsequent applications, such as Hamiltonian simulation.
[0049] In a specific example of the disclosed solution, the optimization function is minimized in the following manner: The details are as follows:
[0050] Minimize the optimization function by iterative processing
[0051] Among them, one iteration step in the iterative processing method includes:
[0052] Determine the current iteration step corresponding to
[0053] Calculate the minimum optimization function Desired search direction
[0054] Based on the search direction and the get
[0055] Among them, the minimization optimization function In the process of determining that the termination condition is met, the target processing parameters of the target quantum signal processing circuit based on the target polynomial are obtained. include:
[0056] Based on When it is determined that the termination condition is met, the corresponding As the target processing parameter of the target quantum signal processing circuit based on the target polynomial
[0057] Thus, the disclosed solution provides a method for specifically minimizing the optimization function Moreover, the optimization process has a faster calculation speed and omits the difficulty of hyperparameter selection, thus further improving the efficiency of obtaining processing parameters.
[0058] For example, assuming that the current iteration is the tth iteration, the tth iteration steps specifically include:
[0059] Determine the current iteration step corresponding to Compute the minimized optimization function Desired search direction Based on the search direction and the Get new processing parameters Finally, based on When it is determined that the termination condition is met, the corresponding As the target processing parameter of the target quantum signal processing circuit based on the target polynomial In this way, the processing parameters of the target quantum signal processing circuit can be obtained efficiently.
[0060] Further, in a specific example of the disclosed solution, based on When it is determined that the termination condition is not met, the next iteration step is entered.
[0061] For example, assuming that the current iteration is the tth iteration, at this time, if the When it is determined that the termination condition is not met, the next iteration step is entered, that is, the t+1th iteration step. At this time, t=t+1 can be set. Furthermore, the t+1th iteration step specifically includes:
[0062] Determine the current iteration step corresponding to (At this time, the t+1th iteration step is the current iteration step, and in the t+1th iteration step is the value in the tth iteration step ); calculate the minimization optimization function Desired search direction Based on search direction as well as Get new processing parameters Finally, based on Determine whether the termination condition is met, and repeat the process in this way until the termination condition is met.
[0063] In this way, the processing parameters of the target quantum signal processing circuit are efficiently obtained through a cyclic iteration. Moreover, the optimization process has a faster calculation speed and omits the difficulty of hyperparameter selection, thus further improving the efficiency of obtaining the processing parameters.
[0064] In a specific example of the disclosed solution, the determination of the current iteration step corresponds to include:
[0065] When the current iteration step is the first iteration, the is a preset initial value; or,
[0066] When the current iteration step is not the first iteration, the is obtained in the previous iteration step
[0067] For example, assuming that the current iteration is the tth iteration, at this time, if t=0, that is, the current iteration step is the first iteration, the is a preset initial value, for example, an empirical value. Or, if t≠0, that is, the current iteration step is not the first iteration, the is the value obtained in the previous iteration step (i.e., the t-1th time)
[0068] This lays the foundation for improving the processing parameters of the target quantum signal processing circuit and further improving the efficiency of subsequent applications, such as Hamiltonian simulation.
[0069] In a specific example of the disclosed solution, the following method can be used to determine whether the termination condition is satisfied, specifically including:
[0070] Method 1: After determining the When the relationship between the function value and the preset calculation accuracy ∈ meets the preset requirements, it is determined that the termination condition is met.
[0071] For example, assuming that the current iteration is the tth iteration, at this time, the processing parameters are obtained in the tth iteration step Afterwards, you can determine The function value of The relationship between the function value of and the preset calculation accuracy (which can be recorded as ∈) is used to determine whether the termination condition is met. For example, in a specific example, if If the condition is met, it is determined that the termination condition is met; otherwise, it is determined that the termination condition is not met.
[0072] Thus, in this method, due to the selection of the The function value is used to directly determine whether the termination condition is met, so the amount of calculation is further reduced and the processing efficiency is further improved.
[0073] Method 2: After determining the The function value of The function value and the preset calculation accuracy ∈ When the three meet the preset requirements, it is determined that the termination condition is met.
[0074] For example, assuming that the current iteration is the tth iteration, at this time, the processing parameters obtained in the tth iteration step are Afterwards, the The function value of The function value of The function value of The relationship between the function value of and the preset calculation accuracy (which can be recorded as ∈) is used to determine whether the termination condition is met. For example, in a specific example, if If it is established, it is determined that the termination condition is satisfied; otherwise, it is determined that the termination condition is not satisfied. Here, ||·|| represents a norm. It should be noted that the disclosed solution does not specifically limit the norm used.
[0075] This method provides a specific solution for stopping iterative processing, and the method is simple and efficient, laying the foundation for improving the processing parameters of the target quantum signal processing circuit and further improving the efficiency of subsequent applications such as Hamiltonian simulation.
[0076] It is understandable that in practical applications, the above two methods can be executed either one of them, and the disclosed solution does not limit this.
[0077] In a specific example of the disclosed solution, the following method can be used to obtain An iteration step in the iterative processing method also includes:
[0078] Determine the trial step length l corresponding to the current iteration step;
[0079] Based on this, the above-mentioned search direction and the get Specifically include:
[0080] Based on the search direction Said And the trial step length l, get the
[0081] For example, assuming that the current iteration is the tth iteration, at this time, in the tth iteration step, determine the corresponding Compute the minimized optimization function Desired search direction And determine the trial step length l corresponding to the current iteration step; then based on the search direction Said And the trial step length l, get the processing parameter Finally, based on It is determined whether the termination condition is satisfied.
[0082] In this way, a specific method of iterative processing is provided, which is simple, has strong computing power and fast processing speed, and lays a foundation for improving the processing parameters of the target quantum signal processing circuit and further improving the efficiency of subsequent applications, such as Hamiltonian simulation.
[0083] In a specific example of the present disclosure,
[0084] For example, assuming that the current iteration is the tth iteration, at this time, in the tth iteration step, determine the corresponding Compute the minimized optimization function Desired search direction And determine the trial step length l corresponding to the current iteration step, and then get based on the following formula
[0085]
[0086] In this way, a specific method of iterative processing is provided, which is simple, has strong computing power and fast processing speed, and lays a foundation for improving the processing parameters of the target quantum signal processing circuit and further improving the efficiency of subsequent applications, such as Hamiltonian simulation.
[0087] In a specific example of the disclosed solution, the trial step length l can be obtained in the following manner. Specifically, the above-mentioned determination of the trial step length l corresponding to the current iteration step specifically includes:
[0088] When the current iteration step is the first iteration, the preset step length is used as the trial step length l; or,
[0089] When the current iteration step is not the first iteration, based on the search direction as well as Get the trial step length l. Here, YesL f exist The gradient at .
[0090] For example, assuming that the current iteration is the tth iteration, at this time, if t=0, that is, the current iteration step is the first iteration, the trial step length l is a preset step length, for example, an empirical value. Alternatively, if t≠0, that is, the current iteration step is not the first iteration, the trial step length l can be based on the search direction as well as Income.
[0091] In this way, a specific method of iterative processing is provided, which is simple, has strong computing power and fast processing speed, and lays a foundation for improving the processing parameters of the target quantum signal processing circuit and further improving the efficiency of subsequent applications, such as Hamiltonian simulation.
[0092] In a specific example of the disclosed solution, the trial step length in:
[0093]
[0094] Here, the “·” represents the inner product, that is, b is equal to and The inner product of .
[0095] Furthermore, the
[0096] In this way, a specific method of iterative processing is provided, which is simple, has strong computing power and fast processing speed, and lays a foundation for improving the processing parameters of the target quantum signal processing circuit and further improving the efficiency of subsequent applications, such as Hamiltonian simulation.
[0097] The disclosed solution provides a more efficient method for determining the processing parameters of a quantum signal processing circuit (especially a target quantum signal processing circuit). Compared with the existing solution, the disclosed solution can realize the processing parameters of more complex target polynomials, and has a faster calculation speed when calculating the processing parameters of the same target polynomial at the same precision. Benefiting from this, the disclosed solution can realize the generation of quantum circuits such as longer Hamiltonian simulation and quantum singular value transformation of more complex functions on the one hand, and on the other hand, while accelerating the speed of quantum circuit generation, it has a significant boost to the cutting-edge research of quantum signal processing, quantum simulation and its application.
[0098] The following is a further detailed description of the disclosed solution in conjunction with specific examples; specifically, the disclosed solution provides a solution for more efficiently obtaining the processing parameters required for symmetric quantum signal processing circuits. Compared with existing algorithms, it can calculate the processing parameters of more complex target polynomials, and at the same accuracy, it has a faster calculation speed when calculating the processing parameters of the same target function. Benefiting from this, the disclosed solution can, on the one hand, realize the generation of quantum circuits such as longer Hamiltonian simulations and quantum singular value transformations of more complex functions, and on the other hand, it can speed up the generation of quantum circuits, which is a significant boost to cutting-edge research in quantum signal processing, quantum simulation and its applications.
[0099] The expression of the symmetric quantum signal processing circuit is explained below;
[0100] Generally speaking, the expression of the preset quantum signal processing circuit (denoted as )for:
[0101]
[0102] Here, x∈[-1, 1] is the signal parameter, For processing parameters, is an imaginary unit, Represents a signal quantum gate in a quantum signal processing circuit (it should be noted that the signal quantum gate is encoded with signal parameters); Indicates processing quantum gates (it should be noted that the processing quantum gate encoding has processing parameters, such as processing quantum gates The encoding has processing parameters φ k ); The Z in the equation represents the Pauli Z operator, that is, SU(2) is the set of single-bit quantum gates, for example, the set of all 2-dimensional unitary matrices with determinant 1; k is greater than or equal to 1 and less than or equal to A positive integer, is the number of processing parameters.
[0103] Furthermore, for the parity parameter p=0, 1, based on the above preset quantum signal processing circuit The expression of symmetric quantum signal processing circuit is given by The expression of is:
[0104]
[0105] in, express It should be noted that the symmetric quantum signal processing circuit described in the disclosed solution refers to a quantum signal processing circuit with symmetric processing parameters.
[0106] It should be noted that in this example, the processing parameters can be called Symmetric quantum signal processing circuit More precisely, the processing parameters It is a symmetric quantum signal processing circuit The free processing parameters of is the number of free processing parameters.
[0107] Here, the symmetric quantum signal processing matrix Several signal processing functions are encoded, specifically, is a quantum signal processing function (also referred to as a symmetric quantum signal processing function). Further, in a specific example, the quantum signal processing function Can be used for symmetric quantum signal processing circuits The I-component is:
[0108]
[0109] Furthermore, in the specific application of symmetric quantum signal processing, it is usually necessary to formulate the target polynomial in advance. To determine the processing effect of symmetric quantum signal processing. After determining the target polynomial f(x), it is necessary to find the processing parameters and a parity parameter p, such that In this way, symmetric quantum signal processing is ensured; however, this is difficult to do. Therefore, instead, a preset calculation accuracy ∈ is set, and symmetric quantum signal processing is completed under the calculation accuracy ∈.
[0110] Specifically, find the processing parameters and a parity parameter p, such that Wherein, ||·|| represents the norm. Further, the disclosed solution may select the following norm, namely:
[0111]
[0112] It can be understood that the above norm is only a specific example. In practical applications, other norms can also be used. The present disclosure does not limit the specific norm.
[0113] Furthermore, the following optimization function is defined based on another norm: (In this example, it can be written as ):
[0114]
[0115] Wherein, the parity parameter p=deg f mod 2, deg f=d is the degree of the target polynomial f(x) (which can be simply referred to as f). It should be noted that the target polynomial f has parity, and in this case, the value of the parity parameter p can be obtained based on the parity of the target polynomial f; for example, if the target polynomial f is an odd function, the parity parameter p is an odd number; if the target polynomial f is an even function, the parity parameter p is an even number.
[0116] Furthermore, based on the optimization function defined above Symmetrical quantum signal processing based on the target polynomial f can be realized. Specifically, the disclosed solution provides a solution for determining the processing parameters of the symmetric quantum signal processing circuit, and uses a quadratic interpolation method to determine the search step size; at the same time, directly using the optimization function The value of is used as the termination condition, thus effectively reducing the amount of additional calculations and improving the overall processing efficiency. The specific algorithm steps are as follows:
[0117] It should be noted that the input and output of this example are:
[0118] Input: Target polynomial and the target polynomial f(x) is an odd function or an even function, the degree of the target polynomial f is deg f=d, and Preset calculation accuracy ∈; bounded storage size m.
[0119] Output: Processing parameters here is the number of free processing parameters, i.e.
[0120] Furthermore, if Figure 2 As shown, the specific steps include:
[0121] Step 1: Iteration counter t=0;
[0122] Step 2: The processing parameters Initialize.
[0123] Here, we can define For the case of calculator t = 0,
[0124]
[0125] Step 3: Use a preset iterative algorithm, such as the BFGS (Broyden-Fletcher-Goldfarb-Shanno) iterative algorithm, to calculate the minimum The corresponding search direction
[0126] Step 4: Determine t and perform the following operations:
[0127] Step 4(a): If t = 0, set the trial step length l = 1.
[0128] Step 4(b): Otherwise, that is, t≠0, calculate Will As the trial function value, the trial step length l is determined by using quadratic interpolation; specifically, the following are included:
[0129] make (Here, “·” represents the inner product), let
[0130] The search step length
[0131] in,
[0132]
[0133]
[0134] here, YesL f exist The gradient at tk for The kth component of p=deg f mod 2.
[0135] Step 5: Verify the Pre-conditions Is it true?
[0136] It is understandable that, in practical applications, the preset condition may also be:
[0137]
[0138] Step 5(a): If the preset condition is not met, record the iterative data. For example, when the BFGS iterative algorithm is used, record the BFGS iterative data in a queue structure; if more than m pieces of data are present, discard the oldest piece of data; and set t = t + 1, Return to step 3.
[0139] Step 5(b): If the preset condition is met, output the It can be called the target processing parameter and can be written as
[0140] It should be noted that the disclosed solution uses the quadratic interpolation method to determine the search step length, and makes slight adjustments based on experience. In addition, the termination condition of the disclosed solution can be You can also verify directly In this way, the termination condition can be selected based on actual needs, which effectively reduces the amount of calculation and lays the foundation for further improving processing efficiency.
[0141] The disclosed solution provides a more efficient method for determining the processing parameters of a quantum signal processing circuit (especially a target quantum signal processing circuit). Compared with the existing solution, the disclosed solution can realize the processing parameters of more complex target polynomials, and has a faster calculation speed when calculating the processing parameters of the same target polynomial at the same precision. Benefiting from this, the disclosed solution can realize the generation of quantum circuits such as longer Hamiltonian simulation and quantum singular value transformation of more complex functions on the one hand, and on the other hand, while accelerating the speed of quantum circuit generation, it has a significant boost to the cutting-edge research of quantum signal processing, quantum simulation and its application.
[0142] Compared with the industry solutions, the disclosed solution has the following advantages:
[0143] First, it has a wide range of applications and strong computing power. The disclosed solution has broader requirements for the target polynomial, and the target polynomial applicable to the disclosed solution is higher than the previous optimal solution in the industry in terms of complexity upper limit.
[0144] Second, the calculation speed is fast. For the same target polynomial, the calculation speed of the disclosed solution is faster. For example, compared with DMWL, the speed is increased by 7% to 26% (the speed-up effect is affected by and The higher the complexity of the target polynomial, the better the speed-up effect).
[0145] Third, the difficulty of hyperparameter selection is omitted. The disclosed solution does not have the problem of hyperparameter selection; according to experience, for ∈≥10 -14 In this case, m=20 is sufficient to complete the calculation.
[0146] The disclosed solution also provides a device for determining processing parameters of a quantum signal processing circuit, such as Figure 3 As shown, including:
[0147] An acquisition unit 301 is used to acquire a target polynomial f(x) corresponding to a target quantum signal processing circuit, wherein the target polynomial f(x) is used to determine a processing effect of the target quantum signal processing circuit on a signal parameter x;
[0148] Processing unit 302, for minimizing the optimization function Among them, the optimization function is based on the target polynomial f(x) and the quantum signal processing function Determined, the quantum signal processing function is an expression based on the target quantum signal processing circuit income; represents the processing parameters of the target quantum signal processing circuit, p represents the parity parameter, and the value of p is related to the parity of the target polynomial f(x); in minimizing the optimization function In the process of determining that the termination condition is met, the target processing parameters of the target quantum signal processing circuit based on the target polynomial are obtained. Among them, the target processing parameters The encoding includes the processing effect of the target quantum signal processing circuit on the signal parameter x.
[0149] In a specific example of the disclosed solution, the quantum signal processing function The expression of the target quantum signal processing circuit The traces are related.
[0150] In a specific example of the disclosed solution, the target quantum signal processing circuit is a quantum signal processing circuit with symmetric processing parameters.
[0151] In a specific example of the disclosed solution, the processing unit 302 is specifically configured to:
[0152] Minimize the optimization function by iterative processing
[0153] Among them, one iteration step in the iterative processing method includes:
[0154] Determine the current iteration step corresponding to
[0155] Calculate the minimum optimization function Desired search direction
[0156] Based on the search direction and the get
[0157] Based on When it is determined that the termination condition is met, the corresponding As the target processing parameter of the target quantum signal processing circuit based on the target polynomial
[0158] In a specific example of the disclosed solution, the processing unit 302 is further configured to:
[0159] Based on When it is determined that the termination condition is not met, the next iteration step is entered.
[0160] In a specific example of the disclosed solution, the processing unit 302 is specifically configured to:
[0161] When the current iteration step is the first iteration, the is a preset initial value; or,
[0162] When the current iteration step is not the first iteration, the is obtained in the previous iteration step
[0163] In a specific example of the disclosed solution, the processing unit 302 is further configured to:
[0164] In determining the When the relationship between the function value and the preset calculation accuracy ∈ meets the preset requirements, it is determined that the termination condition is met.
[0165] In a specific example of the disclosed solution, the processing unit 302 is further configured to:
[0166] In determining the The function value of When the function value of and the preset calculation accuracy ∈ meet the preset requirements, it is determined that the termination condition is met.
[0167] In a specific example of the disclosed solution, the processing unit 302 is further configured to:
[0168] Determine the trial step length l corresponding to the current iteration step;
[0169] Based on the search direction Said And the trial step length l, get the
[0170] In a specific example of the present disclosure,
[0171] In a specific example of the disclosed solution, the processing unit 302 is specifically configured to:
[0172] When the current iteration step is the first iteration, the preset step length is used as the trial step length l; or,
[0173] When the current iteration step is not the first iteration, based on the search direction as well as The trial step length l is obtained.
[0174] In a specific example of the disclosed solution, the trial step length
[0175] in,
[0176] For the description of the specific functions and examples of each unit of the device in the embodiment of the present disclosure, reference can be made to the relevant description of the corresponding steps in the above method embodiment, which will not be repeated here.
[0177] According to an embodiment of the present disclosure, the present disclosure also provides an electronic device, a readable storage medium and a computer program product.
[0178] Figure 4 A schematic block diagram of an example electronic device 400 that can be used to implement an embodiment of the present disclosure is shown. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital assistants, cellular phones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the present disclosure described and / or required herein.
[0179] like Figure 4 As shown, the device 400 includes a computing unit 401, which can perform various appropriate actions and processes according to a computer program stored in a read-only memory (ROM) 402 or a computer program loaded from a storage unit 408 into a random access memory (RAM) 403. In the RAM 403, various programs and data required for the operation of the device 400 can also be stored. The computing unit 401, the ROM 402, and the RAM 403 are connected to each other via a bus 404. An input / output (I / O) interface 405 is also connected to the bus 404.
[0180] A number of components in the device 400 are connected to the I / O interface 405, including: an input unit 406, such as a keyboard, a mouse, etc.; an output unit 407, such as various types of displays, speakers, etc.; a storage unit 408, such as a disk, an optical disk, etc.; and a communication unit 409, such as a network card, a modem, a wireless communication transceiver, etc. The communication unit 409 allows the device 400 to exchange information / data with other devices through a computer network such as the Internet and / or various telecommunication networks.
[0181] The computing unit 401 may be a variety of general and / or special processing components with processing and computing capabilities. Some examples of the computing unit 401 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various dedicated artificial intelligence (AI) computing chips, various computing units running machine learning model algorithms, digital signal processors (DSPs), and any appropriate processors, controllers, microcontrollers, etc. The computing unit 401 performs the various methods and processes described above, such as a method for determining processing parameters of a quantum signal processing circuit. For example, in some embodiments, the method for determining processing parameters of a quantum signal processing circuit may be implemented as a computer software program, which is tangibly contained in a machine-readable medium, such as a storage unit 408. In some embodiments, part or all of the computer program may be loaded and / or installed on the device 400 via the ROM 402 and / or the communication unit 409. When the computer program is loaded into the RAM 403 and executed by the computing unit 401, one or more steps of the method for determining processing parameters of the quantum signal processing circuit described above may be performed. Alternatively, in other embodiments, the computing unit 401 may be configured to execute the method for determining the processing parameters of the quantum signal processing circuit in any other appropriate manner (for example, by means of firmware).
[0182] Various implementations of the systems and techniques described above herein can be implemented in digital electronic circuit systems, integrated circuit systems, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), complex programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various implementations can include: being implemented in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which can be a special purpose or general purpose programmable processor that can receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit data and instructions to the storage system, the at least one input device, and the at least one output device.
[0183] The program code for implementing the method of the present disclosure may be written in any combination of one or more programming languages. These program codes may be provided to a processor or controller of a general-purpose computer, a special-purpose computer, or other programmable data processing device, so that the program code, when executed by the processor or controller, enables the functions / operations specified in the flow chart and / or block diagram to be implemented. The program code may be executed entirely on the machine, partially on the machine, partially on the machine and partially on a remote machine as a stand-alone software package, or entirely on a remote machine or server.
[0184] In the context of the present disclosure, a machine-readable medium may be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, device, or equipment. A machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or equipment, or any suitable combination of the foregoing. A more specific example of a machine-readable storage medium may include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
[0185] To provide interaction with a user, the systems and techniques described herein can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and pointing device (e.g., a mouse or trackball) through which the user can provide input to the computer. Other types of devices can also be used to provide interaction with the user; for example, the feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including acoustic input, voice input, or tactile input).
[0186] The systems and techniques described herein may be implemented in a computing system that includes back-end components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes front-end components (e.g., a user computer with a graphical user interface or a web browser through which a user can interact with implementations of the systems and techniques described herein), or a computing system that includes any combination of such back-end components, middleware components, or front-end components. The components of the system may be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: a local area network (LAN), a wide area network (WAN), and the Internet.
[0187] A computer system may include a client and a server. The client and the server are generally remote from each other and usually interact through a communication network. The relationship of client and server is generated by computer programs running on respective computers and having a client-server relationship with each other. The server may be a cloud server, a server of a distributed system, or a server combined with a blockchain.
[0188] It should be understood that the various forms of processes shown above can be used to reorder, add or delete steps. For example, the steps recorded in this disclosure can be executed in parallel, sequentially or in different orders, as long as the desired results of the technical solutions disclosed in this disclosure can be achieved, and this document does not limit this.
[0189] The above specific implementations do not constitute a limitation on the protection scope of the present disclosure. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions can be made according to design requirements and other factors. Any modification, equivalent substitution and improvement made within the spirit and principle of the present disclosure shall be included in the protection scope of the present disclosure.
Claims
1. A method for determining processing parameters of a quantum signal processing circuit, comprising: Obtaining a target polynomial f(x) corresponding to a target quantum signal processing circuit, wherein the target quantum signal processing circuit is a quantum signal processing circuit with symmetric processing parameters, and the target polynomial f(x) is used to determine a processing effect of the target quantum signal processing circuit on the signal parameter x; Minimize the optimization function using iterative processing An iterative step in the iterative processing method includes: determining the corresponding Calculate the minimum optimization function Desired search direction Based on the search direction and the get Among them, the optimization function is based on the target polynomial f(x) and the quantum signal processing function Determined, the quantum signal processing function is an expression based on the target quantum signal processing circuit income; represents a processing parameter of the target quantum signal processing circuit, p represents a parity parameter, and the value of p is related to the parity of the target polynomial f(x); and Based on When the termination condition is determined to be met, the corresponding As the target processing parameter of the target quantum signal processing circuit based on the target polynomial Among them, the target processing parameters The encoding includes the processing effect of the target quantum signal processing circuit on the signal parameter x.
2. The method according to claim 1, wherein: The quantum signal processing function The expression of the target quantum signal processing circuit The traces are related.
3. The method according to claim 1, further comprising: Based on When it is determined that the termination condition is not met, the next iteration step is entered.
4. The method according to claim 3, wherein the step of determining the current iteration step corresponds to include: When the current iteration step is the first iteration, the is the preset initial value; or, When the current iteration step is not the first iteration, the is obtained in the previous iteration step 5. The method according to claim 4, further comprising: In determining the When the relationship between the function value and the preset calculation accuracy ∈ meets the preset requirements, it is determined that the termination condition is met.
6. The method according to claim 4, further comprising: In determining the The function value of When the function value of and the preset calculation accuracy ∈ meet the preset requirements, it is determined that the termination condition is met.
7. The method according to claim 4, wherein: One iteration step in the iterative processing method further includes: Determine the trial step length l corresponding to the current iteration step; Wherein, the search direction based on and the get include: Based on the search direction Said And the trial step length l, get the 8. The method according to claim 7, wherein:
9. The method according to claim 8, wherein: The step of determining the trial step length l corresponding to the current iteration step includes: When the current iteration step is the first iteration, the preset step length is used as the trial step length l; or, When the current iteration step is not the first iteration, based on the search direction as well as The trial step length l is obtained.
10. The method according to claim 9, wherein: The trial step length in, 11. A device for determining processing parameters of a quantum signal processing circuit, comprising: An acquisition unit, used to acquire a target polynomial f(x) corresponding to a target quantum signal processing circuit, wherein the target quantum signal processing circuit is a quantum signal processing circuit with symmetric processing parameters, and the target polynomial f(x) is used to determine a processing effect of the target quantum signal processing circuit on the signal parameter x; Processing unit for minimizing the optimization function using iterative processing An iterative step in the iterative processing method includes: determining the corresponding Calculate the minimum optimization function Desired search direction Based on the search direction and the get Among them, the optimization function is based on the target polynomial f(x) and the quantum signal processing function Determined, the quantum signal processing function is an expression based on the target quantum signal processing circuit income; represents the processing parameter of the target quantum signal processing circuit, p represents the parity parameter, and the value of p is related to the parity of the target polynomial f(x); based on When the termination condition is determined to be met, the corresponding As the target processing parameter of the target quantum signal processing circuit based on the target polynomial Among them, the target processing parameters The encoding includes the processing effect of the target quantum signal processing circuit on the signal parameter x.
12. The device according to claim 11, wherein The quantum signal processing function The expression of the target quantum signal processing circuit The traces are related.
13. The device according to claim 11, wherein: The processing unit is further used for: Based on When it is determined that the termination condition is not met, the next iteration step is entered.
14. The device according to claim 13, wherein: The processing unit is specifically used for: When the current iteration step is the first iteration, the is the preset initial value; or, When the current iteration step is not the first iteration, the is obtained in the previous iteration step 15. The device according to claim 14, wherein: The processing unit is further used for: In determining the When the relationship between the function value and the preset calculation accuracy ∈ meets the preset requirements, it is determined that the termination condition is met.
16. The device according to claim 14, wherein: The processing unit is further used for: In determining the The function value of When the function value of and the preset calculation accuracy ∈ meet the preset requirements, it is determined that the termination condition is met.
17. The device according to claim 14, wherein: The processing unit is further used for: Determine the trial step length l corresponding to the current iteration step; Based on the search direction Said And the trial step length l, get the 18. The device according to claim 17, wherein:
19. The device according to claim 18, wherein: The processing unit is specifically used for: When the current iteration step is the first iteration, the preset step length is used as the trial step length l; or, When the current iteration step is not the first iteration, based on the search direction as well as The trial step length l is obtained.
20. The device according to claim 19, wherein The trial step length in, 21. An electronic device, comprising: at least one processor; as well as a memory communicatively connected to the at least one processor; wherein, The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to perform the method according to any one of claims 1 to 10.
22. A non-transitory computer-readable storage medium storing computer instructions, wherein: The computer instructions are used to cause the computer to execute the method according to any one of claims 1-10.
23. A computer program product comprising a computer program, which, when executed by a processor, implements the method according to any one of claims 1 to 10.
