CN115456188B - Quantum computing task optimization processing method and device and quantum computer - Google Patents
Quantum computing task optimization processing method and device and quantum computer Download PDFInfo
- Publication number
- CN115456188B CN115456188B CN202210189021.7A CN202210189021A CN115456188B CN 115456188 B CN115456188 B CN 115456188B CN 202210189021 A CN202210189021 A CN 202210189021A CN 115456188 B CN115456188 B CN 115456188B
- Authority
- CN
- China
- Prior art keywords
- quantum
- quantum computing
- executed
- task
- computing task
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000003672 processing method Methods 0.000 title claims abstract description 19
- 238000005457 optimization Methods 0.000 title claims abstract description 13
- 238000012545 processing Methods 0.000 claims abstract description 71
- 238000000034 method Methods 0.000 claims abstract description 60
- 230000008569 process Effects 0.000 claims description 21
- 238000004891 communication Methods 0.000 claims description 19
- 238000004590 computer program Methods 0.000 claims description 12
- 238000004806 packaging method and process Methods 0.000 claims description 9
- 238000003860 storage Methods 0.000 claims description 7
- 238000000638 solvent extraction Methods 0.000 claims description 3
- 238000005192 partition Methods 0.000 claims 1
- 101150039208 KCNK3 gene Proteins 0.000 description 11
- 239000002096 quantum dot Substances 0.000 description 11
- 238000012827 research and development Methods 0.000 description 8
- 238000010586 diagram Methods 0.000 description 7
- 238000000889 atomisation Methods 0.000 description 5
- 230000007547 defect Effects 0.000 description 5
- 230000006872 improvement Effects 0.000 description 5
- 230000011218 segmentation Effects 0.000 description 5
- 238000002474 experimental method Methods 0.000 description 4
- 238000005259 measurement Methods 0.000 description 4
- 230000007704 transition Effects 0.000 description 4
- 230000009471 action Effects 0.000 description 3
- 230000001276 controlling effect Effects 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 230000001105 regulatory effect Effects 0.000 description 3
- 101150083764 KCNK9 gene Proteins 0.000 description 2
- 238000004422 calculation algorithm Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012856 packing Methods 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N10/00—Quantum computing, i.e. information processing based on quantum-mechanical phenomena
Landscapes
- Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Mathematical Analysis (AREA)
- Computing Systems (AREA)
- Evolutionary Computation (AREA)
- Condensed Matter Physics & Semiconductors (AREA)
- Computational Mathematics (AREA)
- Mathematical Optimization (AREA)
- Pure & Applied Mathematics (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Mathematical Physics (AREA)
- Software Systems (AREA)
- Artificial Intelligence (AREA)
- Superconductor Devices And Manufacturing Methods Thereof (AREA)
- Memory System Of A Hierarchy Structure (AREA)
Abstract
The application discloses a quantum computing task optimization processing method, a quantum computing task optimization processing device and a quantum computer, wherein the quantum computing task optimization processing method comprises the following steps: receiving a quantum computing task to be executed; judging whether the length of the quantum computing task to be executed exceeds a preset threshold value or not, wherein the threshold value is set according to the length of the maximum unit task which can be operated by a quantum control system of the quantum computer; if yes, dividing the quantum computing task to be executed into a plurality of subtasks, and executing compiling processing on each subtask, wherein the sum of the lengths of all the subtasks is equal to the length of the quantum computing task to be executed; if not, compiling the quantum computing task to be executed. The method and the device can meet the requirement of processing the quantum computing task with a larger length under the condition that the hardware resources of the quantum computer are limited.
Description
Technical Field
The present disclosure relates to the field of quantum information, and in particular, to a method and an apparatus for optimizing a quantum computing task, and a quantum computer.
Background
The quantum computer uses quantum bits as basic units, realizes subversion data operation processing modes by utilizing the characteristics of quantum superposition, quantum entanglement and the like, and can provide huge information carrying capacity and super-strong parallel computing processing capacity which are potentially superior to all classical computing technologies. The operation of the quantum computer depends on the mutual coordination of a quantum chip and a quantum control system which belong to a hardware part and a quantum computer operation system which belongs to a software part, wherein quantum bits are integrated on the quantum chip, the quantum control system is used for controlling and measuring the quantum chip, and the quantum chip and the quantum control system form a quantum processor of the quantum computer; the quantum computer operating system is a tool in the quantum computer for connecting the user terminal and the quantum processor of the quantum computer, and is used for receiving quantum computing tasks sent by a user on one hand and distributing hardware resources for the quantum computing tasks to map the quantum computing tasks into specific quantum bit topological structures in a quantum chip to finish execution of the quantum computing tasks on the other hand.
Due to the extremely severe requirements of the quantum chip on the running environment, and the limited level of the quantum chip manufacturing process, the hardware resources of the quantum computer are relatively limited. However, with the increasing demands of users for quantum computing, the types and complexity (embodied as the length of the task) of quantum computing tasks to be processed will also increase, and the limited hardware resources of quantum computers make it difficult for the existing processing manner of low-complexity quantum computing tasks for performing simple data operations to meet the processing demands of quantum computing tasks for performing higher complexity (or greater length).
Therefore, it is a urgent problem in the art to propose a new quantum computing task processing method to adapt to limited quantum computer hardware resources to meet the running requirements of a longer-length quantum computing task.
It should be noted that the information disclosed in the background section of the present application is only for enhancement of understanding of the general background of the present application and should not be taken as an admission or any form of suggestion that this information forms the prior art already known to a person skilled in the art.
Disclosure of Invention
The purpose of the application is to provide a quantum computing task optimization processing method and device and a quantum computer, so as to solve the defects in the prior art, and the method and device can meet the requirement of processing a quantum computing task with a larger length under the condition of limited hardware resources of the quantum computer.
In order to achieve the above object, an embodiment of a first aspect of the present application provides a method for optimizing a quantum computing task, including:
comprising the following steps:
receiving a quantum computing task to be executed;
judging whether the length of the quantum computing task to be executed exceeds a preset threshold value or not, wherein the threshold value is set according to the length of the maximum unit task which can be operated by a quantum control system of the quantum computer;
if yes, dividing the quantum computing task to be executed into a plurality of subtasks, and executing compiling processing on each subtask, wherein the sum of the lengths of all the subtasks is equal to the length of the quantum computing task to be executed;
if not, compiling the quantum computing task to be executed.
Further, the dividing the quantum computing task to be performed into a plurality of subtasks includes:
dividing the quantum computing task to be executed into a plurality of subtasks according to a preset dividing rule, and adding a label to each subtask so that each subtask has a unique label code, wherein all the subtasks can be combined according to the label codes to form the quantum computing task to be executed.
Further, the segmentation rule is set according to the length of the maximum unit task that the quantum control system of the quantum computer can operate.
Further, the threshold value is smaller than or equal to the length of the maximum unit task, and the length of each subtask formed by dividing the quantum computing task to be executed based on the dividing rule is smaller than or equal to the length of the maximum unit task.
Further, the compiling process for each subtask includes:
and compiling each subtask according to a preset processing rule based on the tag code.
Further, after compiling the subtasks according to a preset processing rule based on the tag code, the method further includes:
and carrying out package processing on the result obtained by compiling each subtask.
Further, the grouping processing is performed on the result obtained by compiling each subtask, including:
and packaging a plurality of instruction files and/or waveform files generated based on the compilation of each subtask according to a data communication protocol adopted by a quantum control system of the quantum computer, so as to generate a plurality of communication data packets which can be operated by the quantum control system.
Further, after the compiling process is performed on the quantum computing task to be performed, the method further includes:
and carrying out package processing on the result obtained by compiling the quantum computing task to be executed.
Further, after the receiving the quantum computing task to be executed, the grouping processing is performed on the result obtained by compiling the quantum computing task to be executed, including:
and packaging a plurality of instruction files and/or waveform files generated based on the quantum computing task compilation to be executed according to a data communication protocol adopted by a quantum control system of a quantum computer, and generating a plurality of communication data packets which can be operated by the quantum control system.
Further, after the receiving the quantum computing task to be performed, the method further comprises:
counting the number of quantum computing tasks to be executed;
and if a plurality of quantum computing tasks to be executed exist, judging each quantum computing task to be executed one by one.
Further, each of the quantum computing tasks to be executed has a unique task code (task ID), and the plurality of sub-tasks generated by the same quantum computing task to be executed are all task codes of the quantum computing task to be executed.
An embodiment of a second aspect of the present application provides an optimization processing device for quantum computing tasks, including:
the task receiving module is used for receiving a quantum computing task to be executed;
the task judging module is used for judging whether the length of the quantum computing task to be executed exceeds a preset threshold value, wherein the threshold value is set according to the length of the maximum unit task which can be operated by a quantum control system of the quantum computer;
the task processing module is used for dividing the quantum computing task to be executed into a plurality of subtasks when the length of the quantum computing task to be executed exceeds the threshold value, and executing compiling processing on each subtask, wherein the sum of the lengths of all the subtasks is equal to the length of the quantum computing task to be executed; and when the length of the quantum computing task to be executed does not exceed the threshold value, executing compiling processing on the quantum computing task to be executed.
An embodiment of a third aspect of the present application provides a quantum computer, including the optimizing processing device of quantum computing task.
A fourth aspect of the present application provides a computer readable storage medium having a computer program stored therein, wherein the computer program is arranged to perform the method when run.
An embodiment of a fifth aspect of the present application provides an electronic device comprising a memory having a computer program stored therein and a processor arranged to run the computer program to perform the method.
Compared with the prior art, the application has the following beneficial effects:
after receiving a quantum computing task to be executed, judging whether the length of the quantum computing task to be executed exceeds a preset threshold value, if the length of the quantum computing task to be executed does not exceed the threshold value, directly executing compiling processing, if the length of the quantum computing task to be executed exceeds the threshold value, dividing the task into a plurality of subtasks supportable by hardware of a quantum computer, and then respectively executing compiling processing on each subtask, thereby realizing that the quantum computing task with larger length can be smoothly processed and executed under the condition that the hardware resources of the quantum computer are limited, and improving the data operation processing capacity of the quantum computer with limited hardware resources to a certain extent; according to the quantum computing task optimizing method and device, the quantum computing task exceeding a certain length is optimized in the software application layer, so that the problem of hardware resource limitation caused by hardware defects of a quantum computer is solved, the research and development cost of the quantum computer is effectively reduced, and the research and development period is shortened.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the related art, the following description will briefly introduce the drawings that are required to be used in the embodiments or the description of the prior art, and it is obvious that the drawings in the following description are only some embodiments of the present application and should not be construed as limiting the scope, and other drawings may be obtained according to these drawings without inventive effort to a person of ordinary skill in the art.
FIG. 1 is a block diagram of a quantum computer in the related art;
FIG. 2 is a flowchart of a quantum computing task optimization processing method according to an embodiment of the present application;
FIG. 3 is a flowchart of a quantum computing task optimization processing method according to another embodiment of the present application;
FIG. 4 is a schematic diagram of a partitioning of two mutually exclusive quantum computing tasks to be performed, as shown in an example of the present application;
FIG. 5 is a block diagram of a quantum computing task optimization processing device according to an embodiment of the present application;
fig. 6 is a block diagram of an electronic device according to an embodiment of the present application.
Detailed Description
In order to better understand the technical solutions of the embodiments of the present application, the following descriptions will clearly and completely describe the technical solutions of the embodiments of the present application with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only some embodiments of the present application, but not all embodiments. All other embodiments, which can be made by one of ordinary skill in the art based on the embodiments herein without making any inventive effort, shall fall within the scope of the present application. The embodiments described below by referring to the drawings are exemplary only for the purpose of illustrating the present application and are not to be construed as limiting the present application.
Referring to fig. 1, fig. 1 is a block diagram of a quantum computer implemented by using superconducting technology according to an exemplary embodiment of the present application, including a quantum chip, a quantum control system, a quantum computer operating system, and a user terminal, where a plurality of qubits are integrated on the quantum chip, and each qubit is a two-level system, and has parameters such as a transition frequency and a transition energy, where the parameters need to be regulated by applying corresponding regulation signals (analog signals). The quantum control system is used for controlling and measuring the quantum chip, namely a signal output channel of the quantum control system is required to correspond to a parameter regulation port and a quantum bit state measurement port of a quantum bit arranged on the quantum chip. Therefore, the regulating signal is generated by the quantum control system and output to the corresponding port on the quantum chip. The quantum computer operating system can be configured in a cloud platform server or a physical server. Specifically, the user terminal generates a quantum computing task according to the user demand, the quantum computer operating system receives the quantum computing task sent by the user terminal and analyzes and processes the quantum computing task into a data packet which can be identified and processed by the quantum control system, the quantum control system receives the data packet and generates a regulating signal to be output to the quantum chip, and parameters such as transition frequency, transition energy and the like of a quantum bit are controlled, so that the quantum state of the quantum bit evolves along with time, and execution of the quantum computing task is realized. For the quantum computing task to be executed, the length of the quantum computing task is increased along with the improvement of the type and complexity of the task, namely the number of task parameters in a parameter list which needs to be traversed at one time in the quantum computing task is increased, and the number of quantum bits which need to be participated in is increased, namely the number of output channels of a required quantum control system is increased.
However, due to the fragility of the qubit, the requirement of the quantum chip on the running environment is extremely severe, so that the research and development period of the large-scale quantum chip is long and the research and development cost is high. Under the condition of the hardware resource of a relatively limited quantum computer, the length of the quantum computing task which can be executed by the quantum computing system is limited, so that the number of task parameters in a traversing parameter list can not exceed the number which can be supported by hardware when the quantum computing task is executed once by the quantum control system. Although such hardware defects can be solved by hardware improvements, the cost of the hardware improvements is excessive. Therefore, the problem caused by the hardware defect is solved by a software optimization mode, so that the research and development cost of the quantum computer can be effectively reduced, and the research and development period is shortened.
Based on the above, the embodiment of the application solves the problem that the larger quantum computing task of the software application layer of the quantum computer cannot be executed due to the limitation of the hardware resources of the quantum computer in the related technology by providing the quantum computing task optimizing processing method and device and the quantum computer, and can meet the requirement of processing the quantum computing task with larger length under the condition of limited hardware resources of the quantum computer.
Referring to fig. 2, an implementation manner of the embodiment of the present application discloses a method for optimizing a quantum computing task, which includes the following steps:
s110: and receiving a quantum computing task to be executed.
S120: judging whether the length of the quantum computing task to be executed exceeds a preset threshold value, wherein the threshold value is set according to the length of the maximum unit task which can be operated by a quantum control system of the quantum computer.
S130: if the length of the quantum computing task to be executed exceeds the threshold value, dividing the quantum computing task to be executed into a plurality of subtasks, and executing compiling processing on each subtask, wherein the sum of the lengths of all the subtasks is equal to the length of the quantum computing task to be executed.
S140: and if the length of the quantum computing task to be executed does not exceed the threshold value, executing compiling processing on the quantum computing task to be executed.
It can be seen that the embodiment of the application discloses an optimization processing method for a quantum computing task, by judging the length of a received quantum computing task to be executed, if the length of the task does not exceed a preset threshold, directly executing compiling processing, if the length of the task exceeds the preset threshold, dividing the task into a plurality of subtasks supportable by hardware of a quantum computer, so as to realize the slice atomization of the quantum computing task to be executed with a larger length, and then respectively executing compiling processing on each subtask after the slice atomization, thereby realizing the smooth execution of the longer quantum computing task in the quantum computer with limited hardware resources by dividing the quantum computing task beyond a certain length into a plurality of subtasks at the software application level.
In a specific implementation process, the quantum computing task optimization processing method disclosed by the application is implemented based on a quantum computer operating system. In step S110, a quantum computing task to be performed is received by the quantum computer operating system, and the type and complexity of the quantum computing task to be performed may be different according to the user' S requirements. In general, the higher the complexity of a quantum computing task, the greater will be its length, as will the number of task parameters that need to be traversed at a time.
It should be noted that the quantum computing task to be executed is a task having N (N is an integer greater than or equal to 1) repeated execution requirements. In order for a quantum computing task to be identified, the data structure of all quantum computing tasks received by the quantum computer operating system needs to be uniform. And whatever form of data structure is employed, it needs to include at least the qubit resources that the task needs to use once and the number of task parameters in the parameter list that the task needs to traverse once.
Specifically, in step S120, the length of the quantum computing task to be executed is taken as the number of task parameters in the parameter list that the task needs to traverse once. In order to facilitate the judgment of the length of the quantum computing task to be executed, a threshold value serving as a judgment standard may be set, where the threshold value is the number of task parameters. The threshold may be set according to the length of the maximum unit task that the quantum control system is capable of operating. Preferably, the preset threshold may be less than or equal to the length of the maximum unit task. In order to accurately judge the length of the quantum computing task to be executed, the maximum threshold value can be set to be the length of the maximum unit task which can be operated by the quantum control system, so that the hardware resource of the quantum computer can be fully utilized, and the task execution efficiency is improved. Thus, when the length of the quantum computing task to be performed exceeds the length of the maximum unit task, then the quantum computing task to be performed must be divided into a number of sub-tasks.
Further, in step S130, the quantum computing task to be performed is divided into a plurality of subtasks, including:
dividing the quantum computing task to be executed into a plurality of subtasks according to a preset dividing rule, and adding a label to each subtask so that each subtask has a unique label code, wherein all the subtasks can be combined according to the label codes to form the quantum computing task to be executed.
Specifically, the quantum computing task to be executed, the length of which exceeds the threshold value, is segmented according to a preset segmentation rule, and the goal to be achieved is that the length of each subtask formed by segmenting the quantum computing task to be executed based on the segmentation rule is smaller than or equal to the length of the maximum unit task, so that the subtask can be executed smoothly by a quantum control system.
In the practical application process, the segmentation rule can be set according to the length of the maximum unit task which can be operated by the quantum control system of the quantum computer.
For example, the quantum computing task to be executed is divided according to the ratio between the length of the quantum computing task to be executed and the length of the maximum unit task, and the number of the obtained subtasks has a direct relation with the ratio. When the ratio is an integer, dividing the number of the obtained subtasks into the ratio number, wherein the length of each subtask is equal to the length of the maximum unit task; when the ratio is a non-integer, that is, the ratio has an integer part and a fractional part, the number of the subtasks obtained by dividing is the integer part value of the ratio number plus 1, at this time, only one of the subtasks has a length smaller than the length of the maximum unit task, and the length of each of the remaining subtasks is equal to the length of the maximum unit task. The quantum computing task to be executed is divided based on the dividing rule, so that the quantum computer has the maximum resource utilization rate and higher task execution efficiency.
It should be noted that the dividing rule may be set according to actual application requirements, which is not limited herein. The sub-tasks formed by dividing the quantum computing task to be executed based on the preset dividing rule can be executed smoothly by a quantum control system.
In addition, a label is added to each subtask, so that each subtask is provided with a unique label code, and all the subtasks can form the quantum computing task to be executed according to the label codes. This is to facilitate distinguishing each of the subtasks, and also facilitate performing compiling processing on each of the subtasks according to a preset processing rule. Therefore, the total result of the compiling processing performed on each subtask can be ensured to be consistent with the result of the compiling processing performed on the quantum computing task to be performed before the subtotal.
For example, labels are added to each subtask belonging to the same quantum computing task to be executed in a sequential numbering mode, and then the label code of each subtask can be a sequence number; then, all the subtasks can be combined according to the sequence number to form the quantum computing task to be executed.
Further, in step S130, the performing compiling processing on each subtask includes:
and compiling each subtask according to a preset processing rule based on the tag code.
In practical application, the setting of the processing rule needs to be adapted to the rule for compiling the tag code, and as long as it can be ensured that the overall result of performing the compiling process on each subtask according to the processing rule set based on the tag code is consistent with the result of performing the compiling process on the quantum computing task to be performed before the subtask is split, in this embodiment, the setting of the processing rule and the tag code is not particularly limited, and may be set according to practical application needs. For example, the sub-tasks may be compiled sequentially based on the order of the sequence numbers.
It should be noted that, the result obtained by compiling the quantum computing task is a plurality of instruction files and/or waveform files for driving the hardware device of the quantum control system to operate.
In the specific implementation process, the quantum control system matched with the quantum chip comprises a plurality of hardware devices with different functions due to more parameters for controlling and measuring the quantum chip. Typical quantum control systems include arbitrary waveform generators, dc voltage sources, radio frequency transceiver components, data acquisition devices, and other hardware devices, and manipulation and measurement of each qubit in a quantum chip requires the cooperative implementation of these hardware devices. In order to enable all instruction files and/or waveform files obtained through compiling to accurately drive relevant hardware equipment of the quantum control system to work, after compiling processing is carried out on each subtask according to a preset processing rule based on the tag code, the method further comprises the following steps:
and carrying out package processing on the result obtained by executing the compiling processing on each subtask.
Further, in the implementation process, the quantum computer operating system performs data interaction communication with each hardware device of the quantum control system through various data communication protocols (such as TCP/IP protocol). Therefore, the grouping processing of the results obtained by compiling each subtask includes:
and packaging a plurality of instruction files and/or waveform files generated based on the compilation of each subtask according to a data communication protocol adopted by a quantum control system of the quantum computer, so as to generate a plurality of communication data packets which can be operated by the quantum control system.
Further, in step S140, after the performing of the compiling process on the quantum computing task to be performed, the method further includes:
and carrying out package processing on the result obtained by compiling the quantum computing task to be executed.
The step of packaging the result obtained by compiling the quantum computing task to be executed comprises the following steps:
and packaging a plurality of instruction files and/or waveform files generated based on the quantum computing task compilation to be executed according to a data communication protocol adopted by a quantum control system of a quantum computer, and generating a plurality of communication data packets which can be operated by the quantum control system.
In the embodiment of the application, the sub-tasks which can be supported by the hardware of the quantum control system are formed by the atomization of the slices of the quantum computing task to be executed beyond a certain length, all the sub-tasks after the slicing are compiled to form a plurality of instruction files and/or waveform files, and all the instruction files and/or waveform files are packaged according to a data communication protocol adopted by hardware equipment of the quantum control system, so that the conversion from the quantum computing task of a software application layer of the quantum computer to the binary instruction of the hardware equipment of the quantum computer is realized.
It should be noted that, the specific process of performing the compiling process and the packing process on the task does not belong to the important protection content of the present application, and may be implemented with reference to the prior art, which is not described herein.
In practical applications, in order to improve the user experience of a quantum computer, the execution efficiency of quantum computing tasks needs to be improved, and the quantum computer needs to support asynchronous or parallel execution of multiple quantum computing tasks. Thus, at the same time, a quantum computer operating system is able to receive multiple quantum computing tasks.
It should be noted that any two quantum computing tasks performed asynchronously or in parallel are mutually exclusive, i.e. there is no shared qubit resource for both.
Thus, referring to fig. 3, another implementation of the embodiment of the present application discloses a method for optimizing a quantum computing task, where the method is applicable to a situation where a plurality of quantum computing tasks are executed asynchronously or in parallel, and the method includes:
s210: and receiving a quantum computing task to be executed.
S220: and counting the number of the quantum computing tasks to be executed.
S230: if the number of the quantum computing tasks to be executed is multiple, judging whether the length of the current quantum computing task to be executed in all the quantum computing tasks to be executed exceeds a preset threshold, wherein the threshold is set according to the length of the maximum unit task which can be operated by a quantum control system of the quantum computer.
S240: if the length of the quantum computing task to be executed currently exceeds the threshold value, dividing the quantum computing task to be executed currently into a plurality of subtasks, and executing compiling processing on each subtask, wherein the sum of the lengths of all the subtasks is equal to the length of the quantum computing task to be executed currently; and returning to step S230 to execute the determining whether the length of the current quantum computing task in all the quantum computing tasks to be executed exceeds a preset threshold.
S250: if the length of the current quantum computing task to be executed does not exceed the threshold, performing compiling processing on the current quantum computing task to be executed, taking the next quantum computing task to be executed as the current quantum computing task to be executed, and returning to step S230 to execute the step of judging whether the length of the current quantum computing task to be executed in all the quantum computing tasks to be executed exceeds a preset threshold.
It should be noted that, if the current quantum computing task to be executed in the compiling processing in the steps S240 and S250 is the last quantum computing task to be executed, the determining whether the length of the current quantum computing task to be executed in all the quantum computing tasks to be executed exceeds the preset threshold value is not performed.
Steps S230-S250 are substantially identical to steps S120 and S140 in the above-described embodiments of the present application, and reference is made to the above-described embodiments of the present application for details, which are not repeated here.
As can be seen, in the quantum computing task optimizing processing method disclosed in the embodiment of the present application, for the situation that there are multiple quantum computing tasks to be executed asynchronously or in parallel, after receiving the quantum computing tasks to be executed, the number of the quantum computing tasks to be executed may be counted first, and then each quantum computing task to be executed may be judged one by one, that is, whether the length of the current quantum computing task to be executed in all the quantum computing tasks to be executed exceeds a preset threshold value is judged, if the length of the task does not exceed the threshold value, compiling processing is directly executed, and if the length of the task exceeds the threshold value, the task is divided into subtasks supportable by hardware of a quantum control system of a plurality of quantum computers, so as to implement slice atomization of the quantum computing tasks to be executed with a larger length, and then compiling processing is performed on each subtask after slice atomization, so that under the condition that the hardware resources of the quantum computing task with a larger length is limited, the quantum computing task with a larger length may also be successfully processed and executed, and the data computing capability of the quantum computing computer with limited hardware resources is improved to a certain extent; according to the quantum computing task optimizing method and device, the quantum computing task exceeding a certain length is optimized in the software application layer, so that the problem of hardware resource limitation caused by hardware defects of a quantum computer is solved, the research and development cost of the quantum computer is effectively reduced, and the research and development period is shortened.
Further, in order to facilitate accurate identification of a plurality of quantum computing tasks to be executed, a unique task ID may be assigned to each quantum computing task to be executed, and a plurality of subtasks generated by splitting the same quantum computing task to be executed all employ the task ID of the quantum computing task to be executed. The task ID may be set according to actual application needs, and is not limited herein, for example, the task ID may be set according to the maximum number of threads supportable by hardware of the quantum control system. In addition, the specific task ID can be used for distinguishing that all the subtasks which are formed by dividing all the quantum computing tasks to be executed and need to be divided are task groups of different groups, and a plurality of subtasks belonging to the task groups of two different groups can execute compiling processing simultaneously and can execute compiling processing successively, so that the task processing efficiency is greatly improved to a certain extent.
For example, on a quantum computer with 100 qubits, assume that the user uses the quantum measurement and control software pyQCat to perform 10 Ramsey experiments involving the qubits Q0 and Q25, and the number of Task parameters in the parameter list that needs to be traversed for one experiment is 30, thereby generating a Task1 to be executed, which needs to be repeatedly executed 10 times, and assuming that the Task start time is at time 1. The data structure of Task1 may be set to Task1: { "Q0, Q25", "30" }. At time2 of 2s after time1, another user submits 8 Rabi experiments involving the quantum bit Q2 using the quantum measurement and control software pyQCat, and the number of Task parameters in the parameter list to be traversed for one experiment is 35, so as to generate a Task2 to be executed quantum calculation Task to be repeatedly executed 8 times, and the data structure of the Task2 is set as Task2: { "Q2", "35" }. Thus, it can be determined that Task1 and Task2 are mutually exclusive and can be executed asynchronously.
Referring to fig. 4, assume that the length of the maximum unit Task supportable by the hardware of the quantum control system is 10, and the threshold is set to 10, based on which it can be determined that Task1 and Task2 need to be split before performing the compiling process. According to the ratio of the lengths of the Task1 and the Task2 to 10, the Task1 can be divided into 3 subtasks, and the tag codes are set to be Task1, task2 and Task3, wherein the lengths of the Task1 to Task3 are 10; and dividing the Task2 into 4 subtasks, and setting the tag codes into tasks 4, 5, 6 and 7, wherein the length of the Task4-Task6 is 10, and the length of the Task7 is 5. Further, assuming that the maximum number of threads supportable by the hardware of the quantum control system is 5, and the Task ID may have a value of 0-4, task IDs of Task1 and Task2 may be set to 0 and 1, respectively. Therefore, task1-Task3 formed by dividing Task1 forms a group of Task groups, and Task ID of the Task group is 0; task4-Task7 formed by Task2 segmentation forms another set of Task groups with Task ID 1.task1-task3 performs the compiling process in order of 1-3, and task4-task7 performs the compiling process in order of 4-7. And any one of the tasks 1 to 3 can be executed in synchronization with any one of the tasks 4 to 7 during the compiling process.
The following describes an apparatus for optimizing a quantum computing task according to an embodiment of the present application, and the processing apparatus described below and the processing method described above may be referred to correspondingly.
Referring to fig. 5, fig. 5 is a block diagram of a quantum computing task optimizing device according to an embodiment of the present application. The quantum computing task optimizing processing device may include:
the task receiving module 10 is used for receiving a quantum computing task to be executed;
the task judging module 20 is configured to judge whether the length of the quantum computing task to be executed exceeds a preset threshold, where the threshold is set according to the length of the maximum unit task that can be executed by the quantum control system of the quantum computer;
the task processing module 30 is configured to divide the quantum computing task to be executed into a plurality of subtasks when the length of the quantum computing task to be executed exceeds the threshold value, and perform compiling processing on each subtask, where the sum of the lengths of all the subtasks is equal to the length of the quantum computing task to be executed; and when the length of the quantum computing task to be executed does not exceed the threshold value, executing compiling processing on the quantum computing task to be executed.
The optimizing processing device for a quantum computing task according to the embodiment of the present application is configured to implement the foregoing optimizing processing method for a quantum computing task, so that a specific implementation in the optimizing processing device for a quantum computing task may be part of the foregoing embodiment of the optimizing processing method for a quantum computing task, for example, the task receiving module 10, the task judging module 20, and the task processing module 30 are respectively configured to implement steps S110, S120, S130, and S140 in the foregoing optimizing processing method for a quantum computing task, and therefore, the specific implementation thereof may refer to descriptions of respective partial embodiments and be not repeated herein.
The application also provides a quantum computer, which comprises the quantum computing task optimizing processing device of the embodiment of the application, or performs the quantum computing task by applying the quantum computing task optimizing processing method described in any embodiment of the application. The remainder of this disclosure may be referred to in the art and will not be described further herein.
The electronic device described below and the method for optimizing a quantum computing task and the device for optimizing a quantum computing task described above can be referred to correspondingly.
Referring to fig. 6, fig. 6 is a block diagram of an electronic device according to an embodiment of the present application.
Referring to fig. 6, the electronic device may include a processor 11 and a memory 12.
The memory 12 is used for storing a computer program; the processor 11 is configured to implement the method for optimizing the quantum computing task described in the embodiments of the present application when executing the computer program.
The processor 11 in the electronic device of the present embodiment is used for installing the optimizing processing device for quantum computing tasks described in the embodiments of the present application, and the combination of the processor 11 and the memory 12 may implement the optimizing processing method for quantum computing tasks described in any one of the embodiments of the present application. Therefore, the detailed description of the electronic device can refer to the description of the corresponding embodiments of each portion, and the detailed description is omitted herein.
The application also provides a computer readable storage medium, and a computer program is stored on the computer readable storage medium, and when the computer program is executed by a processor, the method for optimizing the quantum computing task is realized. The remainder of this disclosure may be referred to in the art and will not be described further herein.
In this specification, each embodiment is described in a progressive manner, and each embodiment is mainly described in a different point from other embodiments, so that the same or similar parts between the embodiments are mutually referred to. For the device disclosed in the embodiment, since it corresponds to the method disclosed in the embodiment, the description is relatively simple, and the relevant points refer to the description of the method section.
Those of skill would further appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both, and that the various illustrative elements and steps are described above generally in terms of functionality in order to clearly illustrate the interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
The steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. The software modules may be disposed in Random Access Memory (RAM), memory, read Only Memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art.
Finally, it is further noted that relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Moreover, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises an element.
The above describes in detail a method for optimizing a quantum computing task, an apparatus for optimizing a quantum computing task, a quantum computer, an electronic apparatus, and a computer-readable storage medium provided in the present application. Specific examples are set forth herein to illustrate the principles and embodiments of the present application, and the description of the examples above is only intended to assist in understanding the methods of the present application and their core ideas. It should be noted that it would be obvious to those skilled in the art that various improvements and modifications can be made to the present application without departing from the principles of the present application, and such improvements and modifications fall within the scope of the claims of the present application.
Claims (13)
1. The optimizing processing method for the quantum computing task is characterized by comprising the following steps of:
receiving a quantum computing task to be executed;
judging whether the length of a received quantum computing task to be executed exceeds a preset threshold value, wherein the threshold value is set according to the length of a maximum unit task which can be operated by a quantum control system of a quantum computer;
if so, dividing the quantum computing task to be executed into a plurality of subtasks, executing compiling processing on each subtask, and respectively packaging a plurality of instruction files and/or waveform files generated based on compiling of each subtask according to a data communication protocol adopted by a quantum control system of a quantum computer to generate a plurality of communication data packets which can be operated by the quantum control system, wherein the sum of the lengths of all the subtasks is equal to the length of the quantum computing task to be executed.
2. The method of claim 1, wherein the partitioning the quantum computing task to be performed into a number of sub-tasks comprises:
dividing the quantum computing task to be executed into a plurality of subtasks according to a preset dividing rule, and adding a label to each subtask so that each subtask has a unique label code, wherein all the subtasks can be combined according to the label codes to form the quantum computing task to be executed.
3. The method of claim 2, wherein the partitioning rule is set according to a length of a maximum unit task that a quantum control system of a quantum computer can run.
4. A method according to claim 3, wherein the threshold is less than or equal to the length of the maximum unit task, and the length of each subtask formed by dividing the quantum computing task to be performed based on the division rule is less than or equal to the length of the maximum unit task.
5. The method of claim 2, wherein said performing a compilation process on each of said subtasks comprises:
and compiling each subtask according to a preset processing rule based on the tag code.
6. The method of claim 1, wherein the method further comprises:
and when the length of the quantum computing task to be executed does not exceed a preset threshold value, performing compiling processing on the quantum computing task to be executed, and packaging a plurality of instruction files and/or waveform files generated based on the compiling of the quantum computing task to be executed according to a data communication protocol adopted by a quantum control system of a quantum computer to generate a plurality of communication data packets which can be operated by the quantum control system.
7. The method of any of claims 1-6, wherein after the receiving a quantum computing task to be performed, the method further comprises:
counting the number of quantum computing tasks to be executed;
and if a plurality of quantum computing tasks to be executed exist, judging each quantum computing task to be executed one by one.
8. The method of claim 7, wherein each of the quantum computing tasks to be performed has a unique task code, and wherein the plurality of sub-tasks generated by the same quantum computing task partition all employ the task code of the quantum computing task to be performed.
9. An optimization processing device for quantum computing tasks, comprising:
the task receiving module is used for receiving a quantum computing task to be executed;
the task judging module is used for judging whether the length of the quantum computing task to be executed exceeds a preset threshold value, wherein the threshold value is set according to the length of the maximum unit task which can be operated by a quantum control system of the quantum computer;
and the task processing module is used for dividing the quantum computing task to be executed into a plurality of subtasks when the length of the quantum computing task to be executed exceeds the threshold value, executing compiling processing on each subtask, respectively packaging a plurality of instruction files and/or waveform files generated based on compiling of each subtask according to a data communication protocol adopted by a quantum control system of a quantum computer, and generating a plurality of communication data packets which can be operated by the quantum control system, wherein the sum of the lengths of all the subtasks is equal to the length of the quantum computing task to be executed.
10. The apparatus of claim 9, wherein the device comprises a plurality of sensors,
and the task processing module is also used for executing compiling processing on the quantum computing task to be executed when the length of the quantum computing task to be executed does not exceed the threshold value, and packaging a plurality of instruction files and/or waveform files generated based on the compiling of the quantum computing task to be executed according to a data communication protocol adopted by a quantum control system of a quantum computer to generate a plurality of communication data packets which can be operated by the quantum control system.
11. A quantum computer comprising the quantum computing task optimizing processing device according to claims 9-10.
12. A computer readable storage medium, characterized in that the computer readable storage medium has stored therein a computer program, wherein the computer program is arranged to perform the method according to any of claims 1-8 when run.
13. An electronic device comprising a memory and a processor, the memory having stored therein a computer program, the processor being arranged to run the computer program to perform the method of any of claims 1-8.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210189021.7A CN115456188B (en) | 2022-02-28 | 2022-02-28 | Quantum computing task optimization processing method and device and quantum computer |
| PCT/CN2023/077961 WO2023160629A1 (en) | 2022-02-25 | 2023-02-23 | Processing device and method for quantum control system, quantum computer, medium, and electronic device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210189021.7A CN115456188B (en) | 2022-02-28 | 2022-02-28 | Quantum computing task optimization processing method and device and quantum computer |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115456188A CN115456188A (en) | 2022-12-09 |
| CN115456188B true CN115456188B (en) | 2024-04-05 |
Family
ID=84296194
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210189021.7A Active CN115456188B (en) | 2022-02-25 | 2022-02-28 | Quantum computing task optimization processing method and device and quantum computer |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115456188B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2023160629A1 (en) * | 2022-02-25 | 2023-08-31 | 本源量子计算科技（合肥）股份有限公司 | Processing device and method for quantum control system, quantum computer, medium, and electronic device |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104951705A (en) * | 2015-07-08 | 2015-09-30 | 南京烽火星空通信发展有限公司 | Android application data encryption packaging method based on operating system interface rewriting |
| EP3449426A1 (en) * | 2016-04-25 | 2019-03-06 | Google, Inc. | Quantum assisted optimization |
| CN112130977A (en) * | 2020-09-25 | 2020-12-25 | 山东云海国创云计算装备产业创新中心有限公司 | Task scheduling method, device, equipment and medium |
| CN113419833A (en) * | 2021-06-24 | 2021-09-21 | 中国信息通信研究院 | Method and device for quantum cloud computing platform task scheduling and quantum cloud computing platform task scheduling server |
| CN113902120A (en) * | 2021-09-18 | 2022-01-07 | 中国人民解放军战略支援部队信息工程大学 | Heterogeneous cloud resolving platform hybrid computing task dynamic self-adaptive partitioning scheduling method and system |
| CN114004361A (en) * | 2021-09-24 | 2022-02-01 | 苏州浪潮智能科技有限公司 | Label identification and segmentation method and device for quantum-classical hybrid algorithm and storage medium |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10044638B2 (en) * | 2016-05-26 | 2018-08-07 | 1Qb Information Technologies Inc. | Methods and systems for quantum computing |
-
2022
- 2022-02-28 CN CN202210189021.7A patent/CN115456188B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104951705A (en) * | 2015-07-08 | 2015-09-30 | 南京烽火星空通信发展有限公司 | Android application data encryption packaging method based on operating system interface rewriting |
| EP3449426A1 (en) * | 2016-04-25 | 2019-03-06 | Google, Inc. | Quantum assisted optimization |
| CN112130977A (en) * | 2020-09-25 | 2020-12-25 | 山东云海国创云计算装备产业创新中心有限公司 | Task scheduling method, device, equipment and medium |
| CN113419833A (en) * | 2021-06-24 | 2021-09-21 | 中国信息通信研究院 | Method and device for quantum cloud computing platform task scheduling and quantum cloud computing platform task scheduling server |
| CN113902120A (en) * | 2021-09-18 | 2022-01-07 | 中国人民解放军战略支援部队信息工程大学 | Heterogeneous cloud resolving platform hybrid computing task dynamic self-adaptive partitioning scheduling method and system |
| CN114004361A (en) * | 2021-09-24 | 2022-02-01 | 苏州浪潮智能科技有限公司 | Label identification and segmentation method and device for quantum-classical hybrid algorithm and storage medium |
Non-Patent Citations (1)
| Title |
|---|
| 基于冗余图态的多人协作量子计算;田宇玲;冯田峰;周晓祺;;物理学报;20190524(第11期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115456188A (en) | 2022-12-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105900064A (en) | Method and apparatus for scheduling data flow task | |
| Jangiti et al. | Scalable and direct vector bin-packing heuristic based on residual resource ratios for virtual machine placement in cloud data centers | |
| CN115456188B (en) | Quantum computing task optimization processing method and device and quantum computer | |
| CN103581336A (en) | Service flow scheduling method and system based on cloud computing platform | |
| Armant et al. | Semi-online task assignment policies for workload consolidation in cloud computing systems | |
| CN115470915B (en) | Server system of quantum computer and its realizing method | |
| Panda et al. | An efficient task consolidation algorithm for cloud computing systems | |
| CN111597043A (en) | Method, device and system for calculating edge of whole scene | |
| Jansen et al. | Approximation schemes for parallel machine scheduling problems with controllable processing times | |
| CN114647515A (en) | GPU cluster-oriented dynamic resource scheduling method | |
| CN105573843B (en) | A kind of data processing method and system | |
| CN105808346A (en) | Task scheduling method and device | |
| US20230325235A1 (en) | Training task queuing cause analysis method and system, device and medium | |
| US20230176905A1 (en) | Automatic driving simulation task scheduling method and apparatus, device, and readable medium | |
| CN111930485B (en) | Job scheduling method based on performance expression | |
| CN111049900B (en) | Internet of things flow calculation scheduling method and device and electronic equipment | |
| Han et al. | An adaptive scheduling algorithm for heterogeneous Hadoop systems | |
| CN111580950A (en) | Self-adaptive feedback resource scheduling method for improving cloud reliability | |
| Jia et al. | Adaptive load distribution strategies for divisible load processing on resource unaware multilevel tree networks | |
| Doddavula et al. | Implementation of a fast vector packing algorithm and its application for server consolidation | |
| CN114980216A (en) | Dependent task unloading system and method based on mobile edge calculation | |
| CN110955527B (en) | Method and system for realizing parallel task scheduling based on CPU (Central processing Unit) core number prediction | |
| Pham et al. | A general and practical consolidation framework in CloudNFV | |
| Du et al. | OctopusKing: A TCT-aware task scheduling on spark platform | |
| CN112492612B (en) | Resource allocation method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information |
Address after: 230088 6th floor, E2 building, phase II, innovation industrial park, 2800 innovation Avenue, high tech Zone, Hefei City, Anhui Province Applicant after: Benyuan Quantum Computing Technology (Hefei) Co.,Ltd. Address before: 230088 6th floor, E2 building, phase II, innovation industrial park, 2800 innovation Avenue, high tech Zone, Hefei City, Anhui Province Applicant before: ORIGIN QUANTUM COMPUTING COMPANY, LIMITED, HEFEI |
|
| CB02 | Change of applicant information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |