CN115511088A

CN115511088A - Quantum computing task processing method and device and quantum computer operating system

Info

Publication number: CN115511088A
Application number: CN202110699191.5A
Authority: CN
Inventors: 赵东一; 王晶; 方圆; 窦猛汉
Original assignee: Origin Quantum Computing Technology Co Ltd
Current assignee: Origin Quantum Computing Technology Co Ltd
Priority date: 2021-06-23
Filing date: 2021-06-23
Publication date: 2022-12-23

Abstract

The application discloses a quantum computing task processing method and device and a quantum computer operating system, which are applied to a distributed quantum computing system, wherein the distributed quantum computing system comprises a server and computing equipment, and the method comprises the following steps: the server receives a quantum computing task sent by user equipment; the server processes the quantum computing task based on the computing resources which are allowed to be used by the computing equipment at present to obtain a plurality of sub-computing tasks; and distributing the plurality of sub-computing tasks to the computing device; the server receives a plurality of sub-computing results returned by the computing device for the plurality of sub-computing tasks; synthesizing the plurality of sub-computation results into a computation result of the quantum computation task; and the server returns the calculation result to the user equipment. By adopting the embodiment of the application, the limit of the number of quantum bits can be broken through, and the processing of the calculation task which can not be processed by a single NISQ device can be realized.

Description

Quantum computing task processing method and device and quantum computer operating system

Technical Field

The present application relates to the field of quantum computing technologies, and in particular, to a quantum computing task processing method and apparatus, and a quantum computer operating system.

Background

Human beings are currently in the key age of Quantum technology development-medium Quantum (NISQ) devices containing noise. The limited coherence time, frequency selection of individual qubits, cross-talk between qubits and limited control bandwidth, etc. increase with the number of qubits, limiting the development of NISQ technology. It is increasingly difficult to build a reliable quantum computing device. How to break through the limit of the quantum bit number and realize the processing of the calculation task which can not be processed by a single NISQ device is a technical problem to be solved.

Disclosure of Invention

The embodiment of the application provides a quantum computing task processing method and device and a quantum computer operating system, which are used for breaking through the limit of quantum bit number and realizing the processing of a computing task which cannot be processed by a single NISQ device.

In a first aspect, an embodiment of the present application provides a quantum computing task processing method, which is applied to a distributed quantum computing system, where the distributed quantum computing system includes a server and a computing device, and the method includes:

the server receives a quantum computing task sent by user equipment;

the server processes the quantum computing task based on the computing resources which are allowed to be used by the computing equipment at present to obtain a plurality of sub-computing tasks; and distributing the plurality of sub-computing tasks to the computing device;

the server receives a plurality of sub-computing results returned by the computing device for the plurality of sub-computing tasks; synthesizing the plurality of sub-computation results into computation results of the quantum computation tasks;

and the server returns the calculation result to the user equipment.

Optionally, the number of the computing devices is multiple, the currently permitted computing resources include currently permitted qubits, and the server processes the quantum computing task based on the currently permitted computing resources of the computing devices to obtain multiple sub-computing tasks, including:

the server determining the quantum bits that each computing device is currently allowed to use;

the server determines target computing equipment based on the quantum bits currently allowed to be used by each computing equipment and the quantum bit number required by the quantum circuit corresponding to the quantum computing task;

the server determines a cutting position of a quantum wire corresponding to the quantum computing task based on the quantum bits currently allowed to be used by the target computing device;

the server cuts the quantum wire into a plurality of sub-quantum wires, each corresponding to a sub-computation task, based on the cutting position of the quantum wire.

Optionally, the server determines a target computing device based on the qubits currently allowed to be used by each computing device and the required number of qubits for the quantum wire corresponding to the quantum computing task, where the determining includes:

the server determines multiple device combination strategies based on the quantum bits currently allowed to be used by each computing device and the quantum bit number required by the quantum circuit corresponding to the quantum computing task, wherein each device combination strategy comprises multiple computing devices;

the server determines a target device combination strategy based on the number of computing devices in each device combination strategy and the total number of quantum bits allowed to be used currently;

the server determines a plurality of computing devices included in the target device combination policy as target computing devices.

Optionally, the server determines a target device combination policy based on the number of computing devices in each device combination policy and the total number of qubits currently allowed to be used, including:

the server determines a device combination policy with the minimum number of computing devices and/or the minimum total number of currently allowed qubits to be used as a target device combination policy.

Optionally, the method further comprises:

the server determines the number of quantum bits which are allowed to be used by each computing device in each device combination strategy;

the server determines the maximum number of the qubits currently allowed to be used by a single computing device in each device combination strategy based on the number of the qubits currently allowed to be used by each computing device in each device combination strategy;

the server determines a device combination strategy with the minimum maximum number of quantum bits currently allowed to be used by the single computing device as a target device combination strategy.

Optionally, the synthesizing, by the server, the multiple sub-computation results into the computation result of the quantum computation task includes:

the server determines a plurality of tensors corresponding to the plurality of sub-calculation results;

and the server determines the compressed tensors as the calculation result of the quantum calculation task.

In a second aspect, an embodiment of the present application provides a quantum computing task processing apparatus, which is applied to a distributed quantum computing system, where the distributed quantum computing system includes a server and a computing device, and the apparatus includes:

the task transceiving unit is used for receiving the quantum computing task sent by the user equipment;

the task processing unit is used for processing the quantum computing task based on the computing resources which are allowed to be used by the computing equipment at present to obtain a plurality of sub-computing tasks;

the task transceiving unit is further configured to distribute the plurality of sub-computing tasks to the computing device; receiving a plurality of sub-computation results returned by the computing device for the plurality of sub-computation tasks;

the task processing unit is further configured to synthesize the multiple sub-computation results into a computation result of the quantum computation task;

the task transceiving unit is further configured to return the calculation result to the user equipment.

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

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

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

In a sixth aspect, an embodiment of the present application provides a quantum computer operating system, where the quantum computer operating system implements distributed computation of a quantum computing task according to some or all of the steps described in the method according to the first aspect of the embodiment of the present application.

It can be seen that, in the embodiment of the present application, a server receives a quantum computing task sent by a user equipment; processing the quantum computing task based on the computing resources currently allowed to be used by the computing equipment to obtain a plurality of sub-computing tasks; and distributing the plurality of sub-computing tasks to the computing device; receiving a plurality of sub-computation results returned by the computing device for the plurality of sub-computation tasks; synthesizing the plurality of sub-computation results into a computation result of the quantum computation task; and returning the calculation result to the user equipment. The server and the computing equipment form a distributed quantum computing system, the quantum computing task is divided into a plurality of sub-computing tasks based on the computing resources which are allowed to be used by the computing equipment at present, the plurality of sub-computing tasks are processed through the computing equipment, the limit of the number of quantum bits is broken through by the distributed quantum computing task processing mode, the processing of the computing task which cannot be processed by a single NISQ equipment is realized, the computing time is saved, and the computing efficiency is improved.

These and other aspects of the present application will be more readily apparent from the following description of the embodiments.

Drawings

In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings used in the embodiments or the prior art descriptions will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present application, and other drawings can be obtained by those skilled in the art without creative efforts.

FIG. 1A is a schematic structural diagram of a quantum computing task processing system provided in the present application;

fig. 1B is a hardware structure block diagram of a computer terminal of a quantum computing task processing method according to an embodiment of the present application;

FIG. 1C is a schematic diagram illustrating a graphical display of quantum wires according to an embodiment of the present disclosure;

fig. 2 is a schematic flowchart of a quantum computing task processing method according to an embodiment of the present application;

fig. 3 is a schematic flowchart of another quantum computing task processing method according to an embodiment of the present application;

fig. 4 is a schematic flowchart of another quantum computing task processing method according to an embodiment of the present application;

fig. 5 is a schematic structural diagram of an electronic device according to an embodiment of the present application;

fig. 6 is a schematic structural diagram of a quantum computing task processing device according to an embodiment of the present application.

Detailed Description

In order to make the technical solutions better understood by those skilled in the art, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only partial embodiments of the present application, but not all embodiments. All other embodiments obtained by a person of ordinary skill in the art based on the embodiments in the present application without making any creative effort shall fall within the protection scope of the present application.

The following are detailed descriptions.

The terms "first," "second," "third," and "fourth," etc. in the description and claims of this application and in the accompanying drawings are used for distinguishing between different objects and not for describing a particular order. Furthermore, the terms "include" and "have," as well as any variations thereof, are intended to cover non-exclusive inclusions. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not limited to only those steps or elements but may alternatively include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.

Reference herein to "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment of the application. The appearances of the phrase in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. It is explicitly and implicitly understood by one skilled in the art that the embodiments described herein may be combined with other embodiments.

Hereinafter, some terms in the present application are explained to facilitate understanding by those skilled in the art.

Fig. 1A is a schematic structural diagram of a quantum computing task processing system provided in the present application. As shown in fig. 1A, a quantum computing task processing system includes a user device, a server, and a computing device. The computing device may be a quantum computer, a quantum virtual machine, a high-performance classical computing cluster. Fig. 1B is a hardware structure block diagram of a computer terminal of a quantum computing task processing method according to an embodiment of the present application. The computer terminal may be the user device, the server, or the computing device of fig. 1A.

Referring to fig. 1B, the computer terminal may include one or more processors 102 (only one is shown in fig. 1B) (the processor 102 may include, but is not limited to, a processing device such as a microprocessor MCU or a programmable logic device FPGA) and a memory 104 for storing data, and optionally, a transmission device 106 for communication functions and an input-output device 108. It will be understood by those skilled in the art that the structure shown in fig. 1B is only an illustration, and is not intended to limit the structure of the computer terminal. For example, the computer terminal may also include more or fewer components than shown in FIG. 1B, or have a different configuration than shown in FIG. 1B.

The memory 104 may be used to store software programs and modules of application software, such as program instructions/modules corresponding to the quantum computing task processing method in the embodiment of the present application, and the processor 102 executes various functional applications and data processing by running the software programs and modules stored in the memory 104, so as to implement the above-mentioned method. The memory 104 may include high speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some examples, the memory 104 may further include memory located remotely from the processor 102, which may be connected to a computer terminal over a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.

The transmission device 106 is used to receive or transmit data via a network. Specific examples of the network described above may include a wireless network provided by a communication provider of the computer terminal. In one example, the transmission device 106 includes a network adapter (NIC) that can be connected to other network devices through a base station to communicate with the internet. In one example, the transmitting device 106 may be a RadIo Frequency (RF) module, which is used to communicate with the internet in a wireless manner.

It should be noted that, the quantum program referred to in the embodiments of the present application is a program written in a classical language and used for characterizing qubits and their evolution, where qubits, quantum logic gates, and the like related to quantum computation are all represented by corresponding classical codes.

A quantum circuit, which is an embodiment of a quantum program and also a weighing sub-logic circuit, is the most common general quantum computation model, and represents a circuit that operates on a quantum bit under an abstract concept, and the circuit includes the quantum bit, a circuit (timeline), and various quantum logic gates, and finally, a result is often read through a quantum measurement operation. The quantum wires may be presented in a sequence of quantum logic gates arranged in a certain execution sequence.

Specifically, for example, a quantum program:

QCircuitcir；

cir<<H(q[0])<<H(q[1])<<H(q[2])<<H(q[3])<<RZ(q[0],PI/2)<<RY(q[1],PI/4)<<RZ(q[2],PI/4)<<CNOT(q[0],q[1])<<CR(q[1],q[2],PI/3)<<CNOT(q[2],q[3])<<CNOT(q[0],q[3]).

the corresponding quantum wire (denoted as 1# quantum wire) can be expressed as:

q[0]:H(q[0])、RZ(q[0],PI/2)

q[1]:H(q[1])、RY(q[1],PI/4)、CNOT(q[0],q[1])

q[2]:H(q[2])、RZ(q[2],-PI/4)、CR(q[1],q[2],PI/3)

q[3]:H(q[3])、CNOT(q[2]，q[3])、CNOT(q[0],q[3])

wherein q [0 ]]、q[1]、q[2]、q[3]Refers to a qubit having bits from 0 to 3, which can also be generally denoted as q ₀ 、q ₁ 、q ₂ 、q ₃ 。

In a more visual presentation, a quantum circuit diagram corresponding to the quantum logic gate sequence is shown with reference to fig. 1C.

Unlike conventional circuits that are connected by metal lines to pass either voltage or current signals, in quantum circuits, the lines can be viewed as being connected by time, i.e., the state of a qubit evolves naturally over time, in the process being operated on by the hamiltonian until encountering a quantum logic gate.

A quantum program corresponds to an overall quantum circuit as a whole, and the quantum program refers to the overall quantum circuit, wherein the total number of quantum bits in the overall quantum circuit is the same as the total number of quantum bits of the quantum program. It can be understood that: a quantum program may consist of quantum wires, measurement operations for quantum bits in the quantum wires, registers to hold measurement results, and control flow nodes (jump instructions), and a quantum wire may contain tens to hundreds or even thousands of quantum gate operations. The execution process of the quantum program is a process executed for all the quantum logic gates according to a certain time sequence. It should be noted that timing is the time sequence in which the single quantum logic gate is executed.

It should be noted that, in the classical calculation, the most basic unit is a bit, and the most basic control mode is a logic gate, and the purpose of controlling the circuit can be achieved through the combination of the logic gates. Similarly, the way qubits are handled is quantum logic gates. The quantum state can be evolved by using quantum logic gates, which are the basis for forming quantum circuits, including single-bit quantum logic gates (or single-quantum logic gates, abbreviated as "single gates"), such as Hadamard gates (H gates, hadamard gates), pauli-X gates (X gates), pauli-Y gates (Y gates), pauli-Z gates (Z gates), RX gates, RY gates, RZ gates, and the like; two-bit quantum logic gates (or double quantum logic gates, simply "double gates"), such as CNOT gates, CR gates, SWAP gates, ISWAP gates, and so on; a multi-bit quantum logic gate (or a multi-quantum logic gate, abbreviated as "multi-gate"), such as a toffloi gate, etc. Quantum logic gates are typically represented using unitary matrices, which are not only matrix-form but also an operation and transformation. The function of a general quantum logic gate on a quantum state is calculated by multiplying a unitary matrix by a matrix corresponding to a quantum state right vector.

For example, quantum state right vector |0>Corresponding vector is

Quantum state right vector |1>Corresponding vector is

