Task scheduling method of quantum classical hybrid computing system and related device

Abstract

The invention discloses a task scheduling method of a quantum classical hybrid computing system and a related device. The task scheduling method comprises the steps of obtaining a first task request submitted by a user; the first task request is an application program with task coding characteristics based on quantum computing hybrid programming, and a quantum part and a classical part of the same application program establish a first linkage relationship based on the task coding characteristics; determining a first scheduling sequence of the first task based on computing resources required by the first task, computing resources of the current quantum classical hybrid computing system and a first self-defined scheduling strategy; respectively configuring the quantum part and the classic part of the first task to a quantum task queue and a classic task queue according to the first scheduling sequence; scheduling a quantum task queue and a classical task queue based on the quantum classical hybrid computing system and the first linkage relationship; by introducing a linkage mechanism between a quantum part and a classic part, the overall calculation efficiency of a quantum and classic hybrid application calculation task is improved.

Description

TECHNICAL FIELD

[0001] The application belongs to the technical field of quantum computing, and particularly relates to a task scheduling method of a quantum-classical hybrid computing system and a related device. BACKGROUND

[0002] In a quantum-classical hybrid application program, a quantum computer participates in a local specific algorithm in a cooperative computing manner, and a classical computer undertakes main logic computation. If the quantum computing part and the classical computing part lack an effective cooperative scheduling mechanism, they will be independent of each other, that is, they will run independently, thereby reducing the overall computing efficiency.

[0003] Therefore, a technical problem to be solved is to provide a new task scheduling method to improve the overall computing efficiency of a quantum-classical hybrid computing system. SUMMARY

[0004] The application aims to provide a task scheduling method of a quantum-classical hybrid computing system and a related device, and aims to improve the overall computing efficiency of a quantum-classical hybrid computing system.

[0005] One embodiment of the application provides a task scheduling method of a quantum-classical hybrid computing system, and the method comprises the following steps.

[0006] Obtaining a first task request submitted by a user; the first task request is an application program with task coding characteristics based on quantum computing hybrid programming, and a quantum part and a classical part of the same application program establish a first linkage relationship based on the task coding characteristics;

[0007] Determining a first scheduling sequence of the first task based on computing resources required by the first task, computing resources currently possessed by the quantum-classical hybrid computing system, and a first custom scheduling strategy;

[0008] Configuring the quantum part and the classical part of the first task to a quantum task queue and a classical task queue respectively according to the first scheduling sequence;

[0009] Scheduling the quantum task queue and the classical task queue based on the quantum-classical hybrid computing system and the first linkage relationship.

[0010] Optionally, the scheduling of the quantum task queue and the classical task queue based on the quantum-classical hybrid computing system and the first linkage relationship comprises the following steps.

[0011] scheduling the quantum task queue and the classical task queue based on a quantum computing resource part of the quantum-classical hybrid computing system, the second customized scheduling strategy, and the first linkage relationship; or scheduling the classical task queue and the quantum task queue based on a classical computing resource part of the quantum-classical hybrid computing system, the second customized scheduling strategy, and the first linkage relationship.

[0012] Optionally, the first customized scheduling strategy, the second customized scheduling strategy, and the third customized scheduling strategy each include one or a combination of short job priority, first come first compute, and task priority.

[0013] Optionally, the first customized scheduling strategy, the second customized scheduling strategy, and the third customized scheduling strategy each include one or a combination of short job priority, first come first compute, and task priority.

[0014] Optionally, the scheduling the quantum task queue and the classical task queue based on a quantum computing resource part of the quantum-classical hybrid computing system, the second customized scheduling strategy, and the first linkage relationship includes:

[0015] determining a target quantum task of the quantum task queue based on a quantum computing resource part of the quantum-classical hybrid computing system and the second customized scheduling strategy;

[0016] obtaining a target classical task corresponding to the target quantum task based on the first linkage relationship;

[0017] determining a scheduling order of the target classical task based on a classical computing resource part of the quantum-classical hybrid computing system and the second customized scheduling strategy;

[0018] scheduling the target quantum task to schedule the target classical task based on the scheduling order.

[0019] Optionally, the scheduling the classical task queue and the quantum task queue based on a classical computing resource part of the quantum-classical hybrid computing system, the second customized scheduling strategy, and the first linkage relationship includes:

[0020] determining a target classical task of the classical task queue based on a classical computing resource part of the quantum-classical hybrid computing system and the second customized scheduling strategy;

[0021] obtaining the target quantum task corresponding to the target classical task based on the first linkage relationship;

[0022] determining a scheduling order of the target quantum task based on a quantum computing resource part of the quantum-classical hybrid computing system and the second customized scheduling strategy;

[0023] scheduling the target classical task to schedule the target quantum task based on the scheduling order.

[0024] Optionally, the computing resources include quantum computing resources and classical computing resources.

[0025] Yet another embodiment of the present application provides a task scheduling device of a quantum-classical hybrid computing system, the device comprising:

[0026] An obtaining unit is configured to obtain a first task request submitted by a user, the first task request being an application program with task coding features based on quantum computing hybrid programming, and a quantum part and a classical part of the same application program establishing a first linkage relationship based on the task coding features;

[0027] A determining unit is configured to determine a first scheduling order of the first task based on computing resources required by the first task, computing resources currently possessed by the quantum-classical hybrid computing system, and a first custom scheduling strategy;

[0028] A configuring unit is configured to configure the quantum part and the classical part of the first task to a quantum task queue and a classical task queue respectively according to the first scheduling order;

[0029] A scheduling unit is configured to schedule the quantum task queue and the classical task queue based on the quantum-classical hybrid computing system and the first linkage relationship.

[0030] Yet another embodiment of the present application provides an electronic device, the computer readable storage medium storing a computer program, the computer program comprising program instructions, the program instructions being executed by a processor to perform the method in any of the above embodiments.

[0031] Yet another embodiment of the present application provides a computer readable storage medium, the computer readable storage medium storing a computer program, the computer program comprising program instructions, the program instructions being executed by a processor to perform the method in any of the above embodiments.

[0032] Yet another embodiment of the present application provides a quantum computer operating system, the quantum computer operating system performing task scheduling of a quantum-classical hybrid computing system according to the method in any of the above embodiments.

[0033] Compared with the prior art, the application firstly obtains a first task request submitted by a user; the first task request is an application program with a task coding feature based on quantum computing hybrid programming, and a quantum part and a classical part of the same application program establish a first linkage relationship based on the task coding feature; then a first scheduling order of the first task is determined based on computing resources required by the first task, computing resources possessed by a current quantum-classical hybrid computing system and a first custom scheduling strategy; and the quantum part and the classical part of the first task are respectively configured to a quantum task queue and a classical task queue according to the first scheduling order; finally, the quantum task queue and the classical task queue are scheduled based on the quantum-classical hybrid computing system and the first linkage relationship.

[0034] The application firstly obtains a first task request submitted by a user; the first task request is an application with task coding characteristics based on quantum computing hybrid programming, the quantum part and the classical part of the same application establish a first linkage relationship based on the task coding characteristics, by receiving and identifying the task request submitted by the user, it can be ensured that the user request can be responded in time, by identifying these task requests, the system can further understand the characteristics and requirements of the task, providing necessary information for subsequent task scheduling, and the first linkage relationship established based on the task coding characteristics clearly defines the dependency relationship between the quantum part and the classical part, ensuring the consistency of subsequent task execution; then determine the first scheduling order of the first task based on the computing resources required by the first task, the computing resources possessed by the current quantum-classical hybrid computing system and the first custom scheduling strategy, by evaluating the computing resources required for scheduling tasks, it is helpful to understand the size and complexity of the task, by considering the computing resources possessed by the current system, it is helpful to judge whether there are enough resources to support the execution of the task, combined with the custom scheduling strategy, the optimal scheduling plan can be made, such comprehensive consideration ensures the effective use of resources, and can maximize the efficiency of task execution and the overall performance of the system; and according to the first scheduling order, the quantum part and the classical part of the first task are configured to a quantum task queue and a classical task queue respectively, by distributing different parts of the task to respective queues, the classification management of the task is realized, which is conducive to the orderly execution of subsequent scheduling, because the quantum task queue and the classical task queue can be independently managed, thereby avoiding the conflict between different types of computing resources, improving the parallelism and efficiency of task processing; finally, the quantum task queue and the classical task queue are scheduled based on the quantum-classical hybrid computing system and the first linkage relationship, when executing task scheduling, not only the allocation of computing resources should be considered, but also the mutual dependency relationship between the quantum part and the classical part should be considered, by this way, it ensures that each part of the task is executed in the correct order, which not only meets the logical requirements of the task itself, but also fully utilizes the characteristics of quantum and classical computing resources, such scheduling strategy helps to improve the overall efficiency of task execution, while ensuring the accuracy and consistency of task execution. BRIEF DESCRIPTION OF DRAWINGS

[0035] Figure 1 A network block diagram of a task scheduling system of a quantum-classical hybrid computing system provided by an embodiment of the application.

[0036] Figure 2 A flowchart of a task scheduling method of a quantum-classical hybrid computing system provided by an embodiment of the application.

[0037] Figure 3A flowchart of a determination method for scheduling a quantum task queue and a classical task queue is provided for an embodiment of the present application.

[0038] Figure 4 A flowchart of another determination method for scheduling a classical task queue and a quantum task queue is provided for an embodiment of the present application.

[0039] Figure 5 A structural diagram of a task scheduling device of a quantum-classical hybrid computing system is provided for an embodiment of the present application.

[0040] Figure 6 A structural diagram of an electronic device is provided for an embodiment of the present application. DETAILED DESCRIPTION

[0041] The embodiments described below with reference to the drawings are exemplary and are only used to explain the present application, and cannot be explained as a limitation of the present application.

[0042] Figure 1 A network diagram of a task scheduling system of a quantum-classical hybrid computing system is provided for an embodiment of the present application. The task scheduling system of the quantum-classical hybrid computing system can include a network 110, a server 120, a wireless device 130, a client 140, a storage 150, a classical computing unit 160, a quantum computing unit 170, and can also include additional storage, classical processors, quantum processors and other devices not shown.

[0043] The network 110 is a medium for providing communication links between various devices and computers connected together in the task scheduling system of the quantum-classical hybrid computing system, including but not limited to the Internet, an intranet, a local area network, a mobile communication network and combinations thereof, and the connection mode can adopt wired, wireless communication links or optical fiber cables, etc.

[0044] The server 120, the wireless device 130 and the client 140 are conventional data processing systems, which can contain data and have application programs or software tools for performing conventional computing processes. The client 140 can be a personal computer or a network computer, so the data can also be provided by the server 120. The wireless device 130 can be a smartphone, a tablet, a notebook computer, a smart wearable device, etc. The storage unit 150 can include a database 151, which can be configured to store data such as qubit parameters, quantum logic gate parameters, quantum circuits, quantum programs, etc.

[0045] The classical computing unit 160 (quantum computing unit 170) can include a classical processor 161 (quantum processor 171) for processing classical data (quantum data) and a memory 162 (memory 172) for storing classical data (quantum data), and the classical data (quantum data) can be a boot file, an operating system image, and an application 163 (application 173) that can be used to implement a quantum algorithm compiled by a task scheduling method of a quantum-classical hybrid computing system according to an embodiment of the present application.

[0046] Any data or information stored or generated in the classical computing unit 160 (quantum computing unit 170) can also be configured to be stored or generated in another classical (quantum) processing system in a similar manner, and any application executed by it can also be configured to be executed in another classical (quantum) processing system in a similar manner.

[0047] It should be noted that a real quantum computer is a hybrid structure, which at least includes Figure 1 two parts: a classical computing unit 160 responsible for performing classical computing and control; and a quantum computing unit 170 responsible for running quantum programs to implement quantum computing.

[0048] The classical computing unit 160 and the quantum computing unit 170 described above can be integrated in one device or distributed in two different devices. For example, a first device including the classical computing unit 160 runs a classical computer operating system, provides quantum application development tools and services thereon, and also provides storage and network services required by quantum applications. A user develops a quantum program through the quantum application development tools and services thereon, and sends the quantum program to a second device including the quantum computing unit 170 through the network services thereon. The second device runs a quantum computer operating system, parses the code of the quantum program through the quantum computer operating system to compile instructions that can be recognized and executed by the quantum processor 170, and the quantum processor 170 implements a quantum algorithm corresponding to the quantum program according to the instructions.

[0049] The computing unit of the classical processor 161 in the classical computing unit 160 is a CMOS tube based on a silicon chip, and such a computing unit is not limited by time and coherence, i.e., such a computing unit is not limited by the length of use and is available at any time. In addition, in a silicon chip, the number of such computing units is also sufficient, and the number of computing units in a classical processor 161 is currently in the thousands, and the number of computing units is sufficient and the computing logic of the CMOS tube is fixed, for example: AND logic. When operating with CMOS tubes, a large number of CMOS tubes are combined with limited logic functions to achieve the effect of operation.

[0050] In the quantum computing unit 170, the basic computing unit of the quantum processor 171 is the qubit. The input of a qubit is limited by coherence and coherence time; that is, a qubit is limited by its available usage time and is not always readily available. Making full use of qubits within their available usage time is a key challenge in quantum computing. Furthermore, the number of qubits in a quantum computer is one of the representative indicators of its performance. Each qubit performs computational functions through on-demand configured logical functions. Given the limited number of qubits and the diverse logical functions available in quantum computing, such as Hadamard gates (H gates), Pauli-X gates (X gates), Pauli-Y gates (Y gates), Pauli-Z gates (Z gates), X gates, RY gates, RZ gates, CNOT gates, CR gates, iSWAP gates, Tofoli gates, etc., quantum computing requires combining a limited number of qubits with diverse logical function combinations to achieve computational effects.

[0051] Based on these differences, the design of classical logic functions applied to CMOS transistors and the design of quantum logic functions applied to qubits are significantly and fundamentally different. The design of classical logic functions applied to CMOS transistors does not need to consider the individuality of CMOS transistors. For example, the representation of a CMOS transistor in a silicon chip is its individual identifier, location, and usable time of each CMOS transistor. Therefore, classical algorithms composed of classical logic functions only express the operational relationship of the algorithm, not the algorithm's dependence on individual CMOS transistors.

[0052] Quantum logic functions applied to qubits need to consider the individuality of each qubit, such as its position within the quantum chip, its relationship with surrounding qubits, and the duration of its usable time. Therefore, quantum algorithms composed of quantum logic functions not only express the computational relationships within the algorithm but also its dependence on the individual qubits.

[0053] A quantum chip can include qubits and channels for controlling them. Quantum logic gates are implemented using analog signals. Different combinations of analog signals are applied to the qubits through these channels, thereby creating quantum circuits with different functions to process data. Therefore, the design of quantum logic functions in the qubits (including the design of whether qubits are used and the design of the efficiency of each qubit) is crucial for improving the computational performance of quantum computers and requires special design. This is the unique characteristic of quantum algorithms based on quantum logic functions, and it is fundamentally and significantly different from classical algorithms based on classical logic functions. The aforementioned design considerations for qubits are technical problems that ordinary computing devices do not need to consider or address.

[0054] In quantum-classical hybrid applications, quantum computers participate in local specific algorithms in a cooperative computing manner, while classical computers undertake the main logical computing. If the quantum computing part and the classical computing part lack an effective cooperative scheduling mechanism, they will run independently, resulting in a decrease in overall computing efficiency.

[0055] Therefore, the urgent technical problem to be solved is to propose a new task scheduling method to improve the overall computational efficiency of tasks in quantum-classical hybrid computing systems.

[0056] See Figure 2 , Figure 2 A task scheduling method for a quantum-classical hybrid computing system provided in this embodiment of the invention includes the following steps:

[0057] Step S201: Obtain the first task request submitted by the user; the first task request is an application with task coding characteristics based on quantum computing hybrid programming, and the quantum part and the classical part of the same application establish a first linkage relationship based on the task coding characteristics.

[0058] Among them, task encoding features refer to specific data labels or annotations; the first linkage relationship refers to the dependency relationship between quantum computing tasks and their corresponding classical computing tasks.

[0059] Specifically, the quantum computer first obtains the first task request submitted by the user. Here, the first task request refers to an application with task coding characteristics based on the hybrid programming of the quantum computer. The quantum part and the classical part of the same application establish a first linkage relationship based on the task coding characteristics, that is, establish a corresponding dependency relationship between the two.

[0060] For example, suppose there is a financial risk management application designed to assess the risk level of an investment portfolio. This application consists of two parts: a classical Monte Carlo simulation algorithm used to generate various scenarios under market volatility, and a quantum optimization algorithm used to find the optimal investment strategy among the generated scenarios. In this application, the classical Monte Carlo simulation algorithm and the quantum optimization algorithm are distinguished by task-encoded features. The quantum part of the application uses the quantum optimization algorithm to find the optimal investment strategy, while the classical part uses the Monte Carlo simulation algorithm to generate market scenarios. There is a dependency between the two, which is encoded into the application through task-encoded features to ensure coordinated operation between the quantum and classical parts.

[0061] Step S202: Determine the first scheduling order of the first task based on the computing resources required for the first task, the computing resources available in the current quantum-classical hybrid computing system, and the first custom scheduling strategy.

[0062] Among them, computing resources refer to quantum chips, the number of qubits, the number of CPU cores in a classical computer, and the size of memory, etc.; the first custom scheduling strategy refers to one or a combination of shortest job first, first-come-first-served, and task priority.

[0063] Specifically, the first scheduling order of the first task is determined by first judging the computing resources required by the first task request, the computing resources available in the current quantum-classical hybrid computing system, and the first custom scheduling strategy.

[0064] For example, suppose a user submits a task request for molecular dynamics simulation. This task request is an application with task coding characteristics based on quantum computing hybrid programming. First, the system needs to evaluate the computing resources required by the task request. Second, the system checks the computing resources available in the current quantum-classical hybrid computing system. Suppose the current system has 20 CPU cores, 64GB of memory, and a quantum processor containing 50 qubits. According to a first custom scheduling policy, which is assumed to prioritize applications that require fewer computing resources, the system further determines the first scheduling order of the first task based on the above processing results.

[0065] Step S203: Configure the quantum part and the classical part of the first task into the quantum task queue and the classical task queue respectively according to the first scheduling order.

[0066] Specifically, based on the first scheduling order of the first task determined in step S202 above, the quantum part and the classical part of the target application are configured into the quantum task queue and the classical task queue, respectively, according to the first scheduling order.

[0067] For example, suppose a user submits a drug design task that includes two types of computation: one is the generation of the preliminary structure of candidate compounds (classical computation part), and the other is the optimization of the structure of these compounds (quantum computation part). The system first evaluates the resources required for the task and confirms that the current system has sufficient resources to support these computations. Then, the system determines the priority to execute the quantum computation part, i.e. the optimization of candidate compounds, according to the scheduling strategy. The system then puts the quantum computation part of the task into the quantum task queue to wait for execution, while putting the classical computation part of the task into the classical task queue to wait for execution.

[0068] Step S204: Schedule the quantum task queue and the classical task queue based on the quantum-classical hybrid computing system and the first linkage relationship.

[0069] Specifically, based on the situation of the quantum-classical hybrid computing system and the first linkage relationship, a comprehensive judgment is made to determine the scheduling of the quantum task queue and the classical task queue.

[0070] This invention first obtains a first task request submitted by a user. This first task request is an application program with task-encoding characteristics based on quantum computing hybrid programming. The quantum and classical parts of the same application establish a first linkage relationship based on the task-encoding characteristics. By receiving and identifying the user-submitted task requests, the system ensures timely response. Identifying these task requests allows the system to further understand the characteristics and requirements of the tasks, providing necessary information for subsequent task scheduling. Furthermore, the first linkage relationship established based on the task-encoding characteristics clarifies the dependency between the quantum and classical parts, ensuring consistency in subsequent task execution. Then, based on the computational resources required by the first task, the computational resources available in the current quantum-classical hybrid computing system, and a first custom scheduling strategy, the first scheduling order of the first task is determined. Evaluating the computational resources required for scheduling tasks helps to understand the scale and complexity of the tasks. Considering the current system's computational resources helps to determine whether there are sufficient resources to support task execution. Combined with the custom scheduling strategy, an optimal scheduling plan can be formulated. This comprehensive approach... The system comprehensively considers and ensures the effective utilization of resources, maximizing task execution efficiency and overall system performance. Furthermore, by configuring the quantum and classical components of the first task into quantum and classical task queues respectively according to the first scheduling order, task classification management is achieved. This facilitates orderly execution of subsequent scheduling, as the quantum and classical task queues can be managed independently, avoiding conflicts between different types of computing resources and improving the parallelism and efficiency of task processing. Finally, the quantum and classical task queues are scheduled based on the quantum-classical hybrid computing system and the first linkage relationship. When scheduling tasks, not only the allocation of computing resources but also the interdependence between the quantum and classical components must be considered. This ensures that each part of the task is executed in the correct order, satisfying the logical requirements of the task itself while fully utilizing the characteristics of quantum and classical computing resources. This scheduling strategy helps improve the overall efficiency of task execution while ensuring the accuracy and consistency of task execution.

[0071] In one embodiment of this application, scheduling the quantum task queue and the classical task queue based on the quantum-classical hybrid computing system and the first linkage relationship includes:

[0072] The quantum task queue and the classical task queue are scheduled based on the quantum computing resource portion of the quantum-classical hybrid computing system, the second custom scheduling strategy, and the first linkage relationship; or the classical task queue and the quantum task queue are scheduled based on the classical computing resource portion of the quantum-classical hybrid computing system, the second custom scheduling strategy, and the first linkage relationship.

[0073] Specifically, the scheduling of the quantum task queue and the classical task queue is first performed based on the quantum computing resources of the quantum-classical hybrid computing system, the second custom scheduling strategy, and the first linkage relationship; or the scheduling of the quantum task queue and the classical task queue is performed based on the classical computing resources of the quantum-classical hybrid computing system, the second custom scheduling strategy, and the first linkage relationship.

[0074] In one embodiment of this application, the first custom scheduling policy, the second custom scheduling policy, and the third custom scheduling policy all include:

[0075] Shortest job priority, first-come-first-served, and task priority, or a combination thereof.

[0076] Among them, "shortest job priority" means that the task with the shortest expected execution time will be executed first. When scheduling, the system will prioritize the task with the shortest expected execution time. "First come, first served" means that tasks are processed according to the order in which they arrive, that is, the task that arrives first is executed first. "Task priority" means that different priorities are assigned to tasks based on their importance or urgency. Tasks with higher priority are executed first. The task priority can be set statically or adjusted dynamically.

[0077] See Figure 3 , Figure 3 A flowchart of a method for determining a quantum task queue and a classical task queue, provided for embodiments of the present invention, includes the following steps:

[0078] Step S301: Based on the quantum computing resource portion of the quantum-classical hybrid computing system and the second custom scheduling strategy, determine the target quantum task of the quantum task queue.

[0079] Quantum computing resources refer to quantum chips and the number of qubits, among other things.

[0080] Specifically, the target quantum tasks of the quantum task queue are determined by comprehensively judging and processing based on the quantum computing resources possessed by the quantum-classical hybrid computing system and the second custom scheduling strategy.

[0081] For example, suppose a user submits a task request for drug molecule design optimization, which includes classical and quantum computing components. First, the quantum computing resource requirements are assessed, including the number of quantum chips and qubits. Assuming the current system has 40 available qubits, and based on a second custom scheduling strategy, taking into account factors such as qubit requirements, the system selects task Q. A As the target quantum task, task Q A Place it in the quantum task queue and wait for execution scheduling.

[0082] Step S302: Obtain the target classical task corresponding to the target quantum task based on the first linkage relationship.

[0083] Specifically, the target classical task corresponding to the target quantum task is obtained based on the first linkage relationship.

[0084] For example, according to the target quantum task Q in step S301 above... A To determine the corresponding classic task C A .

[0085] Step S303: Determine the scheduling order of the target classical task based on the classical computing resource portion of the quantum-classical hybrid computing system and the second custom scheduling strategy.

[0086] The "classic resources" section refers to the number of CPU cores and memory size of a classic computer.

[0087] Specifically, the scheduling order of the target classical tasks is determined based on the classical computing resources of the quantum-classical hybrid computing system and the second custom scheduling strategy.

[0088] Step S304: Schedule the target quantum task to schedule the target classical task based on the scheduling order.

