CN114330732A - Multi-task asynchronous scheduling method, equipment and medium based on quantum computing - Google Patents
Multi-task asynchronous scheduling method, equipment and medium based on quantum computing Download PDFInfo
- Publication number
- CN114330732A CN114330732A CN202111664912.5A CN202111664912A CN114330732A CN 114330732 A CN114330732 A CN 114330732A CN 202111664912 A CN202111664912 A CN 202111664912A CN 114330732 A CN114330732 A CN 114330732A
- Authority
- CN
- China
- Prior art keywords
- quantum
- carrier
- running
- tasks
- resource table
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 38
- 238000010586 diagram Methods 0.000 description 9
- 238000004590 computer program Methods 0.000 description 7
- 238000004088 simulation Methods 0.000 description 7
- 230000009286 beneficial effect Effects 0.000 description 5
- 230000006870 function Effects 0.000 description 5
- 230000008569 process Effects 0.000 description 5
- 239000000969 carrier Substances 0.000 description 3
- 230000000694 effects Effects 0.000 description 3
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 1
- 230000000903 blocking effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
Images
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application discloses a multitask asynchronous scheduling method, equipment and a medium based on quantum computing, wherein the method comprises the following steps: inquiring a plurality of quantum tasks in a quantum task table, and respectively obtaining the running states of the plurality of quantum tasks; selecting quantum tasks with running states as waiting queues from the multiple quantum tasks, acquiring running carrier types corresponding to the quantum tasks of the waiting queues, and calling corresponding carrier resource tables according to the running carrier types; and acquiring a corresponding carrier number in the carrier resource table according to the type of the running carrier, and running the quantum task waiting for the queue in the carrier corresponding to the carrier number according to the carrier number. The scheduling of the quantum real machine or the simulator is asynchronous, and the interfaces are independent and asynchronous without mutual influence, so that the calling of the quantum task and the returning of the result can be quickly finished, the task blockage can not be generated, and the resource utilization rate of the quantum real machine or the simulator can be maximized.
Description
Technical Field
The application relates to the technical field of quantum computing, in particular to a multitask asynchronous scheduling method, equipment and medium based on quantum computing.
Background
Quantum computers are physical devices that perform high-speed mathematical and logical operations, store and process quantum information following quantum mechanical laws, i.e., computing devices that run quantum algorithms. The quantum computer is characterized by high running speed, strong information handling capacity, wide application range and the like, and compared with a common computer, the quantum computer is more beneficial to implementation of operation as the information processing amount is more, so that the accuracy of operation can be more accurately ensured.
However, when quantum programming is performed by using a quantum programming framework, task scheduling and running equipment of the obtained quantum instruction string are often very confused, and when a large number of quantum instruction strings exist, it is difficult to purposefully select corresponding equipment to execute the quantum instruction strings.
Disclosure of Invention
In order to solve the above problems, the present application provides a method, a device, and a medium for multitask asynchronous scheduling based on quantum computing, including:
in a first aspect, the present application provides a quantum computation-based multitask asynchronous scheduling method, including: inquiring a plurality of quantum tasks in a quantum task table, and respectively acquiring the running states of the plurality of quantum tasks, wherein the running states comprise: waiting for queue, in-service, and completion of operation; selecting the quantum task with the running state as the waiting queue from the plurality of quantum tasks, and acquiring a running carrier type corresponding to the quantum task of the waiting queue, wherein the running carrier type comprises: a real machine and a simulator; calling a corresponding carrier resource table according to the type of the operation carrier, wherein the carrier resource table comprises: a real machine resource table and an analog machine resource table; and acquiring a corresponding carrier number in the carrier resource table according to the type of the running carrier, and running the quantum task of the waiting queue in the carrier corresponding to the carrier number according to the carrier number.
In one example, invoking a corresponding carrier resource table according to the type of the operating carrier specifically includes: determining that the type of the operation carrier is a real machine, and calling a real machine resource table; inquiring the real machine state in the real machine resource table through a real machine state inquiry interface, wherein the real machine state comprises: free, busy.
In one example, according to the type of the running bearer, obtaining a corresponding bearer number from the bearer resource table, and according to the bearer number, running the quantum task of the waiting queue in the bearer corresponding to the bearer number specifically includes: determining that the type of the running carrier is a real machine, and inquiring a real machine number with an idle real machine state in the real machine resource table; acquiring a submission instruction interface corresponding to the real machine number; and transmitting the quantum tasks of the waiting queue to a corresponding real machine through the submitting instruction interface, and running the quantum tasks of the waiting queue through the real machine.
In one example, the transmitting the quantum tasks of the waiting queue to a corresponding real machine through the submission instruction interface, and running the quantum tasks of the waiting queue through the real machine specifically includes: according to the real machine number corresponding to the real machine, modifying the real machine state corresponding to the real machine into busy in the real machine resource table; in the quantum task table, modifying the running state corresponding to the quantum tasks of the waiting queue into running; and determining that the quantum tasks of the waiting queue finish running, modifying the running state corresponding to the quantum tasks of the waiting queue into running completion in the quantum task table, and modifying the real machine state corresponding to the real machine into idle in the real machine resource table.
In one example, invoking a corresponding carrier resource table according to the type of the operating carrier specifically includes: determining the type of the operation carrier as a simulator, and calling a resource table of the simulator; inquiring the state of the analog machine in the analog machine resource table through an analog machine state inquiry interface, wherein the state of the analog machine comprises the following steps: free, busy.
In one example, according to the type of the running bearer, obtaining a corresponding bearer number from the bearer resource table, and according to the bearer number, running the quantum task of the waiting queue in the bearer corresponding to the bearer number specifically includes: determining that the type of the operation carrier is a simulator, and inquiring a simulator number with a state of the simulator being idle in a simulator resource table; acquiring a submitting instruction interface corresponding to the analog machine number; and transmitting the quantum tasks of the waiting queue to a corresponding simulator through the submitting instruction interface, and running the quantum tasks of the waiting queue through the simulator.
In one example, the transmitting the quantum tasks of the waiting queue to a corresponding simulation machine through the submission instruction interface, and running the quantum tasks of the waiting queue through the simulation machine specifically include: according to the analog machine number corresponding to the analog machine, modifying the state of the analog machine corresponding to the analog machine into busy state in the analog machine resource table; in the quantum task table, modifying the running state corresponding to the quantum tasks of the waiting queue into running; and determining that the quantum tasks of the waiting queue are completely operated, modifying the operation state corresponding to the quantum tasks of the waiting queue into operation completion in the quantum task table, and modifying the state of the simulator corresponding to the simulator into idle in the simulator resource table.
In one example, according to the carrier number, running the quantum task of the waiting queue in the carrier corresponding to the carrier number specifically includes: according to the carrier number, a submission instruction interface corresponding to the carrier number is inquired in the carrier resource table; according to the quantum tasks of the waiting queue, inquiring a quantum submission interface corresponding to the quantum tasks of the waiting queue in the quantum task table; and constructing data interconnection between a submission instruction interface corresponding to the carrier number and a quantum submission interface corresponding to the quantum task of the waiting queue.
On the other hand, the application provides a multitask asynchronous scheduling device based on quantum computing, which comprises: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to enable the at least one processor to: inquiring a plurality of quantum tasks in a quantum task table, and respectively acquiring the running states of the plurality of quantum tasks, wherein the running states comprise: waiting for queue, in-service, and completion of operation; selecting the quantum task with the running state as the waiting queue from the plurality of quantum tasks, and acquiring a running carrier type corresponding to the quantum task of the waiting queue, wherein the running carrier type comprises: a real machine and a simulator; calling a corresponding carrier resource table according to the type of the operation carrier, wherein the carrier resource table comprises: a real machine resource table and an analog machine resource table; and acquiring a corresponding carrier number in the carrier resource table according to the type of the running carrier, and running the quantum task of the waiting queue in the carrier corresponding to the carrier number according to the carrier number.
In another aspect, the present application provides a non-transitory computer storage medium storing computer-executable instructions configured to: inquiring a plurality of quantum tasks in a quantum task table, and respectively acquiring the running states of the plurality of quantum tasks, wherein the running states comprise: waiting for queue, in-service, and completion of operation; selecting the quantum task with the running state as the waiting queue from the plurality of quantum tasks, and acquiring a running carrier type corresponding to the quantum task of the waiting queue, wherein the running carrier type comprises: a real machine and a simulator; calling a corresponding carrier resource table according to the type of the operation carrier, wherein the carrier resource table comprises: a real machine resource table and an analog machine resource table; and acquiring a corresponding carrier number in the carrier resource table according to the type of the running carrier, and running the quantum task of the waiting queue in the carrier corresponding to the carrier number according to the carrier number.
The multitask asynchronous scheduling method, the multitask asynchronous scheduling device and the multitask asynchronous scheduling medium based on quantum computing have the following beneficial effects that: the scheduling of the quantum real machine or the simulator is asynchronous, and the interfaces are independent and asynchronous without mutual influence, so that the calling of the quantum task and the returning of the result can be quickly finished, the task blockage can not be generated, and the resource utilization rate of the quantum real machine or the simulator can be maximized.
Drawings
The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the application and together with the description serve to explain the application and not to limit the application. In the drawings:
fig. 1 is a schematic flowchart of a quantum computing-based multitask asynchronous scheduling method in an embodiment of the present application;
fig. 2 is a schematic diagram of a multitask asynchronous scheduling device based on quantum computing in an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the technical solutions of the present application will be described in detail and completely with reference to the following specific embodiments of the present application and the accompanying drawings. It should be apparent that the described embodiments are only some of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
Firstly, it should be noted that the quantum computing-based multitask asynchronous scheduling method described in the present application may be stored in a system in a form of a quantum instruction string, and the system may be operated in a quantum computer, and meanwhile, the quantum computer should have a corresponding hardware capability to support the operation of the system and a corresponding quantum instruction string, thereby implementing quantum computing-based multitask asynchronous scheduling.
The technical solutions provided by the embodiments of the present application are described in detail below with reference to the accompanying drawings.
As shown in fig. 1, a method for multitask asynchronous scheduling based on quantum computing provided in an embodiment of the present application includes:
s101: inquiring a plurality of quantum tasks in a quantum task table, and respectively acquiring the running states of the plurality of quantum tasks, wherein the running states comprise: waiting for queue, running and running completion.
Specifically, the system comprises a quantum task table, a user carries out quantum instruction conversion through a quantum programming framework to finally obtain a quantum instruction string, and selects a simulator or a real machine resource to carry out quantum instruction execution, so that a large number of quantum tasks are generated and stored in the quantum task table.
The quantum tasks contained in the quantum task table are not all running or running completed, and due to the resource calling problem of a real machine or a simulation machine, a large number of quantum tasks may all have a state waiting for running.
S102: selecting the quantum task with the running state as the waiting queue from the plurality of quantum tasks, and acquiring a running carrier type corresponding to the quantum task of the waiting queue, wherein the running carrier type comprises: true machine, analog machine.
Specifically, the system needs to schedule corresponding computing resources for the quantum tasks of the waiting queue, and meanwhile, different quantum tasks have different running carriers, that is, when a user writes the quantum character strings corresponding to the quantum tasks, based on the different functions of the quantum character strings, the user can select whether the generated quantum tasks run in a real machine or a simulation machine.
S103: calling a corresponding carrier resource table according to the type of the operation carrier, wherein the carrier resource table comprises: real machine resource table, analog machine resource table.
Specifically, the following embodiments may be included according to the difference of the operation carrier:
the first method comprises the following steps:
the system determines that the type of the operation carrier is a real machine, and calls a real machine resource table.
Through real machine state inquiry interface, inquire the real machine state in the real machine resource table, real machine state includes: free, busy.
It should be noted that the real machine state query interface corresponds to the only real machine, and the condition that a plurality of real machines share the same real machine state query interface does not exist. In addition, the specific address of the real machine state query interface can also be stored in the real machine resource table.
In the second step:
the system determines that the type of the operation carrier is the simulator, and calls a resource table of the simulator.
Through the analog machine state inquiry interface, inquire the analog machine state in the analog machine resource table, the analog machine state includes: free, busy.
It should be noted that the state query interface of the analog machine corresponds to a unique analog machine, and a plurality of analog machines do not share the same state query interface of the analog machine. In addition, the specific address of the simulator state query interface can also be stored in the simulator resource table.
S104: and acquiring a corresponding carrier number in the carrier resource table according to the type of the running carrier, and running the quantum task of the waiting queue in the carrier corresponding to the carrier number according to the carrier number.
Specifically, two embodiments such as the step S103 may be included according to the difference of the operation carriers, and the first embodiment mentioned in the step is the first embodiment in the receiving S103, and the second embodiment mentioned in this section is the second embodiment in the receiving S103.
The first method comprises the following steps:
the system determines that the type of the running carrier is a real machine, and inquires the serial number of the real machine with the idle state in a real machine resource table.
And further, acquiring a submission instruction interface corresponding to the real machine number.
And further, the quantum tasks of the waiting queue are transmitted to the corresponding real machine through the submission instruction interface, and the quantum tasks of the waiting queue are operated through the real machine.
It should be noted that the submission instruction interface corresponds to a unique real machine, and there is no condition that multiple real machines share the same submission instruction interface. In addition, the specific address of the commit instruction interface may also be stored in the real machine resource table.
In addition, the quantum tasks of the waiting queue are transmitted to the corresponding real machine through the submission instruction interface, and the quantum tasks of the waiting queue are run through the real machine, which specifically comprises the following steps:
the system modifies the real machine state corresponding to the real machine into busy in the real machine resource table according to the real machine number corresponding to the real machine.
Furthermore, in the quantum task table, the operation state corresponding to the quantum task of the waiting queue is modified to be in operation.
And then, the system determines that the quantum tasks of the waiting queue are completely operated, modifies the operation state corresponding to the quantum tasks of the waiting queue into operation completion in the quantum task table, and modifies the real machine state corresponding to the real machine into idle in the real machine resource table.
And the second method comprises the following steps:
the system determines that the type of the operation carrier is the simulator, and inquires the number of the simulator with the state of the simulator being idle in a resource table of the simulator.
And further, acquiring a submission instruction interface corresponding to the analog machine number.
And further, the quantum tasks of the waiting queue are transmitted to the corresponding analog machine through the submission instruction interface, and the quantum tasks of the waiting queue are operated through the analog machine.
It should be noted that the submit instruction interface herein corresponds to a unique simulator, and there is no condition that a plurality of simulators share the same submit instruction interface. In addition, the specific address of the interface of the commit instruction may also be stored in the resource table of the analog machine.
In addition, the quantum tasks of the waiting queue are transmitted to the corresponding analog machine through the submission instruction interface, and the quantum tasks of the waiting queue are run through the analog machine, which specifically comprises the following steps:
the system changes the state of the analog machine corresponding to the analog machine into busy state in the resource table of the analog machine according to the serial number of the analog machine corresponding to the analog machine.
Furthermore, in the quantum task table, the operation state corresponding to the quantum task of the waiting queue is modified to be in operation.
And then, the system determines that the quantum tasks of the waiting queue are completely operated, modifies the operation state corresponding to the quantum tasks of the waiting queue into operation completion in the quantum task table, and modifies the state of the simulator corresponding to the simulator into idle in the simulator resource table.
In one embodiment, the system runs the quantum task waiting for the queue in the carrier corresponding to the carrier number according to the carrier number, and specifically includes:
the system inquires a submission instruction interface corresponding to the carrier number in the carrier resource table according to the carrier number.
And the system inquires a quantum submission interface corresponding to the quantum task of the waiting queue in the quantum task table according to the quantum task of the waiting queue.
And then, the system constructs data interconnection between a submission instruction interface corresponding to the carrier number and a quantum submission interface corresponding to the quantum task of the waiting queue.
Namely, according to the technical scheme of the application, the quantum tasks waiting for the queues can be transmitted to the corresponding carriers to be operated through the data interconnection.
In addition, it should be noted that, in the above technical solution, the carrier resource table mainly identifies the resource usage of the simulation machine and the address of the submission instruction interface of each resource, each resource between the real machine and the simulation machine is independent, and the provided real machine state query interface or the simulation machine state query interface and the quantum submission interface have fixed interface call addresses.
When batch quantum tasks are generated, idle resources are selected in batches to be called for the quantum tasks of the waiting queue, and a large number of tasks are shared by more resources. Meanwhile, the scheduling of the quantum real machine and the scheduling of the simulator are asynchronous and do not affect each other, the task calling and result returning can be completed rapidly, the task blocking cannot be generated, and the resource utilization rate of the quantum real machine or the simulator is maximized.
In addition, in an embodiment, as shown in fig. 2, the present application further provides a quantum computing-based multitask asynchronous scheduling device, including:
at least one processor; and the number of the first and second groups,
a memory communicatively coupled to the at least one processor; wherein,
the memory stores instructions executable by the at least one processor to cause the at least one processor to perform instructions for:
inquiring a plurality of quantum tasks in a quantum task table, and respectively acquiring the running states of the plurality of quantum tasks, wherein the running states comprise: waiting for queue, in-service, and completion of operation;
selecting the quantum task with the running state as the waiting queue from the plurality of quantum tasks, and acquiring a running carrier type corresponding to the quantum task of the waiting queue, wherein the running carrier type comprises: a real machine and a simulator;
calling a corresponding carrier resource table according to the type of the operation carrier, wherein the carrier resource table comprises: a real machine resource table and an analog machine resource table;
and acquiring a corresponding carrier number in the carrier resource table according to the type of the running carrier, and running the quantum task of the waiting queue in the carrier corresponding to the carrier number according to the carrier number.
In one embodiment, the present application further provides a non-transitory computer storage medium storing computer-executable instructions configured to:
inquiring a plurality of quantum tasks in a quantum task table, and respectively acquiring the running states of the plurality of quantum tasks, wherein the running states comprise: waiting for queue, in-service, and completion of operation;
selecting the quantum task with the running state as the waiting queue from the plurality of quantum tasks, and acquiring a running carrier type corresponding to the quantum task of the waiting queue, wherein the running carrier type comprises: a real machine and a simulator;
calling a corresponding carrier resource table according to the type of the operation carrier, wherein the carrier resource table comprises: a real machine resource table and an analog machine resource table;
and acquiring a corresponding carrier number in the carrier resource table according to the type of the running carrier, and running the quantum task of the waiting queue in the carrier corresponding to the carrier number according to the carrier number.
The embodiments in the present application are described in a progressive manner, and the same and similar parts among the embodiments can be referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the device and media embodiments, the description is relatively simple as it is substantially similar to the method embodiments, and reference may be made to some descriptions of the method embodiments for relevant points.
The device and the medium provided by the embodiment of the application correspond to the method one to one, so the device and the medium also have the similar beneficial technical effects as the corresponding method, and the beneficial technical effects of the method are explained in detail above, so the beneficial technical effects of the device and the medium are not repeated herein.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
It should also be noted that 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 an … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
The above description is only an example of the present application and is not intended to limit the present application. Various modifications and changes may occur to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.
Claims (10)
1. A multitask asynchronous scheduling method based on quantum computing is characterized by comprising the following steps:
inquiring a plurality of quantum tasks in a quantum task table, and respectively acquiring the running states of the plurality of quantum tasks, wherein the running states comprise: waiting for queue, in-service, and completion of operation;
selecting the quantum task with the running state as the waiting queue from the plurality of quantum tasks, and acquiring a running carrier type corresponding to the quantum task of the waiting queue, wherein the running carrier type comprises: a real machine and a simulator;
calling a corresponding carrier resource table according to the type of the operation carrier, wherein the carrier resource table comprises: a real machine resource table and an analog machine resource table;
and acquiring a corresponding carrier number in the carrier resource table according to the type of the running carrier, and running the quantum task of the waiting queue in the carrier corresponding to the carrier number according to the carrier number.
2. The quantum-computation-based multitask asynchronous scheduling method according to claim 1, wherein the step of calling a corresponding carrier resource table according to the type of the operation carrier specifically comprises the steps of:
determining that the type of the operation carrier is a real machine, and calling a real machine resource table;
inquiring the real machine state in the real machine resource table through a real machine state inquiry interface, wherein the real machine state comprises: free, busy.
3. The method according to claim 2, wherein according to the type of the operating bearer, a corresponding bearer number is obtained from the bearer resource table, and according to the bearer number, the quantum task of the waiting queue is operated in the bearer corresponding to the bearer number, specifically comprising:
determining that the type of the running carrier is a real machine, and inquiring a real machine number with an idle real machine state in the real machine resource table;
acquiring a submission instruction interface corresponding to the real machine number;
and transmitting the quantum tasks of the waiting queue to a corresponding real machine through the submitting instruction interface, and running the quantum tasks of the waiting queue through the real machine.
4. The quantum-computation-based multitask asynchronous scheduling method according to claim 3, wherein the step of transmitting the quantum tasks of the waiting queue to the corresponding real machine through the submission instruction interface and running the quantum tasks of the waiting queue through the real machine specifically comprises the steps of:
according to the real machine number corresponding to the real machine, modifying the real machine state corresponding to the real machine into busy in the real machine resource table;
in the quantum task table, modifying the running state corresponding to the quantum tasks of the waiting queue into running;
and determining that the quantum tasks of the waiting queue finish running, modifying the running state corresponding to the quantum tasks of the waiting queue into running completion in the quantum task table, and modifying the real machine state corresponding to the real machine into idle in the real machine resource table.
5. The quantum-computation-based multitask asynchronous scheduling method according to claim 1, wherein the step of calling a corresponding carrier resource table according to the type of the operation carrier specifically comprises the steps of:
determining the type of the operation carrier as a simulator, and calling a resource table of the simulator;
inquiring the state of the analog machine in the analog machine resource table through an analog machine state inquiry interface, wherein the state of the analog machine comprises the following steps: free, busy.
6. The method according to claim 5, wherein according to the type of the operating bearer, a corresponding bearer number is obtained from the bearer resource table, and according to the bearer number, the quantum task of the waiting queue is operated in the bearer corresponding to the bearer number, specifically comprising:
determining that the type of the operation carrier is a simulator, and inquiring a simulator number with a state of the simulator being idle in a simulator resource table;
acquiring a submitting instruction interface corresponding to the analog machine number;
and transmitting the quantum tasks of the waiting queue to a corresponding simulator through the submitting instruction interface, and running the quantum tasks of the waiting queue through the simulator.
7. The quantum-computation-based multitask asynchronous scheduling method according to claim 5, wherein the steps of transmitting the quantum tasks of the waiting queue to a corresponding analog machine through the instruction submitting interface and running the quantum tasks of the waiting queue through the analog machine specifically include:
according to the analog machine number corresponding to the analog machine, modifying the state of the analog machine corresponding to the analog machine into busy state in the analog machine resource table;
in the quantum task table, modifying the running state corresponding to the quantum tasks of the waiting queue into running;
and determining that the quantum tasks of the waiting queue are completely operated, modifying the operation state corresponding to the quantum tasks of the waiting queue into operation completion in the quantum task table, and modifying the state of the simulator corresponding to the simulator into idle in the simulator resource table.
8. The method according to claim 1, wherein the step of running the quantum tasks of the waiting queue in the bearer corresponding to the bearer number according to the bearer number specifically comprises:
according to the carrier number, a submission instruction interface corresponding to the carrier number is inquired in the carrier resource table;
according to the quantum tasks of the waiting queue, inquiring a quantum submission interface corresponding to the quantum tasks of the waiting queue in the quantum task table;
and constructing data interconnection between a submission instruction interface corresponding to the carrier number and a quantum submission interface corresponding to the quantum task of the waiting queue.
9. A quantum computing-based multitask asynchronous scheduling device, comprising:
at least one processor; and the number of the first and second groups,
a memory communicatively coupled to the at least one processor; wherein,
the memory stores instructions executable by the at least one processor to cause the at least one processor to perform instructions for:
inquiring a plurality of quantum tasks in a quantum task table, and respectively acquiring the running states of the plurality of quantum tasks, wherein the running states comprise: waiting for queue, in-service, and completion of operation;
selecting the quantum task with the running state as the waiting queue from the plurality of quantum tasks, and acquiring a running carrier type corresponding to the quantum task of the waiting queue, wherein the running carrier type comprises: a real machine and a simulator;
calling a corresponding carrier resource table according to the type of the operation carrier, wherein the carrier resource table comprises: a real machine resource table and an analog machine resource table;
and acquiring a corresponding carrier number in the carrier resource table according to the type of the running carrier, and running the quantum task of the waiting queue in the carrier corresponding to the carrier number according to the carrier number.
10. A non-transitory computer storage medium storing computer-executable instructions, the computer-executable instructions configured to:
inquiring a plurality of quantum tasks in a quantum task table, and respectively acquiring the running states of the plurality of quantum tasks, wherein the running states comprise: waiting for queue, in-service, and completion of operation;
selecting the quantum task with the running state as the waiting queue from the plurality of quantum tasks, and acquiring a running carrier type corresponding to the quantum task of the waiting queue, wherein the running carrier type comprises: a real machine and a simulator;
calling a corresponding carrier resource table according to the type of the operation carrier, wherein the carrier resource table comprises: a real machine resource table and an analog machine resource table;
and acquiring a corresponding carrier number in the carrier resource table according to the type of the running carrier, and running the quantum task of the waiting queue in the carrier corresponding to the carrier number according to the carrier number.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111664912.5A CN114330732B (en) | 2021-12-30 | 2021-12-30 | Quantum computation-based multitasking asynchronous scheduling method, device and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111664912.5A CN114330732B (en) | 2021-12-30 | 2021-12-30 | Quantum computation-based multitasking asynchronous scheduling method, device and medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114330732A true CN114330732A (en) | 2022-04-12 |
| CN114330732B CN114330732B (en) | 2024-08-06 |
Family
ID=81021845
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111664912.5A Active CN114330732B (en) | 2021-12-30 | 2021-12-30 | Quantum computation-based multitasking asynchronous scheduling method, device and medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114330732B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180365585A1 (en) * | 2017-06-19 | 2018-12-20 | Rigetti & Co, Inc. | Distributed Quantum Computing System |
| WO2020108993A1 (en) * | 2018-11-29 | 2020-06-04 | International Business Machines Corporation | Co-scheduling quantum computing jobs |
| CN112214327A (en) * | 2020-10-23 | 2021-01-12 | 济南浪潮高新科技投资发展有限公司 | Quantum computer resource scheduling system and method based on quantum cloud platform |
| CN112596904A (en) * | 2020-12-25 | 2021-04-02 | 济南浪潮高新科技投资发展有限公司 | Quantum service resource calling optimization method based on quantum cloud platform |
| CN113010302A (en) * | 2021-02-02 | 2021-06-22 | 中国人民解放军战略支援部队信息工程大学 | Multi-task scheduling method and system under quantum-classical hybrid architecture and quantum computer system architecture |
| 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 |
-
2021
- 2021-12-30 CN CN202111664912.5A patent/CN114330732B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180365585A1 (en) * | 2017-06-19 | 2018-12-20 | Rigetti & Co, Inc. | Distributed Quantum Computing System |
| WO2020108993A1 (en) * | 2018-11-29 | 2020-06-04 | International Business Machines Corporation | Co-scheduling quantum computing jobs |
| CN112214327A (en) * | 2020-10-23 | 2021-01-12 | 济南浪潮高新科技投资发展有限公司 | Quantum computer resource scheduling system and method based on quantum cloud platform |
| CN112596904A (en) * | 2020-12-25 | 2021-04-02 | 济南浪潮高新科技投资发展有限公司 | Quantum service resource calling optimization method based on quantum cloud platform |
| CN113010302A (en) * | 2021-02-02 | 2021-06-22 | 中国人民解放军战略支援部队信息工程大学 | Multi-task scheduling method and system under quantum-classical hybrid architecture and quantum computer system architecture |
| 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 |
Non-Patent Citations (1)
| Title |
|---|
| 崔子嵬;王维语;翁文康;: "量子云计算平台的现状与发展", 信息通信技术与政策, no. 07, 15 July 2020 (2020-07-15) * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114330732B (en) | 2024-08-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108614726B (en) | Virtual machine creation method and device | |
| CN110008018A (en) | A kind of batch tasks processing method, device and equipment | |
| CN109725989B (en) | Task execution method and device | |
| JP2018515844A (en) | Data processing method and system | |
| CN112181378B (en) | Method and device for realizing business process | |
| CN103064955A (en) | Inquiry planning method and device | |
| CN115599764A (en) | Method, device and medium for migrating table data | |
| CN110764930A (en) | Request or response processing method and device based on message mode | |
| CN106462360B (en) | A kind of resource regulating method and relevant apparatus | |
| CN113377652A (en) | Test data generation method and device | |
| CN110837446A (en) | Equipment management method and device applied to embedded system, medium and embedded equipment | |
| CN114330732B (en) | Quantum computation-based multitasking asynchronous scheduling method, device and medium | |
| CN116737370A (en) | Multi-resource scheduling method, system, storage medium and terminal | |
| CN111176844A (en) | Real-time online batch optimization method and system for financial data | |
| CN114253845A (en) | Automatic testing method and device for special-shaped architecture integration system | |
| CN111984510B (en) | Performance test method and device for dispatching system | |
| CN115687310A (en) | Data cleaning method and device | |
| CN113359530A (en) | Sequence control method and device | |
| CN109299125B (en) | Database updating method and device | |
| CN113760524A (en) | Task execution method and device | |
| CN111353696A (en) | Resource pool scheduling method and device | |
| CN111158940A (en) | Method and device for docking and dynamically loading different devices in field of Internet of things | |
| CN112540842A (en) | Method and device for dynamically adjusting system resources | |
| CN110968370B (en) | Data processing method and device | |
| Hussain et al. | A novel approach of fair scheduling to enhance performance of hadoop distributed file system |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |