Data processing method and related device

By using the matrix operation of probability storage matrix and recombinant data in quantum circuit splitting technology, the problem of inefficient data recombination is solved and efficient data recombination is achieved.

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

Patent Information

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

AI Technical Summary

Technical Problem

When existing quantum circuit splitting technology deals with large-scale quantum circuits, it leads to inefficient data reorganization. The reason is that the calculation operation of exponential complexity seriously increases the time for data reorganization.

Method used

By obtaining the probability storage matrix and recombinant data of the segmented circuit to be recombined, matrix calculation is performed according to the recombination rules, efficiently utilize computing power, and improve data recombination efficiency.

Benefits of technology

The overall operation of recombinant segmented circuit data is realized, which reduces the computational complexity and significantly improves the efficiency of data recombination.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119026698A_ABST
    Figure CN119026698A_ABST
Patent Text Reader

Abstract

The invention discloses a data processing method and a related device. The method comprises the following steps: obtaining a probability storage matrix and recombination data corresponding to a to-be-recombined segmented circuit; the probability storage matrix and the recombination data are processed according to recombination rules corresponding to the to-be-recombined segmented circuits, the output result of the original quantum circuit is obtained, and the recombination rules are determined by the relation between the to-be-recombined segmented circuits in the original quantum circuit. By utilizing the embodiment of the invention, the data recombination efficiency is improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application belongs to the field of data processing technology, and in particular to a data processing method and related devices. Background Art

[0002] Quantum circuits (also called quantum logic circuits) are the most commonly used general quantum computing models, which represent circuits that operate on quantum bits in an abstract sense. They consist of quantum bits, circuits (timelines), and various logic gates, and the results are finally read out through quantum measurements.

[0003] The current quantum circuit splitting technology is used to split large-scale quantum circuits into small-scale circuits that can run on NISQ (Noisy Intermediate-Scale Quantum) computers, so as to achieve the purpose of using small-scale quantum hardware to simulate large-scale quantum circuits to solve large-scale problems, and obtain potential computing power between quantum computing and classical computing.

[0004] When a quantum circuit is cut, the completeness requirement of the quantum data flow needs to be met, that is, the output result of the cut quantum circuit is the same as the output result of the original quantum circuit. Each segmented circuit obtained by cutting (corresponding to a module of the unsplit quantum circuit) needs to be represented by multiple subcircuits under different measurement bases or different input quantum states. The probability distribution obtained by state tomography of these subcircuits needs to be stored for subsequent recovery or solution of the total probability distribution of the complete circuit or the objective function. In order to meet the completeness requirement, the existing processing method is to multiply the probabilities of the output points of multiple subcircuits representing each segmented circuit one by one in a serial manner and then add them up. Since the number of multiplication items increases exponentially with the number of cutting points, this operation introduces exponential complexity, which seriously increases the time for data reorganization, thereby reducing the efficiency of data reorganization. Summary of the invention

[0005] The purpose of this application is to provide a data processing method and related devices to address the deficiencies in the prior art. It processes the probability storage matrix and the reorganized data according to the reorganization rules, based on matrix operations, and efficiently utilizes computing power, thereby improving the data reorganization efficiency.

[0006] An embodiment of the present application provides a data processing method, the method comprising:

[0007] Obtaining a probability storage matrix and reorganization data corresponding to a segmented circuit to be reorganized, wherein the segmented circuit to be reorganized is obtained by cutting the original quantum circuit according to a preset cutting point, the probability storage matrix is ​​composed of measurement probabilities corresponding to the output quantum state of the segmented circuit to be reorganized, the output quantum state is the quantum state after different input quantum states are evolved through the corresponding segmented circuit to be reorganized, the measurement probability is the probability obtained by measuring the evolved cut quantum bits on different measurement bases, and the cut quantum bits are quantum bits with cutting points on the corresponding timeline;

[0008] The probability storage matrix and the reorganization data are processed according to a reorganization rule corresponding to the segmented circuits to be reorganized to obtain an output result of the original quantum circuit, wherein the reorganization rule is determined by the relationship between the segmented circuits to be reorganized in the original quantum circuit.

[0009] Optionally, the reorganized data includes:

[0010] A first matrix composed of first coefficients, wherein the first coefficients are coefficients of decomposition of an output quantum state of a cut quantum bit on each measurement basis;

[0011] A second matrix composed of second coefficients, wherein the second coefficients are coefficients of an output quantum state corresponding to different input quantum states of a cut quantum bit.

[0012] Optionally, the reorganized data further includes:

[0013] A third matrix is ​​used to implement the correspondence between the first element and the second element, wherein the first element is an element in a probability storage matrix corresponding to a segmented circuit to be reorganized, and the second element is an element in the first matrix.

[0014] Optionally, the third matrix includes:

[0015]

[0016] Among them, C t is the third matrix, I is the unit matrix, and t is the number of cutting points on the time line corresponding to two adjacent segmented circuits to be reorganized.

[0017] Optionally, the processing of the probability storage matrix and the reorganized data according to the reorganization rule corresponding to the segmented circuit to be reorganized to obtain the output result of the original quantum circuit includes:

[0018] Determine the relationship between the segmented circuits to be reassembled in each group of segmented circuits to be reassembled, which is the reassembly type of each group of segmented circuits to be reassembled;

[0019] According to the corresponding relationship between the reorganization type and the reorganization rule, the reorganization rule corresponding to each group of segmented circuits to be reorganized is determined;

[0020] According to the determined recombination rules, the corresponding probability storage matrix and the reorganized data are processed to obtain the output result of the original quantum circuit.

[0021] Optionally, determining the reorganization rule corresponding to each group of segmented circuits to be reorganized according to the correspondence between the reorganization type and the reorganization rule includes:

[0022] When the reorganization type is sequential reorganization, the reorganization rules corresponding to the sequential reorganization include:

[0023]

[0024] in, are the probability storage matrices corresponding to the segmented circuit A and the segmented circuit B in a group of segmented circuits to be reorganized, U R is the first matrix, U L is the second matrix;

[0025] When the recombination type is embedded recombination, the recombination rules corresponding to the sequential recombination include:

[0026]

[0027] The segmented circuit A to be reassembled and the segmented circuit B to be reassembled are in an embedded relationship.

[0028] Optionally, the method further comprises:

[0029] When there is a segmented circuit to be reorganized in which the number of input points is not equal to the number of output points in a group of segmented circuits to be reorganized, in addition to the cut quantum bits, new cut quantum bits are determined in the segmented circuit to be reorganized, and new cut points are set on the new cut quantum bits.

[0030] Another embodiment of the present application provides a data processing device, the device comprising:

[0031] An acquisition module is used to obtain a probability storage matrix and reorganization data corresponding to a segmented circuit to be reorganized, wherein the segmented circuit to be reorganized is obtained by cutting the original quantum circuit according to a preset cutting point, and the probability storage matrix is ​​composed of measurement probabilities corresponding to the output quantum state of the segmented circuit to be reorganized, wherein the output quantum state is a quantum state after different input quantum states are evolved through the corresponding segmented circuit to be reorganized, and the measurement probability is a probability obtained by measuring the evolved cut quantum bits on different measurement bases, and the cut quantum bits are quantum bits with cutting points on the corresponding timeline;

[0032] A processing module is used to process the probability storage matrix and the reorganization data according to a reorganization rule corresponding to the segmented circuits to be reorganized, so as to obtain an output result of the original quantum circuit, wherein the reorganization rule is determined by the relationship between the segmented circuits to be reorganized in the original quantum circuit.

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

[0034] 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.

[0035] 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.

[0036] Compared with the prior art, the present application first obtains the probability storage matrix and reorganization data corresponding to the segmented circuit to be reorganized, and then processes the probability storage matrix and the reorganization data according to the reorganization rules corresponding to the segmented circuit to be reorganized to obtain the output result of the original quantum circuit. The probability storage matrix can contain all the probabilities corresponding to the cut quantum bits. Based on the operation of the probability storage matrix and the reorganization data, the reorganization result can be obtained. Compared with the calculation one by one, the present application uses matrix operations to realize the overall operation of the data corresponding to the segmented circuit to be reorganized, which efficiently utilizes the computing power and thus improves the efficiency of data reorganization. BRIEF DESCRIPTION OF THE DRAWINGS

[0037] Figure 1 is a network block diagram of a data processing system provided by an embodiment of the present application;

[0038] Figure 2 A flowchart of a data processing method provided in an embodiment of the present application;

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

[0040] Figure 4 A schematic diagram of a segmented circuit to be reassembled composed of multiple sub-circuits provided in an embodiment of the present application;

[0041] Figure 5 A schematic diagram of a segmented circuit to be reassembled with an embedded relationship provided in an embodiment of the present application;

[0042] Figure 6A schematic diagram of a segmented circuit to be reassembled with a new cutting point added provided in an embodiment of the present application;

[0043] Figure 7 A schematic diagram of the structure of a data processing device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0044] 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.

[0045] Figure 1 1 is a network block diagram of a data processing system provided by an embodiment of the present application. The data processing system 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.

[0046] The network 110 is a medium for providing communication links between various devices and computers connected together in a data processing system, 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.

[0047] 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.

[0048] 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 data processing method provided in an embodiment of the present application.

[0049] 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.

[0050] 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.