[0089] In summary, firstly, the target quantum tasks of the quantum task queue are determined based on the quantum computing resources of the quantum-classical hybrid computing system and the second custom scheduling strategy. By determining the target quantum tasks based on the currently available quantum computing resources and the second custom scheduling strategy, high-priority or more urgent quantum tasks are ensured to be executed first. Then, the target classical tasks corresponding to the target quantum tasks are obtained based on the first linkage relationship, ensuring collaborative work between the quantum and classical parts and enhancing the logical coherence of task execution. Furthermore, the scheduling order of the target classical tasks is determined based on the classical computing resources of the quantum-classical hybrid computing system and the second custom scheduling strategy. By effectively utilizing classical computing resources and determining the execution order based on task priority, the overall performance and resource utilization of the system are improved. Finally, the target quantum tasks are scheduled to schedule the target classical tasks based on the scheduling order. In this way, the system can efficiently complete task scheduling and ensure close cooperation between quantum and classical computing, thereby achieving fast and orderly task execution.

[0090] See Figure 4 , Figure 4 A flowchart of another method for determining classical task queues and quantum task queues provided in an embodiment of the present invention includes the following steps:

[0091] Step S401: Based on the classical computing resource portion of the quantum-classical hybrid computing system and the second custom scheduling strategy, determine the target classical task of the classical task queue.

[0092] Specifically, the target classical tasks of the classical task queue are determined based on the classical computing resources of the quantum-classical hybrid computing system and the second custom scheduling strategy.

[0093] Step S402: Obtain the target quantum task corresponding to the target classical task based on the first linkage relationship.

[0094] Specifically, the target quantum task corresponding to the target classical task is obtained based on the first linkage relationship.

[0095] Step S403: Determine the scheduling order of the target quantum task based on the quantum computing resource portion of the quantum-classical hybrid computing system and the second custom scheduling strategy.

[0096] Specifically, the scheduling order of the target quantum tasks is determined based on the quantum computing resources of the quantum-classical hybrid computing system and the second custom scheduling strategy.

[0097] Step S404: Schedule the target classical task to schedule the target quantum task based on the scheduling order.

[0098] In summary, firstly, based on the classical computing resources of the quantum-classical hybrid computing system and the second custom scheduling strategy, the system determines the target classical tasks in the classical task queue. The system then selects the classical tasks to be executed based on the currently available classical computing resources and the second custom scheduling strategy. This helps to rationally allocate classical computing resources, avoid resource waste, and ensure that high-priority or more urgent classical tasks are executed first. Secondly, based on the first linkage relationship, the system obtains the target quantum tasks corresponding to the target classical tasks, ensuring collaborative work between the classical and quantum components and enhancing the logical coherence of task execution. Thirdly, based on the quantum computing resources of the quantum-classical hybrid computing system and the second custom scheduling strategy, the system determines the scheduling order of the target quantum tasks. The system determines the execution order of the target quantum tasks based on the currently available quantum computing resources and the second custom scheduling strategy, effectively utilizing quantum computing resources and arranging the execution order according to task priority or dependencies, thereby improving the overall system performance and resource utilization. Finally, the system schedules the target classical tasks to schedule the target quantum tasks based on the scheduling order. In this way, the system can efficiently complete task processing and ensure close cooperation between classical and quantum computing, thereby achieving fast and orderly task execution.

[0099] In one embodiment of this application, the computing resources include quantum computing resources and classical computing resources.

[0100] Quantum computing resources refer to quantum chips and the number of qubits, while classical computing resources refer to the number of CPU cores and memory size of classical computers.

[0101] See Figure 5 , Figure 5 This is a structural diagram of a task scheduling device for a quantum-classical hybrid computing system provided in an embodiment of the present invention. The device includes an acquisition unit 501, a determination unit 502, a configuration unit 503, and a scheduling unit 504, wherein:

[0102] The acquisition unit 501 is used to acquire a first task request submitted by the user; the first task request is an application with task coding characteristics based on quantum computing hybrid programming, and the quantum part and the classical part of the same application establish a first linkage relationship based on the task coding characteristics.

[0103] Among them, task encoding features refer to specific data labels or annotations; the first linkage relationship refers to the dependency relationship between quantum computing tasks and their corresponding classical computing tasks.

[0104] The determining unit 502 is used to determine the first scheduling order of the first task based on the computing resources required by the first task, the computing resources of the current quantum-classical hybrid computing system, and the first custom scheduling strategy.

[0105] Among them, computing resources refer to quantum chips, the number of qubits, the number of CPU cores in a classical computer, and the size of memory, etc.; the first custom scheduling strategy refers to one or a combination of shortest job first, first-come-first-served, and task priority.

[0106] Specifically, the first custom scheduling policy, the second custom scheduling policy, and the third custom scheduling policy all include:

[0107] Shortest job priority, first-come-first-served, and task priority, or a combination thereof.

[0108] Specifically, the computing resources include quantum computing resources and classical computing resources.