A quantum state, i.e., the logical state of a qubit. In quantum algorithms (or quantum programs), a binary representation is used for the quantum states of a group of quantum bits contained in a quantum circuit, e.g. q for a group of quantum bits ₀ 、q ₁ 、q ₂ Representing the 0 th, 1 st, 2 nd quantum bit, and ordering from high to low in binary representation as q ₂ q ₁ q ₀ The quantum states corresponding to the set of qubits have a total quantum state of 2 to the power of the total number of qubits, i.e. 8 eigenstates (determined states): |000>、|001>、|010>、|011>、|100>、|101>、|110>、|111>The bits of each quantum state correspond to qubits, e.g. |001>State 001 from high to low corresponds to q ₂ q ₁ q ₀ ，|>Is a dirac symbol. For a bit containing N quanta q ₀ 、q ₁ 、…、q _n 、…、q _N-1 The order of the binary representation quantum state of the quantum line is q _N-1 q _N-2 …、q ₁ q ₀ 。

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

The quantum computing task processing method provided by the embodiment of the application is further described below with reference to the accompanying drawings.

Referring to fig. 2, fig. 2 is a schematic flowchart of a quantum computing task processing method provided in an embodiment of the present application, and the method is applied to a distributed quantum computing system, where the distributed quantum computing system includes a server and a computing device, and the method includes:

the server receives a quantum computing task sent by user equipment;

the server receives a plurality of sub-computing results returned by the computing device for the plurality of sub-computing tasks; synthesizing the plurality of sub-computation results into a computation result of the quantum computation task;

and the server returns the calculation result to the user equipment.

Specifically, the method comprises the following steps:

step 201: the user device sends the quantum computing task to the server.

Step 202: the server obtains computing resources that the computing device is currently allowed to use.

Step 203: and the server processes the quantum computing task based on the computing resources which are allowed to be used by the computing equipment at present to obtain a plurality of sub-computing tasks.

Step 204: the server distributes the plurality of sub-computing tasks to the computing device;

step 205: and the computing equipment executes the plurality of sub-computing tasks to obtain a plurality of sub-computing results.

Step 206: the computing device sends the plurality of sub-computation results to a server.

Step 207: and the server synthesizes the plurality of sub-computation results into the computation result of the quantum computation task.

Step 208: and the server sends the calculation result to the user equipment.

Quantum computing tasks are often represented in quantum wires.

The computing resources refer to a system which follows quantum mechanical rules and can be used for quantum information processing and storage, the basic unit of the system is a quantum bit, and the computing resources comprise a quantum processor, a quantum memory and the like.

Wherein the computing device comprises a quantum computer, a quantum virtual machine, and a high-performance classical computing cluster.

It can be seen that, in the embodiment of the present application, a server receives a quantum computing task sent by a user equipment; processing the quantum computing task based on the computing resources currently allowed to be used by the computing equipment to obtain a plurality of sub-computing tasks; and distributing the plurality of sub-computing tasks to the computing device; receiving a plurality of sub-computation results returned by the computing device for the plurality of sub-computation tasks; synthesizing the plurality of sub-computation results into computation results of the quantum computation tasks; and returning the calculation result to the user equipment. The server and the computing equipment form a distributed quantum computing system, the quantum computing task is divided into a plurality of sub-computing tasks based on the computing resources which are allowed to be used by the computing equipment at present, the plurality of sub-computing tasks are processed through the computing equipment, the limit of the number of quantum bits is broken through by the distributed quantum computing task processing mode, the processing of the computing task which cannot be processed by a single NISQ equipment is realized, the computing time is saved, and the computing efficiency is improved.

In an embodiment of the application, the number of the computing devices is multiple, the currently permitted computing resources include currently permitted qubits, and the server processes the quantum computing task based on the currently permitted computing resources of the computing devices to obtain multiple sub-computing tasks, including:

the server determines target computing equipment based on the quantum bits currently allowed to be used by each computing equipment and the quantum bit number required by the quantum line corresponding to the quantum computing task;

the server cuts the quantum wire into a plurality of sub-quantum wires, one for each sub-computation task, based on the cut position of the quantum wire.

Wherein the target computing device comprises at least one computing device that currently allows the number of qubits to be used to be greater than or equal to the number of qubits required by the quantum wire.

Wherein the server determines, based on the qubits currently allowed to be used by the target computing device, a cutting position of a quantum wire corresponding to the quantum computing task, including:

the server acquires a connected graph of a quantum circuit corresponding to the quantum computing task, wherein a vertex of the connected graph is used for representing a quantum logic gate in the quantum circuit, and a directed edge of the connected graph is used for representing the dependency relationship of the quantum logic gate according to the quantum state evolution time sequence of a quantum bit;

the server obtains q from the top point of the connected graph _i A continuous vertex, and dividing said q _i The continuous top points are used as the top points of the ith sub-connected graph, and the q is _i The number of quantum bits included by each continuous vertex is equal to the number of quantum bits currently allowed to be used by the ith computing device;

the server takes any point on a directed edge between a vertex included by the ith sub-connected graph and a vertex included by the ith sub-connected graph in the connected graph as a first cutting point of the connected graph;

the server deletes the ith sub-connected graph to obtain a new connected graph;

the server makes i = i +1, and then executes the step of obtaining q from the vertex of the connected graph _i A continuous vertex, and dividing said q _i A continuous vertexAs the vertex of the ith sub-connected graph until all the first cut points are determined.

The two quantum logic gates corresponding to the first cutting points in the quantum wires are determined;

and the change of the same quantum bit under the action of the two quantum logic gates from the quantum state evolution corresponding to the action of one quantum logic gate to the quantum state evolution corresponding to the action of the other quantum logic gate is taken as a cutting position.

In an embodiment of the application, the server determining a target computing device based on the qubits currently allowed to be used by each computing device and the required number of qubits for the quantum wire corresponding to the quantum computing task, includes:

the server determines a plurality of device combination strategies based on the quantum bits currently allowed to be used by each computing device and the quantum bit number required by the quantum line corresponding to the quantum computing task, wherein each device combination strategy comprises a plurality of computing devices;

For example, assume that there are 4 computing devices, the number of qubits currently allowed to be used by computing device a is 4, the number of qubits currently allowed to be used by computing device B is 3, the number of qubits currently allowed to be used by computing device C is 3, and the number of qubits currently allowed to be used by computing device D is 2. For the quantum wire corresponding to the quantum computing task, the number of the required quantum bits is 6, and then the following four device combination strategies exist: first, computing device a and computing device B; second, computing device a and computing device C; and the third is that: computing device A and computing device D; and fourthly: computing device B and computing device C.

In an embodiment of the application, the server determines the target device combination policy based on the number of computing devices in each device combination policy and the total number of qubits currently allowed to be used, including:

For example, for the four device combination strategies, the number of computing devices included in the first type is 2, and the total number of qubits currently allowed to be used is 7; the second type comprises the number of computing devices being 2, the total number of qubits currently allowed to be used being 7; the third type comprises that the number of the computing devices is 2, and the total number of the quantum bits allowed to be used currently is 6; the fourth type includes a number of computing devices of 2 and a total number of qubits currently allowed to be used of 6.

If the equipment combination strategy with the least number of computing equipment is determined as the target equipment combination strategy, the four types of equipment combination strategies can be adopted; if the device combination strategy with the minimum total number of the currently allowed quantum bits is determined as the target device combination strategy, the device combination strategy is the third or fourth type; and if the device combination strategy with the minimum number of computing devices and the minimum total number of the quantum bits allowed to be used currently is determined as the target device combination strategy, determining the target device combination strategy as the third or fourth device combination strategy.

It can be seen that, in the embodiment of the present application, the device combination strategy with the least number of computing devices is determined as the target device combination strategy, so that the computation results of the subsequent sub-quantum wires that need to be synthesized are less, the execution flow of the quantum computation task is reduced, and the execution efficiency of the quantum computation task is improved; determining the device combination policy with the minimum total number of currently allowed qubits to be used as the target device combination policy can reduce the phenomenon that the qubits currently allowed to be used by the computing device in a single device combination policy are not fully utilized, thereby providing efficiency in utilization of computing resources.

In an embodiment of the present application, the method further includes:

For example, for the above four device combination strategies, the number of qubits currently allowed to be used by the computing device a in the first device combination strategy is 4, and the number of qubits currently allowed to be used by the computing device B in the first device combination strategy is 3, so that the maximum number of qubits currently allowed to be used by a single computing device in the first device combination strategy is 4;

in the second device combination strategy, the number of qubits currently allowed to be used by the computing device a is 4, and the number of qubits currently allowed to be used by the computing device C is 3, so that the maximum number of qubits currently allowed to be used by a single computing device in the second device combination strategy is 4;

in the third device combination strategy, the number of qubits currently allowed to be used by the computing device a is 4, and the number of qubits currently allowed to be used by the computing device D is 2, so that the maximum number of qubits currently allowed to be used by a single computing device in the third device combination strategy is 4;

in the fourth device combination strategy, the number of qubits currently allowed to be used by the computing device B is 3, and the number of qubits currently allowed to be used by the computing device C is 3, so that the maximum number of qubits currently allowed to be used by a single computing device in the second device combination strategy is 3;

and if the device combination strategy with the minimum maximum number of the quantum bits which are allowed to be used currently by the single computing device is determined as the target device combination strategy, selecting a fourth device.

It can be seen that, in the embodiment of the present application, the server determines the device combination policy that is the minimum maximum number of the qubits that a single computing device currently allows to use as the target device combination policy, so that the number of the qubits that the remaining computing devices currently allow to use is as large as possible, and when a next quantum computing task requiring a large number of qubits is executed, cutting is not needed, thereby simplifying the quantum computing task execution process and improving the accuracy of the computation result of the quantum computing task.

In an embodiment of the present application, the synthesizing, by the server, the multiple sub-computation results into the computation result of the quantum computation task includes:

Each sub-calculation result is a density matrix, and each density matrix corresponds to a tensor.

