Quantum computing task scheduling system, execution system, and quantum computer

Abstract

This application discloses a quantum computing task scheduling system, execution system, and quantum computer, belonging to the field of quantum computing technology. A resource manager is used to cache the bit resource information of the quantum chip and verify the tasks to be executed based on their task resource information and bit resource information. A database has a first task queue and a second task queue. The first task queue stores tasks to be executed, and the second task queue stores the quantum execution tasks obtained after compiling the tasks to be executed. A scheduler has a third task queue, used to retrieve quantum execution tasks from the second task queue and store them in the third task queue, or to store tasks to be executed under compilation in the third task queue, and to schedule the tasks in the third task queue based on the verification results. This application improves task execution efficiency, reduces the waiting time of qubits on the quantum chip, and improves the resource utilization of the quantum chip.

Description

Technical Field

[0001] This application relates to the field of quantum computing technology, and in particular to a quantum computing task scheduling system, execution system and quantum computer. Background Technology

[0002] A quantum computer is a physical device that performs high-speed mathematical and logical operations, stores and processes quantum information, following the laws of quantum mechanics. The main characteristics of quantum computers include high operating speed, strong information processing capabilities, and a wide range of applications. Compared to conventional computers, the greater the amount of information processed, the more advantageous it is for quantum computers to perform calculations, and the more accurately the calculations can be ensured.

[0003] Quantum chips are to quantum computers what CPUs are to traditional computers; they are the core components of quantum computers. As research into quantum computing technologies continues to advance, the number of qubits on quantum chips is increasing year by year. It is foreseeable that larger-scale quantum chips will emerge in the future, containing even more qubits, and quantum computers will be equipped with even larger-scale quantum chips.

[0004] Most existing quantum computers on the market employ a combination of a host computer, a quantum computing control system, and quantum chips to perform quantum computing tasks. Typically, the host computer receives the user's quantum computing task, processes it, and forms a quantum circuit. This quantum circuit is then mapped onto the topology of the corresponding quantum chip. The quantum circuit contains the quantum gates required for the task, the measurement operations for the final quantum computing result, and the timing sequence of each operation. Upon receiving this information from the quantum circuit, the quantum computing control system converts it into corresponding instructions to enable the relevant hardware devices to operate and complete the quantum computing task.

[0005] 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 user tasks (including but not limited to test tasks, calibration tasks and other measurement and control experiments) sent from the host computer, and to convert the corresponding user tasks into a language that the hardware system can recognize, so that the hardware system can generate corresponding control signals to achieve the purpose of operating and controlling the quantum chip.

[0006] Existing quantum computing measurement and control systems mostly execute quantum computing tasks by compiling them sequentially according to the order in which they are received, and then sending them out for execution after compilation. This approach is inefficient when executing multiple quantum computing tasks and greatly reduces the resource utilization of quantum chips.

[0007] Therefore, improving the execution efficiency of quantum computing tasks and the resource utilization of quantum chips has become an urgent problem to be solved in this field.

[0008] It should be noted that the information disclosed in the background section of this application is intended only to enhance the understanding of the general background of this application, and should not be construed as an admission or in any way implying that the information constitutes prior art known to those skilled in the art. Summary of the Invention

[0009] The purpose of this application is to provide a quantum computing task scheduling system, execution system, and quantum computer to solve the problems of low execution efficiency of quantum computing tasks and low resource utilization on quantum chips in the prior art, thereby greatly improving execution efficiency and resource utilization on quantum chips.

[0010] To solve the above technical problems, the technical solution of this application is as follows:

[0011] The first aspect of this application provides a quantum computing task scheduling system, the system comprising:

[0012] The resource manager is used to cache the bit resource information of the quantum chip and to verify the task to be executed based on the task resource information and the bit resource information.

[0013] The database has a first task queue and a second task queue; wherein the first task queue is used to store tasks to be executed, and the second task queue is used to store quantum execution tasks obtained by compiling the tasks to be executed.

[0014] The scheduler has a preset third task queue, which is used to obtain quantum execution tasks from the second task queue and store them in the third task queue or to store tasks to be executed during compilation in the third task queue, and to schedule the tasks in the third task queue according to the verification results.

[0015] In the quantum computing task scheduling system described above, optionally, the length of the third task queue has a first preset threshold. When the number of tasks to be executed in the first task queue is less than the preset threshold, the scheduler is used to store the tasks in the first task queue that are being compiled into the third task queue.

[0016] In the quantum computing task scheduling system described above, optionally, when the number of tasks to be executed in the first task queue is greater than the first preset threshold, the scheduler is used to obtain quantum execution tasks from the second task queue and store them in the third task queue.

[0017] In the quantum computing task scheduling system described above, optionally, the second task queue length has a second preset threshold. When the number of tasks in the second task queue is less than the second preset threshold, the scheduler is further used to detect whether the type of tasks in the first task queue matches the working mode of the quantum computing task scheduling system.

[0018] In the quantum computing task scheduling system described above, optionally, the resource manager includes:

[0019] A quantum resource counter is used to acquire the bit resource information of the quantum chip and the task bit information for executing the task, and to update the bit resource information based on the task bit information;

[0020] The task execution verifier is used to verify the task resource information of the task to be executed based on the current bit resource information of the quantum chip, so as to verify whether the current bit resource information meets the task resource information.

[0021] The quantum computing task scheduling system described above may optionally also include a buffer for caching task information for all tasks, as well as a queue of tasks retrieved from the first task queue, the second task queue, and the third task queue.

[0022] In the quantum computing task scheduling system described above, optionally, the buffer includes:

[0023] The task object cache is used to cache task information for all registered tasks to be executed.

[0024] The task queue cache is used to arrange and cache tasks in the first task queue, the second task queue, and the third task queue according to the registration time and expected time of all tasks.

[0025] A second aspect of this application provides a quantum computing task execution system, comprising:

[0026] Quantum computing task scheduling system as described in any of the first aspects above;

[0027] The task dispatch module is used to register the received tasks to be executed to the first task queue in the database;

[0028] The task compilation module is used to compile the tasks to be executed in the first task queue and store the compiled quantum execution tasks in the second task queue of the database.

[0029] In the quantum computing task execution system described above, optionally, the task compilation module is used to send the status information and compilation completion information of the task to be executed to the quantum computing task scheduling system when compiling the task to be executed;

[0030] The quantum computing task scheduling system is used to retrieve tasks and store them in the third task queue based on the status information and compilation completion information.

[0031] A third aspect of this application provides a quantum computer, including a quantum computing measurement and control system and a quantum chip. The quantum computing measurement and control system employs a quantum computing task scheduling system as described in any of the first aspects above, or a quantum computing task execution system as described in any of the second aspects above, to control the quantum chip to execute quantum computing tasks. Compared with the prior art, this application has the following advantages:

[0032] In the quantum computing task scheduling system of this application, a resource manager is used to cache the bit resource information of the quantum chip, and the task to be executed is verified based on the task resource information and bit resource information to determine whether it can be executed. Then, the first task queue and the second task queue in the database are used to store the task to be executed and the quantum execution task obtained after compiling the task to be executed, respectively. Then, the scheduler selects the task to be executed that is being compiled or the quantum execution task obtained after compilation and stores it in the third task queue as the task to be scheduled, according to the number of tasks to be executed. When the number of tasks to be executed is large, the quantum execution task is selected, and when the number of tasks to be executed is small, the task to be executed that is being compiled is selected. Finally, the tasks in the third task queue are scheduled, which improves the execution efficiency of the task, reduces the waiting time of the qubits on the quantum chip, and improves the resource utilization of the qubits on the quantum chip.

[0033] The quantum computing task execution system and quantum computer proposed in this application belong to the same concept as the quantum computing task scheduling system, and therefore have the same beneficial effects, which will not be elaborated here. Attached Figure Description

[0034] Figure 1 This is a schematic diagram illustrating the structure of a quantum computing task scheduling system as exemplified by an embodiment of this application;

[0035] Figure 2 This is a schematic diagram of the structure of a quantum computing task execution system as an example of an embodiment of this application. Detailed Implementation

[0036] The specific embodiments of this application will be described in more detail below with reference to the schematic diagrams. The advantages and features of this application will become clearer from the following description and claims. It should be noted that the drawings are all in a very simplified form and use non-precise proportions, and are only used to facilitate and clarify the illustration of the embodiments of this application.

[0037] In the description of this application, it should be understood that the terms "center", "upper", "lower", "left", "right", etc., indicate the orientation or positional relationship based on the orientation or positional relationship shown in the accompanying drawings. They are used only for the convenience of describing this application and simplifying the description, and do not indicate or imply that the device or element referred to must have a specific orientation, or be constructed and operated in a specific orientation. Therefore, they should not be construed as limitations on this application.

[0038] Furthermore, the terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of that feature. In the description of this application, "multiple" means at least two, such as two, three, etc., unless otherwise explicitly specified.

[0039] A quantum computer comprises a quantum chip, a quantum computing measurement and control system, and a measurement and control link connecting the quantum chip and the quantum computing measurement and control system. The quantum computing measurement and control system includes hardware devices (a quantum measurement and control integrated machine) and software systems (quantum measurement and control software). The hardware devices include various signal sources, signal acquisition devices, and other electronic equipment. These electronic devices can output various control signals to the quantum chip and can also acquire and process the signals output by the quantum chip. The software system is the functional software loaded in a classical computer. The functional software is used to drive and schedule the hardware devices. These operations are determined according to the specific task to be executed, converting various task requirements into specific operation instructions, and controlling the output and acquisition of the hardware devices through these operation instructions.

[0040] The quantum measurement and control integrated machine is equipped with many task threads, each of which executes a quantum computing task. Each task thread is implemented by several output channels to enable multiple tasks to be performed in parallel or asynchronously. The control and scheduling of the multi-threading are implemented by the software system.

[0041] The quantum computing task scheduling system in this embodiment belongs to the quantum measurement and control software system. It is used to receive various task requirements from users and to compile and schedule various tasks. Typically, a task to be executed is scheduled after it has been compiled, and the compilation time is related to the complexity of the task to be executed. During scheduling, multi-threaded scheduling can be implemented to ensure the parallelism of multiple tasks.

[0042] Quantum chips integrate a large number of qubits. When there are few tasks to be executed and compilation is time-consuming, the qubits on the quantum chip may remain idle until the tasks are compiled, scheduled, and sent to the quantum chip, resulting in wasted qubit resources. This embodiment provides a quantum computing task scheduling system that can schedule tasks not only after compilation is complete but also during the compilation process, thus significantly improving the utilization rate of qubits on the quantum chip.

[0043] like Figure 1 As shown, this embodiment provides a quantum computing task scheduling system, which includes: a resource manager, a database, and a scheduler. Specifically, the resource manager is used to cache the bit resource information of the quantum chip and to verify the task to be executed based on the task resource information and bit resource information of the task to be executed. The database has a first task queue and a second task queue. The first task queue is used to store the task to be executed, and the second task queue is used to store the quantum execution task obtained after compiling the task to be executed. The scheduler has a third task queue, which is used to obtain the quantum execution task from the second task queue and store it in the third task queue or to store the task to be executed under compilation in the third task queue, and to schedule the tasks in the third task queue based on the verification result.

[0044] A quantum chip integrates multiple qubits for performing quantum computing tasks. A qubit currently performing a task is considered to be in a working state, while a qubit not currently performing a task is considered to be in an idle state, ready to perform tasks. Furthermore, idle qubits adjacent to or related to the currently performing qubit, but affected by environmental factors such as crosstalk, can be defined as having an environmental state. The environmental state of a bit is associated with its task state; that is, each task bit has a corresponding environmental bit. The relationship between task bits and environmental bits is determined by the user based on each task to be executed, and the environmental state information is sent along with the task information.

[0045] For each quantum chip, its bit resource information can be obtained, which represents the number of qubits on the quantum chip, the layout and connection relationship of the qubits, the state of each qubit, and the number of qubits in the same state. For each task to be executed, the number of qubits required, the qubit connection relationship, the duration of the task, and the task state information are also determined, and this information serves as the task resource information for each task.