[0109] Configuration unit 503 is configured to configure the quantum part and the classical part of the first task into the quantum task queue and the classical task queue respectively according to the first scheduling order.

[0110] The scheduling unit 504 is used to schedule the quantum task queue and the classical task queue based on the quantum-classical hybrid computing system and the first linkage relationship.

[0111] Specifically, scheduling the quantum task queue and the classical task queue based on the quantum-classical hybrid computing system and the first linkage relationship includes:

[0112] The quantum task queue and the classical task queue are scheduled based on the quantum computing resource portion of the quantum-classical hybrid computing system, the second custom scheduling strategy, and the first linkage relationship; or the classical task queue and the quantum task queue are scheduled based on the classical computing resource portion of the quantum-classical hybrid computing system, the second custom scheduling strategy, and the first linkage relationship.

[0113] Specifically, the quantum computing resource component of the quantum-classical hybrid computing system, the second custom scheduling strategy, and the first linkage relationship for scheduling the quantum task queue and the classical task queue include:

[0114] The quantum computing resource component of the quantum-classical hybrid computing system and the second custom scheduling strategy determine the target quantum tasks of the quantum task queue.

[0115] Based on the first linkage relationship, the target classical task corresponding to the target quantum task is obtained.

[0116] The scheduling order of the target classical task is determined based on the classical computing resource portion of the quantum-classical hybrid computing system and the second custom scheduling strategy.

[0117] The target quantum task is scheduled to schedule the target classical task based on the scheduling order.

[0118] Specifically, scheduling the classical task queue and the quantum task queue based on the classical computing resources of the quantum-classical hybrid computing system, the second custom scheduling strategy, and the first linkage relationship includes:

[0119] Based on the classical computing resources of the quantum-classical hybrid computing system and the second custom scheduling strategy, the target classical tasks of the classical task queue are determined.

[0120] Based on the first linkage relationship, the target quantum task corresponding to the target classical task is obtained.

[0121] The scheduling order of the target quantum task is determined based on the quantum computing resource portion of the quantum-classical hybrid computing system and the second custom scheduling strategy.

[0122] The target classical task is scheduled to schedule the target quantum task based on the scheduling order.

[0123] The specific functions and effects of the task scheduling device in the aforementioned quantum-classical hybrid computing system can be explained by referring to other embodiments in this specification, and will not be repeated here. Each module in the task scheduling device of the quantum-classical hybrid computing system can be implemented entirely or partially through software, hardware, or a combination thereof. Each module can be embedded in or independent of the processor in the computer device in hardware form, or it can be stored in the memory of the computer device in software form, so that the processor can call and execute the operations corresponding to each module.

[0124] Please see Figure 6 This specification also provides an electronic device, including a memory and a processor. The memory stores a computer program, and the processor executes the computer program to implement the task scheduling method of the quantum-classical hybrid computing system in any of the above embodiments. Please refer to [link to documentation]. Figure 6 The electronic device can be a classical computer or a quantum computer.

[0125] This specification also provides a computer-readable storage medium storing a computer program thereon, which, when executed by a computer, causes the computer to perform the task scheduling method of the quantum-classical hybrid computing system in any of the above embodiments.

[0126] This specification also provides a computer program product containing instructions that, when executed by a computer, cause the computer to perform the task scheduling method of the quantum-classical hybrid computing system in any of the above embodiments.

[0127] It is understood that the specific examples in this specification are only intended to help those skilled in the art better understand the implementation methods described herein, and are not intended to limit the scope of the invention.

[0128] It is understood that in the various embodiments of this specification, the sequence number of each process does not imply the order of execution. The execution order of each process should be determined by its function and internal logic, and should not limit the implementation process of the embodiments of this specification in any way.

[0129] It is understood that the various implementation methods described in this specification can be implemented individually or in combination, and the implementation methods in this specification are not limited in this respect.

[0130] Unless otherwise stated, all technical and scientific terms used in the embodiments of this specification have the same meaning as commonly understood by one of ordinary skill in the art. The terminology used in this specification is for the purpose of describing particular embodiments only and is not intended to limit the scope of this specification. The term "and / or" as used in this specification includes any and all combinations of one or more of the associated listed items. The singular forms "a," "the," and "the" as used in the embodiments of this specification and the appended claims are also intended to include the plural forms unless the context clearly indicates otherwise.

[0131] It is understood that the processor in the embodiments of this specification can be an integrated circuit chip with signal processing capabilities. In implementation, each step of the above method embodiments can be completed by integrated logic circuits in the processor's hardware or by instructions in software form. The processor can be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components. It can implement or execute the methods, steps, and logic block diagrams disclosed in the embodiments of this specification. The general-purpose processor can be a microprocessor or any conventional processor. The steps of the methods disclosed in the embodiments of this specification can be directly implemented by a hardware decoding processor, or by a combination of hardware and software modules in the decoding processor. The software modules can reside in random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, or other mature storage media in the art. This storage medium is located in memory; the processor reads information from the memory and, in conjunction with its hardware, completes the steps of the above methods.