Further, the tensor shrinkage method is as follows:

if the output node of the density matrix I is equal to the input node of the density matrix J, combining the density matrix I and the density matrix J to obtain a density matrix K, wherein the input node of the density matrix K is the same as the input node of the density matrix I, and the output node of the density matrix K is the same as the output node of the density matrix J.

For example, assume that the sub-computation result of a sub-quantum wire is

And

wherein Q _i1 And Q _i3 The input nodes of the sub-quantum lines are represented as quantum bits q [1 ]]And a qubit q [3 ]]The input node is a quantum input node, and the time line of the quantum input node representing the quantum bit is a cut downstream time line. Q _o3 And Q _o1 Respectively representing the output nodes of the sub-quantum-lines as quantum bits q[3]And a qubit q [1 ]]And the output node is a quantum output node, and the time line of the quantum output node representing the quantum bit is the cut upstream time line.

According to the above-mentioned shrinkage method, the following can be shrunk:

wherein Λ is a real number.

It can be seen that, in the embodiment of the application, the server determines a plurality of tensors corresponding to a plurality of sub-computation results, and determines the tensors obtained by compressing the plurality of tensors as the computation results of the quantum computation tasks, so that the measurement results of the sub-quantum lines are converted into the computation results of the quantum computation tasks, the processing of the computation tasks which cannot be processed by a single NISQ device is further realized, the computation time is saved, and the computation efficiency is improved.

Referring to fig. 3, fig. 3 is a schematic flowchart of another quantum computing task processing method provided in this embodiment of the present application, and is applied to a distributed quantum computing system, where the distributed quantum computing system includes a server and a computing device, and the method includes:

step 301: the user device sends the quantum computing task to the server.

Step 302: the server acquires a plurality of computing resources which are currently allowed to be used by the computing devices, wherein the currently allowed computing resources comprise the quantum bits which are currently allowed to be used.

Step 303: the server determines the qubits currently allowed to be used by each computing device.

Step 304: the server determines a plurality of device combination strategies based on the quantum bits currently allowed to be used by each computing device and the quantum bit number required by the quantum wire corresponding to the quantum computing task, wherein each device combination strategy comprises a plurality of computing devices.

Step 305: the server determines a device combination policy with the minimum number of computing devices and/or the minimum total number of currently allowed qubits to be used as a target device combination policy.

Step 306: the server determines a plurality of computing devices included in the target device combination policy as target computing devices.

Step 307: the server determines a cutting position of a quantum wire corresponding to the quantum computing task based on the quantum bits currently allowed to be used by the target computing device.

Step 308: the server cuts the quantum wire into a plurality of sub-quantum wires, one for each sub-computation task, based on the cut position of the quantum wire.

Step 309: the server distributes the plurality of sub-computing tasks to the target computing device.

Step 310: and the target computing equipment executes the plurality of sub-computing tasks to obtain a plurality of sub-computing results.

Step 311: the target computing device sends the plurality of sub-computation results to a server.

Step 312: and the server determines a plurality of tensors corresponding to the plurality of sub-calculation results.

Step 313: and the server determines the tensors obtained by compressing the plurality of tensors as the calculation result of the quantum calculation task.

Step 314: and the server sends the calculation result to the user equipment.

It should be noted that, for the specific implementation process of the present embodiment, reference may be made to the specific implementation process described in the above method embodiment, and a description thereof is omitted here.

Referring to fig. 4, fig. 4 is a schematic flowchart of another quantum computing task processing method provided in this embodiment of the present application, and is applied to a distributed quantum computing system, where the distributed quantum computing system includes a server and a computing device, and the method includes:

step 401: the user device sends the quantum computing task to the server.

Step 402: the server obtains a plurality of computing resources which are allowed to be used currently by the computing devices, wherein the computing resources which are allowed to be used currently comprise the quantum bits which are allowed to be used currently.

Step 403: the server determines the qubits currently allowed to be used by each computing device.

Step 404: the server determines a plurality of device combination strategies based on the quantum bits currently allowed to be used by each computing device and the quantum bit number required by the quantum wire corresponding to the quantum computing task, wherein each device combination strategy comprises a plurality of computing devices.

Step 405: the server determines the number of qubits currently allowed to be used by each computing device in each device combination strategy.

Step 406: and the server determines the maximum number of the quantum bits which are currently allowed to be used by the single computing device in each device combination strategy based on the number of the quantum bits which are currently allowed to be used by each computing device in each device combination strategy.

Step 407: the server determines the device combination strategy with the minimum maximum number of quantum bits currently allowed to be used by the single computing device as the target device combination strategy.

Step 408: the server determines a cutting position of a quantum wire corresponding to the quantum computing task based on the quantum bits currently allowed to be used by the target computing device.

Step 409: the server cuts the quantum wire into a plurality of sub-quantum wires based on the cutting position of the quantum wire, each sub-quantum wire corresponding to a sub-computation task.

Step 410: the server distributes the plurality of sub-computing tasks to the target computing device.