[0046] Understandably, if a task to be executed is to be issued, the bit resource information of the current quantum chip needs to meet the task resource information of that task. Therefore, before the task is issued, each task to be executed needs to be verified. These verification tasks are implemented by the resource manager in the system.

[0047] In addition, a database is provided, which includes a first task queue and a second task queue, both used to store tasks. Specifically, the first task queue stores received tasks to be executed. These tasks cannot be directly sent to the hardware system at this stage and require compilation. The second task queue stores the quantum execution tasks obtained after compiling the tasks. After compilation, the tasks generate various control instructions, which the hardware system uses to respond and output drive signals to the quantum chip to execute the tasks. Each of the first, second, and third task queues has a length, representing the maximum number of tasks it can store.

[0048] A quantum chip integrates many qubits and can run multiple quantum computing tasks simultaneously. The hardware and software devices are equipped with multiple task threads, each of which can be used to execute one task. The compiled tasks stored in the second task queue need to be scheduled to determine the corresponding task thread. Thread scheduling is performed by the scheduler.

[0049] Specifically, the scheduler has a pre-defined third task queue. All tasks in the third task queue are schedulable, and scheduling is based on the verification results from the resource manager. The tasks in the third task queue include both quantum execution tasks obtained after compilation from the second task queue and tasks that are still being compiled and are yet to be executed, taken from the first task queue.

[0050] It should be added that when the task compilation module compiles the task to be executed, it is divided into three stages: loading the task, parsing the task, and parallel compilation. In this embodiment, the parallel compilation stage is completed after the task is compiled, and the parallel compilation stage begins after the parsing task is completed.

[0051] In this process, "compiled" indicates that the task is ready to run, while "compiling" means that the task has not yet been compiled. For tasks in the second task queue that have been compiled, the scheduler retrieves them and stores them in the third task queue, then schedules them based on the verification results. For tasks that are still being compiled, compilation and scheduling are implemented in parallel. Specifically, while compiling the task, it is stored in the third task queue and scheduled based on the verification results. At this time, the task data obtained during compilation is sent to the execution module in the software system. The execution module controls the hardware system to output drive signals to the quantum chip to execute the task based on the task data. During the parallel implementation of compilation and scheduling, the quantum chip has already executed the task, without waiting for the task to be compiled before scheduling, thus improving the resource utilization of the quantum chip.

[0052] It should be added that, for the two working modes of scheduling after compilation and scheduling during compilation, the user can determine which mode to use based on the number of tasks to be executed, and issue the corresponding mode scheduling instructions to the quantum computing task scheduling system. The scheduler in the system will then respond to the user's scheduling instructions and schedule tasks according to the selected mode.

[0053] In the quantum computing task scheduling system of this application, a resource manager is used to cache the bit resource information of the quantum chip, and the task to be executed is verified based on the task resource information and bit resource information to determine whether it can be executed. Then, the first task queue and the second task queue in the database are used to store the task to be executed and the quantum execution task obtained after compiling the task to be executed, respectively. Then, the scheduler selects the task to be executed that is being compiled or the quantum execution task that has been compiled and stored in the third task queue as the task to be scheduled, according to the number of tasks to be executed. When the number of tasks to be executed is large, the quantum execution task is selected, and when the number of tasks to be executed is small, the task to be executed that is being compiled is selected. Finally, the tasks in the third task queue are scheduled, which improves the task execution efficiency, reduces the waiting time of the qubits on the quantum chip, and improves the resource utilization of the qubits on the quantum chip.

[0054] In one implementation, the scheduler uses one of the two strategies described above to acquire tasks, store them in the third task queue, and schedule them. Whether to acquire a completed task or a task that is being compiled can be determined based on the number of tasks to be executed and the length of the third task queue.

[0055] On the one hand, the length of the third task queue has a first preset threshold. When the number of tasks to be executed in the first task queue is less than the preset threshold, the scheduler stores the tasks in the first task queue of the parallel compilation tasks into the third task queue. On the other hand, when the number of tasks to be executed in the first task queue is greater than the first preset threshold, the scheduler obtains quantum execution tasks from the second task queue and stores them into the third task queue.

[0056] Specifically, as described above, the third task queue has a length, which can be set to a first preset threshold, representing the maximum number of tasks to be scheduled stored. When the number of tasks to be executed is relatively small, or even less than the preset threshold of the third task queue, the number of qubits participating in the tasks on the quantum chip is also small. It is foreseeable that the utilization rate of qubits on the quantum chip will be relatively low. At this time, the scheduler obtains the tasks being compiled and stores them in the third task queue, and schedules them according to the verification results, so that the quantum chip can run quantum computing tasks as early as possible, reduce the compilation waiting time, and improve the resource utilization rate of qubits.

[0057] On the other hand, when the number of tasks to be executed is large, far exceeding the preset threshold of the third task scheduling queue, the number of qubits participating in the tasks on the quantum chip is also large. It is foreseeable that the utilization rate of qubits on the quantum chip will be relatively high. At this time, the scheduler can obtain quantum execution tasks from the second task queue, store them in the third task queue, and schedule them according to the verification results.

[0058] As another implementation, the scheduler can determine whether to acquire a completed task or a task in the process of compilation based on task resource information and bit resource information.

[0059] For example, the current quantum chip has a lot of bit resources, which is much greater than the task resources required by the task to be executed. At this time, the number of qubits participating in the task on the quantum chip is also very small, and the utilization rate of qubits will be relatively low. In this case, the scheduler obtains the task being compiled and stores it in the third task queue, and schedules it according to the verification result, so that the quantum chip can run the quantum computing task as early as possible, reduce the compilation waiting time, and improve the resource utilization rate of qubits.

[0060] On the other hand, the current bit resource information of the quantum chip is less than the task resource information required by the task to be executed. All the qubits on the quantum chip need to execute tasks, so the utilization rate of the qubits on the quantum chip will be relatively high. At this time, the scheduler can obtain the quantum execution task from the second task queue, store it in the third task queue, and schedule it according to the verification result.

[0061] Understandably, during the operation of a quantum computing measurement and control system, the scheduler will respond to the user's scheduling instructions to determine the corresponding scheduling mode, thereby improving the resource utilization of qubits on the quantum chip.

[0062] It should be added that when this task scheduling system is working, the compilation process of the tasks to be executed is carried out sequentially. After the tasks taken from the third task queue are sent to the corresponding task threads, multiple task threads are executed in parallel.

[0063] As one implementation, the second task queue length has a second preset threshold. When the number of tasks in the second task queue is less than the second preset threshold, the scheduler is also used to detect whether the type of tasks in the first task queue matches the working mode of the quantum computing task scheduling system.

[0064] The second task queue stores the quantum execution tasks obtained after compiling the tasks to be executed. These tasks are in a state where they can be run directly and are retrieved by the scheduler and stored in the third task queue for scheduling. During implementation, there may be a situation where the second task queue is not full (i.e., the number of tasks in the second task queue is less than the second preset threshold). In this case, the scheduler can pre-verify the tasks in the first task queue.

[0065] Specifically, the pre-verification checks whether the types of tasks in the first task queue are supported by the current operating mode of the task scheduling system. For example, task types include quantum measurement and control experiments, or other types of tasks; while the operating modes of the task scheduling system are usually set to several, such as instrument mode, experimental mode, pure online mode, configuration mode, etc.; each operating mode supports the corresponding task type.

[0066] When the second task queue is not full, the scheduler can perform other tasks. For example, it can pre-validate the task types and system operating modes in the first task queue to determine whether the tasks meet the running requirements. If the running requirements are not met, no further compilation work is required, thus improving the running efficiency of the task scheduling system.

[0067] In one implementation, the resource manager includes: a quantum resource counter, used to acquire bit resource information of the quantum chip and task bit information for executing tasks, and update the bit resource information according to the task bit information; and a task execution verifier, used to verify the task resource information of the task to be executed according to the current bit resource information of the quantum chip, so as to verify whether the current bit resource information meets the task resource information.

