Method and device for processing combinatorial optimization problem

By splitting and recombining quantum circuits, suppressing hardware noise and generating target combinations, the noise limiting problem of quantum computers in the operation of large-bit combination optimization algorithms is solved, and the accuracy and efficiency of the algorithm are improved.

CN119026699AActive Publication Date: 2024-11-26ORIGIN QUANTUM COMPUTING TECH (HEFEI) CO LTD
View PDF 6 Cites 0 Cited by

Patent Information

Application Number
CN202310621170.0
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2023-05-26
Publication Date
2024-11-26
Estimated Expiration
2043-05-26

AI Technical Summary

Technical Problem

The hardware noise of current quantum computers limits the operation of large-bit combinatorial optimization algorithms, making it difficult to effectively deal with large-scale combinatorial optimization problems.

Method used

By splitting the original quantum circuit, error suppression and recombination operations are performed, the measurement results after error suppression are generated, and the target combination is generated based on the average energy expectations, so as to realize the operation of the large-bit combination optimization algorithm.

Benefits of technology

It effectively reduces the error caused by quantum hardware noise, improves the accuracy and efficiency of the combined optimization algorithm, and realizes the operation of large-bit number algorithms on quantum hardware.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119026699A_ABST
    Figure CN119026699A_ABST
Patent Text Reader

Abstract

The invention discloses a combined optimization problem processing method and device, and the method comprises the steps: operating segmented quantum circuits obtained by splitting an original quantum circuit, carrying out the error suppression of a measurement result of each segmented quantum circuit, and obtaining a first measurement result corresponding to each segmented quantum circuit after the error suppression; recombining the obtained first measurement result to generate a second measurement result; obtaining an average energy expectation of the original quantum circuit based on the generated second measurement; and when execution of the segmented quantum circuit meets a specified condition, generating a target combination corresponding to the target combination optimization problem based on the average energy expectation. According to the embodiment of the invention, the operation of the large-bit-number combined optimization algorithm on the quantum hardware is realized through the operation, recombination and the like of the split quantum circuit.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application belongs to the field of quantum computing technology, and in particular to a method and device for processing combinatorial optimization problems. Background Art

[0002] Combinatorial optimization is one of the hot issues in applied mathematics and theoretical computer science. It has important theoretical and practical significance. The goal is to find a combination that meets the requirements in a limited set of objects. Combinatorial optimization problems are generally NP (Non-deterministic Polynomial) hard, which poses a great challenge to the computing power of classical computers, especially when it comes to timeliness issues.

[0003] As an innovative technology for information processing, quantum computing can achieve potential exponential acceleration relative to classical computing on specific problems, and can provide powerful computing power for solving large-scale analysis, calculation and simulation problems in the fields of finance, biomedicine, transportation, etc. We are currently in the era of NISQ (noisy intermediate-scale quantum) computers, and quantum computers at this stage have the characteristics of small number of bits and low depth of executable circuits.

[0004] Due to the imperfections in quantum state preparation, quantum logic gate manipulation, and measurement operations, most current quantum computers are noisy and are only suitable for running small-scale quantum circuits. In terms of combinatorial optimization, current research mainly relies on quantum simulators to simulate the performance of algorithms without hardware noise. Verification on hardware is limited to a relatively small number of bits, and the expansion to a higher number of bits is limited by hardware noise, which makes it difficult to run large-bit combinatorial optimization algorithms on quantum hardware. Summary of the invention

[0005] The purpose of this application is to provide a method and device for processing combinatorial optimization problems, which realizes the operation of a large-bit combinatorial optimization algorithm on quantum hardware by running and reorganizing the split quantum circuits.

[0006] An embodiment of the present application provides a method for processing a combinatorial optimization problem, the method comprising:

[0007] Running the segmented quantum circuits obtained by splitting the original quantum circuit, and performing error suppression on the measurement results of each segmented quantum circuit to obtain a first measurement result corresponding to each segmented quantum circuit after error suppression, wherein the original quantum circuit is generated for a target combinatorial optimization problem;

[0008] Recombining the obtained first measurement result to generate a second measurement result, wherein the second measurement result is a result obtained by measuring the original quantum circuit;

[0009] Based on the generated second measurement result, obtaining an average energy expectation of the original quantum circuit;

[0010] When the execution of the segmented quantum circuit meets the specified conditions, a target combination corresponding to the target combination optimization problem is generated based on the average energy expectation.

[0011] Optionally, the original quantum circuit is generated by:

[0012] Determine the action sequence of the quantum logic gate and the action relationship between the quantum bit and the quantum logic gate according to the initial state data and the selected proposed method, wherein the initial state data is state data characterizing the initial quantum state corresponding to the target combinatorial optimization problem;

[0013] According to the action sequence and the action relationship, an original quantum circuit is generated.

[0014] Optionally, the error suppression of the measurement result of each segmented quantum circuit includes:

[0015] A preset quantum error suppression algorithm is used to suppress the error of the measurement result of each segmented quantum circuit, wherein the quantum error suppression algorithm includes one or a combination of a readout error suppression algorithm, a zero noise extrapolation algorithm, a probabilistic error elimination algorithm and a dynamic decoupling algorithm.

[0016] Optionally, the first measurement result is obtained by measuring an uncut quantum bit of a segmented quantum circuit;

[0017] The reorganizing all the first measurement results to generate the second measurement result includes:

[0018] All first measurement results are reorganized according to the order of the quantum bits corresponding to each segmented quantum circuit in the original quantum circuit to generate a second measurement result.

[0019] Optionally, obtaining an average energy expectation for the original quantum circuit based on all second measurement results comprises:

[0020] Calculating a first energy expectation corresponding to each second measurement result;

[0021] Based on a preset confidence, determining a second energy expectation from the first energy expectations arranged in order of magnitude;

