Concurrent task scheduling system, method and medium for quantum computing processor

Abstract

The present invention relates to the field of quantum computing, and in particular to a concurrent task scheduling system, method and medium for a quantum computing processor. The system includes: at least one quantum computing processor, each of which has multiple quantum bits; a first-level scheduling center, which monitors the busyness of each quantum computing processor, extracts the total number of tasks from the quantum experiment information to be processed, and performs task segmentation to obtain a task queue corresponding to each quantum computing processor; a second-level scheduling center, which divides multiple quantum bits into multiple quantum bit combinations based on each quantum computing processor and monitors the working status, and selects a target quantum bit combination from the multiple quantum bit combinations according to the working status to execute the task queue segmented by the first-level scheduling center for the corresponding quantum computing processor. The solution of the present invention improves the problem that the quantum computing processor is monopolized by experimental tasks and improves the processing speed of experimental tasks.

Description

Technical Field

[0001] The present invention relates to the field of quantum computing, and in particular to a concurrent task scheduling system, method, device and medium for a quantum computing processor. Background Art

[0002] In actual work, the quantum compiler will generate a program described by a quantum instruction set as the output of the software layer to the lower layer; these instructions will then be executed by the quantum control processor as the input of the hardware, and through the drive control and measurement instruments, the corresponding microwave operations will eventually be sent to the quantum hardware. At the same time, under this working framework, feedback control based on real-time interaction of quantum-classical information can also be realized. Although the quantum computing architecture has made the above progress, with the continuous increase in quantum cloud access users and the increase in the number of quantum experimental tasks, the processing efficiency of the quantum control processor has also been increasingly challenged.

[0003] At present, quantum computing tasks are mainly single-threaded tasks on a single processor. For a large number of experimental tasks, the experimental task processing of a single processor is relatively heavy. In addition, users usually access the quantum computing processor with single thread access. That is, when one user accesses the quantum processor, the next user can only wait until the previous user completes the operation before operating. Such operation efficiency affects the user's access speed. Therefore, it is necessary to optimize the quantum computing processor scheduling strategy. Summary of the invention

[0004] In view of this, it is necessary to provide a concurrent task scheduling system, method, device and medium for a quantum computing processor to address the above technical problems.

[0005] According to a first aspect of the present invention, there is provided a concurrent task scheduling system for a quantum computing processor, the system comprising:

[0006] at least one quantum computing processor, each quantum computing processor having a plurality of qubits;

[0007] A first-layer scheduling center, which is used to monitor the busyness of each quantum computing processor, extract the total number of tasks from the quantum experiment information to be processed submitted by the user, and perform task segmentation based on the busyness and the total number of tasks to obtain a task queue corresponding to each quantum computing processor;

[0008] The second-layer scheduling center is used to divide multiple quantum bits into multiple quantum bit combinations based on each quantum computing processor, monitor the working status of each quantum bit combination, and select a target quantum bit combination from the multiple quantum bit combinations according to the working status to execute the task queue divided by the first-layer scheduling center for the corresponding quantum computing processor.

[0009] In some embodiments, the first-layer scheduling center is further used to extract the experiment ID and the task IDs of all tasks included in each experiment ID from the quantum experiment information to be processed submitted by the user, and form a task queue based on the experiment ID and the task IDs of all tasks included in each experiment ID;

[0010] The quantum bit combination is also used to return the experiment ID, task ID, and execution results to the first-level scheduling center after executing a quantum computing task.

[0011] In some embodiments, the first-layer scheduling center is also used to receive the experiment ID, task ID, and execution results returned by each target quantum bit combination, and store the task IDs and execution results of each task ID included in the experiment ID in the database in units of experiment ID.

[0012] In some embodiments, the first-layer scheduling center monitors the busyness of the quantum computing processor according to the following rules:

[0013] Acquire a working state of each quantum bit combination of each quantum computing processor, wherein the working state includes an idle state and a busy state;