[0051] 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.

[0052] 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.

[0053] 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 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. When performing quantum computing, it is necessary to use limited quantum bits combined with a variety of logical functions to achieve the computing effect.

[0054] 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 achieve efficient data processing, this application proposes a data processing method and related devices to improve the efficiency of data reorganization.

[0055] See also Figure 2 , Figure 2 A flowchart of a data processing method provided in an embodiment of the present application may include the following steps:

[0056] S201: Obtain a probability storage matrix and reorganization data corresponding to a segmented circuit to be reorganized, wherein the segmented circuit to be reorganized is obtained based on cutting the original quantum circuit according to a preset cutting point, and the probability storage matrix is ​​composed of measurement probabilities corresponding to the output quantum state of the segmented circuit to be reorganized, the output quantum state is the quantum state after different input quantum states evolve through the corresponding segmented circuit to be reorganized, the measurement probability is the probability obtained by measuring the evolved cut quantum bits on different measurement bases, and the cut quantum bits are quantum bits with cutting points on the corresponding timeline.

[0057] The preset cutting point can be selected according to the actual situation or according to the preset cutting rule, so as to determine the cutting position in the original quantum circuit. The segmented circuit to be reorganized can be obtained by directly cutting the cutting point, or by reorganizing the segmented circuit to be reorganized obtained by cutting. The segmented circuit to be reorganized contains at least one multi-bit quantum logic gate, and the segmented circuit to be reorganized is distinguished by the corresponding quantum logic gate in the circuit. Figure 3 As shown, a quantum logic gate A corresponding to a segmented circuit to be reorganized, the segmented circuit to be reorganized can be called a reorganized segmented circuit A. Quantum logic gate A and quantum logic gate B represent an operator block (or unitary matrix) respectively. The operator block and the quantum bits acted on by the operator block constitute the segmented circuit to be reorganized. The operator block can be a basic module constituting the original quantum circuit. The operator block includes a multi-bit quantum logic gate. The multi-bit quantum logic gate can be obtained by merging multiple single-bit quantum logic gates and / or multi-bit quantum logic gates. Figure 3 In the figure, the position marked by the paired triangles is the cutting point, the quantum bit at the cutting point is the cutting quantum bit, the triangle on the left represents the output point (also called the measurement point), and the triangle on the right represents the input point. That is, after the original quantum circuit is cut at this position, the eigenvalue measured on the left side under the measurement basis needs to be input to the right side, which corresponds to the operation status of the original quantum circuit.

[0058] 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.

[0059] The probability distribution of the uncut quantum bits in the segmented circuit to be reorganized is omitted, and the probability storage matrix U p This can be represented by the following matrix:

[0060]

[0061] Each row corresponds to the probability statistics of the output of the |0> and |1> states obtained by measuring the cut quantum bits when the input quantum states are |0>, |1>, |+>, and |i>, respectively; each column corresponds to the probability of obtaining the |0> and |1> states under different I, X, and Y measurement bases. Because the eigenvectors of the measurement base I and the measurement base Z are the same, the corresponding probabilities are the same, so the measurement base I is used as the representative in the probability storage matrix. The probability storage matrix can be a 4×6 matrix form, which can be converted into a high-order tensor form, where 4 represents the 4 input quantum states. Because the probability of measuring the |0> and |1> states under the measurement basis is 2×3=6. A probability storage matrix can store one of the probability distributions of all actual output cut quantum bits. For multiple actual outputs, the same number of storage matrices are required for storage, that is, a third-order tensor, that is, the number of eigenstates output by a segmented circuit to be reorganized is m*n*a, where m is the number of input quantum states, n is twice the number of measurement bases, and a is the number of output quantum states of uncut quantum bits in the segmented circuit to be reorganized.

[0062] A segmented circuit to be reassembled may be composed of multiple sub-circuits. For example, Figure 4 As shown, the entangled quantum information flow is split into a linear combination of unentangled information flows through subcircuits. The quantum processing system 170 runs each subcircuit, obtains the measurement result of each subcircuit, and sends the measurement result to the classical processing system 160, which generates a probability storage matrix using the measurement result.

[0063] The reorganized data is the data required for data reorganization except the probability storage matrix. The reorganized data corresponding to different segmented circuits to be reorganized are the same, that is, the reorganized data does not change with the change of the segmented circuit to be reorganized, but is determined by the unique properties of quantum computing.

[0064] S202: Processing the probability storage matrix and the reorganization data according to a reorganization rule corresponding to the segmented circuits to be reorganized to obtain an output result of the original quantum circuit, wherein the reorganization rule is determined by the relationship between the segmented circuits to be reorganized in the original quantum circuit.