Step 411: and the target computing equipment executes the plurality of sub-computing tasks to obtain a plurality of sub-computing results.

Step 412: the target computing device sends the plurality of sub-computation results to a server.

Step 413: and the server determines a plurality of tensors corresponding to the plurality of sub-calculation results.

Step 414: and the server determines the tensors obtained by compressing the tensors as a calculation result of the quantum calculation task.

Step 415: and the server sends the calculation result to the user equipment.

Referring to fig. 5, in accordance with the embodiments shown in fig. 2, fig. 3 and fig. 4, fig. 5 is a schematic structural diagram of an electronic device provided in an embodiment of the present application, and as shown in fig. 5, the electronic device includes a processor, a memory, a communication interface and one or more programs, where the one or more programs are stored in the memory and configured to be executed by the processor, and the programs include instructions for performing the following steps:

receiving a quantum computing task sent by user equipment;

processing the quantum computing task based on the computing resources currently allowed to be used by the computing equipment to obtain a plurality of sub-computing tasks; and distributing the plurality of sub-computing tasks to the computing device;

receiving a plurality of sub-computation results returned by the computing device for the plurality of sub-computation tasks; synthesizing the plurality of sub-computation results into a computation result of the quantum computation task;

and returning the calculation result to the user equipment.

In an embodiment of the present application, the number of the computing devices is multiple, the currently allowed computing resources include currently allowed qubits, and in terms of processing the quantum computing task based on the currently allowed computing resources of the computing devices to obtain multiple sub-computing tasks, the program includes instructions specifically configured to:

determining qubits currently allowed to be used by each computing device;

determining target computing equipment based on the quantum bits currently allowed to be used by each computing equipment and the quantum bit number required by the quantum circuit corresponding to the quantum computing task;

determining a cutting position of a quantum wire corresponding to the quantum computing task based on the quantum bit currently allowed to be used by the target computing device;

the quantum wire is cut into a plurality of sub-quantum wires, each corresponding to a sub-computation task, based on the cutting position of the quantum wire.

In an embodiment of the application, in determining the target computing device based on the qubits currently allowed to be used by each computing device and the required number of qubits for the quantum wire corresponding to the quantum computing task, the program includes instructions specifically configured to:

determining a plurality of device combination strategies based on the quantum bits currently allowed to be used by each computing device and the quantum bit number required by the quantum wire corresponding to the quantum computing task, wherein each device combination strategy comprises a plurality of computing devices;

determining a target device combination strategy based on the number of computing devices in each device combination strategy and the total number of quantum bits allowed to be used currently;

determining a plurality of computing devices included in the target device combination policy as target computing devices.

In an embodiment of the application, in determining the target device combination policy based on the number of computing devices in each device combination policy and the total number of qubits currently allowed to be used, the program includes instructions specifically for: and determining the device combination strategy with the minimum number of computing devices and/or the minimum total number of the quantum bits allowed to be used currently as the target device combination strategy.

In an embodiment of the application, the program includes instructions for further performing the steps of:

determining the number of quantum bits currently allowed to be used by each computing device in each device combination strategy;

determining the maximum number of the qubits which are allowed to be used currently by a single computing device in each device combination strategy based on the number of the qubits which are allowed to be used currently by each computing device in each device combination strategy;

and determining the device combination strategy with the minimum maximum number of quantum bits which are currently allowed to be used by the single computing device as the target device combination strategy.

In an embodiment of the application, in synthesizing the plurality of sub-computation results into the computation result of the quantum computation task, the program includes instructions specifically configured to:

determining a plurality of tensors corresponding to the plurality of sub-calculation results;

and determining the tensors obtained by compressing the plurality of tensors as the calculation result of the quantum calculation task.

It should be noted that, for the specific implementation process of this embodiment, reference may be made to the specific implementation process described in the above method embodiment, and no description is given here.

In the embodiment of the present application, the electronic device may be divided into the functional units according to the method example, for example, each functional unit may be divided corresponding to each function, or two or more functions may be integrated into one processing unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit. It should be noted that, in the embodiment of the present application, the division of the unit is schematic, and is only one logic function division, and when the actual implementation is realized, another division manner may be provided.

The following is an embodiment of the apparatus of the present application, which is used to execute the method implemented by the embodiment of the method of the present application. Referring to fig. 6, fig. 6 is a schematic structural diagram of a quantum computing task processing apparatus according to an embodiment of the present application, applied to a distributed quantum computing system, where the distributed quantum computing system includes a server and a computing device, and the apparatus includes:

the task transceiver unit 601 is configured to receive a quantum computation task sent by user equipment;

a task processing unit 602, configured to process the quantum computing task based on a computing resource currently allowed to be used by the computing device, so as to obtain multiple sub-computing tasks;

the task transceiver 601 is further configured to distribute the plurality of sub-computation tasks to the computing device; receiving a plurality of sub-computation results returned by the computing device for the plurality of sub-computation tasks;