[0014] In response to at least one quantum bit combination of a quantum computing processor being in an idle state, confirming that the quantum computing processor is not busy;

[0015] In response to all quantum bit combinations of a certain quantum computing processor being in a busy state, it is confirmed that the certain quantum computing processor is busy.

[0016] In some embodiments, the first-layer scheduling center performs task segmentation according to the following rules:

[0017] Get the total number of quantum computing processors that are not busy;

[0018] The total task volume is evenly divided into a plurality of task queues, wherein the total number of task queues is equal to the total number of quantum computing processors that are not busy.

[0019] In some embodiments, the second-layer dispatch center divides the quantum bit combinations and monitors according to the following rules:

[0020] Get the number of all quantum bits included in the quantum computing processor;

[0021] Comparing the number of all qubits with a preset number of groups to obtain the number of qubits included in each qubit combination, and evenly allocating a plurality of qubits according to the number of qubits to form a plurality of qubit combinations, wherein the preset number of groups is greater than or equal to two and less than or equal to the total number of qubits included in the quantum computing processor;

[0022] In response to a certain quantum bit combination currently executing a computing task, marking a working state of the certain quantum bit combination as a busy state;

[0023] In response to a certain quantum bit combination not currently executing a computing task, the working state of the certain quantum bit combination is marked as an idle state.

[0024] In some embodiments, the second-layer scheduling center selects the target quantum bit combination according to the following rules:

[0025] Get the number of qubit combinations in idle state;

[0026] In response to the number of qubit combinations in an idle state being multiple, selecting one of the qubit combinations in the idle state as a target qubit combination;

[0027] In response to there being only one qubit combination in an idle state, the qubit combination in the only idle state is used as the target qubit combination.

[0028] According to a second aspect of the present invention, a concurrent task scheduling method for a quantum computing processor is provided, the method comprising:

[0029] Provide at least one quantum computing processor, wherein each quantum computing processor has a plurality of quantum bits;

[0030] Using the first-layer scheduling center to monitor the busyness of each quantum computing processor, and extracting the total number of tasks from the quantum experiment information to be processed submitted by the user, and performing task segmentation based on the busyness and the total number of tasks to obtain a task queue corresponding to each quantum computing processor;

[0031] The second-layer scheduling center is used to divide multiple quantum bits into multiple quantum bit combinations based on each quantum computing processor, and the working status of each quantum bit combination is monitored, and a target quantum bit combination is selected from the multiple quantum bit combinations according to the working status to execute the task queue divided by the first-layer scheduling center for the corresponding quantum computing processor.

[0032] According to a third aspect of the present invention, there is further provided a computer device, the computer device comprising:

[0033] at least one processor; and

[0034] The memory stores a computer program that can be run on the processor, and the processor executes the aforementioned concurrent task scheduling method for a quantum computing processor when executing the program.

[0035] According to a fourth aspect of the present invention, a computer-readable storage medium is further provided, wherein the computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the aforementioned concurrent task scheduling method for a quantum computing processor is executed.

[0036] The above-mentioned concurrent task scheduling system for quantum computing processors adopts a two-layer scheduling center. The first layer is the scheduling of task allocation to the quantum computing processor, and the second layer is the scheduling of different quantum bit combinations in the quantum computing processor. By splitting the quantum computing processor into multiple quantum bit combinations, multiple users can concurrently operate the quantum computing processor, which improves the problem of the quantum computing processor being monopolized by experimental tasks, thereby improving the processing speed of experimental tasks.

[0037] In addition, the present invention also provides a concurrent task scheduling method for a quantum computing processor, a computer device and a computer-readable storage medium, which can also achieve the above-mentioned technical effects and will not be repeated here. BRIEF DESCRIPTION OF THE DRAWINGS

[0038] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings in the following description are only some embodiments of the present invention. For ordinary technicians in this field, other embodiments can be obtained based on these drawings without paying creative work.

[0039] Figure 1 A schematic diagram of the structure of a concurrent task scheduling system for a quantum computing processor provided by one embodiment of the present invention;

[0040] Figure 2 A flowchart of a concurrent task scheduling method for a quantum computing processor provided by one embodiment of the present invention;

[0041] Figure 3 FIG. 4 is a diagram showing the internal structure of a computer device in another embodiment of the present invention. DETAILED DESCRIPTION

[0042] In order to make the objectives, technical solutions and advantages of the present invention more clearly understood, the embodiments of the present invention are further described in detail below in combination with specific embodiments and with reference to the accompanying drawings.

[0043] It should be noted that all expressions using "first" and "second" in the embodiments of the present invention are for distinguishing two non-identical entities with the same name or non-identical parameters. It can be seen that "first" and "second" are only for the convenience of expression and should not be understood as limitations on the embodiments of the present invention. The subsequent embodiments will not explain this one by one.

[0044] In one embodiment, please refer to Figure 1 As shown, the present invention provides a concurrent task scheduling system 100 for a quantum computing processor. Specifically, the system includes:

[0045] At least one quantum computing processor 110, each quantum computing processor 110 having a plurality of quantum bits;

[0046] The first-layer scheduling center 120 is used to monitor the busyness of each quantum computing processor 110, extract the total number of tasks from the quantum experiment information to be processed submitted by the user, and perform task segmentation based on the busyness and the total number of tasks to obtain a task queue corresponding to each quantum computing processor 110;

[0047] The second-layer scheduling center 130 is used to divide the multiple quantum bits into multiple quantum bit combinations 111 based on each quantum computing processor 110, monitor the working status of each quantum bit combination 111, and select a target quantum bit combination from the multiple quantum bit combinations 111 according to the working status to execute the task queue divided by the first-layer scheduling center 120 for the corresponding quantum computing processor 110.

[0048] The above-mentioned concurrent task scheduling system for quantum computing processors adopts a two-layer scheduling center. The first layer is the scheduling of task allocation to the quantum computing processor, and the second layer is the scheduling of different quantum bit combinations in the quantum computing processor. By splitting the quantum computing processor into multiple quantum bit combinations, multiple users can concurrently operate the quantum computing processor, which improves the problem of the quantum computing processor being monopolized by experimental tasks, thereby improving the processing speed of experimental tasks.

[0049] In some embodiments, the first-layer scheduling center 120 is further used to extract the experiment ID and the task IDs of all tasks included in each experiment ID from the quantum experiment information to be processed submitted by the user, and form a task queue based on the experiment ID and the task IDs of all tasks included in each experiment ID;

[0050] The quantum bit combination 111 is also used to return the experiment ID, task ID, and execution result to the first-layer scheduling center 120 after executing a quantum computing task.

[0051] In some embodiments, the first-layer scheduling center 120 is also used to receive the experiment ID, task ID, and execution result returned by each target quantum bit combination, and store the task IDs and execution results of each task ID included in the experiment ID in the database in units of the experiment ID.

[0052] In some embodiments, the first-layer scheduling center 120 monitors the busyness of the quantum computing processor 110 according to the following rules:

[0053] Acquire a working state of each quantum bit combination 111 of each quantum computing processor 110, wherein the working state includes an idle state and a busy state;

[0054] In response to at least one quantum bit combination 111 of a certain quantum computing processor 110 being in an idle state, it is determined that the certain quantum computing processor 110 is not busy;

[0055] In response to all quantum bit combinations 111 of a certain quantum computing processor 110 being in a busy state, it is confirmed that the certain quantum computing processor 110 is busy.

[0056] In some embodiments, the first-layer scheduling center 120 performs task segmentation according to the following rules:

[0057] Obtaining the total number of quantum computing processors 110 that are not busy;

[0058] The total task volume is evenly divided into a plurality of task queues, wherein the total number of task queues is equal to the total number of quantum computing processors 110 that are not busy.

[0059] In some embodiments, the second-layer dispatch center 130 divides the quantum bit combination 111 and monitors according to the following rules:

[0060] Obtaining the number of all quantum bits included in the quantum computing processor 110;

[0061] Comparing the number of all qubits with a preset number of groups to obtain the number of qubits included in each qubit combination 111, and evenly allocating a plurality of qubits according to the number of qubits to form a plurality of qubit combinations, wherein the preset number of groups is greater than or equal to two and less than or equal to the total number of qubits 111 included in the quantum computing processor;

[0062] In response to a certain quantum bit combination 111 currently executing a computing task, marking a working state of the certain quantum bit combination 111 as a busy state;

[0063] In response to a certain quantum bit combination 111 not currently executing a computing task, the working state of the certain quantum bit combination 111 is marked as an idle state.

[0064] In some embodiments, the second-layer scheduling center 130 selects the target quantum bit combination according to the following rules:

[0065] Obtain the number of quantum bit combinations 111 in an idle state;

[0066] In response to the number of qubit combinations 111 in an idle state being multiple, selecting one of the qubit combinations 111 in the idle state as a target qubit combination;

[0067] In response to there being only one qubit combination 111 in an idle state, the qubit combination 111 in the idle state is used as the target qubit combination.

[0068] In another embodiment, in order to facilitate understanding of the solution of the present invention, a quantum computing processor containing 8 quantum bits is taken as an example. It is assumed that the quantum computing processor is divided into two quantum bit combinations. This embodiment provides another concurrent task scheduling system for quantum computing processors. The implementation principle of the system is as follows: the first-level scheduling center will concurrently schedule tasks according to the experimental task ID, the specific content of the experimental task, the idle state of the quantum computing processor and other information. For example, if there are 100 tasks, we can divide the tasks according to the number of processors. For example, if there are 10 quantum computing processors, each processor is assigned 10 experimental tasks; the second-level scheduling center is for scheduling different quantum bit combinations; after the bit combination of the quantum computing processor completes the experimental task, the ID and experimental results of the experimental task are sent to the back end of the cloud platform. After the back end of the cloud platform receives the message, it is saved in the database and file server. Each processor or bit combination will execute the experimental task information in sequence according to the scheduling strategy. After executing an experimental task information, it will be sent to the back end of the cloud platform, and then continue to execute the next experimental task. After all the tasks are completed, continue to execute the next experimental task.

[0069] The following will describe the implementation steps in detail in conjunction with each part of the system:

[0070] Step 1: The user submits the quantum experiment information to be executed to the cloud platform backend through the cloud platform or client software.

[0071] Step 2: The first-level dispatch center divides the experimental tasks in the system based on real-time monitoring of the operating status and task execution of each quantum computing processor. If there is only one quantum computing processor, no division is required. If there are two quantum computing processors and neither is busy, the total task is divided into two queues.

[0072] Step three: The first-level scheduling center sends the divided task queue to the second-level scheduling center corresponding to the quantum computing processor.

[0073] Step 4, the second-level scheduling strategy is: divide the 8-qubit quantum computing processor into two qubit combinations according to the topological structure. For example, the first four qubits can be recorded as combination one and the last four qubits can be recorded as combination two, and they are marked as idle.

[0074] Step 5: After receiving the task queue, the second-level scheduling center schedules the module to check the idle and busy status of the two combinations. If both are idle, a combination is randomly selected for task execution and the combination is marked as busy. If only one is idle, the experimental task is directly run on the idle combination, and the quantum computing processor is marked as busy.

[0075] Step 6: The quantum computing processor executes the queue experiment tasks in sequence according to the scheduling strategy, and feeds back the results to the first-level scheduling center after each task is completed.

[0076] Step 7: The first-level dispatch center saves the corresponding result information into the database table according to the experiment ID.