[0022] The average value of all the second energy expectations is calculated to obtain the average energy expectation of the original quantum circuit.

[0023] Optionally, the method further comprises:

[0024] When the execution of the segmented quantum circuit does not satisfy the specified conditions, CVaR is used to calculate the gradient of the variational parameters in the original quantum circuit;

[0025] Based on the gradient, a variational parameter of each segmented quantum circuit is correspondingly updated.

[0026] Another embodiment of the present application provides a processing device for combinatorial optimization problems, the device comprising:

[0027] A first obtaining module is used to run the segmented quantum circuits obtained by splitting the original quantum circuit, and perform error suppression on the measurement results of each segmented quantum circuit to obtain a first measurement result corresponding to each segmented quantum circuit after error suppression, wherein the original quantum circuit is generated for a target combinatorial optimization problem;

[0028] A recombining module, used for recombining the obtained first measurement result to generate a second measurement result, wherein the second measurement result is a result obtained by measuring the original quantum circuit;

[0029] A second obtaining module, configured to obtain an average energy expectation of the original quantum circuit based on the generated second measurement result;

[0030] A generating module is used to generate a target combination corresponding to the target combination optimization problem based on the average energy expectation when the execution of the segmented quantum circuit meets the specified conditions.

[0031] Another embodiment of the present application provides a quantitative super-cooperative operating system, which implements the processing of combinatorial optimization problems according to any of the methods described above.

[0032] Yet another embodiment of the present application provides a storage medium, wherein the storage medium stores a computer program, wherein the computer program is configured to implement any of the above methods when executed.

[0033] Yet another embodiment of the present application provides an electronic device, including a memory and a processor, wherein the memory stores a computer program, and the processor is configured to run the computer program to implement any of the above methods.

[0034] Compared with the prior art, the present application first runs the segmented quantum circuit obtained by splitting the original quantum circuit, and performs error suppression on the measurement results of each segmented quantum circuit to obtain the first measurement result corresponding to each segmented quantum circuit after error suppression; then reorganizes the obtained first measurement result to generate a second measurement result; then based on the generated second measurement result, obtains the average energy expectation of the original quantum circuit; finally, when the execution of the segmented quantum circuit meets the specified conditions, based on the average energy expectation, generates the target combination corresponding to the target combination optimization problem. By running and reorganizing the split quantum circuit, the operation of the combinatorial optimization algorithm with a large number of bits on quantum hardware is realized. BRIEF DESCRIPTION OF THE DRAWINGS

[0035] Figure 1 It is a network block diagram of a system for processing combinatorial optimization problems provided by an embodiment of the present application;

[0036] Figure 2 A flowchart of a method for processing a combinatorial optimization problem provided in an embodiment of the present application;

[0037] Figure 3 A schematic diagram of quantum circuit cutting provided in an embodiment of the present application;

[0038] Figure 4 A schematic diagram of the structure of a device for processing combinatorial optimization problems provided in an embodiment of the present application. DETAILED DESCRIPTION

[0039] The embodiments described below with reference to the accompanying drawings are exemplary and are only used to explain the present application, and should not be construed as limiting the present application.

[0040] Figure 1 1 is a network block diagram of a system for processing combinatorial optimization problems provided by an embodiment of the present application. The system for processing combinatorial optimization problems may include a network 110, a server 120, a wireless device 130, a client 140, a storage unit 150, a classical processing system 160, a quantum processing system 170, and may also include additional memories, classical processors, quantum processors, and other devices not shown.

[0041] The network 110 is a medium for providing communication links between various devices and computers connected together in the system for processing combinatorial optimization problems, including but not limited to the Internet, corporate intranets, local area networks, mobile communication networks and combinations thereof. The connection method may be wired, wireless communication links or optical fiber cables, etc.

[0042] The server 120 and the client 140 are conventional data processing systems that may contain data and applications or software tools that perform conventional computing processes. The client 140 may be a personal computer or a network computer, so the data may also be provided by the server 120. The wireless device 130 may be a smart phone, a tablet, a laptop, a smart wearable device, etc. The storage unit 150 may include a database 151, which may be configured to store data such as quantum bit parameters, quantum logic gate parameters, quantum circuits, quantum programs, etc.

[0043] The classical processing system 160 (quantum processing system 170) may include a classical processor 161 (quantum processor 171) for processing classical data (quantum data) and a memory 163 (memory 172) for storing classical data (quantum data). The classical data (quantum data) may be a boot file, an operating system image, and an application 162 (application 173). The application 162 (application 173) may be used to implement a quantum algorithm compiled according to the method for processing combinatorial optimization problems provided in an embodiment of the present application.

[0044] Any data or information stored or generated in the classical processing system 160 (quantum processing system 170) can also be configured to be stored or generated in another classical (quantum) processing system in a similar manner, and any application program executed by it can also be configured to be executed in another classical (quantum) processing system in a similar manner.

[0045] It should be noted that a true quantum computer is a hybrid structure, which includes at least Figure 1 There are two major parts in it: the classical processing system 160, which is responsible for performing classical calculations and control; and the quantum processing system 170, which is responsible for running quantum programs and thus realizing quantum calculations.

[0046] The classical processing system 160 and the quantum processing system 170 may be integrated into one device or distributed in two different devices. For example, the first device including the classical processing system 160 runs a classical computer operating system, on which quantum application development tools and services are provided, as well as storage and network services required for quantum applications. Users develop quantum applications through the quantum application development tools and services thereon, and send quantum programs to the second device including the quantum processing system 170 through the network services thereon. The second device runs a quantum computer operating system, parses the code of the quantum program through the quantum computer operating system, and compiles it into instructions that can be recognized and executed by the quantum computer measurement and control system. The quantum processor 170 implements the quantum algorithm corresponding to the quantum program according to the instructions.

[0047] In the classic processing system 160 based on silicon chips, the unit of the classic processor 161 is a CMOS tube. This computing unit is not limited by time and coherence, that is, this computing unit is not limited by the length of use and is available at any time. In addition, in the silicon chip, the number of such computing units is also sufficient. At present, the number of computing units in a classic processor is tens of thousands. The number of computing units is sufficient and the computing logic that can be selected by the CMOS tube is fixed, for example: AND logic. When calculating with the help of CMOS tubes, a large number of CMOS tubes are combined with limited logic functions to achieve the calculation effect.

[0048] Unlike this logic unit in the classical processing system 160, the basic computing unit of the quantum processor 171 in the quantum processing system 170 is a quantum bit, and the input of the quantum bit is limited by coherence and coherence time, that is, the quantum bit is limited by the use time and is not available at any time. Making full use of the quantum bit within the available use time of the quantum bit is a key problem in quantum computing. In addition, the number of quantum bits in a quantum computer is one of the representative indicators of the performance of a quantum computer. Each quantum bit realizes the computing function through the logical function configured on demand. In view of the limited number of quantum bits, the logical functions in the field of quantum computing are diverse, such as: Hadamard gate (Hadamard gate, H gate), Pauli-X gate (X gate), Pauli-Y gate (Y gate), Pauli-Z gate (Z gate), X gate, RY gate, RZ gate, CNOT gate, CR gate, iSWAP gate, Toffoli gate, etc. In quantum computing, it is necessary to use limited quantum bits combined with a variety of logical functions to achieve the computing effect.

[0049] In quantum computing, the basic unit of information is the quantum bit. A quantum bit has two states, 0 and 1, denoted as |0> and |1>, but it can be in a superposition state of the two states 0 and 1, which can be expressed as |ψ>=a|0>+b|1>, where a and b are complex numbers representing the amplitude (probability amplitude) of the |0> state and |1> state, which is not available in classical bits. After measurement, the state of the quantum bit will collapse to a certain state (eigenstate, here |0> state, |1> state), where the probability of collapsing to |0> is |a| 2 , the probability of collapsing to |1> is |b| 2 , |a| 2 +|b| 2 =1, |> is the Dirac symbol.

[0050] The quantum state is generally described by a set of orthogonal and complete eigenstates. Usually, the eigenstates are represented in binary in quantum algorithms (or quantum programs). For example, a set of quantum bits is q0, q1, q2, representing the 0th, 1st, and 2nd quantum bits, and the order from high to low is q2q1q0. The quantum state of this set of quantum bits is the superposition state of 8 eigenstates, and the 8 eigenstates are: |000>, |001>, |010>, |011>, |100>, |101>, |110>, |111>, and each eigenstate corresponds to the same quantum bit. For example, in the |000> state, 000 corresponds to q2q1q0 from high to low. It should be noted that the quantum bits can also be sorted from low to high. Specifically, it is set according to the actual situation. In short, the quantum state is a superposition state composed of various eigenstates. When the probability of other eigenstates is 0, it is in one of the definite eigenstates. One eigenstate corresponds to one basis vector. For example, if the eigenstate is |000>, the basis vector is 000. The basis vector is a binary string composed of 0 and 1. The state data generally contains at least one basis vector.

[0051] Based on these differences, the design of the logical function acting on quantum bits (including the design of whether the quantum bits are used or not and the design of the efficiency of the use of each quantum bit) is the key to improving the computing performance of quantum computers and requires special design. The above-mentioned design for quantum bits is a technical problem that ordinary computing devices do not need to consider or face. Based on this, in order to realize the processing of combinatorial optimization problems in quantum computing, this application proposes a method for processing combinatorial optimization problems and related devices, which aims to realize the operation of combinatorial optimization algorithms with large bit numbers on quantum hardware through the operation and reorganization of split quantum circuits.

[0052] See also Figure 2 , Figure 2 A flowchart of a method for processing a combinatorial optimization problem provided in an embodiment of the present application may include the following steps:

[0053] S201: running the segmented quantum circuits obtained by splitting the original quantum circuit, and performing error suppression on the measurement results of each segmented quantum circuit to obtain a first measurement result corresponding to each segmented quantum circuit after error suppression, wherein the original quantum circuit is generated for a target combinatorial optimization problem.

[0054] The original quantum circuit is split according to the cutting point to obtain the segmented quantum circuit. The cutting point can be selected according to the actual situation or according to the preset cutting rule to determine the cutting position in the original quantum circuit.

[0055] Quantum hardware noise is ubiquitous. Quantum bit decoherence, quantum control errors, quantum logic gate errors, measurement errors, and crosstalk between quantum bits can all cause errors. When quantum hardware reaches a certain level, the output errors of small bits and shallow circuits are mainly composed of measurement errors. Error suppression is to reduce the noise or errors caused by imperfect quantum hardware by optimizing the operation control of quantum circuits and classical post-processing of circuit output data, thereby improving the fidelity of output data. Error suppression can reduce the error of measurement results, obtain higher-precision output, and improve the accuracy of the measured distribution of each basis vector.

[0056] S202: Recombining the obtained first measurement result to generate a second measurement result, wherein the second measurement result is a result obtained by measuring the original quantum circuit.

[0057] In order to obtain the correct second measurement result and meet the completeness requirements of the quantum data stream, it is necessary to set the recombination rules according to the quantum state evolution rules that conform to the law, and use the recombination rules for recombination. The recombination process of the measurement results is actually the data processing process. Different recombination rules will produce different data processing methods. Different data processing methods may require different amounts of data and data storage forms. Therefore, the recombination rules determine the operation mode of the segmented quantum circuit and the storage form of the first measurement result. In view of this, different recombination rules can be selected according to the configuration and computing power of the processing system of the combinatorial optimization problem. Different recombination rules can be selected for different original quantum circuits; for an original quantum circuit, different recombination rules can also be selected according to the different measurement results required.