the task processing unit 602 is further configured to synthesize the multiple sub-computation results into a computation result of the quantum computation task;

the task transceiver 601 is further configured to return the calculation result to the user equipment. In an embodiment of the present application, the number of the computing devices is multiple, the currently allowed computing resources include currently allowed qubits, and in terms of processing the quantum computing task based on the currently allowed computing resources of the computing devices to obtain multiple sub-computing tasks, the task processing unit 602 is specifically configured to:

determining qubits currently allowed to be used by each computing device;

In an embodiment of the application, in terms of determining a target computing device based on the qubits currently allowed to be used by each computing device and the number of qubits needed by the quantum wire corresponding to the quantum computing task, the task processing unit 602 is specifically configured to:

determining a plurality of computing devices included in the target device combination policy as target computing devices. In an embodiment of the present application, in determining a target device combination policy based on the number of computing devices in each device combination policy and the total number of qubits currently allowed to be used, the task processing unit 602 is specifically configured to:

and determining the device combination strategy with the minimum number of computing devices and/or the minimum total number of the quantum bits allowed to be used currently as the target device combination strategy.

In an embodiment of the present application, the task processing unit 602 is specifically configured to:

In an embodiment of the application, in terms of synthesizing the multiple sub-computation results into the computation result of the quantum computation task, the task processing unit 602 is specifically configured to:

It should be noted that the task transceiver 601 and the task processing unit 602 may be implemented by a processor.

Embodiments of the present application further provide a computer-readable storage medium, where the computer-readable storage medium stores a computer program for electronic data exchange, the computer program enables a computer to execute some or all of the steps of any one of the methods as set forth in the above method embodiments, and the computer includes an electronic device.

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

The embodiments of the present application further provide a quantum computer operating system, which implements distributed computation of the quantum computing task according to part or all of the steps of any one of the methods described in the above method embodiments.

It should be noted that, for simplicity of description, the above-mentioned method embodiments are described as a series of acts or combination of acts, but those skilled in the art will recognize that the present application is not limited by the order of acts described, as some steps may occur in other orders or concurrently depending on the application. Further, those skilled in the art should also appreciate that the embodiments described in the specification are preferred embodiments and that the acts and modules referred to are not necessarily required in this application.

In the foregoing embodiments, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.

In the several embodiments provided in the present application, it should be understood that the disclosed apparatus may be implemented in other manners. For example, the above-described embodiments of the apparatus are merely illustrative, and for example, the above-described division of the units is only one type of division of logical functions, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed coupling or direct coupling or communication connection between each other may be through some interfaces, indirect coupling or communication connection between devices or units, and may be in an electrical or other form.

The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.

In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.

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

Those skilled in the art will appreciate that all or part of the steps in the methods of the above embodiments may be implemented by associated hardware instructed by a program, which may be stored in a computer-readable memory, which may include: flash Memory disks, read-Only memories (ROMs), random Access Memories (RAMs), magnetic or optical disks, and the like.

The foregoing detailed description of the embodiments of the present application has been presented to illustrate the principles and implementations of the present application, and the above description of the embodiments is only provided to help understand the method and the core concept of the present application; meanwhile, for a person skilled in the art, according to the idea of the present application, the specific implementation manner and the application scope may be changed, and in summary, the content of the present specification should not be construed as a limitation to the present application.

Claims

1. A quantum computing task processing method is applied to a distributed quantum computing system, wherein the distributed quantum computing system comprises a server and a computing device, and the method comprises the following steps:

the server receives a quantum computing task sent by user equipment;

and the server returns the calculation result to the user equipment.

2. The method of claim 1, wherein the number of the computing devices is plural, the currently allowed computational resources include currently allowed qubits, and wherein the server processes the quantum computational task based on the currently allowed computational resources of the computing devices to obtain a plurality of sub-computational tasks, including:

the server determining the qubits currently allowed to be used by each computing device;

3. The method of claim 2, wherein the server determines the target computing device based on the qubits currently allowed to be used by each computing device and the required number of qubits for the quantum wire corresponding to the quantum computing task, and comprises:

4. The method of claim 3, wherein the server determines the target device combination policy based on the number of computing devices in each device combination policy and the total number of qubits currently allowed to be used, and comprises:

the server determines a device combination strategy with the minimum number of computing devices and/or the minimum total number of quantum bits allowed to be used currently as a target device combination strategy.

5. The method of claim 3, further comprising:

the server determines the number of quantum bits which are currently allowed to be used by each computing device in each device combination strategy;

6. The method of claim 1, wherein the server synthesizing the plurality of sub-computation results into the computation result of the quantum computation task comprises:

7. A quantum computing task processing apparatus, applied to a distributed quantum computing system including a server and a computing device, the apparatus comprising:

the task processing unit is further configured to synthesize the multiple sub-computation results into computation results of the quantum computation task;

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

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

10. A quantum computer operating system, wherein the quantum computer operating system implements distributed computing of a quantum computing task according to the method of any one of claims 1-6.