[0077] A concurrent task scheduling system for a quantum computing processor of this embodiment introduces a two-layer scheduling strategy to improve the task processing speed. The two-layer task scheduling mainly includes the first layer of scheduling for assigning tasks to the quantum computing processor, and the second layer of scheduling for different quantum bit combinations in the quantum computing processor. The characteristics of quantum circuits are used to utilize the parallel opportunities of many control layers in quantum programs. By realizing these different levels of parallelism, the user access efficiency can be greatly improved, so that when the number of user accesses increases, the operation of quantum experimental tasks is less restricted by the control processor, thereby improving the experimental task processing speed.

[0078] In some embodiments, please refer to Figure 2 As shown, the present invention also provides a concurrent task scheduling method 200 for a quantum computing processor, the method comprising:

[0079] Step 201, setting at least one quantum computing processor, wherein each quantum computing processor has a plurality of quantum bits;

[0080] Step 202: using the first-layer scheduling center to monitor the busyness of each quantum computing processor, extracting the total number of tasks from the quantum experiment information to be processed submitted by the user, and performing task segmentation based on the busyness and the total number of tasks to obtain a task queue corresponding to each quantum computing processor;

[0081] Step 203, using the second-layer scheduling center to divide the multiple quantum bits into multiple quantum bit combinations based on each quantum computing processor, and monitor the working status of each quantum bit combination, and select a target quantum bit combination from the multiple quantum bit combinations according to the working status to execute the task queue divided by the first-layer scheduling center for the corresponding quantum computing processor.

[0082] The above-mentioned concurrent task scheduling method for a quantum computing processor adopts a two-layer scheduling center. The first layer is the scheduling of task allocation to the quantum computing processor, and the second layer is the scheduling of different quantum bit combinations in the quantum computing processor. By splitting the quantum computing processor into multiple quantum bit combinations, multiple users can concurrently operate the quantum computing processor, which improves the problem of the quantum computing processor being monopolized by experimental tasks, thereby improving the processing speed of experimental tasks.

[0083] In some embodiments, the method further comprises:

[0084] The first-layer scheduling center is used to extract the experiment ID and the task IDs of all tasks included in each experiment ID from the quantum experiment information to be processed submitted by the user, and a task queue is formed based on the experiment ID and the task IDs of all tasks included in each experiment ID;

[0085] After executing a quantum computing task, the experiment ID, task ID, and execution result are returned to the first-level scheduling center using a combination of quantum bits.

[0086] In some embodiments, the method further comprises:

[0087] The first-layer scheduling center is used to receive the experiment ID, task ID, and execution result returned by each target quantum bit combination, and each task ID included in the experiment ID and the execution result of each task ID are stored in the database in units of the experiment ID.

[0088] In some embodiments, in step 202, the first-layer scheduling center monitors the busyness of the quantum computing processor according to the following rules:

[0089] Acquire a working state of each quantum bit combination of each quantum computing processor, wherein the working state includes an idle state and a busy state;

[0090] In response to at least one quantum bit combination of a quantum computing processor being in an idle state, confirming that the quantum computing processor is not busy;

[0091] In response to all quantum bit combinations of a certain quantum computing processor being in a busy state, it is confirmed that the certain quantum computing processor is busy.

[0092] In some embodiments, in step 203, the first-layer scheduling center performs task segmentation according to the following rules:

[0093] Get the total number of quantum computing processors that are not busy;

[0094] The total task volume is evenly divided into a plurality of task queues, wherein the total number of task queues is equal to the total number of quantum computing processors that are not busy.

[0095] In some embodiments, in step 203, the second-layer dispatch center divides the quantum bit combinations and monitors according to the following rules:

[0096] Get the number of all quantum bits included in the quantum computing processor;

[0097] Comparing the number of all qubits with a preset number of groups to obtain the number of qubits included in each qubit combination, and evenly allocating a plurality of qubits according to the number of qubits to form a plurality of qubit combinations, wherein the preset number of groups is greater than or equal to two and less than or equal to the total number of qubits included in the quantum computing processor;

[0098] In response to a certain quantum bit combination currently executing a computing task, marking a working state of the certain quantum bit combination as a busy state;

[0099] In response to a certain quantum bit combination not currently executing a computing task, the working state of the certain quantum bit combination is marked as an idle state.

[0100] In some embodiments, in step 203, the second-layer scheduling center selects the target quantum bit combination according to the following rules:

[0101] Get the number of qubit combinations in idle state;

[0102] In response to the number of qubit combinations in an idle state being multiple, selecting one of the qubit combinations in the idle state as a target qubit combination;

[0103] In response to there being only one qubit combination in an idle state, the qubit combination in the only idle state is used as the target qubit combination.

[0104] It should be noted that the specific limitations on the concurrent task scheduling method for a quantum computing processor can be found in the above limitations on the concurrent task scheduling system for a quantum computing processor, which will not be repeated here.

[0105] According to another aspect of the present invention, a computer device is provided. The computer device may be a server. Figure 3 As shown. The computer device includes a processor, a memory, a network interface and a database connected through a system bus. Among them, the processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program and a database. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The database of the computer device is used to store data. The network interface of the computer device is used to communicate with an external terminal through a network connection. When the computer program is executed by the processor, the concurrent task scheduling method for a quantum computing processor described above is implemented. Specifically, the method includes the following steps:

[0106] Provide at least one quantum computing processor, wherein each quantum computing processor has a plurality of quantum bits;

[0107] Using the first-layer scheduling center to monitor the busyness of each quantum computing processor, and extracting the total number of tasks from the quantum experiment information to be processed submitted by the user, and performing task segmentation based on the busyness and the total number of tasks to obtain a task queue corresponding to each quantum computing processor;

[0108] The second-layer scheduling center is used to divide multiple quantum bits into multiple quantum bit combinations based on each quantum computing processor, and the working status of each quantum bit combination is monitored, and a target quantum bit combination is selected from the multiple quantum bit combinations according to the working status to execute the task queue divided by the first-layer scheduling center for the corresponding quantum computing processor.

[0109] According to another aspect of the present invention, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the concurrent task scheduling method for a quantum computing processor described above is implemented. Specifically, the method includes executing the following steps:

[0110] Provide at least one quantum computing processor, wherein each quantum computing processor has a plurality of quantum bits;

[0111] Using the first-layer scheduling center to monitor the busyness of each quantum computing processor, and extracting the total number of tasks from the quantum experiment information to be processed submitted by the user, and performing task segmentation based on the busyness and the total number of tasks to obtain a task queue corresponding to each quantum computing processor;

[0112] The second-layer scheduling center is used to divide multiple quantum bits into multiple quantum bit combinations based on each quantum computing processor, and the working status of each quantum bit combination is monitored, and a target quantum bit combination is selected from the multiple quantum bit combinations according to the working status to execute the task queue divided by the first-layer scheduling center for the corresponding quantum computing processor.

[0113] Those skilled in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to memory, storage, database or other media used in the embodiments provided in this application can include non-volatile and / or volatile memory. Non-volatile memory can include read-only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM) or flash memory. Volatile memory can include random access memory (RAM) or external cache memory. As an illustration and not limitation, RAM is available in many forms, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous link (Synchlink) DRAM (SLDRAM), memory bus (Rambus) direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).

[0114] The technical features of the above embodiments may be arbitrarily combined. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0115] The above-mentioned embodiments only express several implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the invention patent. It should be pointed out that, for a person of ordinary skill in the art, several variations and improvements can be made without departing from the concept of the present application, and these all belong to the protection scope of the present application. Therefore, the protection scope of the patent of the present application shall be subject to the attached claims.

Claims