[0065] In order to obtain the output result of the original quantum circuit, the data corresponding to the segmented circuits to be reorganized are reorganized. Therefore, the reorganization cannot be performed arbitrarily. In order to obtain the correct output result, the reorganization rules need to be determined by the relationship between the circuits to be reorganized. The relationship between the circuits to be reorganized is different, and the processing methods of the probability storage matrix and the reorganized data may also be different. The reorganization rules determine the processing method of the data. The relationship between the segmented circuits to be reorganized determines how to evolve the quantum state. According to the evolution rules that conform to the law, the reorganization rules are set to meet the completeness requirements of the quantum data flow.

[0066] It can be seen that the embodiment of the present application first obtains the probability storage matrix and reorganization data corresponding to the segmented circuit to be reorganized, and then processes the probability storage matrix and the reorganization data according to the reorganization rules corresponding to the segmented circuit to be reorganized to obtain the output result of the original quantum circuit. The probability storage matrix can contain all the probabilities corresponding to the cut quantum bits. Based on the operation of the probability storage matrix and the reorganization data, the reorganization result can be obtained. Compared with the calculation one by one, the present application uses matrix operations to realize the overall operation of the data corresponding to the segmented circuit to be reorganized, which efficiently utilizes the computing power and thus improves the efficiency of data reorganization.

[0067] In some possible implementations of the present application, the reorganized data may include:

[0068] A first matrix composed of first coefficients, wherein the first coefficients are coefficients of decomposition of an output quantum state of a cut quantum bit on each measurement basis;

[0069] A second matrix composed of second coefficients, wherein the second coefficients are coefficients of an output quantum state corresponding to different input quantum states of a cut quantum bit.

[0070] The output quantum state of the cut quantum bit is the quantum state measured at the measurement point in the cut quantum bit on different measurement bases. For example, taking a segmented circuit to be reorganized with 1 cut quantum bit and 2 uncut quantum bits as an example, one output quantum state of the 2 uncut quantum bits is a |01> state, then the decomposition of the segmented circuit to be reorganized on different measurement bases can be shown as follows:

[0071] p 1,1 =p(|010>|I)+p(|011>|I)+p(|010>|Z)-p(|011>|Z)

[0072] p 1,2 =p(|010>|I)+p(|011>|I)-p(|010>|Z)+p(|011)|Z)

[0073] p 1,3 =p(|010>|X)-p(|011>|X)

[0074] p 1,4 =p(|010>|Y)-p(|011>|Y)

[0075] The eigenvectors of the measurement basis I and the measurement basis Z are the same. The coefficients of the decomposition quantities corresponding to the two measurement bases can be merged to obtain the first matrix U with a dimension of 6×4 R It can be as follows:

[0076]

[0077] The second matrix is ​​composed of coefficients of output quantum states obtained by evolving the corresponding segmented circuits to be reorganized from different input quantum states (|0> state, |1> state, |+> state, |i> state). Exemplarily, an output quantum state of the segmented circuit to be reorganized is |010>, and the coefficients of the output quantum state can be:

[0078] p 2,1 =p(|010>||0>)

[0079] p 2,2 =p(|010>||1>)

[0080] p 2,3 =2p(|010>||+>)-p(|010>||0>)-p(|010>||1>)

[0081] p 2,4 =2p(|010>||i>)-p(|010>||0>)-p(|010>||1>)

[0082] Based on the above coefficients, we can get the second matrix U with a dimension of 4×4 L As shown below:

[0083]

[0084] It should be noted that the coefficients of the decomposition of the output quantum state on the measurement basis are constant. For different input quantum states, the coefficients of the output quantum state are also constant. The corresponding probability will change with different input quantum states and different measurement bases. Therefore, the first matrix and the second matrix corresponding to different output quantum states are the same.

[0085] In the embodiment of the present application, the reorganized data may further include:

[0086] A third matrix is ​​used to implement the correspondence between the first element and the second element, wherein the first element is an element in a probability storage matrix corresponding to a segmented circuit to be reorganized, and the second element is an element in the first matrix.

[0087] From the form of the probability storage matrix, we can know that its rows and columns correspond to input and measurement respectively, and its storage form cannot be completed by direct direct product (Kronecker) when expanding to multi-cut quantum bits. This is because the calculation order of the probability storage matrix and the first matrix cannot be matched by simple direct product, but the correspondence with the second matrix can be expanded by direct product. Therefore, before multiplying the probability storage matrix with the first matrix, it is necessary to match the elements of the two. Specifically, the columns of the probability storage matrix can be first translated by the third matrix, and then multiplied with the first matrix, so as to achieve the expansion to multi-cut quantum bits.

[0088] In some possible implementations of the present application, the third matrix may include:

[0089]