[0068] In this embodiment, the resource manager is used to cache chip information, a qubit counter, and a resource verifier for task scheduling. Specifically, a quantum resource counter is used to record the information of the qubits on the quantum chip. The quantum chip has multiple qubits, and each qubit has several states, such as task, idle, and environment. The environment mainly represents the state of the surrounding qubits adjacent to the bit executing the task, and it affects the task bit, hence it serves as the environment state. Both the bit resource information and the task bit information on the quantum chip are stored in the quantum resource counter. As each task runs, the task bit information also changes, such as the working state of the qubit, the number of idle qubits, and the number of environment qubits. At this time, the bit resource information needs to be updated based on the task bit information to ensure that subsequent tasks can call these updated resources. In addition, the contents of the qubit counter can be displayed in the interface of the quantum computing measurement and control system for easy access by the user.

[0069] The task execution verifier is mainly used to verify the task resource information of the task to be executed based on the current bit resource information of the quantum chip, so as to verify whether the current bit resource information meets the task resource information. If it does, the task to be executed can be scheduled by the scheduler.

[0070] In this embodiment, the various resource management and task scheduling of the quantum chip are separated and implemented using corresponding resource managers and schedulers respectively, thereby improving the system's operating efficiency.

[0071] The first, second, and third task queues each store multiple tasks. When multiple tasks are retrieved from or stored in the first, second, and third task queues, a buffer is used for caching. As one implementation, the quantum computing task scheduling system also includes a buffer for caching task information for all tasks, as well as queues of tasks retrieved from the first, second, and third task queues.

[0072] For each task to be executed received, the task scheduling system creates a corresponding task object and task information. The task information includes all information about the task object during execution and is stored in a cache. The scheduler can obtain the task information for each task to be executed. In addition, the queues of tasks taken from the first, second, and third task queues are also cached by the cache.

[0073] In practical implementation, since task information and task queues are of different types, they are stored separately in the cache. For example, the cache includes: a task object cache, used to cache the task information of all registered tasks to be executed; and a task queue cache, used to arrange and cache tasks in the first, second, and third task queues according to the registration time and expected time of all tasks.

[0074] In the task queue cache, tasks are queued according to their registration time and expected time. This allows for flexible queuing and makes it easy for users to intuitively obtain the current progress of each task.

[0075] like Figure 2 As shown, based on the same application concept, this embodiment also provides a quantum computing task execution system, including the quantum computing task scheduling system of any of the preceding claims; a task dispatch module, used to register the received tasks to be executed to a first task queue in the database; and a task compilation module, used to compile the tasks to be executed in the first task queue and store the compiled quantum execution tasks to a second task queue in the database.

[0076] The quantum computing task scheduling system includes the aforementioned modules, such as the resource manager, database, and scheduler. The task dispatch module is mainly used to receive tasks to be executed and register them in the first task queue of the quantum computing task scheduling system's database. This allows the task compilation module to read and compile the tasks. The compiled quantum execution tasks are stored in the second task queue of the database. Then, the scheduler in the quantum computing task scheduling system retrieves the quantum execution tasks and stores them in the third task queue. If a task in the process of compilation is to be scheduled, it is directly stored in the third task queue by the scheduler. The scheduler then schedules the tasks in the third task queue based on the verification results.

[0077] In one implementation, the task compilation module is used to send the status information and compilation completion information of the task to be executed to the quantum computing task scheduling system when compiling the task to be executed; the quantum computing task scheduling system is used to retrieve the task and store it in the third task queue based on the status information and compilation completion information.

[0078] The task compilation module is divided into three stages when compiling the task to be executed: loading the task, parsing the task, and parallel compiling the task. After the parsing task is completed, the task status change information of the task to be executed will be sent. After the parallel compilation task is completed, the task status change information and compilation completion information will be sent. The scheduler in the quantum computing task scheduling system uses this information to obtain the completed or in-process compiled tasks to be executed and store them in the third task queue.

[0079] Based on the same concept, this embodiment also provides a quantum computer, including a quantum computing measurement and control system and a quantum chip. The quantum computing measurement and control system uses the quantum computing task scheduling system of any one of the above claims, or the quantum computing task execution system of any one of the above claims to control the quantum chip to execute quantum computing tasks.