[0132] It is understood that the memory in the embodiments of this specification may be volatile memory or non-volatile memory, or may include both volatile and non-volatile memory. Non-volatile memory may be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), or flash memory. Volatile memory may be random access memory (RAM). It should be noted that the memory in the systems and methods described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0133] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this specification.

[0134] Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the aforementioned method implementations, and will not be repeated here.

[0135] In the several embodiments provided in this specification, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between devices or units may be electrical, mechanical, or other forms.

[0136] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment, depending on actual needs.

[0137] In addition, the functional units in the various embodiments of this specification can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.

[0138] If the aforementioned functions are implemented as software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solutions of this specification, in essence, or the parts that contribute to the prior art, or parts of the technical solutions, can be embodied in the form of software products. These computer software products are stored in a storage medium and include several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this specification. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0139] The above description is merely a specific embodiment of this specification, but the scope of protection of this invention is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in this specification should be included within the scope of protection of this specification. Therefore, the scope of protection of this invention should be determined by the scope of the claims.

Claims

1. A task scheduling method for a quantum-classical hybrid computing system, characterized in that, The method includes: The system obtains a first task request submitted by the user; the first task request is an application with task coding characteristics based on quantum computing hybrid programming, and the quantum part and the classical part of the same application establish a first linkage relationship based on the task coding characteristics; The first scheduling order of the first task is determined based on the computing resources required for the first task, the computing resources available in the current quantum-classical hybrid computing system, and the first custom scheduling strategy. According to the first scheduling order, the quantum part and the classical part of the first task are respectively configured into the quantum task queue and the classical task queue; The quantum task queue and the classical task queue are scheduled based on the quantum-classical hybrid computing system and the first linkage relationship.

2. The method according to claim 1, characterized in that, The scheduling of the quantum task queue and the classical task queue based on the quantum-classical hybrid computing system and the first linkage relationship includes: The quantum task queue and the classical task queue are scheduled based on the quantum computing resource portion of the quantum-classical hybrid computing system, the second custom scheduling strategy, and the first linkage relationship; or the classical task queue and the quantum task queue are scheduled based on the classical computing resource portion of the quantum-classical hybrid computing system, the second custom scheduling strategy, and the first linkage relationship.

3. The method according to claim 1, characterized in that, The first custom scheduling policy, the second custom scheduling policy, and the third custom scheduling policy all include: Shortest job priority, first-come-first-served, and task priority, or a combination thereof.

4. The method according to claim 2, characterized in that, The quantum computing resource component of the quantum-classical hybrid computing system, the second custom scheduling strategy, and the first linkage relationship for scheduling the quantum task queue and the classical task queue include: The quantum computing resource component of the quantum-classical hybrid computing system and the second custom scheduling strategy determine the target quantum tasks of the quantum task queue. Based on the first linkage relationship, the target classical task corresponding to the target quantum task is obtained; The scheduling order of the target classical task is determined based on the classical computing resource portion of the quantum-classical hybrid computing system and the second custom scheduling strategy. The target quantum task is scheduled to schedule the target classical task based on the scheduling order.

5. The method according to claim 2, characterized in that, The scheduling of the classical computing resources of the quantum-classical hybrid computing system, the second custom scheduling strategy, and the first linkage relationship, including the scheduling of the classical task queue and the quantum task queue, comprises: Based on the classical computing resource portion of the quantum-classical hybrid computing system and the second custom scheduling strategy, the target classical tasks of the classical task queue are determined. Based on the first linkage relationship, the target quantum task corresponding to the target classical task is obtained; The scheduling order of the target quantum task is determined based on the quantum computing resource portion of the quantum-classical hybrid computing system and the second custom scheduling strategy. The target classical task is scheduled to schedule the target quantum task based on the scheduling order.

6. The method according to claim 1, characterized in that, The computing resources include quantum computing resources and classical computing resources.

7. A task scheduling device for a quantum-classical hybrid computing system, characterized in that, The device includes: The acquisition unit is used to acquire a first task request submitted by the user; the first task request is an application with task coding characteristics based on quantum computing hybrid programming, and the quantum part and the classical part of the same application establish a first linkage relationship based on the task coding characteristics; The determining unit is used to determine the first scheduling order of the first task based on the computing resources required by the first task, the computing resources available in the current quantum-classical hybrid computing system, and the first custom scheduling strategy. A configuration unit is configured to configure the quantum part and the classical part of the first task into a quantum task queue and a classical task queue, respectively, according to the first scheduling order. The scheduling unit is used to schedule the quantum task queue and the classical task queue based on the quantum-classical hybrid computing system and the first linkage relationship.

8. An electronic device, characterized in that, include: Processor and memory; The processor is connected to a memory, wherein the memory is used to store a computer program, and the processor is used to invoke the computer program to execute the method as described in claims 1-6.

9. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program, the computer program including program instructions that, when executed by a processor, perform the method as described in claims 1-6.

10. A quantum computer operating system, characterized in that, The quantum computer operating system implements task scheduling of the quantum-classical hybrid computing system according to any one of claims 1-6.

Images