1. A concurrent task scheduling system for a quantum computing processor, characterized in that: The system comprises: at least one quantum computing processor, each quantum computing processor having a plurality of qubits; A first-layer scheduling center, which is used to monitor the busyness of each quantum computing processor, extract the total number of tasks from the quantum experiment information to be processed submitted by the user, and perform task segmentation based on the busyness and the total number of tasks to obtain a task queue corresponding to each quantum computing processor; A second-layer scheduling center, the second-layer scheduling center is used to divide the multiple quantum bits into multiple quantum bit combinations based on each quantum computing processor, monitor the working state of each quantum bit combination, and select a target quantum bit combination from the multiple quantum bit combinations according to the working state to execute the task queue divided by the first-layer scheduling center for the corresponding quantum computing processor; The first-layer dispatch center monitors the busyness of the quantum computing processor according to the following rules: obtaining the working state of each quantum bit combination of each quantum computing processor, wherein the working state includes an idle state and a busy state; in response to at least one quantum bit combination of a quantum computing processor being in an idle state, confirming that the quantum computing processor is not busy; in response to all quantum bit combinations of a quantum computing processor being in a busy state, confirming that the quantum computing processor is busy; The first-layer scheduling center performs task segmentation according to the following rules: obtaining the total number of quantum computing processors that are not busy; and evenly dividing the total task volume into multiple task queues, wherein the total number of task queues is equal to the total number of quantum computing processors that are not busy.

2. The concurrent task scheduling system for a quantum computing processor according to claim 1, characterized in that: The first-layer scheduling center is also used to extract the experiment ID and the task IDs of all tasks included in each experiment ID from the quantum experiment information to be processed submitted by the user, and form a task queue based on the experiment ID and the task IDs of all tasks included in each experiment ID; The quantum bit combination is also used to return the experiment ID, task ID, and execution results to the first-level scheduling center after executing a quantum computing task.

3. The concurrent task scheduling system for a quantum computing processor according to claim 2, characterized in that: The first-level scheduling center is also used to receive the experiment ID, task ID, and execution result returned by each target quantum bit combination, and store the task IDs and execution results of each task ID included in the experiment ID in the database in units of the experiment ID.

4. The concurrent task scheduling system for a quantum computing processor according to claim 1, characterized in that: The second-level dispatch center divides the quantum bit combinations and monitors them according to the following rules: Get the number of all quantum bits included in the quantum computing processor; Comparing the number of all qubits with a preset number of groups to obtain the number of qubits included in each qubit combination, and evenly allocating a plurality of qubits according to the number of qubits to form a plurality of qubit combinations, wherein the preset number of groups is greater than or equal to two and less than or equal to the total number of qubits included in the quantum computing processor; In response to a certain quantum bit combination currently executing a computing task, marking a working state of the certain quantum bit combination as a busy state; In response to a certain quantum bit combination not currently executing a computing task, the working state of the certain quantum bit combination is marked as an idle state.

5. The concurrent task scheduling system for a quantum computing processor according to claim 4, characterized in that: The second-level scheduling center selects the target quantum bit combination according to the following rules: Get the number of qubit combinations in idle state; In response to the number of qubit combinations in an idle state being multiple, selecting one of the qubit combinations in the idle state as a target qubit combination; In response to there being only one qubit combination in an idle state, the qubit combination in the only idle state is used as the target qubit combination.

6. A concurrent task scheduling method for a quantum computing processor, characterized in that: The method comprises: Provide at least one quantum computing processor, wherein each quantum computing processor has a plurality of quantum bits; Using the first-layer scheduling center to monitor the busyness of each quantum computing processor, and extracting the total number of tasks from the quantum experiment information to be processed submitted by the user, and performing task segmentation based on the busyness and the total number of tasks to obtain a task queue corresponding to each quantum computing processor; The second-layer scheduling center is used to divide multiple quantum bits into multiple quantum bit combinations based on each quantum computing processor, and the working status of each quantum bit combination is monitored, and a target quantum bit combination is selected from the multiple quantum bit combinations according to the working status to execute the task queue divided by the first-layer scheduling center for the corresponding quantum computing processor.

7. A computer device, characterized in that: include: at least one processor; as well as A memory storing a computer program executable in the processor, wherein the processor executes the method according to claim 6 when executing the program.

8. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the method according to claim 6 is performed.

Images