[0080] In the description of this specification, the references to terms such as "one embodiment," "some embodiments," "example," or "specific example," etc., indicate that a specific feature, structure, material, or characteristic described in connection with that embodiment or example is included in at least one embodiment or example of this application. In this specification, the illustrative expressions of the above terms do not necessarily refer to the same embodiment or example. Furthermore, the specific features, structures, materials, or characteristics described may be combined in any suitable manner in one or more embodiments. In addition, those skilled in the art can combine and integrate the different embodiments or examples described in this specification.

[0081] The above are merely preferred embodiments of this application and do not constitute any limitation on this application. Any equivalent substitutions or modifications made by those skilled in the art to the technical solutions and content disclosed in this application without departing from the scope of the technical solutions of this application shall still fall within the protection scope of this application.

Claims

1. A quantum computing task scheduling system, characterized in that, The system includes: The resource manager is used to cache the bit resource information of the quantum chip and to verify the task to be executed based on the task resource information and the bit resource information. The database has a first task queue and a second task queue; wherein the first task queue is used to store tasks to be executed, and the second task queue is used to store quantum execution tasks obtained by compiling the tasks to be executed. The scheduler has a preset third task queue, which is used to obtain quantum execution tasks from the second task queue and store them in the third task queue or to store tasks to be executed during compilation in the third task queue, and to schedule the tasks in the third task queue according to the verification results.

2. The quantum computing task scheduling system as described in claim 1, characterized in that, The length of the third task queue has a first preset threshold. When the number of tasks to be executed in the first task queue is less than the preset threshold, the scheduler is used to store the tasks in the first task queue that are being compiled into the third task queue.

3. The quantum computing task scheduling system as described in claim 2, characterized in that, When the number of tasks to be executed in the first task queue is greater than the first preset threshold, the scheduler is used to obtain quantum execution tasks from the second task queue and store them in the third task queue.

4. The quantum computing task scheduling system as described in claim 2, characterized in that, The second task queue length has a second preset threshold. When the number of tasks in the second task queue is less than the second preset threshold, the scheduler is also used to detect whether the type of tasks in the first task queue matches the working mode of the quantum computing task scheduling system.

5. The quantum computing task scheduling system as described in claim 1, characterized in that, The resource manager includes: A quantum resource counter is used to acquire the bit resource information of the quantum chip and the task bit information for executing the task, and to update the bit resource information based on the task bit information; The task execution verifier is used to verify the task resource information of the task to be executed based on the current bit resource information of the quantum chip, so as to verify whether the current bit resource information meets the task resource information.

6. The quantum computing task scheduling system as described in claim 1, characterized in that, It also includes a cache, which is used to cache task information for all tasks, as well as a queue of tasks retrieved from the first task queue, the second task queue, and the third task queue.

7. The quantum computing task scheduling system as described in claim 6, characterized in that, The buffer includes: The task object cache is used to cache task information for all registered tasks to be executed. The task queue cache is used to arrange and cache tasks in the first task queue, the second task queue, and the third task queue according to the registration time and expected time of all tasks.

8. A quantum computing task execution system, characterized in that, include: The quantum computing task scheduling system as described in any one of claims 1-7; The task dispatch module is used to register the received tasks to be executed to the first task queue in the database; The task compilation module is used to compile the tasks to be executed in the first task queue and store the compiled quantum execution tasks in the second task queue of the database.

9. The quantum computing task execution system as described in claim 8, characterized in that, The task compilation module is used to send the status information and compilation completion information of the task to be executed to the quantum computing task scheduling system when compiling the task to be executed. The quantum computing task scheduling system is used to retrieve tasks and store them in the third task queue based on the status information and compilation completion information.

10. A quantum computer, characterized in that, The system includes a quantum computing measurement and control system and a quantum chip. The quantum computing measurement and control system employs a quantum computing task scheduling system as described in any one of claims 1-7, or a quantum computing task execution system as described in any one of claims 8-9 to control the quantum chip to perform quantum computing tasks.

Images