[0058] S203: Based on the generated second measurement result, obtain an average energy expectation of the original quantum circuit.

[0059] The energy expectation is obtained by linearly combining the energy expectations of each sub-Hamiltonian that constitutes the Hamiltonian under this basis vector according to its coefficients based on the duality property. The average energy expectation of the original quantum circuit is obtained by averaging the energy expectations under a set of basis vectors, which are measured under the Z measurement basis.

[0060] In this application, the Hamiltonian can be obtained as follows:

[0061] The constraints of the constrained combinatorial optimization problem Cbo based on the mean-variance model are transformed into penalty terms, and the optimization problem Qubo without constraints is obtained. This mathematical problem is mapped to the representation of a two-state physical system, and the corresponding Hamiltonian H with at most two-body interaction is obtained.

[0062] S204: When the execution of the segmented quantum circuit meets the specified conditions, a target combination corresponding to the target combination optimization problem is generated based on the average energy expectation.

[0063] The specified conditions are used to measure whether the optimal or good enough solution is determined. Good enough means that it is close to the optimal solution and can meet the needs of further research based on the solution. In some cases, it can be equivalent to the optimal solution. When a good enough solution is obtained, the operation of the segmented quantum circuit is stopped, which can save computing resources, reduce the time required to solve the combinatorial optimization problem, and improve efficiency.

[0064] The number of iterations is the number of times the variational parameters in the segmented quantum circuit are updated. The original quantum circuit contains variational parameters, and the segmented quantum circuit contains corresponding variational parameters. When the variational parameters are updated, the quantum state prepared using the original quantum circuit will also be different, and the first measurement result obtained may also be different.

[0065] The specified conditions can be set based on the computing power of the quantum computing system, or can be set based on other conditions. Specifically, the specified conditions can be a combination of one or more of these conditions: the number of iterations reaches a preset threshold; the difference between the average energy expectation of the original quantum circuit obtained in the current iteration and the average energy expectation of the original quantum circuit obtained in the previous iteration is within a preset range; the difference between the average energy expectation of the original quantum circuit obtained in the current iteration and the preset ground state energy expectation is within a preset range. It should be noted that the specified conditions can also be other conditions for determining iterative convergence, which are not listed here.

[0066] When the operation of the segmented quantum circuit meets the iterative convergence condition, the minimum energy expectation used when calculating the average energy expectation can be calculated in the current iteration, and the target combination corresponding to the target combination optimization problem is generated based on the basis vector corresponding to the minimum energy expectation. Exemplarily, the target optimization problem is an investment portfolio optimization problem, specifically selecting 3 assets from 10 candidate assets for investment, and the obtained basis vector is 0001010001, and the elements in the basis vector represent 1 asset. If the order of the basis vectors from left to right corresponds to the ascending order of the assets and the ascending order of the quantum bit numbers, the generated target combination is (asset 4, asset 6, asset 10).

[0067] It can be seen that the embodiment of the present application first runs the segmented quantum circuit obtained by splitting the original quantum circuit, and performs error suppression on the measurement results of each segmented quantum circuit to obtain the first measurement result corresponding to each segmented quantum circuit after error suppression; then reorganizes the obtained first measurement result to generate a second measurement result; then based on the generated second measurement result, the average energy expectation of the original quantum circuit is obtained; finally, when the execution of the segmented quantum circuit meets the specified conditions, based on the average energy expectation, the target combination corresponding to the target combination optimization problem is generated. By running and reorganizing the split quantum circuit, the operation of the combinatorial optimization algorithm with a large number of bits on quantum hardware is realized.

[0068] In some possible implementations of the present application, the original quantum circuit is generated in the following manner:

[0069] Determine the action sequence of the quantum logic gate and the action relationship between the quantum bit and the quantum logic gate according to the initial state data and the selected proposed method, wherein the initial state data is state data characterizing the initial quantum state corresponding to the target combinatorial optimization problem;

[0070] According to the action sequence and the action relationship, an original quantum circuit is generated.

[0071] The initial state data can be obtained after preprocessing the target optimization combinatorial problem. The initial state data can be generated by analyzing the characteristics of the target combinatorial optimization problem. Different methods are used to generate the initial state data for different combinatorial optimization problems. In the embodiments of the present application, the method for generating the initial state data is not limited, as long as the initial state data is obtained. Based on the initial state data and the assumed method, the timing of the action of the quantum logic gate and the action relationship between the quantum logic gate and the quantum bit can be determined, and the original quantum circuit can be generated. Using the original quantum circuit, the initial quantum state can be prepared.

[0072] In combinatorial optimization problems, the initial quantum state can be a W state, a Dicke state, a complete superposition state, etc. For the initial state data, the Hamming weights of the basis vectors contained therein are determined, and the original quantum circuit is generated using different methods based on the parity of the Hamming weight k. Specifically, when k is an odd number (even number), the original quantum circuit is generated using the following method:

[0073] Using the first quantum logic gate combination, the first sub-quantum circuit module is constructed in the first time sequence of the even-numbered (odd-numbered) quantum bits (the quantum bit number is 0≤i≤n-1, n is the number of quantum bits contained in the original quantum circuit, which is specifically determined by the initial state data) in the first k quantum bits. The first sub-quantum circuit module may include The first quantum logic gate combination;

[0074] Using the second quantum logic gate combination, starting from the quantum bit numbered i=2 (i=1), a second sub-quantum circuit module is constructed within the second time sequence of the quantum bit. The second sub-quantum circuit module may include A second quantum logic gate combination;

[0075] Using the second quantum logic gate combination, construct a third sub-quantum circuit module in a third time sequence of all quantum bits, the third sub-quantum circuit module including (n-1) second quantum logic gate combinations;

[0076] The first sub-quantum circuit module, the second sub-quantum circuit module and the third sub-quantum circuit module are combined in sequence to generate an original quantum circuit.

[0077] In the above original quantum circuit generation method, the first quantum logic gate combination includes the Pauli-X gate, and the second quantum logic gate combination includes the controlled NOT gate and the controlled rotation gate. The original quantum circuit generated based on the above method can determine the cutting method more efficiently. Of course, there are other generation methods, and the quantum circuit generation method with efficient cutting is better, but as long as the original quantum circuit can be generated, it will not be listed here one by one.

[0078] In some possible implementations of the present application, the error suppression of the measurement result of each segmented quantum circuit includes:

[0079] A preset quantum error suppression algorithm is used to suppress the error of the measurement result of each segmented quantum circuit, wherein the quantum error suppression algorithm includes one or a combination of a readout error suppression algorithm, a zero noise extrapolation algorithm, a probabilistic error elimination algorithm and a dynamic decoupling algorithm.

[0080] The readout error suppression algorithm is mainly used to suppress the measurement error of shallow circuits, mainly for the case where the quantum state preparation error and the two-bit quantum logic gate error are small enough. By measuring the quantum hardware, the statistical characteristics of the quantum hardware measurement error are obtained and saved as the response matrix M, which is used to recover the accurate output from the noisy output quantum state. The relationship can be expressed as ρ noise =Mρ ideal , that is, when the noisy quantum state ρ is measured noise After that, by executing M -1 ρ noise The operation restores a closer ρ ideal Quantum state estimation.

[0081] Without considering non-local interactions such as crosstalk between bits, the response matrix M can be obtained by sampling a single bit: i, and finally the total response matrix M is obtained by direct product. When the crosstalk between bits cannot be ignored, it is necessary to measure all bits synchronously to obtain the response matrix M. In fact, a basis vector will only migrate to the basis vector with a smaller Hamming distance, so the response matrix should be a matrix with a main diagonal accounting for the main components and a wide distribution of 0 values. In addition, it is unrealistic and unnecessary to traverse the exponential multiple basis vectors, which can be accomplished by sampling the basis vectors of specific Hamming weights.

[0082] The zero-noise extrapolation algorithm is a sequence acceleration method in numerical analysis, which is used to improve the convergence speed of the estimated sequence of the solved value. Assuming that the function A(h) is an expansion with h as a parameter, and the value of A(h) under a small number of h is known, the zero-noise extrapolation algorithm can be used to solve the value A(h) of the function A(h) when h tends to 0. * The zero-noise extrapolation algorithm can be described as follows:

[0083] Assume that the expanded form of function A(h) is:

[0084] A(h)=A * +Ch n +O(h n+1 )

[0085] Introducing the scaling parameter t of the independent variable h, the expansion of h / t as the independent variable is obtained as follows:

[0086] A(h / t)=A * +Ch n / t n +O(h n+1 / t n+1 )

[0087] By converting the above formula Ch n / t n t in n Transfer to the numerator and perform the estimation to get the target value, namely:

[0088]

[0089] The above method and principle correspond to the case of zero noise extrapolation algorithm and can be used to estimate the noise-free output value when the noise level h of the quantum circuit tends to zero.

[0090] The probabilistic error elimination algorithm is a quasi-probabilistic decomposition method that estimates the noise-free energy expectation by linearly combining the energy expectations of multiple noisy quantum circuits. Similar to the quantum circuit decomposition method, which decomposes the channel into linear combinations on specific channels, in the probabilistic error elimination algorithm, it is assumed that the total channel is Y = Y N ...Y2Y1, where the noiseless channel Y i(corresponding to a quantum logic gate) is decomposed into a noisy channel B that can be implemented in hardware n,i Linear combination of:

[0091]

[0092] Among them, the coefficient β n,i is a real number, and the observable quantity O is in the quantum state Y i |ψ i >The expected value of energy under

[0093] The probabilistic error elimination algorithm requires that each channel Y in the quantum circuit i All are decomposed. Assuming that the number of bases decomposed from each of the N channels is b, the total number of noise channels is bN. Therefore, the synthesis of noise-free channels cannot be achieved by complete tomography and linear combination, but still needs to be performed by sampling. At this time, the decomposition of the total channel is expressed as Y = ∑ n β n B n , due to the coefficient β n It cannot be guaranteed that they are all positive numbers, so a normalization coefficient A=∑ n |β n |、and β n The symbol of is contracted into the noise channel, and the probability is |β n | / Linear combination of A:

[0094] A∑n(|β n | / A)sgn(β n )β n

[0095] Based on this, the target energy expectation can be expressed as Therefore, according to the probability distribution |β n | / A vs. B n Sampling to get energy expectation Finally, the linear combination is used to obtain the target energy expectation.

[0096] The dynamical decoupling (DD) algorithm is a quantum error control technology that suppresses decoherence in quantum computing by designing a specific pulse sequence. It is usually used to protect quantum states, approximately average out the unwanted coupling between the system and the environment, and extend its coherence time.

[0097] In some possible implementations of the present application, the first measurement result is obtained by measuring an uncut quantum bit of a segmented quantum circuit;

[0098] The reorganizing all the first measurement results to generate the second measurement result may include:

[0099] All first measurement results are reorganized according to the order of the quantum bits corresponding to each segmented quantum circuit in the original quantum circuit to generate a second measurement result.

[0100] It should be noted that the cut quantum bits and the uncut quantum bits are determined based on whether there is a cut point in the corresponding timeline. The corresponding timeline is the timeline between the segmented circuits to be reorganized with the execution timing later. The execution timing is determined based on the original quantum circuit. The cut quantum bits and the uncut quantum bits of the segmented circuit to be reorganized with the execution timing immediately adjacent to each other are determined. Figure 3 For example, for segmented quantum circuit A, the cut quantum bit is q4, and the uncut quantum bit is q3; for segmented quantum circuit B, the cut quantum bit is q5, and the uncut quantum bit is q4.

[0101] The first measurement result is a segment of the basis vector corresponding to the original quantum circuit, specifically, a segment of the binary string. In order to obtain a complete basis vector, the segment basis vectors corresponding to the segmented quantum circuit need to be reorganized in order. Exemplarily, the uncut quantum bits of segmented quantum circuit 1 are q0 and q1, and the corresponding first measurement result is 01; the uncut quantum bits of segmented quantum circuit 2 are q2, q3, and q4, and the corresponding first measurement result is 100; the uncut quantum bits of segmented quantum circuit 3 are q5 and q6, and the corresponding first measurement result is 00; the uncut quantum bits of segmented quantum circuit 4 are q7, q8, q9, and q10, and the corresponding first measurement result is 0101, then the second measurement result is 01100000101.

[0102] In some embodiments of the present application, each segmented quantum circuit performs a measurement error suppression when measuring a binary string segment, but the suppression at this time is only the measurement error suppression matrix acting on a certain unit basis vector, so as to obtain a measurement result of the superposition of several possible unit basis vectors. In order to obtain a first measurement result, a binary string segment as the final output of the segmented quantum circuit can be selected from these superimposed basis vectors according to their probability, randomly or by other means.

[0103] In some possible implementations of the present application, obtaining an average energy expectation for the original quantum circuit based on all second measurement results includes:

[0104] Calculating a first energy expectation corresponding to each second measurement result;

[0105] Based on a preset confidence, determining a second energy expectation from the first energy expectations arranged in order of magnitude;

[0106] The average value of all the second energy expectations is calculated to obtain the average energy expectation of the original quantum circuit.

[0107] In an embodiment of the present application, in order to obtain a more accurate average energy expectation, the expectation interval composed of the first energy expectation is sampled again, and the sampling results are averaged. Specifically, based on the preset confidence and the number of first energy expectations, the sampling number of the second energy expectation is determined, and the first energy expectations arranged in order from small to large are selected in turn as the second energy expectation, until the number of second energy expectations is the sampling number. Exemplarily, the number of first energy expectations is 30, and the preset confidence is 0.3, then the sampling number is 20*0.3=6, and the 6 smallest energy expectations are selected from the first energy expectations as the second energy expectations. The sampling interval is determined using the preset confidence, and the corresponding expectations in the sampling interval are sampled to obtain the second energy expectation. In this way, the sampling range can be limited to the left part of the interval of the first energy expectations arranged from small to large, so that sampling can obtain a more accurate average energy expectation of the original quantum circuit.

[0108] In some possible implementations of the present application, the method may further include:

[0109] When the execution of the segmented quantum circuit does not satisfy the specified conditions, CVaR is used to calculate the gradient of the variational parameters in the original quantum circuit;

[0110] Based on the gradient, a variational parameter of each segmented quantum circuit is correspondingly updated.

[0111] In order to accelerate the convergence speed of gradient optimization, CVaR (Conditional Value at Risk) is used as the objective function for gradient optimization in the embodiment of the present application. Based on the objective function, the variational parameter θ of the original quantum circuit of the gradient optimization algorithm is optimized. The variational parameter is updated once the optimization is performed. Different quantum states can be prepared using the original quantum circuit with different variational parameters. This operation can gradually reduce the energy expectation of Hamiltonian H in the quantum state, which is equivalent to gradually increasing the overlap between the ground state and the quantum state, or making the basis vectors that make up the quantum state closer to the ground state; when the iterative operation of the segmented quantum circuit meets the specified conditions, the optimal solution or approximate solution of the target combinatorial optimization problem can be obtained. Based on the gradient and the current variational parameters, new variational parameters are calculated, which correspond to the variational parameters of the updated segmented quantum circuit.

[0112] See also Figure 4 , Figure 4 A schematic diagram of a structure of a processing device for a combinatorial optimization problem provided in an embodiment of the present application, and Figure 2Corresponding to the process shown, the device includes:

[0113] A first obtaining module 401 is used to run the segmented quantum circuits obtained by splitting the original quantum circuit, and perform error suppression on the measurement results of each segmented quantum circuit to obtain a first measurement result corresponding to each segmented quantum circuit after error suppression, wherein the original quantum circuit is generated for a target combinatorial optimization problem;

[0114] A recombining module 402, configured to recombinate the obtained first measurement result to generate a second measurement result, wherein the second measurement result is a result obtained by measuring the original quantum circuit;

[0115] A second obtaining module 403, configured to obtain an average energy expectation of the original quantum circuit based on the generated second measurement result;

[0116] The generating module 404 is used to generate a target combination corresponding to the target combination optimization problem based on the average energy expectation when the execution of the segmented quantum circuit meets the specified condition.

[0117] In some possible implementations of the present application, the original quantum circuit is generated in the following manner:

[0118] Determine the action sequence of the quantum logic gate and the action relationship between the quantum bit and the quantum logic gate according to the initial state data and the selected proposed method, wherein the initial state data is state data characterizing the initial quantum state corresponding to the target combinatorial optimization problem;

[0119] According to the action sequence and the action relationship, an original quantum circuit is generated.

[0120] In some possible implementations of the present application, the first obtaining module 401 may be specifically used to:

[0121] A preset quantum error suppression algorithm is used to suppress the error of the measurement result of each segmented quantum circuit, wherein the quantum error suppression algorithm includes one or a combination of a readout error suppression algorithm, a zero noise extrapolation algorithm, a probabilistic error elimination algorithm and a dynamic decoupling algorithm.

[0122] In some possible implementations of the present application, the first measurement result is obtained by measuring an uncut quantum bit of a segmented quantum circuit;

[0123] The recombinant module 402 may be specifically used for:

[0124] All first measurement results are reorganized according to the order of the quantum bits corresponding to each segmented quantum circuit in the original quantum circuit to generate a second measurement result.

[0125] In some possible implementations of the present application, the second obtaining module 403 is specifically used to:

[0126] Calculating a first energy expectation corresponding to each second measurement result;

[0127] Based on a preset confidence, determining a second energy expectation from the first energy expectations arranged in order of magnitude;

[0128] The average value of all the second energy expectations is calculated to obtain the average energy expectation of the original quantum circuit.

[0129] In some possible implementations of the present application, the device may further include:

[0130] A calculation module, used for calculating the gradient of the variational parameter in the original quantum circuit by using CVaR when the execution of the segmented quantum circuit does not meet the specified conditions;

[0131] An updating module is used to update the variational parameters of each segmented quantum circuit based on the gradient.

[0132] It can be seen that the embodiment of the present application first runs the segmented quantum circuit obtained by splitting the original quantum circuit, and performs error suppression on the measurement results of each segmented quantum circuit to obtain the first measurement result corresponding to each segmented quantum circuit after error suppression; then reorganizes the obtained first measurement result to generate a second measurement result; then based on the generated second measurement result, the average energy expectation of the original quantum circuit is obtained; finally, when the execution of the segmented quantum circuit meets the specified conditions, based on the average energy expectation, the target combination corresponding to the target combination optimization problem is generated. By running and reorganizing the split quantum circuit, the operation of the combinatorial optimization algorithm with a large number of bits on quantum hardware is realized.

[0133] An embodiment of the present application also provides a quantum super-cooperative operating system, which runs on a quantum computer including a quantum processor and / or a supercomputer including a classical processor, and is used to implement the processing of combinatorial optimization problems according to the method described in the embodiment of the method side of the present application.

[0134] An embodiment of the present application further provides a storage medium, in which a computer program is stored, wherein the computer program is configured to implement the steps of any of the above method embodiments when executed.

[0135] Specifically, in this embodiment, the above storage medium may be configured to store a computer program for implementing the following steps:

[0136] S201: running a segmented quantum circuit obtained by splitting an original quantum circuit, and performing error suppression on a measurement result of each segmented quantum circuit to obtain a first measurement result corresponding to each segmented quantum circuit after error suppression, wherein the original quantum circuit is generated for a target combinatorial optimization problem;

[0137] S202: Recombining the obtained first measurement result to generate a second measurement result, wherein the second measurement result is a result obtained by measuring the original quantum circuit;

[0138] S203: Obtaining an average energy expectation of the original quantum circuit based on the generated second measurement result;

[0139] S204: When the execution of the segmented quantum circuit meets the specified conditions, a target combination corresponding to the target combination optimization problem is generated based on the average energy expectation.

[0140] An embodiment of the present application further provides an electronic device, including a memory and a processor, wherein the memory stores a computer program, and the processor is configured to run the computer program to implement the steps in any one of the above method embodiments.

[0141] Specifically, the electronic device may further include a transmission device and an input / output device, wherein the transmission device is connected to the processor, and the input / output device is connected to the processor.

[0142] Specifically, in this embodiment, the processor may be configured to implement the following steps through a computer program:

[0143] S201: running a segmented quantum circuit obtained by splitting an original quantum circuit, and performing error suppression on a measurement result of each segmented quantum circuit to obtain a first measurement result corresponding to each segmented quantum circuit after error suppression, wherein the original quantum circuit is generated for a target combinatorial optimization problem;

[0144] S202: Recombining the obtained first measurement result to generate a second measurement result, wherein the second measurement result is a result obtained by measuring the original quantum circuit;

[0145] S203: Obtaining an average energy expectation of the original quantum circuit based on the generated second measurement result;

[0146] S204: When the execution of the segmented quantum circuit meets the specified conditions, a target combination corresponding to the target combination optimization problem is generated based on the average energy expectation.

[0147] The embodiments of this specification also provide a computer program product including instructions, which, when executed by a computer, enables the computer to perform the processing of the combinatorial optimization problem in any of the above embodiments.

[0148] It should be understood that the specific examples in this specification are only intended to help those skilled in the art to better understand the implementation methods of this specification, rather than to limit the scope of this application.

[0149] It can be understood that in the various implementations of this specification, the size of the serial number of each process does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the implementation methods of this specification.

[0150] It can be understood that the various embodiments described in this specification can be implemented individually or in combination, and the embodiments of this specification are not limited to this.

[0151] Unless otherwise specified, all technical and scientific terms used in the embodiments of this specification have the same meaning as those generally understood by those skilled in the art of the technical field of this specification. The terms used in this specification are only for the purpose of describing specific embodiments and are not intended to limit the scope of this specification. The term "and / or" used in this specification includes any and all combinations of one or more related listed items. The singular forms of "a", "above", and "the" used in the embodiments of this specification and the appended claims are also intended to include plural forms, unless the context clearly indicates other meanings.

[0152] It can be understood that the processor of the embodiment of this specification can be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method implementation can be completed by the hardware integrated logic circuit or software instructions in the processor. The above processor can be a general processor, a digital signal processor (Digital Signal Processor, DSP), an application specific integrated circuit (Application Specific Integrated Circuit, ASIC), a field programmable gate array (Field Programmable Gate Array, FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components. The disclosed methods, steps and logic block diagrams in the embodiment of this specification can be implemented or executed. The general processor can be a microprocessor or the processor can also be any conventional processor, etc. The steps of the method disclosed in the embodiment of this specification can be directly embodied as a hardware decoding processor to perform, or the hardware and software modules in the decoding processor are combined and performed. The software module can be located in a random access memory, a flash memory, a read-only memory, a programmable read-only memory or an electrically erasable programmable memory, a register, and other mature storage media in the art. The storage medium is located in the memory, and the processor reads the information in the memory and completes the steps of the above method in combination with its hardware.

[0153] It is understood that the memory in the embodiments of this specification may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memory. Among them, the non-volatile memory may be a read-only memory (ROM), a programmable read-only memory (programmable ROM, PROM), an erasable programmable read-only memory (erasablePROM, EPROM), an electrically erasable programmable read-only memory (EEPROM) or a flash memory. The volatile memory may be a random access memory (RAM). It should be noted that the memory of the systems and methods described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0154] Those skilled in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this specification.

[0155] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method implementation methods and will not be repeated here.

[0156] In the several embodiments provided in this specification, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device implementation described above is only schematic. For example, the division of the units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0157] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the present embodiment.

[0158] In addition, each functional unit in each embodiment of the present specification may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[0159] If the functions are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this specification, or the part that contributes to the prior art or the part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium, including several instructions for a computer device (which can be a personal computer, server, or network device, etc.) to perform all or part of the steps of the method described in each embodiment of this specification. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), disk or optical disk, etc., various media that can store program codes.

[0160] The above is only a specific implementation of this specification, but the protection scope of this application is not limited thereto. Any technician familiar with the technical field can easily think of changes or substitutions within the technical scope disclosed in this specification, which should be included in the protection scope of this specification. Therefore, the protection scope of this application should be based on the protection scope of the claims.

Claims

1. A method for processing combinatorial optimization problems, It is characterized in that The method comprises: Running the segmented quantum circuits obtained by splitting the original quantum circuit, and performing error suppression on the measurement results of each segmented quantum circuit to obtain a first measurement result corresponding to each segmented quantum circuit after error suppression, wherein the original quantum circuit is generated for a target combinatorial optimization problem; Recombining the obtained first measurement result to generate a second measurement result, wherein the second measurement result is a result obtained by measuring the original quantum circuit; Based on the generated second measurement result, obtaining an average energy expectation of the original quantum circuit; When the execution of the segmented quantum circuit meets the specified conditions, a target combination corresponding to the target combination optimization problem is generated based on the average energy expectation.

2. The method according to claim 1, It is characterized in that The original quantum circuit is generated in the following way: Determine the action sequence of the quantum logic gate and the action relationship between the quantum bit and the quantum logic gate according to the initial state data and the selected proposed method, wherein the initial state data is state data characterizing the initial quantum state corresponding to the target combinatorial optimization problem; According to the action sequence and the action relationship, an original quantum circuit is generated.

3. The method according to claim 2, It is characterized in that The error suppression of the measurement result of each segmented quantum circuit includes: A preset quantum error suppression algorithm is used to suppress the error of the measurement result of each segmented quantum circuit, wherein the quantum error suppression algorithm includes one or a combination of a readout error suppression algorithm, a zero noise extrapolation algorithm, a probabilistic error elimination algorithm and a dynamic decoupling algorithm.

4. The method according to claim 3, It is characterized in that The first measurement result is obtained by measuring an uncut quantum bit of a segmented quantum circuit; The reorganizing all the first measurement results to generate the second measurement result includes: All first measurement results are reorganized according to the order of the quantum bits corresponding to each segmented quantum circuit in the original quantum circuit to generate a second measurement result.

5. The method according to any one of claims 1 to 4, It is characterized in that The step of obtaining an average energy expectation for the original quantum circuit based on all second measurement results comprises: Calculating a first energy expectation corresponding to each second measurement result; Based on a preset confidence, determining a second energy expectation from the first energy expectations arranged in order of magnitude; The average value of all the second energy expectations is calculated to obtain the average energy expectation of the original quantum circuit.

6. The method according to claim 5, It is characterized in that The method further comprises: When the execution of the segmented quantum circuit does not meet the specified conditions, the conditional value at risk CVaR is used to calculate the gradient of the variational parameters in the original quantum circuit; Based on the gradient, a variational parameter of each segmented quantum circuit is correspondingly updated.

7. A processing device for combinatorial optimization problems, It is characterized in that The device comprises: A first obtaining module is used to run the segmented quantum circuits obtained by splitting the original quantum circuit, and perform error suppression on the measurement results of each segmented quantum circuit to obtain a first measurement result corresponding to each segmented quantum circuit after error suppression, wherein the original quantum circuit is generated for a target combinatorial optimization problem; A recombining module, used for recombining the obtained first measurement result to generate a second measurement result, wherein the second measurement result is a result obtained by measuring the original quantum circuit; A second obtaining module, configured to obtain an average energy expectation of the original quantum circuit based on the generated second measurement result; A generating module is used to generate a target combination corresponding to the target combination optimization problem based on the average energy expectation when the execution of the segmented quantum circuit meets the specified conditions.

8. A quantitative super collaborative operating system, It is characterized in that The quantitative super-cooperative operating system implements the processing of combinatorial optimization problems according to the method described in any one of claims 1 to 6.

9. A storage medium, It is characterized in that The storage medium stores a computer program, wherein the computer program is configured to implement the method according to any one of claims 1 to 6 when executed.

10. An electronic device comprising a memory and a processor, It is characterized in that A computer program is stored in the memory, and the processor is configured to run the computer program to implement the method according to any one of claims 1 to 6.

Citation Information

Patent Citations

  • Method and device for obtaining observable measurement of target system and medium

    CN114519429A

  • Method and device for measuring quantum state of sub-quantum circuit and quantum computer operating system

    CN115423109A

  • Quantum system controller configured for quantum error correction

    EP4138002A1

  • Optimization problem arithmetic method and optimization problem arithmetic device

    US20200089728A1

  • Quantum circuit system

    WO2021064932A1