Method and apparatus for scheduling quantum computing tasks, and quantum computer
By introducing task queue management and resource scheduling mechanisms into the quantum measurement and control software system, the problems of low execution efficiency and low resource utilization of quantum computing tasks have been solved, achieving more efficient task execution and quantum chip resource utilization.
Patent Information
- Application Number
- CN202510545415.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-04-28
- Publication Date
- 2026-11-06
AI Technical Summary
Existing quantum computing measurement and control systems exhibit low execution efficiency and low resource utilization of quantum chips when performing quantum computing tasks.
By introducing a task queue management and resource scheduling mechanism into the quantum measurement and control software system, including a first task queue, a second task queue, and a third task queue, which are used to store user tasks, compiled quantum computing tasks, and scheduling tasks respectively, and to perform reasonable scheduling based on the number of tasks and resource availability, the efficiency of task execution and the resource utilization of the quantum chip are improved.
It improves the execution efficiency of quantum computing tasks, reduces the waiting time of qubits on quantum chips, and enhances the resource utilization of qubits on quantum chips.
Smart Images
Figure CN123048111A_ABST
Abstract
Description
Technical Field
[0001] This application relates to the field of quantum computing technology, and in particular to a method, apparatus and quantum computer for scheduling quantum computing tasks. 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 measurement and control systems 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 scheduling method, apparatus and quantum computer for quantum computing tasks, which solves the problems of low execution efficiency of quantum computing tasks and low resource utilization on quantum chips in the prior art, and greatly improves 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 scheduling method for quantum computing tasks, applied to a quantum measurement and control software system, the method comprising:
[0012] In response to a user's task registration request, the received user task is stored in the first task queue in the database;
[0013] The user task is obtained from the first task queue, compiled and processed to obtain a quantum computing task for manipulating the quantum chip, and the quantum computing task is stored in the second task queue of the database;
[0014] Quantum computing tasks are retrieved from the second task queue or user tasks under compilation are stored as scheduling tasks in the third task queue, and the scheduling tasks in the third task queue are scheduled to idle task threads according to task resources.
[0015] Optionally, in the quantum computing task scheduling method described above, before storing the received user task in the first task queue of the database in response to the user's task registration request, the method further includes:
[0016] The user's permission to execute tasks on the experimental platform is verified; wherein, the experimental platform is a control platform created on the front-end service page of the quantum measurement and control software system that maps the quantum measurement and control all-in-one machine and the quantum chip;
[0017] For users whose permissions have been verified, execute the steps to respond to the user's task registration request.
[0018] In the quantum computing task scheduling method described above, optionally, the step of responding to a user's task registration request and storing the received user task in a first task queue in the database includes:
[0019] For users whose permissions have been verified, a corresponding task structure and task metadata are created based on the user's task.
[0020] The task structure and task metadata are stored in the first task queue in the database.
[0021] The quantum computing task scheduling method described above, optionally, includes a third task queue with a first preset threshold length, and the following steps: obtaining quantum computing tasks from the second task queue or storing user tasks under compilation as scheduled tasks in the third task queue.
[0022] When the number of user tasks in the first task queue is less than the first preset threshold, the user tasks in the compilation process are stored as scheduled tasks in the third task queue.
[0023] When the number of user tasks in the first task queue is greater than the first preset threshold, a quantum computing task is obtained from the second task queue and stored as a scheduling task in the third task queue.
[0024] In the quantum computing task scheduling method 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 and the number of tasks in the third task queue is less than the first preset threshold, before obtaining the user task from the first task queue and compiling it to obtain a quantum computing task for manipulating the quantum chip, the method further includes:
[0025] The user tasks in the first task queue are pre-verified; wherein, the pre-verification is to check whether the task type of the user task matches the working mode of the quantum measurement and control software system;
[0026] Compile the user tasks that have been pre-verified and matched.
[0027] The quantum computing task scheduling method described above may optionally include scheduling tasks in the third task queue to idle task threads based on task resources, including:
[0028] Obtain the bit resource information of the quantum chip and the task resource information required to execute the scheduling task;
[0029] Resource verification is performed based on the task resource information and the bit resource information;
[0030] Schedule tasks that pass resource verification to idle task threads.
[0031] The quantum computing task scheduling method described above optionally includes the following steps: tasks in the first task queue, the second task queue, and the third task queue all have priorities; the user task is retrieved from the first task queue, compiled to obtain a quantum computing task for manipulating the quantum chip, and the quantum computing task is stored in the second task queue of the database;
[0032] The highest priority user task is retrieved from the first task queue, compiled to obtain a quantum computing task for manipulating the quantum chip, and then the quantum computing task is sent to the second task queue.
[0033] Obtaining quantum computing tasks from the second task queue as scheduling tasks and storing them in the third task queue includes:
[0034] The highest priority quantum computing task is selected from the second task queue and sent to the third task queue as a scheduling task;
[0035] The scheduling of tasks in the third task queue to idle task threads based on task resources includes:
[0036] The highest priority scheduling task is obtained from the third task queue and scheduled to an idle task thread based on task resources.
[0037] Optionally, in the quantum computing task scheduling method described above, before retrieving the user task from the first task queue and compiling it to obtain the quantum computing task for manipulating the quantum chip, the method further includes:
[0038] Determine whether the user task is a time-exclusive task;
[0039] If so, the time-exclusive task is compiled and processed, and other tasks are stored in the cache until the time-exclusive task is completed.
[0040] A second aspect of this application provides a scheduling device for quantum computing tasks, comprising:
[0041] The task dispatch module is used to respond to user task registration requests and store the received user tasks in the first task queue in the database.
[0042] The task compilation module is used to obtain the user task from the first task queue, compile and process it to obtain a quantum computing task for manipulating the quantum chip, and store the quantum computing task in the second task queue of the database.
[0043] The task scheduling module is used to obtain quantum computing tasks from the second task queue or store user tasks under compilation as scheduling tasks in the third task queue, and schedule the scheduling tasks in the third task queue to idle task threads according to task resources.
[0044] 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 executes tasks using the quantum computing task scheduling method described in any one of the first aspects above, or includes the quantum computing task scheduling device described in the second aspect above.
[0045] Compared with the prior art, this application has the following beneficial effects:
[0046] The quantum computing task scheduling method of this application first responds to the task registration request issued by the user and stores the received user task in the first task queue of the database. Then, it retrieves the user task from the first task queue, compiles it to obtain the quantum computing task used to control the quantum chip, and stores the quantum computing task in the second task queue of the database. Next, based on the number of user tasks, it selects either the user task being compiled or the quantum computing task that has been compiled as the scheduling task and stores it in the third task queue. When the number of user tasks is relatively large, the quantum computing task is selected; when the number of user tasks is relatively small, the user task being compiled is selected. Finally, based on the task resources, the scheduling tasks in the third task queue are scheduled to idle task threads, which improves task execution efficiency, reduces the waiting time of qubits on the quantum chip, and improves the resource utilization of qubits on the quantum chip.
[0047] The scheduling device and quantum computer for quantum computing tasks proposed in this application belong to the same concept as the scheduling method for quantum computing tasks, and therefore have the same beneficial effects, which will not be elaborated here. Attached Figure Description
[0048] Figure 1 This is a schematic diagram illustrating the structure of a quantum measurement and control software system as exemplified in an embodiment of this application;
[0049] Figure 2 This is a flowchart illustrating a quantum computing task scheduling method as an example of an embodiment of this application;
[0050] Figure 3 This is a schematic diagram of a quantum computing task scheduling device as an example of an embodiment of this application. Detailed Implementation
[0051] 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.
[0052] 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.
[0053] 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.
[0054] 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.
[0055] 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.
[0056] The quantum computing task scheduling method in this embodiment is applied to a quantum measurement and control software system to receive various task requirements from users and to compile and schedule various tasks. Typically, a user task is scheduled after it has been compiled, and the compilation time is related to the complexity of the user task. During scheduling, multi-threaded scheduling can be implemented to ensure the parallelism of multiple tasks.
[0057] Quantum chips integrate a large number of qubits. When there are few user tasks and compilation is time-consuming, the qubits on the quantum chip may remain idle until the tasks to be executed are compiled, scheduled, and sent to the quantum chip, resulting in wasted qubit resources. This embodiment provides a quantum computing task scheduling method 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.
[0058] like Figure 1 and Figure 2 As shown, Figure 1 This is a structural diagram of the quantum measurement and control software system. Figure 2 This application discloses a scheduling method for quantum computing tasks, applied to a quantum measurement and control software system. The quantum measurement and control software system includes a task dispatch module, a task compilation module, and a task scheduling module. The method includes the following steps.
[0059] Step S10: In response to the user's task registration request, store the received user task in the first task queue of the database.
[0060] This step is executed by the task dispatch module. In addition to the task dispatch module, task compilation module, and task scheduling module, the quantum measurement and control software system also includes a database for storing various tasks and data. In this embodiment, the database has a first task queue and a second task queue; the first task queue stores user tasks received by the task dispatch module after responding to a task registration request, and the second task queue stores quantum computing tasks obtained by the task compilation module after compiling the user tasks.
[0061] This is used to issue task registration requests through the user terminal or interface software, and the task dispatch module responds to the request. For each user task received, there is corresponding task information, including the task resources required to execute the user task, such as the resource information of qubits required to execute the task on the quantum chip.
[0062] Step S20: Obtain user tasks from the first task queue, compile and process them to obtain quantum computing tasks for manipulating quantum chips, and store the quantum computing tasks in the second task queue of the database.
[0063] This step is performed by the task compilation module, which is mainly responsible for retrieving user tasks from the first task queue and compiling them to obtain instructions for controlling the hardware system. After compilation, the instructions are stored in the second task queue in the database as quantum computing tasks.
[0064] Step S30: Obtain quantum computing tasks from the second task queue or store user tasks under compilation as scheduling tasks in the third task queue, and schedule the scheduling tasks in the third task queue to idle task threads according to task resources.
[0065] This step is performed by the task scheduling module. When compiling user tasks, the task compilation module divides the process into three stages: task loading, task parsing, and parallel compilation. The quantum computing task is the task obtained after the parallel compilation is completed. The compilation process occurs when the parsing task is completed and the parallel compilation begins; at this point, the compilation of the user task is not yet complete.
[0066] In this context, "parallel compilation complete" indicates that the task is ready to run, while "compiling in progress" means the task has not yet been compiled. For quantum computing tasks in the second task queue that have completed compilation, the task scheduling module retrieves them and stores them in the third task queue, then schedules them based on task resources. For user tasks that are still compiling, compilation and scheduling are implemented in parallel. Specifically, while compiling the user task, it is stored in the third task queue and scheduled according to task resources. 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 user task to be compiled before scheduling, thus improving the resource utilization of the quantum chip.
[0067] The task compilation module sends a compilation signal to the task scheduling module after both the parsing task and the parallel compilation task are completed. This allows the task scheduling module to obtain the compilation progress of the task based on the compilation signal, synchronize the compilation progress with the task compilation module, and then perform subsequent scheduling.
[0068] 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 user tasks, and issue the corresponding scheduling instructions to the quantum measurement and control software system. The task scheduling module in the system will then respond to the user's scheduling instructions and perform scheduling according to the selected mode.
[0069] When scheduling tasks in the third task queue, the task scheduling module schedules them according to the task resources of the task. The task resources may include the resource information of the qubits required to run the task on the quantum chip. Tasks that meet the task resource requirements can be scheduled to run on idle task threads.
[0070] The quantum computing task scheduling method of this application first responds to the task registration request issued by the user and stores the received user task in the first task queue of the database. Then, it retrieves the user task from the first task queue, compiles it to obtain the quantum computing task used to control the quantum chip, and stores the quantum computing task in the second task queue of the database. Next, based on the number of user tasks, it selects either the user task being compiled or the quantum computing task that has been compiled as the scheduling task and stores it in the third task queue. When the number of user tasks is relatively large, the quantum computing task is selected; when the number of user tasks is relatively small, the user task being compiled is selected. Finally, based on the task resources, the scheduling tasks in the third task queue are scheduled to idle task threads, which improves task execution efficiency, reduces the waiting time of qubits on the quantum chip, and improves the resource utilization of qubits on the quantum chip.
[0071] Before responding to a user's task registration request and storing the received user task in the first task queue in the database, the method further includes: the task dispatch module verifying the user's permission to execute tasks on the experimental platform; wherein the experimental platform is a control platform created on the front-end service page of the quantum measurement and control software system that maps the quantum measurement and control all-in-one machine and the quantum chip; for users whose permissions have been verified, the step of responding to the user's task registration request is executed.
[0072] Users submit user tasks via the user terminal or front-end service interface, which are then sent to the quantum computer for execution. A control platform mapping the quantum measurement and control integrated machine and quantum chip is created on the front-end service interface. Users can configure the control platform on this interface according to the requirements of their user tasks and submit tasks through the configured platform. Different users have different permissions to execute tasks on the experimental platform. Therefore, after a user submits a task on the front-end service interface, the task dispatch module verifies the user's permission to execute tasks on the experimental platform before creating the task. If the verification passes, steps S10-S30 are executed sequentially to compile and submit the user task; otherwise, steps S10-S30 are not executed to avoid wasting the resources of the quantum measurement and control software system.
[0073] As one implementation method, in response to a user's task registration request, the received user task is stored in the first task queue of the database, including the following steps.
[0074] Step S101: For users whose permissions have been verified, create a corresponding task structure and task metadata based on the user's task.
[0075] Step S102: Store the task structure and task metadata in the first task queue of the database.
[0076] Steps S101-S102 above are executed by the task dispatch module. During execution, it responds to task registration requests that have passed the permission verification, creates a task structure and task metadata based on the task information in the user task, and sends the task structure and task metadata of each user task to the first task queue in the database for subsequent reading by the task compilation module. Specifically, the task structure includes the specific content of the user task; the task metadata describes the basic information of the user task, such as protocol type, username, task priority, occupied bits, experiment name, thread scheduling verification data, etc. By using the task structure and task metadata to represent various task information of the user task, it is easy to distinguish and use it later.
[0077] As one implementation, the length of the third task queue has a first preset threshold, and the process of obtaining quantum computing tasks from the second task queue or storing user tasks under compilation as scheduling tasks in the third task queue includes the following steps.
[0078] When the number of user tasks in the first task queue is less than a first preset threshold, the user tasks in the compilation process are stored as scheduling tasks in the third task queue; when the number of user tasks in the first task queue is greater than the first preset threshold, quantum computing tasks are obtained from the second task queue and stored as scheduling tasks in the third task queue.
[0079] In this embodiment, the task scheduling module uses one of the two strategies described above to acquire tasks as scheduling tasks, store them in the third task queue, and schedule them. Whether the acquired task is a quantum computing task that has been compiled or a user task that is being compiled can be determined based on the number of user tasks and the length of the third task queue.
[0080] On one hand, the length of the third task queue has a first preset threshold. When the number of user tasks in the first task queue is less than the preset threshold, the task scheduling module stores the user tasks in the parallel compilation tasks as scheduling tasks in the third task queue. On the other hand, when the number of user tasks in the first task queue is greater than the first preset threshold, the task scheduling module obtains quantum computing tasks from the second task queue as scheduling tasks and stores them in the third task queue.
[0081] 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 user tasks 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 task scheduling module obtains the user tasks under compilation as scheduling tasks and stores them in the third task queue, and schedules them according to the task resources, so that the quantum chip can run quantum computing tasks as early as possible, reduce the waiting time of tasks, and improve the resource utilization rate of qubits.
[0082] On the other hand, when the number of user tasks 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 task scheduling module can obtain quantum computing tasks from the second task queue as scheduling tasks and store them in the third task queue, and schedule them according to the task resources.
[0083] As another implementation, the task scheduling module 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.
[0084] For example, the current quantum chip has a lot of bit resources, which is much greater than the task resources required by the user task. 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 task scheduling module obtains the user task being compiled as the scheduling task and stores it in the third task queue. It then schedules the task according to the task resources, so that the quantum chip can run the quantum computing task as early as possible, reduce the waiting time of the task, and improve the resource utilization rate of qubits.
[0085] On the other hand, the current bit resource information of quantum chips is less than the task resource information required by user tasks. All qubits on the quantum chip need to execute tasks, so the utilization rate of qubits on the quantum chip will be relatively high. At this time, the task scheduling module can obtain quantum computing tasks from the second task queue as scheduling tasks and store them in the third task queue, and then schedule them according to the task resources.
[0086] Understandably, during the operation of a quantum computing measurement and control system, the task scheduling module 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.
[0087] 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 and the number of tasks in the third task queue is less than the first preset threshold, the method further includes the following steps before obtaining user tasks from the first task queue and compiling them to obtain quantum computing tasks for manipulating quantum chips.
[0088] Step S111: Perform pre-verification on the user tasks in the first task queue; wherein, the pre-verification is to check whether the task type of the user task matches the working mode of the quantum measurement and control software system.
[0089] Step S112: Compile the user task for pre-verification matching.
[0090] The second task queue stores quantum computing tasks compiled from user tasks. These tasks are ready to run directly. The task scheduling module retrieves the quantum computing tasks as scheduling tasks and stores them in the third task queue for scheduling. During implementation, there may be situations 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 task scheduling module can pre-verify the tasks in the first task queue.
[0091] Specifically, the pre-verification checks whether the types of tasks in the first task queue are supported by the current operating mode of the quantum measurement and control software system. For example, task types include quantum measurement and control experiments, or other types of tasks; while the operating modes of the quantum measurement and control software 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.
[0092] When the second task queue is not full, the task scheduling module can perform other tasks. For example, it can pre-validate the task types and system operating modes in the first task queue to determine if the tasks meet the runtime requirements. If the pre-validation does not match and the runtime requirements are not met, subsequent compilation is unnecessary, improving the efficiency of the task scheduling system. If the pre-validation matches, subsequent compilation processing continues. Through pre-validation, tasks that are not supported by the system operating mode can be directly excluded, avoiding wasted resources and time in task routing and distribution.
[0093] In one implementation, the task scheduling module needs to combine the bit resource information on the quantum chip and the task resource information required by the user task when performing task scheduling. Specifically, scheduling tasks in the third task queue to idle task threads based on task resources includes the following steps.
[0094] Step S301: Obtain the bit resource information of the quantum chip and the task resource information of the scheduled tasks in the third task queue.
[0095] 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.
[0096] For each quantum chip, its bit resource information can be obtained, which represents the number of qubits on the chip, the layout and connection relationships of the qubits, the state of each qubit, and the number of qubits in the same state. For each user task, the number of qubits required, the qubit connection relationships, 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.
[0097] S302: Perform resource verification based on the task resource information and the bit resource information.
[0098] S303: Schedule the task that has passed the resource verification to an idle task thread.
[0099] Steps S301-S303 are executed by the task scheduling module. It is understandable that if a task is to be sent to the quantum chip, the current bit resource information of the quantum chip must meet the task resource information of that task. Therefore, before sending a task, resource verification needs to be performed on each task, and this resource verification is implemented by the task scheduling module. For tasks that pass the resource verification, the task scheduling module schedules them to idle task threads for execution based on the task resources.
[0100] By verifying the bit resource information of the quantum chip and the task resource information of the task to be sent, it is ensured that the sent task can be executed smoothly, avoiding the need to wait due to insufficient resources and wasting time and resources.
[0101] In this embodiment, the tasks in the first task queue, the second task queue, and the third task queue all have priorities. The process of obtaining a user task from the first task queue, compiling it to obtain a quantum computing task for manipulating the quantum chip, and storing the quantum computing task in the second task queue in the database includes: obtaining the highest priority user task from the first task queue, compiling it to obtain a quantum computing task for manipulating the quantum chip, and sending the quantum computing task to the second task queue.
[0102] Obtaining quantum computing tasks from the second task queue as scheduling tasks and storing them in the third task queue includes: obtaining the highest priority quantum computing task from the second task queue as a scheduling task and sending it to the third task queue;
[0103] The scheduling of tasks in the third task queue is based on task resources and then assigned to an idle task thread. This includes: obtaining the highest priority scheduling task from the third task queue and assigning it to an idle task thread based on task resources.
[0104] Each task has a priority, which is determined by the user and included in the task metadata and obtained by the task scheduling module. When compiling and scheduling tasks, the highest priority task is given priority to ensure that compilation and scheduling are carried out as early as possible to meet the user's priority requirements.
[0105] In this embodiment, before obtaining user tasks from the first task queue and compiling them to obtain quantum computing tasks for manipulating quantum chips, the method further includes the following steps.
[0106] Step S121: Determine whether the user task is a time-exclusive task.
[0107] Step S122: If so, compile the time-exclusive task and store the other tasks in the buffer until the time-exclusive task is completed.
[0108] A time-dedicated task means that when this task runs, it requires all the time available in the quantum measurement and control software system. During this time, the quantum measurement and control software system will not run any other tasks. Whether a task requires time dedication is determined by the user, and this information is included in the task assignment. When the task scheduling module retrieves a user task from the first task queue, it will determine whether the task is a time-dedicated task. If so, the task scheduling module will send the time-dedicated task to the task compilation module and store other tasks in the buffer until the time-dedicated task is completed. At this point, the task compilation module will compile the task, and then the task scheduling module will schedule the task to meet the user's time-dedicated requirement.
[0109] like Figure 3As shown, based on the same application concept, this embodiment also provides a quantum computing task scheduling device, including a task dispatch module, a task compilation module, and a task scheduling module, wherein: the task dispatch module is used to respond to a user's task registration request and store the received user task in a first task queue in a database; the task compilation module is used to obtain the user task from the first task queue, compile it to obtain a quantum computing task for manipulating a quantum chip, and store the quantum computing task in a second task queue in the database; the task scheduling module is used to obtain a quantum computing task from the second task queue or store the user task under compilation as a scheduling task in a third task queue, and schedule the scheduling task in the third task queue to an idle task thread according to task resources.
[0110] 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 executes tasks using a quantum computing task scheduling method as described above, or includes a quantum computing task scheduling device as described above.
[0111] 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.
[0112] 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 scheduling method for quantum computing tasks, characterized in that, The method, applied to a quantum measurement and control software system, includes: In response to a user's task registration request, the received user task is stored in the first task queue in the database; The user task is obtained from the first task queue, compiled and processed to obtain a quantum computing task for manipulating the quantum chip, and the quantum computing task is stored in the second task queue of the database; Quantum computing tasks are retrieved from the second task queue or user tasks under compilation are stored as scheduling tasks in the third task queue, and the scheduling tasks in the third task queue are scheduled to idle task threads according to task resources.
2. The method of Claim 1, wherein, Before storing the received user task in the first task queue of the database in response to the user's task registration request, the method further includes: The user's permission to execute tasks on the experimental platform is verified; wherein, the experimental platform is a control platform created on the front-end service page of the quantum measurement and control software system that maps the quantum measurement and control all-in-one machine and the quantum chip; For users whose permissions have been verified, execute the steps to respond to the user's task registration request.
3. The scheduling method for quantum computing tasks as described in claim 2, characterized in that, The step of responding to a user's task registration request and storing the received user task in the first task queue of the database includes: For users whose permissions have been verified, a corresponding task structure and task metadata are created based on the user's task. The task structure and task metadata are stored in the first task queue in the database.
4. The scheduling method for quantum computing tasks as described in claim 1, characterized in that, The length of the third task queue has a first preset threshold. Obtaining quantum computing tasks from the second task queue or storing user tasks under compilation as scheduled tasks in the third task queue includes: When the number of user tasks in the first task queue is less than the first preset threshold, the user tasks in the compilation process are stored as scheduled tasks in the third task queue. When the number of user tasks in the first task queue is greater than the first preset threshold, a quantum computing task is obtained from the second task queue and stored as a scheduling task in the third task queue.
5. The scheduling method for quantum computing tasks as described in claim 4, 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 and the number of tasks in the third task queue is less than the first preset threshold, before retrieving the user task from the first task queue and compiling it to obtain a quantum computing task for manipulating the quantum chip, the method further includes: The user tasks in the first task queue are pre-verified; wherein, the pre-verification is to check whether the task type of the user task matches the working mode of the quantum measurement and control software system; Compile the user tasks that are pre-verified and matched.
6. The scheduling method for quantum computing tasks as described in claim 1, characterized in that, The scheduling of tasks in the third task queue to idle task threads based on task resources includes: Obtain the bit resource information of the quantum chip and the task resource information required to execute the scheduling task; Resource verification is performed based on the task resource information and the bit resource information; Schedule tasks that pass resource verification to idle task threads.
7. The scheduling method for quantum computing tasks as described in claim 1, characterized in that, Tasks in the first task queue, the second task queue, and the third task queue all have priorities; the user task is obtained from the first task queue, compiled to obtain a quantum computing task for manipulating the quantum chip, and the quantum computing task is stored in the second task queue of the database, including: The highest priority user task is retrieved from the first task queue, compiled to obtain a quantum computing task for manipulating the quantum chip, and then the quantum computing task is sent to the second task queue. Obtaining quantum computing tasks from the second task queue as scheduling tasks and storing them in the third task queue includes: The highest priority quantum computing task is selected from the second task queue and sent to the third task queue as a scheduling task; The scheduling of tasks in the third task queue to idle task threads based on task resources includes: The highest priority scheduling task is obtained from the third task queue and scheduled to an idle task thread based on task resources.
8. The scheduling method for quantum computing tasks as described in claim 1, characterized in that, Before retrieving the user task from the first task queue and compiling it to obtain a quantum computing task for manipulating the quantum chip, the method further includes: Determine whether the user task is a time-exclusive task; If so, the time-exclusive task is compiled and processed, and other tasks are stored in the cache until the time-exclusive task is completed.
9. A scheduling device for quantum computing tasks, characterized in that, include: The task dispatch module is used to respond to user task registration requests and store the received user tasks in the first task queue in the database. The task compilation module is used to obtain the user task from the first task queue, compile and process it to obtain a quantum computing task for manipulating the quantum chip, and store the quantum computing task in the second task queue of the database. The task scheduling module is used to obtain quantum computing tasks from the second task queue or store user tasks under compilation as scheduling tasks in the third task queue, and schedule the scheduling tasks in the third task queue to idle task threads according to task resources.
10. A quantum computer, characterized in that, It includes a quantum computing measurement and control system and a quantum chip. The quantum computing measurement and control system executes tasks using the quantum computing task scheduling method as described in any one of claims 1-8, or includes the quantum computing task scheduling device as described in claim 9.