[0090] Among them, C t is the third matrix, I is the unit matrix, and t is the number of cutting points on the time line corresponding to two adjacent segmented circuits to be reorganized.

[0091] In a quantum circuit, a timeline corresponds to a quantum bit, and t represents the quantum bit that is jointly acted upon by two adjacent segmented circuits to be reorganized, and the number of cut points on the timeline between the two segmented circuits to be reorganized. Figure 3 For example, the number of cutting points is 1, and the cutting points are the cutting points corresponding to the paired triangles between the segmented circuit A to be reorganized and the segmented circuit B to be reorganized. The cutting points corresponding to the triangles on the left side of the segmented circuit A to be reorganized and the cutting points corresponding to the triangles on the right side of the segmented circuit B to be reorganized cannot be calculated into t because they are not the cutting points between the segmented circuit A to be reorganized and the segmented circuit B to be reorganized.

[0092] The third matrix C t With recursive properties, as follows:

[0093] C1=I6

[0094]

[0095]

[0096]

[0097]

[0098]

[0099] The following uses the matrix form corresponding to Swap6 as an example to illustrate. Swap means that the odd columns of the square matrix of the corresponding dimension are moved forward and the even columns are moved backward:

[0100]

[0101] In some possible implementations of the present application, the processing of the probability storage matrix and the reorganized data according to the reorganization rule corresponding to the segmented circuit to be reorganized to obtain the output result of the original quantum circuit may include:

[0102] Determine the relationship between the segmented circuits to be reassembled in each group of segmented circuits to be reassembled, which is the reassembly type of each group of segmented circuits to be reassembled;

[0103] According to the corresponding relationship between the reorganization type and the reorganization rule, the reorganization rule corresponding to each group of segmented circuits to be reorganized is determined;

[0104] According to the determined recombination rules, the corresponding probability storage matrix and the reorganized data are processed to obtain the output result of the original quantum circuit.

[0105] The number of segmented circuits to be reorganized in each group of segmented circuits to be reorganized can be the same or different. Generally, a group of segmented circuits to be reorganized contains at least two adjacent segmented circuits to be reorganized. The output result of the quantum circuit is related to the evolution sequence of the quantum state in the quantum circuit. The adjacent segmented circuits to be reorganized are reorganized to ensure the correct output result. The grouping method can be preset or generated according to the number of segmented circuits to be reorganized. Exemplarily, the original quantum circuit is cut to obtain A, B, C, D, E, and F. One grouping method can be (A, B), (C, D), (E, F). When A and B are reorganized to obtain G, C and D are reorganized to obtain H, and E and F are reorganized to obtain J, G, H and J can be used as a group of segmented circuits to be reorganized, and G, H and J are reorganized to obtain the output result corresponding to the original quantum circuit; another grouping method can be to group A and B into one group, reorganize to obtain G, and group G and C into one group, reorganize to obtain L. According to this method, the output result corresponding to the original quantum circuit is obtained.

[0106] The relationship between the to-be-reorganized segmented circuits may be obtained by traversing the original quantum circuit marked with the cutting point information, or may be determined by identification information generated by cutting the original quantum circuit according to the cutting point. The identification information may be identification information for a to-be-reorganized segmented circuit, and the identification information identifies the relationship between the to-be-reorganized segmented circuit and other to-be-reorganized segmented circuits; the identification information may also be identification information for a cutting point, and the identification information identifies the relationship between two to-be-reorganized segments corresponding to the cutting point.

[0107] In some possible implementations of the present application, determining the reorganization rule corresponding to each group of segmented circuits to be reorganized according to the correspondence between the reorganization type and the reorganization rule includes:

[0108] When the reorganization type is sequential reorganization, the reorganization rules corresponding to the sequential reorganization include:

[0109]

[0110] in, are the probability storage matrices corresponding to the segmented circuit A and the segmented circuit B in a group of segmented circuits to be reorganized, U R is the first matrix, U L is the second matrix;

[0111] When the recombination type is embedded recombination, the recombination rules corresponding to the sequential recombination include:

[0112]

[0113] The segmented circuit A to be reassembled and the segmented circuit B to be reassembled are in an embedded relationship.

[0114] In the embodiment of the present application, the reorganization operation is matrixed, which can reduce a large number of multiplication / addition operations between data corresponding to the segmented circuits to be reorganized, thereby reducing a large amount of data processing complexity and greatly improving the efficiency of data reorganization.

[0115] Take a group of segmented circuits to be reassembled and two segmented circuits to be reassembled as an example. Figure 3 As shown, the segmented circuits to be reassembled are in a sequential relationship, so the reassembly type is sequential reassembly. t It is used for normalization in sequential reorganization. The probability storage matrix, the first matrix, the second matrix and the third matrix are reorganized using the sequential reorganization rule to obtain a matrix that conforms to the structure of the probability storage matrix, that is, the probability storage matrix of the new segmented circuit is obtained.

