Resource scheduling method of quantum computing measurement and control system and quantum computer
By introducing resource managers and cache queues into the quantum computing measurement and control system, the resource conflict problem during multi-task execution is solved, and the parallel execution of tasks and efficiency improvements are achieved.
Patent Information
- Application Number
- CN202311123012.9
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2023-08-31
- Publication Date
- 2025-02-28
- Estimated Expiration
- 2043-08-31
AI Technical Summary
The existing quantum computing measurement and control systems are less efficient when performing quantum computing tasks, mainly due to resource conflicts when multiple tasks are executed simultaneously, resulting in low task execution efficiency.
A resource scheduling method for quantum computing measurement and control system is proposed. Through the resource manager, whether there is a resource conflict between the task to be executed and the task being executed. When there is a conflict, the task is placed in the cache queue. When there is no conflict, the task is allocated to the task thread and the occupancy state of the qubit is updated.
Through the task of managing resource conflicts in cache queues, the parallel execution of multiple quantum computing tasks is realized, and the execution efficiency of tasks in the quantum computing measurement and control system is improved.
Smart Images

Figure CN119539103A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of quantum computing technology, and in particular to a resource scheduling method for a quantum computing measurement and control system and a quantum computer. Background Art
[0002] Quantum computers are physical devices that follow the laws of quantum mechanics to perform high-speed mathematical and logical operations, store and process quantum information. The main characteristics of quantum computers are fast operation speed, strong information processing capabilities, and a wide range of applications. Compared with ordinary computers, the more information is processed, the more advantageous it is for quantum computers to perform operations, and the more accurate the operations can be.
[0003] Quantum chips are to quantum computers what CPUs are to traditional computers. Quantum chips are the core components of quantum computers. With the continuous advancement of research on quantum computing-related technologies, the number of quantum bits on quantum chips is also increasing year by year. It is foreseeable that larger-scale quantum chips will appear in the future, and the number of quantum bits in quantum chips will be greater, and quantum computers will also be equipped with larger-scale quantum chips.
[0004] For some quantum computers currently available on the market, most of them use a combination of a host computer, a quantum computing measurement and control system, and a quantum chip to implement some quantum computing tasks. Generally, the host computer receives the user's quantum computing task, processes the quantum computing task and forms a quantum circuit, and then maps the quantum circuit to the topological structure of the corresponding quantum chip. The quantum circuit contains the quantum gates required for this quantum computing task, the measurement operation of the final quantum computing result, and the timing of each operation. When the quantum computing measurement and control system receives the information contained in the quantum circuit, it will convert this information into corresponding instructions so that the corresponding hardware device can operate and complete the quantum computing task. Among them, the quantum computing measurement and control system includes a software system and a hardware system. The software system of the quantum computing measurement and control system is used to compile and process the user tasks (including but not limited to test tasks, calibration tasks and other measurement and control experiments) transmitted by the host computer, and convert the corresponding user tasks into a language that can be recognized by the hardware system, so that the hardware system generates corresponding control signals and achieves the purpose of operating and controlling the quantum chip. When the existing quantum computing measurement and control system executes quantum computing tasks, most of them are executed in sequence according to the order of the received quantum computing tasks. The efficiency of executing multiple quantum computing tasks according to this scheme is low.
[0005] Therefore, how to improve the execution efficiency of quantum computing tasks has become an urgent problem to be solved in this field.
[0006] It should be noted that the information disclosed in the background technology section of this application is only intended to deepen the understanding of the general background technology of this application, and should not be regarded as an admission or suggestion in any form that the information constitutes prior art already known to those skilled in the art. Summary of the invention
[0007] The purpose of the present invention is to provide a resource scheduling method for a quantum computing measurement and control system and a quantum computer, so as to solve the problem of low execution efficiency of quantum computing tasks in the prior art.
[0008] In order to solve the above technical problems, the present invention proposes a resource scheduling method for a quantum computing measurement and control system, comprising:
[0009] When receiving a quantum computing task to be executed, using a resource manager to determine whether there is a resource conflict between the quantum computing task to be executed and other quantum computing tasks being executed in the task thread, wherein the resource manager is used to reflect the occupation state of each quantum bit in the quantum chip, and the occupation state of the quantum bit includes an occupied state and an idle state;
[0010] When there is a resource conflict between the quantum computing task to be executed and other quantum computing tasks being executed in the task thread, placing the quantum computing task to be executed into a cache queue;
[0011] When there is no resource conflict between the quantum computing task to be executed and other quantum computing tasks being executed in the task thread, the quantum computing task to be executed is assigned to the task thread, and the occupation state of the quantum bits required by the quantum computing task to be executed is updated to an occupied state;
[0012] After the to-be-executed quantum computing task is completed, the occupation state of the quantum bits required for the to-be-executed quantum computing task is updated to an idle state.
[0013] Optionally, the method further comprises:
[0014] After the execution of the to-be-executed quantum computing task is completed, the first quantum computing task is preferentially obtained from the cache queue, the first quantum computing task is used as the to-be-executed quantum computing task, and the resource manager is used to determine whether there is a resource conflict between the to-be-executed quantum computing task and other quantum computing tasks being executed in the task thread.
[0015] Optionally, the method further comprises:
[0016] If there is no quantum computing task in the cache queue, after the to-be-executed quantum computing task is completed, a second quantum computing task is obtained from the task queue, and the second quantum computing task is used as the to-be-executed quantum computing task, wherein the task queue is a queue of several quantum computing tasks waiting to be executed, and the second quantum computing task is a task in the task queue.
[0017] Optionally, the number of tasks that can be accommodated in the cache queue is a fixed value.
[0018] Optionally, the number of tasks that can be accommodated in the cache queue is 5.
[0019] Optionally, the number of tasks that can be accommodated in the cache queue is adjusted according to the blocking time of the current task queue, wherein the task queue is a queue of several quantum computing tasks waiting to be executed.
[0020] Optionally, the number of tasks that can be accommodated in the cache queue is positively correlated with the blocking time of the current task queue.
[0021] Based on the same inventive concept, the present invention also proposes a resource scheduling device for a quantum computing measurement and control system, comprising:
[0022] The first module is used to, when receiving a quantum computing task to be executed, use a resource manager to determine whether there is a resource conflict between the quantum computing task to be executed and other quantum computing tasks being executed in the task thread, wherein the resource manager is used to reflect the occupation state of each quantum bit in the quantum chip, and the occupation state of the quantum bit includes an occupied state and an idle state;
[0023] The second module is used to put the quantum computing task to be executed into a cache queue when there is a resource conflict between the quantum computing task to be executed and other quantum computing tasks being executed in the task thread;
[0024] The third module is used to allocate the quantum computing task to be executed to the task thread when there is no resource conflict between the quantum computing task to be executed and other quantum computing tasks being executed in the task thread, and update the quantum bits required by the quantum computing task to be executed to an occupied state;
[0025] The fourth module is used to update the quantum bits required by the quantum computing task to be executed to an idle state after the execution of the quantum computing task to be executed is completed.
[0026] Based on the same inventive concept, the present invention also proposes a quantum computing measurement and control system, which performs resource scheduling using the resource scheduling method of the quantum computing measurement and control system described in any one of the above-mentioned feature descriptions.
[0027] Based on the same inventive concept, the present invention also proposes a quantum computer, including the quantum computing measurement and control system described in the above feature description.
[0028] Based on the same inventive concept, the present invention also proposes a readable storage medium on which a computer program is stored. When the computer program is executed by a processor, it can implement the resource scheduling method of the quantum computing and control system described in any one of the above-mentioned feature descriptions.
[0029] Compared with the prior art, the present invention has the following beneficial effects:
[0030] The present invention proposes a resource scheduling method for a quantum computing measurement and control system. When a quantum computing task to be executed is received, a resource manager is used to determine whether there is a resource conflict between the quantum computing task to be executed and other quantum computing tasks being executed in the task thread. When there is a resource conflict between the quantum computing task to be executed and other quantum computing tasks being executed in the task thread, the quantum computing task to be executed is placed in a cache queue. When there is no resource conflict between the quantum computing task to be executed and other quantum computing tasks being executed in the task thread, the quantum computing task to be executed is assigned to the task thread, and the occupation state of the quantum bits required for the quantum computing task to be executed is updated to an occupied state. After the execution of the quantum computing task to be executed is completed, the occupation state of the quantum bits required for the quantum computing task to be executed is updated to an idle state. The resource scheduling method for a quantum computing measurement and control system proposed in the present application determines, through a resource manager, whether there is a resource conflict between the quantum computing task to be executed and other quantum computing tasks being executed in the task thread. If there is a conflict, the conflicting task is placed in a cache queue. If there is no conflict, the quantum computing task to be executed is allocated to the task thread. This solution effectively solves the resource conflict problem that may occur when multiple tasks are to be solved at the same time, realizes the parallel execution of multiple quantum computing tasks, and effectively improves the execution efficiency of quantum computing tasks in the quantum computing measurement and control system.
[0031] The resource scheduling device of the quantum computing measurement and control system, the quantum computing measurement and control system, the quantum computer and the readable storage medium proposed in the present invention belong to the same inventive concept as the resource scheduling method of the quantum computing measurement and control system, and therefore have the same beneficial effects, which will not be elaborated here. BRIEF DESCRIPTION OF THE DRAWINGS
[0032] Figure 1 A schematic diagram of a process flow of a resource scheduling method for a quantum computing measurement and control system proposed in an embodiment of the present invention;
[0033] Figure 2This is a schematic diagram of the resource scheduling scheme when the quantum computing measurement and control system receives the first quantum computing task task0 in the task queue;
[0034] Figure 3 Schematic diagram of resource scheduling scheme when the quantum computing measurement and control system receives the second quantum computing task task1 in the task queue;
[0035] Figure 4 This is a schematic diagram of the resource scheduling scheme when the quantum computing measurement and control system receives the third quantum computing task task2 in the task queue;
[0036] Figure 5 Schematic diagram of resource scheduling scheme when the quantum computing measurement and control system receives the fourth quantum computing task task3 in the task queue;
[0037] Figure 6 This is a schematic diagram of the resource scheduling scheme of the quantum computing measurement and control system after the first quantum computing task task0 is completed;
[0038] Figure 7 This is a simplified schematic diagram of the structure of a resource scheduling device for a quantum computing measurement and control system proposed in an embodiment of the present invention. DETAILED DESCRIPTION
[0039] The specific implementation of the present invention will be described in more detail below in conjunction with the schematic diagram. The advantages and features of the present invention will become clearer from the following description and claims. It should be noted that the drawings are all in a very simplified form and are not in exact proportions, and are only used to facilitate and clearly assist in explaining the purpose of the embodiments of the present invention.
[0040] In the description of the present invention, it is necessary to understand that the terms "center", "up", "down", "left", "right", etc. indicate directions or positional relationships based on the directions or positional relationships shown in the accompanying drawings, and are only for the convenience of describing the present invention and simplifying the description, rather than indicating or implying that the device or element referred to must have a specific direction, be constructed and operated in a specific direction, and therefore cannot be understood as a limitation on the present invention.
[0041] In addition, the terms "first" and "second" are used for descriptive purposes only and should not be understood as indicating or implying relative importance or implicitly indicating the number of the indicated technical features. Therefore, the features defined as "first" and "second" may explicitly or implicitly include one or more of the features. In the description of the present invention, the meaning of "plurality" is at least two, such as two, three, etc., unless otherwise clearly and specifically defined.
[0042] Please refer to Figure 1 The embodiment of the present invention provides a resource scheduling method for a quantum computing measurement and control system, comprising:
[0043] S100: When receiving a quantum computing task to be executed, using a resource manager to determine whether there is a resource conflict between the quantum computing task to be executed and other quantum computing tasks being executed in the task thread, wherein the resource manager is used to reflect the occupation state of each quantum bit in the quantum chip, and the occupation state of the quantum bit includes an occupied state and an idle state;
[0044] S200: When there is a resource conflict between the quantum computing task to be executed and other quantum computing tasks being executed in the task thread, the quantum computing task to be executed is placed into a cache queue;
[0045] S300: When there is no resource conflict between the quantum computing task to be executed and other quantum computing tasks being executed in the task thread, the quantum computing task to be executed is assigned to the task thread, and the occupation state of the quantum bits required by the quantum computing task to be executed is updated to an occupied state;
[0046] S400: After the execution of the to-be-executed quantum computing task is completed, the occupation state of the quantum bits required for the to-be-executed quantum computing task is updated to an idle state.
[0047] The difference from the prior art is that the present invention proposes a resource scheduling method for a quantum computing measurement and control system. When a quantum computing task to be executed is received, a resource manager is used to determine whether there is a resource conflict between the quantum computing task to be executed and other quantum computing tasks being executed in the task thread. When there is a resource conflict between the quantum computing task to be executed and other quantum computing tasks being executed in the task thread, the quantum computing task to be executed is placed in a cache queue. When there is no resource conflict between the quantum computing task to be executed and other quantum computing tasks being executed in the task thread, the quantum computing task to be executed is assigned to the task thread, and the occupation state of the quantum bits required for the quantum computing task to be executed is updated to an occupied state. After the execution of the quantum computing task to be executed is completed, the occupation state of the quantum bits required for the quantum computing task to be executed is updated to an idle state. The resource scheduling method of the quantum computing measurement and control system proposed in this application determines whether there is a resource conflict between the quantum computing task to be executed and other quantum computing tasks being executed in the task thread through the resource manager. When there is a conflict, the conflicting task is placed in the cache queue. When there is no conflict, the quantum computing task to be executed is assigned to the task thread. This solution effectively solves the resource conflict problem that may occur when multiple tasks are to be solved at the same time, realizes the parallel execution of multiple quantum computing tasks, and effectively improves the execution efficiency of quantum computing tasks in the quantum computing measurement and control system. Through the above scheme, the quantum computing measurement and control system can solve resource conflicts and realize multi-threaded parallel execution as much as possible. When there is a resource conflict between quantum computing tasks, only tasks that do not conflict with the currently available quantum bit resources will be assigned to the idle thread for execution, which can maximize the efficiency of concurrent execution and ensure that quantum computing tasks without resource conflicts can be executed in parallel.
[0048] It can be understood by those skilled in the art that the occupancy state of the quantum bit mentioned here is mainly used to distinguish the usage of the quantum bit. For example, in practical applications, we can use specific characters to represent "occupied state" and "idle state" respectively. For example, 1 can be used to represent "occupied state" and 0 can be used to represent "idle state". Figure 2 Taking the quantum chip shown as an example, assuming that the quantum bit Q0 is currently executing a quantum computing task, then the quantum bit Q0 in the first state list is 1, and the quantum bit Q4 is not executing a quantum computing task, then the quantum bit Q4 in the first state list is 0. In addition to the solutions given in the above examples, in other embodiments, other solutions can also be used to distinguish the usage of quantum bits, which will not be described one by one here.
[0049] Specifically, in this embodiment, the resource scheduling method of the quantum computing measurement and control system further includes:
[0050] After the execution of the to-be-executed quantum computing task is completed, the first quantum computing task is preferentially obtained from the cache queue, the first quantum computing task is used as the to-be-executed quantum computing task, and the resource manager is used to determine whether there is a resource conflict between the to-be-executed quantum computing task and other quantum computing tasks being executed in the task thread.
[0051] The cache queue proposed in the present application solution can allow more quantum computing tasks to be executed concurrently. If there is no cache queue, assuming that the first task is being executed in the thread, there are also second and third tasks in the task queue waiting for the thread to be assigned. If there is no cache queue, then once there is a resource conflict between the second task and the first task, we have two options to choose from. The first is to wait for the first task to be executed before the second task can be put into the thread for execution. This solution is the least efficient. The second is to put the second task into the task queue and let it continue to queue. We put the third task into the thread again in the task queue for execution. Although this solution is more efficient than the first solution, it will cause a waste of computing resources of the quantum computing measurement and control system because the second task will be put back into the task queue and will continue to be repeatedly traversed. The cache queue of the present application can effectively solve the above problems. The cache queue is used to temporarily store quantum computing tasks with resource conflicts. This solution quantum computing measurement and control system does not need to wait or repeat the task in the task queue, which effectively improves the utilization of resources and improves the execution efficiency of quantum computing tasks.
[0052] Specifically, in this embodiment, the resource scheduling method of the quantum computing measurement and control system further includes:
[0053] If there is no quantum computing task in the cache queue, after the to-be-executed quantum computing task is completed, a second quantum computing task is obtained from the task queue, and the second quantum computing task is used as the to-be-executed quantum computing task, wherein the task queue is a queue of several quantum computing tasks waiting to be executed, and the second quantum computing task is a task in the task queue.
[0054] In this embodiment, a threshold upper limit can be set for the number of tasks that can be accommodated in the cache queue. If it is not set, the following risks may occur. First, if the cache queue can grow indefinitely, it will occupy more and more memory resources. If the memory resources are not enough to accommodate the infinitely growing cache queue, a memory overflow error will occur, causing the system to crash or become unavailable. Secondly, if the cache queue has no upper limit and there are too many tasks in the cache queue, some quantum computing tasks may take a long time to be executed. Finally, in the case where there is no upper limit to the cache queue, some tasks will occupy resources for a long time, while other tasks cannot be executed, which will lead to unfair resource allocation and may cause some tasks to fail to be completed in time, affecting the overall performance and efficiency of the system. In this embodiment, the number of tasks that can be accommodated in the cache queue is a fixed value. Specifically, the number of tasks that can be accommodated in the cache queue can be set to 5. It can be understood by those skilled in the art that in other embodiments, the number of tasks that can be accommodated in the cache queue can also be set to other values, which will not be repeated here.
[0055] It should be noted that when all the tasks in the cache queue are full and are "mutually exclusive" tasks (that is, there are resource conflicts between them), the tasks in the task queue still conflict with the tasks in the cache queue, and the tasks at this time will be blocked. Assume that the upper limit of the tasks that can be accommodated in the cache queue is 5. At this time, all the tasks that require quantum bit Q0 are already stored, and there are 5 tasks in front of the task queue that require Q0. At this time, after the resource manager detects the conflict, it can no longer put the Q0 task into the cache queue, so the entire system will be blocked and waiting. Assume that at this time it is found that there are still tasks in the task queue that require quantum bits Q7, Q1, Q2, and Q3. They can be executed normally. If they are blocked at this time, the resource utilization of the system will be reduced. In order to solve this special situation, this application also proposes a strategy for dynamically adjusting the length of tasks that can be accommodated in the cache queue. We set a time threshold for the blocked task. When the task is detected to be blocked and exceeds this time threshold, we dynamically expand the length of the cache queue. In this way, the 5 Q0 tasks in the task queue will be placed in the cache queue, and the subsequent Q7, Q1, Q2, and Q3 tasks can also be executed smoothly.
[0056] Specifically, in this embodiment, the number of tasks that can be accommodated in the cache queue is adjusted according to the blocking time of the current task queue, wherein the task queue is a queue of several quantum computing tasks waiting to be executed.
[0057] Specifically, in this embodiment, the number of tasks that can be accommodated in the cache queue is positively correlated with the blocking time of the current task queue.
[0058] Specifically, in this embodiment, the resource manager also includes a second state list for reflecting the occupancy status of each thread in the task thread, and the occupancy status of the thread includes an occupied state and an idle state. When there is no resource conflict between the quantum computing task to be executed and other quantum computing tasks being executed in the task thread, the quantum computing task to be executed is assigned to the thread in the idle state, and the occupancy status of the thread occupied by the quantum computing task to be executed is updated to the occupied state. After the execution of the quantum computing task to be executed is completed, the occupancy status of the thread occupied by the quantum computing task to be executed is updated to the idle state. Similar to the occupancy status of quantum bits, those skilled in the art can understand that the occupancy status of the thread mentioned here is mainly used to distinguish the usage of the thread. For example, in actual applications, we can use specific characters to represent "occupied state" and "idle state" respectively. For example, 1 can be used to represent "occupied state" and 0 can be used to represent "idle state". Figure 2 For example, assuming that thread Thread0 is currently executing a quantum computing task, then thread Thread0 in the second state list is 1, and thread Thread1 is not executing a quantum computing task, then thread Thread1 in the second state list is 0. In addition to the solutions given in the above examples, in other embodiments, other solutions can be used to distinguish the usage of threads, which will not be described one by one here.
[0059] The following is a brief description of the solution of the present application with an example. Assume that the structure of the quantum chip in the quantum computer is as follows: Figure 2-6 As shown in the structure, the quantum chip includes 24 quantum bits, and the task thread of the quantum computing measurement and control system supports 5 threads running simultaneously.
[0060] Please refer to Figure 2 , the quantum computing measurement and control system receives the first quantum computing task task0 in the task queue. We assume that the quantum bits required by task0 are Q0, Q1, Q2, Q3, Q6, Q7, Q8, and Q9. According to the results displayed by the resource manager, these 8 quantum bits are all idle, so they can be used directly. The status of quantum bits Q0, Q1, Q2, Q3, Q6, Q7, Q8, and Q9 is adjusted from "idle" to "occupied". There is currently an idle thread, so the status of thread Thread0 is adjusted from "idle" to "occupied". Please refer to Figure 3During the execution of the first quantum computing task task0, the quantum computing control system receives the second quantum computing task task1 in the task queue. The quantum bits required by task1 are Q15, Q16, Q17, Q21, Q22, and Q23. The resource manager shows that there is no resource conflict between these six quantum bits and task0, and there is currently an idle thread. The state of thread Thread1 is adjusted from "idle" to "occupied". Please refer to Figure 4 , the resource manager finds that the next quantum computing task task2 in the task queue has a resource conflict with task0. Task2 requires quantum bits Q6, Q7, Q12, Q13, Q18, and Q19. At this time, task0 has not been completed, so it cannot be assigned to the task thread. At this time, task2 is placed in the cache queue. Please refer to Figure 5 , continue to traverse other quantum computing tasks in the task queue. The next quantum computing task task3 in the task queue requires quantum bits Q4 and Q5. There is no resource conflict between task3 and task0 and task1. The status of quantum bits Q4 and Q5 is adjusted from "idle" to "occupied". There is an idle thread at present. The status of thread Thread2 is adjusted from "idle" to "occupied". Please refer to Figure 6 , assuming that at this time, task0 in thread Thread0 has been executed, then the status of quantum bits Q0, Q1, Q2, Q3, Q6, Q7, Q8, and Q9 will be adjusted from "occupied state" to "idle state", and the execution thread will notify the resource manager. The resource manager will suspend the traversal of the task queue and start traversing the cache queue. At this time, there is no resource conflict problem for task2, and task2 can be put from the cache queue to thread Thread3 for continued execution.
[0061] Based on the same invention concept, please refer to Figure 7 The present invention also proposes a resource scheduling device for a quantum computing measurement and control system, comprising:
[0062] The first module 100 is used to determine, when receiving a quantum computing task to be executed, whether there is a resource conflict between the quantum computing task to be executed and other quantum computing tasks being executed in the task thread by using a resource manager, wherein the resource manager is used to reflect the occupation state of each quantum bit in the quantum chip, and the occupation state of the quantum bit includes an occupied state and an idle state;
[0063] The second module 200 is used to put the quantum computing task to be executed into a cache queue when there is a resource conflict between the quantum computing task to be executed and other quantum computing tasks being executed in the task thread;
[0064] The third module 300 is used to allocate the quantum computing task to be executed to the task thread when there is no resource conflict between the quantum computing task to be executed and other quantum computing tasks being executed in the task thread, and update the quantum bits required by the quantum computing task to be executed to an occupied state;
[0065] The fourth module 400 is used to update the quantum bits required by the quantum computing task to be executed to an idle state after the execution of the quantum computing task to be executed is completed.
[0066] It can be understood that the first module 100, the second module 200, the third module 300 and the fourth module 400 can be combined in one device, or any one of the modules can be split into multiple sub-modules, or at least part of the functions of one or more of the first module 100, the second module 200, the third module 300 and the fourth module 400 can be combined with at least part of the functions of other modules and implemented in one functional module. According to an embodiment of the present invention, at least one of the first module 100, the second module 200, the third module 300 and the fourth module 400 can be at least partially implemented as a hardware circuit, such as a field programmable gate array (FPGA), a programmable logic array (PLA), a system on a chip, a system on a substrate, a system on a package, an application specific integrated circuit (ASIC), or can be implemented in hardware or firmware in any other reasonable way of integrating or packaging the circuit, or in a suitable combination of software, hardware and firmware. Alternatively, at least one of the first module 100, the second module 200, the third module 300 and the fourth module 400 may be at least partially implemented as a computer program module, and when the program is executed by a computer, the function of the corresponding module may be executed.
[0067] Based on the same inventive concept, the present invention also proposes a quantum computing measurement and control system, which performs resource scheduling using the resource scheduling method of the quantum computing measurement and control system described in any one of the above-mentioned feature descriptions.
[0068] Based on the same inventive concept, the present invention also proposes a quantum computer, including the quantum computing measurement and control system described in the above feature description.
[0069] Based on the same inventive concept, the present invention also proposes a readable storage medium on which a computer program is stored. When the computer program is executed by a processor, it can implement the resource scheduling method of the quantum computing and control system described in any one of the above-mentioned feature descriptions.
[0070] The readable storage medium can be a tangible device that can keep and store the instructions used by the instruction execution device, such as but not limited to an electrical storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device or any suitable combination of the above. The more specific example (non-exhaustive list) of the readable storage medium includes: a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a static random access memory (SRAM), a portable compact disk read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanical encoding device, such as a punch card or a convex structure in a groove on which instructions are stored, and any suitable combination of the above. The computer program described here can be downloaded from the readable storage medium to each computing / processing device, or downloaded to an external computer or external storage device through a network, such as the Internet, a local area network, a wide area network and / or a wireless network. The network can include copper transmission cables, optical fiber transmission, wireless transmission, routers, firewalls, switches, gateway computers and / or edge servers. The network adapter card or network interface in each computing / processing device receives the computer program from the network and forwards the computer program for storage in a readable storage medium in each computing / processing device. The computer program for performing the operation of the present invention may be an assembly instruction, an instruction set architecture (ISA) instruction, a machine instruction, a machine-dependent instruction, a microcode, a firmware instruction, a state setting data, or a source code or object code written in any combination of one or more programming languages, including object-oriented programming languages such as Smalltalk, C++, etc., and conventional procedural programming languages such as "C" language or similar programming languages. The computer program may be executed entirely on the user's computer, partially on the user's computer, as an independent software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., using an Internet service provider to connect through the Internet). In some embodiments, by utilizing the state information of a computer program to personalize an electronic circuit, such as a programmable logic circuit, a field programmable gate array (FPGA), or a programmable logic array (PLA), the electronic circuit can execute computer-readable program instructions to implement various aspects of the present invention.
[0071] Here, various aspects of the present invention are described with reference to the flowchart and / or block diagram of the method, system and computer program product according to the embodiment of the present invention. It should be understood that each square frame of the flowchart and / or block diagram and the combination of the square frames in the flowchart and / or block diagram can be realized by a computer program. These computer programs can be provided to the processor of a general-purpose computer, a special-purpose computer or other programmable data processing device, so as to produce a machine, so that these programs, when executed by the processor of a computer or other programmable data processing device, produce a device for realizing the function / action specified in one or more square frames in the flowchart and / or block diagram. These computer programs can also be stored in a readable storage medium, and these computer programs make the computer, programmable data processing device and / or other equipment work in a specific way, so that the readable storage medium storing the computer program includes a manufactured product, which includes instructions for realizing various aspects of the function / action specified in one or more square frames in the flowchart and / or block diagram.
[0072] The computer program may also be loaded onto a computer, other programmable data processing apparatus, or other device so that a series of operational steps are executed on the computer, other programmable data processing apparatus, or other device to produce a computer-implemented process, thereby causing the computer program executed on the computer, other programmable data processing apparatus, or other device to implement the functions / actions specified in one or more boxes in the flowchart and / or block diagram.
[0073] In the description of this specification, the description with reference to the terms "one embodiment", "some embodiments", "example" or "specific example" etc. means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present invention. In this specification, the schematic representations of the above terms do not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described may be combined in any one or more embodiments in a suitable manner. In addition, those skilled in the art may combine and combine different embodiments or examples described in this specification.
[0074] The above is only a preferred embodiment of the present invention and does not limit the present invention in any way. Any technician in the relevant technical field, without departing from the scope of the technical solution of the present invention, makes any form of equivalent replacement or modification to the technical solution and technical content disclosed in the present invention, which does not depart from the content of the technical solution of the present invention and still falls within the protection scope of the present invention.
Claims
1. A resource scheduling method for a quantum computing measurement and control system, characterized in that: include: When receiving a quantum computing task to be executed, using a resource manager to determine whether there is a resource conflict between the quantum computing task to be executed and other quantum computing tasks being executed in the task thread, wherein the resource manager is used to reflect the occupation state of each quantum bit in the quantum chip, and the occupation state of the quantum bit includes an occupied state and an idle state; When there is a resource conflict between the quantum computing task to be executed and other quantum computing tasks being executed in the task thread, placing the quantum computing task to be executed into a cache queue; When there is no resource conflict between the quantum computing task to be executed and other quantum computing tasks being executed in the task thread, the quantum computing task to be executed is assigned to the task thread, and the occupation state of the quantum bits required by the quantum computing task to be executed is updated to an occupied state; After the to-be-executed quantum computing task is completed, the occupation state of the quantum bits required for the to-be-executed quantum computing task is updated to an idle state.
2. The method according to claim 1, characterized in that The method further comprises: After the execution of the to-be-executed quantum computing task is completed, the first quantum computing task is preferentially obtained from the cache queue, the first quantum computing task is used as the to-be-executed quantum computing task, and the resource manager is used to determine whether there is a resource conflict between the to-be-executed quantum computing task and other quantum computing tasks being executed in the task thread.
3. The method according to claim 2, characterized in that The method further comprises: If there is no quantum computing task in the cache queue, after the to-be-executed quantum computing task is completed, a second quantum computing task is obtained from the task queue, and the second quantum computing task is used as the to-be-executed quantum computing task, wherein the task queue is a queue of several quantum computing tasks waiting to be executed, and the second quantum computing task is a task in the task queue.
4. The method according to claim 1, characterized in that The number of tasks that can be accommodated in the cache queue is a fixed value.
5. The method according to claim 1, characterized in that The number of tasks that can be accommodated in the cache queue is 5.
6. The method according to claim 1, characterized in that The number of tasks that can be accommodated in the cache queue is adjusted according to the blocking time of the current task queue, wherein the task queue is a queue of several quantum computing tasks waiting to be executed.
7. The method according to claim 6, characterized in that The number of tasks that can be accommodated in the cache queue is positively correlated with the blocking time of the current task queue.
8. A resource scheduling device for a quantum computing measurement and control system, characterized in that: include: The first module is used to, when receiving a quantum computing task to be executed, use a resource manager to determine whether there is a resource conflict between the quantum computing task to be executed and other quantum computing tasks being executed in the task thread, wherein the resource manager is used to reflect the occupation state of each quantum bit in the quantum chip, and the occupation state of the quantum bit includes an occupied state and an idle state; The second module is used to put the quantum computing task to be executed into a cache queue when there is a resource conflict between the quantum computing task to be executed and other quantum computing tasks being executed in the task thread; The third module is used to allocate the quantum computing task to be executed to the task thread when there is no resource conflict between the quantum computing task to be executed and other quantum computing tasks being executed in the task thread, and update the quantum bits required by the quantum computing task to be executed to an occupied state; The fourth module is used to update the quantum bits required by the quantum computing task to be executed to an idle state after the execution of the quantum computing task to be executed is completed.
9. A quantum computing measurement and control system, characterized in that: Resource scheduling is performed using the resource scheduling method for a quantum computing measurement and control system described in any one of claims 1 to 7.
10. A quantum computer, characterized in that: Including the quantum computing measurement and control system as described in claim 9.
11. A readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, it can implement the resource scheduling method of the quantum computing measurement and control system described in any one of claims 1 to 7.
Citation Information
Patent Citations
Method and device for managing effectiveness of information processing task
CN110807047A
Access control method of scalar processing unit and scalar processing unit
CN115129480A
Scheduling device and method of quantum control system and quantum computer
CN115469979A
Server system of quantum computer and implementation method thereof
CN115470915A
Method and apparatus for managing effectiveness of information processing task
EP3598302A1