[0116] Figure 5 The schematic diagram of the segmented circuit to be reorganized in an embedded relationship is shown in FIG. 1 . Because the segmented circuit A to be reorganized (divided into A1 and A2) and the segmented circuit B to be reorganized are in an embedded relationship, a trace operation is required. The first cutting point can be reorganized according to the rule of sequential reorganization, or the second cutting point can be reorganized in sequence first, and then a new matrix is ​​obtained through the first matrix, the second matrix and the third matrix. For the two reorganization methods, the order of the segmented circuit A to be reorganized and the segmented circuit B to be reorganized in the reorganization rule changes.

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

[0118] When there is a segmented circuit to be reorganized in which the number of input points is not equal to the number of output points in a group of segmented circuits to be reorganized, in addition to the cut quantum bits, new cut quantum bits are determined in the segmented circuit to be reorganized, and new cut points are set on the new cut quantum bits.

[0119] For the case where the number of output points and input points of a segmented circuit to be reorganized is different, in order to adapt the form of the probability storage matrix, it is necessary to add new cutting points in the segmented circuit to be reorganized where the number of input points is not equal to the number of output points. The new cutting quantum bit is a quantum bit that has no effect on quantum logic gates or acts on unit operators in the subsequent execution sequence, that is, in the subsequent execution sequence, the timeline corresponding to the quantum bit corresponds to the I channel. Figure 6 As shown, before adding new cutting points, the number of input points of the segmented circuit A to be reorganized is 2, which are 2 triangles with the left vertex to the left, and the number of output points is 1, which is the triangle with the right vertex to the right located between the segmented circuit A to be reorganized and the segmented circuit B to be reorganized. The dashed box shows the newly added cutting points of the segmented circuit A to be reorganized, and the subsequent extra cutting points and the segmented circuit B to be reorganized are realized to correspond to the above sequential reorganization rules. The timeline obtained by cutting corresponds to an I channel, and its probability matrix is ​​very simple. By performing a direct product with the probability matrix of the segmented circuit B to be reorganized, the decomposition of the segmented circuit B to be reorganized into a high dimension can be obtained.

[0120] See also Figure 7 , Figure 7 A schematic diagram of a data processing device provided in an embodiment of the present application, and Figure 2 Corresponding to the process shown, the device includes:

[0121] An acquisition module 701 is used to obtain a probability storage matrix and reorganization data corresponding to a segmented circuit to be reorganized, wherein the segmented circuit to be reorganized is obtained by cutting the original quantum circuit according to a preset cutting point, and the probability storage matrix is ​​composed of measurement probabilities corresponding to the output quantum state of the segmented circuit to be reorganized, wherein the output quantum state is a quantum state after different input quantum states are evolved through the corresponding segmented circuit to be reorganized, and the measurement probability is a probability obtained by measuring the evolved cut quantum bits on different measurement bases, and the cut quantum bits are quantum bits with a cutting point on the corresponding timeline;

[0122] The processing module 702 is used to process the probability storage matrix and the reorganization data according to the reorganization rule corresponding to the segmented circuit to be reorganized, so as to obtain the output result of the original quantum circuit, wherein the reorganization rule is determined by the relationship between the segmented circuits to be reorganized in the original quantum circuit.

[0123] In some possible implementations of the present application, the reorganized data may include:

[0124] A first matrix composed of first coefficients, wherein the first coefficients are coefficients of decomposition of an output quantum state of a cut quantum bit on each measurement basis;

[0125] A second matrix composed of second coefficients, wherein the second coefficients are coefficients of an output quantum state corresponding to different input quantum states of a cut quantum bit.

[0126] In some possible implementations of the present application, the reorganized data may further include:

[0127] A third matrix is ​​used to implement the correspondence between the first element and the second element, wherein the first element is an element in a probability storage matrix corresponding to a segmented circuit to be reorganized, and the second element is an element in the first matrix.

[0128] In some possible implementations of the present application, the third matrix may include:

[0129]

[0130] Among them, C t is the third matrix, I is the unit matrix, and t is the number of cutting points on the time line corresponding to two adjacent segmented circuits to be reorganized.

[0131] In some possible implementations of the present application, the processing module 702 may include:

[0132] A first determining unit is used to determine the relationship between the segmented circuits to be reorganized in each group of segmented circuits to be reorganized, which is the reorganization type of each group of segmented circuits to be reorganized;

[0133] A second determining unit, configured to determine a reorganization rule corresponding to each group of segmented circuits to be reorganized according to a correspondence between the reorganization type and the reorganization rule;

[0134] The processing unit is used to process the corresponding probability storage matrix and the reorganization data according to the determined reorganization rule to obtain the output result of the original quantum circuit.

[0135] In some possible implementations of the present application, the processing unit may be specifically used for:

[0136] When the reorganization type is sequential reorganization, the reorganization rules corresponding to the sequential reorganization include:

[0137]

[0138] in, are the probability storage matrices corresponding to the segmented circuit A and the segmented circuit B in a group of segmented circuits to be reorganized, UR is the first matrix, U L is the second matrix;

[0139] When the recombination type is embedded recombination, the recombination rules corresponding to the sequential recombination include:

[0140]

[0141] The segmented circuit A to be reassembled and the segmented circuit B to be reassembled are in an embedded relationship.

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

[0143] A determination module is used to determine new cut quantum bits in addition to the cut quantum bits in a group of segmented circuits to be reorganized, and to set new cutting points on the new cut quantum bits when there is a segmented circuit to be reorganized whose number of input points is not equal to the number of output points in the segmented circuit to be reorganized.

[0144] It can be seen that the embodiment of the present application first obtains the probability storage matrix and reorganization data corresponding to the segmented circuit to be reorganized, and then processes the probability storage matrix and the reorganization data according to the reorganization rules corresponding to the segmented circuit to be reorganized to obtain the output result of the original quantum circuit. The probability storage matrix can contain all the probabilities corresponding to the cut quantum bits. Based on the operation of the probability storage matrix and the reorganization data, the reorganization result can be obtained. Compared with the calculation one by one, the present application uses matrix operations to realize the overall operation of the data corresponding to the segmented circuit to be reorganized, which efficiently utilizes the computing power and thus improves the efficiency of data reorganization.

[0145] 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 data processing according to the method described in the embodiment of the method side of the present application.

[0146] 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.

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

[0148] S201: Obtain a probability storage matrix and reorganization data corresponding to a segmented circuit to be reorganized, wherein the segmented circuit to be reorganized is obtained by cutting the original quantum circuit according to a preset cutting point, and the probability storage matrix is ​​composed of measurement probabilities corresponding to the output quantum state of the segmented circuit to be reorganized, the output quantum state is the quantum state after different input quantum states are evolved through the corresponding segmented circuit to be reorganized, the measurement probability is the probability obtained by measuring the evolved cut quantum bits on different measurement bases, and the cut quantum bits are quantum bits with cutting points on the corresponding timeline;

[0149] S202: Processing the probability storage matrix and the reorganization data according to a reorganization rule corresponding to the segmented circuits to be reorganized to obtain an output result of the original quantum circuit, wherein the reorganization rule is determined by the relationship between the segmented circuits to be reorganized in the original quantum circuit.

[0150] 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.

[0151] 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.

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

[0153] S201: Obtain a probability storage matrix and reorganization data corresponding to a segmented circuit to be reorganized, wherein the segmented circuit to be reorganized is obtained by cutting the original quantum circuit according to a preset cutting point, and the probability storage matrix is ​​composed of measurement probabilities corresponding to the output quantum state of the segmented circuit to be reorganized, the output quantum state is the quantum state after different input quantum states are evolved through the corresponding segmented circuit to be reorganized, the measurement probability is the probability obtained by measuring the evolved cut quantum bits on different measurement bases, and the cut quantum bits are quantum bits with cutting points on the corresponding timeline;

[0154] S202: Processing the probability storage matrix and the reorganization data according to a reorganization rule corresponding to the segmented circuits to be reorganized to obtain an output result of the original quantum circuit, wherein the reorganization rule is determined by the relationship between the segmented circuits to be reorganized in the original quantum circuit.

[0155] The embodiments of this specification also provide a computer program product including instructions, which, when executed by a computer, enables the computer to execute the data processing method in any of the above embodiments.

[0156] 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 the present invention.

[0157] 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.

[0158] 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.

[0159] 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.

[0160] 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 executed. The software module can be located in a mature storage medium in the field such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory or an electrically erasable programmable memory, a register, etc. 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.

[0161] 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.

[0162] 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.

[0163] 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.

[0164] 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.

[0165] 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.

[0166] 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.

[0167] 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.

[0168] The above is only a specific implementation of this specification, but the protection scope of the present invention is not limited thereto. Any person skilled in the art who is 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 the present invention should be based on the protection scope of the claims.

Claims

1. A data processing method, characterized in that: The method comprises: Obtaining a probability storage matrix and reorganization data corresponding to a segmented circuit to be reorganized, wherein the segmented circuit to be reorganized is obtained by cutting the original quantum circuit according to a preset cutting point, the probability storage matrix is ​​composed of measurement probabilities corresponding to the output quantum state of the segmented circuit to be reorganized, the output quantum state is the quantum state after different input quantum states are evolved through the corresponding segmented circuit to be reorganized, the measurement probability is the probability obtained by measuring the evolved cut quantum bits on different measurement bases, and the cut quantum bits are quantum bits with cutting points on the corresponding timeline; The probability storage matrix and the reorganization data are processed according to a reorganization rule corresponding to the segmented circuits to be reorganized to obtain an output result of the original quantum circuit, wherein the reorganization rule is determined by the relationship between the segmented circuits to be reorganized in the original quantum circuit.

2. The method according to claim 1, characterized in that The reorganized data includes: A first matrix composed of first coefficients, wherein the first coefficients are coefficients of decomposition of an output quantum state of a cut quantum bit on each measurement basis; A second matrix composed of second coefficients, wherein the second coefficients are coefficients of an output quantum state corresponding to different input quantum states of a cut quantum bit.

3. The method according to claim 2, characterized in that The reorganized data also includes: A third matrix is ​​used to implement the correspondence between the first element and the second element, wherein the first element is an element in a probability storage matrix corresponding to a segmented circuit to be reorganized, and the second element is an element in the first matrix.

4. The method according to claim 3, characterized in that The third matrix includes: Among them, C t is the third matrix, I is the unit matrix, and t is the number of cutting points on the time line corresponding to two adjacent segmented circuits to be reorganized.

5. The method according to claim 4, characterized in that The step of processing the probability storage matrix and the reorganized data according to the reorganization rule corresponding to the segmented circuit to be reorganized to obtain the output result of the original quantum circuit includes: Determine the relationship between the segmented circuits to be reassembled in each group of segmented circuits to be reassembled, which is the reassembly type of each group of segmented circuits to be reassembled; According to the corresponding relationship between the reorganization type and the reorganization rule, the reorganization rule corresponding to each group of segmented circuits to be reorganized is determined; According to the determined recombination rules, the corresponding probability storage matrix and the reorganized data are processed to obtain the output result of the original quantum circuit.

6. The method according to claim 5, characterized in that Determining the reorganization rule corresponding to each group of segmented circuits to be reorganized according to the correspondence between the reorganization type and the reorganization rule includes: When the reorganization type is sequential reorganization, the reorganization rules corresponding to the sequential reorganization include: in, are the probability storage matrices corresponding to the segmented circuit A and the segmented circuit B in a group of segmented circuits to be reorganized, U R is the first matrix, U L is the second matrix; When the recombination type is embedded recombination, the recombination rules corresponding to the sequential recombination include: The segmented circuit A to be reassembled and the segmented circuit B to be reassembled are in an embedded relationship.

7. The method according to claim 6, characterized in that The method further comprises: When there is a segmented circuit to be reorganized in which the number of input points is not equal to the number of output points in a group of segmented circuits to be reorganized, in addition to the cut quantum bits, new cut quantum bits are determined in the segmented circuit to be reorganized, and new cut points are set on the new cut quantum bits.

8. A data processing device, characterized in that: The device comprises: An acquisition module is used to obtain a probability storage matrix and reorganization data corresponding to a segmented circuit to be reorganized, wherein the segmented circuit to be reorganized is obtained by cutting the original quantum circuit according to a preset cutting point, and the probability storage matrix is ​​composed of measurement probabilities corresponding to the output quantum state of the segmented circuit to be reorganized, wherein the output quantum state is a quantum state after different input quantum states are evolved through the corresponding segmented circuit to be reorganized, and the measurement probability is a probability obtained by measuring the evolved cut quantum bits on different measurement bases, and the cut quantum bits are quantum bits with cutting points on the corresponding timeline; A processing module is used to process the probability storage matrix and the reorganization data according to a reorganization rule corresponding to the segmented circuits to be reorganized, so as to obtain an output result of the original quantum circuit, wherein the reorganization rule is determined by the relationship between the segmented circuits to be reorganized in the original quantum circuit.

9. A quantitative super-cooperative operating system, characterized in that: The quantum hyper-cooperative operating system implements data processing according to the method described in any one of claims 1 to 7.

10. A storage medium, 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 7 when executed.

11. An electronic device comprising a memory and a processor, 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 7.

Citation Information

Patent Citations

  • Multi-quantum-bit quantum Fourier transform line-oriented segmentation method

    CN114529003A

  • Quantum computing processing method and device and electronic equipment

    CN115169568A

  • Quantum circuit execution result determination method and device and quantum computer operating system

    CN115511094A

  • Methods and systems of fully-randomized benchmarking for quantum circuits

    US11348027B1

  • Quantum communications system having at least one waveplate to alter pulse polarization and associated methods

    US20230141134A1