A task management method, device, equipment, storage medium and computer program product

Abstract

This application provides a task management method, apparatus, device, storage medium, and computer program product. The method is applied to a first device deployed in the cloud. The first device includes a first layer and a second layer. The method includes: in the first layer, constructing a first task and sending the first task to the second layer; wherein the first task includes at least a first quantum task corresponding to a quantum gate model and a second quantum task corresponding to a quantum annealing model; in the second layer, performing verification processing on the first task, and if the first task passes the verification, constructing a second task based on the first task and scheduling the second task to the corresponding second device for execution; wherein the second task includes the first task, and the second device includes at least a first quantum machine corresponding to a quantum gate model and a second quantum machine corresponding to a quantum annealing model, thereby improving the execution efficiency of quantum tasks.

Description

Technical Field

[0001] This application relates to the field of quantum computer technology, and in particular to a task management method, apparatus, device, storage medium, and computer program product. Background Technology

[0002] Current quantum computers use qubits instead of binary bits in traditional computers, utilizing the superposition state and quantum superposition properties of quantum mechanics for computation. There are currently two main quantum computing models in the world: the quantum gate model and the quantum annealing model. The quantum gate model, often called the "general-purpose" model, can achieve parallel computing and solve complex problems through quantum gates. However, when facing the challenge of quantum error correction, the quantum annealing model is more intuitive and practical, excelling at solving optimization problems, such as in logistics and finance. Technological approaches for the quantum gate model include ion traps, neutral atoms, and superconductivity; while technological approaches for quantum annealing include photonic quantum computing and superconductors based on Cherfson junctions.

[0003] However, current quantum computing cloud platforms designed based on quantum gate models or quantum annealing models typically only support one type of quantum computing power. In addition, the different quantum computing technology routes of different models result in a very limited range of tasks that each platform can run and the business problems that can be solved, thereby reducing the efficiency of task processing. Summary of the Invention

[0004] This application provides a task management method, apparatus, device, storage medium, and computer program product that can improve task processing efficiency.

[0005] The technical solution of this application embodiment is implemented as follows:

[0006] In a first aspect, embodiments of this application provide a task management method, the method being applied to a first device deployed in the cloud, the first device comprising a first layer and a second layer, the method comprising:

[0007] In the first layer, a first task is constructed and sent to the second layer; wherein, the first task includes at least a first quantum task corresponding to the quantum gate model and a second quantum task corresponding to the quantum annealing model;

[0008] In the second layer, the first task is verified. If the first task passes the verification, a second task is constructed based on the first task, and the second task is scheduled to the corresponding second device for execution. The second task includes the first task, and the second device includes at least the first quantum real machine corresponding to the quantum gate model and the second quantum real machine corresponding to the quantum annealing model.

[0009] Secondly, embodiments of this application provide a task management device, which is applied to a first device. The task management device includes: a construction unit, a sending unit, a verification unit, and a scheduling unit; wherein...

[0010] The construction unit is used to construct the first task in the first layer;

[0011] The sending unit is used to send the first task to the second layer; wherein the first task includes at least a first quantum task corresponding to the quantum gate model and a second quantum task corresponding to the quantum annealing model;

[0012] The verification unit is used to perform verification processing on the first task in the second layer;

[0013] The construction unit is further configured to construct a second task based on the first task if the first task passes the verification.

[0014] The scheduling unit is used to schedule the second task to the corresponding second device for execution; wherein the second task includes the first task, and the second device includes at least the first quantum prototype corresponding to the quantum gate model and the second quantum prototype corresponding to the quantum annealing model.

[0015] Thirdly, embodiments of this application provide a first device, the first device comprising: a processor and a memory; wherein,

[0016] The memory is used to store computer programs that can run on the processor;

[0017] The processor is configured to execute the task management method described above when running the computer program.

[0018] Fourthly, embodiments of this application provide a computer-readable storage medium storing computer program code, which, when executed by a computer, implements the task management method described above.

[0019] Fifthly, embodiments of this application provide a computer program product, including a computer program that, when executed by a processor, implements the task management method described above.

[0020] This application provides a task management method, apparatus, device, storage medium, and computer program product. The method is applied to a first device deployed in the cloud. The first device includes a first layer and a second layer. The method includes: in the first layer, constructing a first task and sending the first task to the second layer; wherein the first task includes at least a first quantum task corresponding to a quantum gate model and a second quantum task corresponding to a quantum annealing model; in the second layer, performing verification processing on the first task, and if the first task passes the verification, constructing a second task based on the first task and scheduling the second task to the corresponding second device for execution; wherein the second task includes the first task, and the second device includes at least a first quantum physical machine corresponding to a quantum gate model and a second quantum physical machine corresponding to a quantum annealing model. Therefore, it can be seen that a first quantum task corresponding to the quantum gate model and a second quantum task corresponding to the quantum annealing model can be constructed at the first layer. That is, the embodiments of this application can simultaneously construct quantum tasks (i.e., the first task) related to different quantum models at the first layer. Then, the first task can be verified at the second layer. If the verification is successful, the second task is constructed based on the first task, and the second task is scheduled to the first quantum machine corresponding to the quantum gate model and the second quantum machine corresponding to the quantum annealing model for execution. That is, the first device in the embodiments of this application can support multiple types of quantum computing power, thereby scheduling different types of quantum machines to execute corresponding quantum tasks, thereby improving the execution efficiency of quantum tasks. Attached Figure Description

[0021] Figure 1 This is a schematic diagram of the task management method proposed in the embodiments of this application. Figure 1 ;

[0022] Figure 2 This is a schematic diagram of the architecture of the first device proposed in an embodiment of this application;

[0023] Figure 3 This is a schematic diagram of the hybrid task scheduling process proposed in the embodiments of this application;

[0024] Figure 4 This is a schematic diagram of the multi-technology route quantum computing power cloud architecture proposed in the embodiments of this application;

[0025] Figure 5 This is a schematic diagram of the task management method proposed in the embodiments of this application. Figure 2 ;

[0026] Figure 6 This is a schematic diagram of the composition structure of the task management device proposed in the embodiments of this application;

[0027] Figure 7 This is a schematic diagram of the composition structure of the first device proposed in the embodiments of this application. Detailed Implementation

[0028] The technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. It should be understood that the specific embodiments described herein are only for explaining the relevant application and not for limiting the application. Furthermore, it should be noted that, for ease of description, only the parts related to the relevant application are shown in the accompanying drawings.

[0029] With the rapid development of science and technology, quantum computing is gradually becoming a shining star in the field. Quantum computers use qubits instead of binary bits in traditional computers, utilizing the superposition state and quantum superposition properties of quantum mechanics for computation. Currently, there are two mainstream quantum computing models in the world: the quantum gate model and the quantum annealing model. Both have jointly driven the progress of quantum computing. The quantum gate model is known as the "general-purpose" model, achieving parallel computing through quantum gates to solve complex problems, but it faces the challenge of quantum error correction. The quantum annealing model is more intuitive and practical, excelling at solving optimization problems, such as in logistics and finance. The technological routes of the quantum gate model include ion traps, neutral atoms, and superconductivity; the technological routes of quantum annealing include photonics and superconductors based on Cherfson junctions.

[0030] However, current quantum computing cloud platforms designed based on quantum gate models or quantum annealing models typically only support one type of quantum computing power. In addition, the different quantum computing technology routes of different models result in a very limited range of tasks that each platform can run and the business problems that can be solved, thereby reducing the efficiency of task processing.

[0031] To address the issue that current quantum computing cloud platforms designed based on quantum gate models or quantum annealing models typically only support one type of quantum computing power, thus reducing task processing efficiency, this application provides a task management method, apparatus, device, storage medium, and computer program product. The method is applied to a first device deployed in the cloud, which includes a first layer and a second layer. The method includes: in the first layer, constructing a first task and sending it to the second layer; wherein the first task includes at least a first quantum task corresponding to the quantum gate model and a second quantum task corresponding to the quantum annealing model; in the second layer, verifying the first task, and if the first task passes verification, constructing a second task based on the first task and scheduling the second task to the corresponding second device for execution; wherein the second task includes the first task, and the second device includes at least a first quantum machine corresponding to the quantum gate model and a second quantum machine corresponding to the quantum annealing model. Therefore, it can be seen that a first quantum task corresponding to the quantum gate model and a second quantum task corresponding to the quantum annealing model can be constructed at the first layer. That is, the embodiments of this application can simultaneously construct quantum tasks (i.e., the first task) related to different quantum models at the first layer. Then, the first task can be verified at the second layer. If the verification is successful, the second task is constructed based on the first task, and the second task is scheduled to the first quantum machine corresponding to the quantum gate model and the second quantum machine corresponding to the quantum annealing model for execution. That is, the first device in the embodiments of this application can support multiple types of quantum computing power, thereby scheduling different types of quantum machines to execute corresponding quantum tasks, thereby improving the execution efficiency of quantum tasks.

[0032] The technical solutions in the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings.

[0033] This application provides a task management method applied to a first device deployed in the cloud, the first device comprising a first layer and a second layer. Figure 1 This is a schematic diagram of the task management method proposed in the embodiments of this application. Figure 1 ,like Figure 1 As shown, the task management method may include the following steps:

[0034] Step 101: In the first layer, construct the first task and send the first task to the second layer; wherein, the first task includes at least the first quantum task corresponding to the quantum gate model and the second quantum task corresponding to the quantum annealing model.

[0035] In embodiments of this application, the task management device can construct a first task at the first layer and send the first task to the second layer.

[0036] It should be noted that, in the embodiments of this application, the first device may include a quantum cloud platform device, and this application does not specifically limit the type of the first device.

[0037] It should be noted that, in the embodiments of this application, the first layer may include an application service layer, which can be user-facing and support quantum physics real machine computing, quantum simulation computing, and quantum algorithm experiments to meet the diverse quantum computing business needs of users. This application does not specifically limit the functions supported by the application service layer.

[0038] It should be noted that, in the embodiments of this application, the second layer may include a core capability layer. This layer can manage heterogeneous quantum computing power in an integrated manner through standardized interfaces, covering both simulated computing power and real machine computing power. Resource scheduling enables integrated monitoring and scheduling of multiple types of computing power resources; task scheduling enables "task-based" invocation of real machine computing power. Scheduling services communicate internally with each other through the Remote Procedure Call (RPC) protocol to improve response efficiency. Task and real machine topology-related data are protected by asymmetric encryption and the Hypertext Transfer Protocol Secure (HTTPS) protocol to ensure data transmission security with the quantum computer. This application does not specifically limit the functions of the core capability layer.

[0039] It should be noted that, in the embodiments of this application, the first task includes at least the first quantum task corresponding to the quantum gate model and the second quantum task corresponding to the quantum annealing model.

[0040] It should be noted that, in the embodiments of this application, the first task includes at least the first quantum task corresponding to the quantum gate model and the second quantum task corresponding to the quantum annealing model, and may also include other quantum tasks. This application does not specifically limit the number and type of quantum tasks included in the first task.

[0041] It should be noted that, in the embodiments of this application, Figure 2 This is a schematic diagram of the architecture of the first device proposed in an embodiment of this application, as shown below. Figure 2 As shown, the first device may include a third layer in addition to the first and second layers. This application does not specify the number of layers included in the first device.

[0042] It should be noted that, in the embodiments of this application, the third layer may include an application support layer. This layer can provide support for users to construct quantum circuits in various scenarios, prepare quadratic unconstrained binary optimization (QUBO) matrices, conduct hybrid quantum algorithm experiments, provide the programming kernel required for quantum simulation, support graphical user interface (GUI) programming, integrated development environment (IDE) programming, and construct quantum tasks via file upload from the World Wide Web (WEB). This application does not specifically limit the functions of the application support layer.

[0043] It should be noted that, in the embodiments of this application, when the task management device constructs the first task, it can obtain N programming methods through the third layer; wherein, the programming method is at least used to construct the first task, and N is a positive integer; then, it can construct the first quantum task based on the first programming method; wherein, the first programming method includes one or more of the N programming methods; it can also construct the second quantum task based on the second programming method; wherein, the second programming method includes one or more of the N programming methods.

[0044] It should be noted that, in the embodiments of this application, the programming method may include GUI programming, IDE programming, etc., and this application does not specifically limit the type and number of programming methods.

[0045] It should be noted that, in the embodiments of this application, the first programming method may include GUI programming or other programming methods, and this application does not specifically limit the type of the first programming method.

[0046] For example, in the embodiments of this application, the task management device can construct a first quantum task corresponding to a quantum gate model based on quantum circuit GUI programming and IDE programming. The first quantum task can include one or more of ion trap circuit tasks, superconducting quantum circuit tasks and simulated quantum circuit tasks. The constructed first quantum task can be characterized in the form of Open Quantum Assembly Language (OpenQASM) code. The task type included in the first quantum task in this application is not specifically limited.

[0047] It should be noted that, in the embodiments of this application, the second programming method may include IDE programming, and this application does not specifically limit the type of the second programming method.

[0048] For example, in the embodiments of this application, the task management device can construct a second quantum task based on the IDE programming environment. The second quantum task can include a QUBO matrix task prepared based on the IDE programming environment or a QUBO matrix task for file upload. The form of the QUBO matrix can be as shown below. This application does not specifically limit the task type included in the second quantum task.

[0049] [[-768,448,448,448,248,0,0,0,152,0,0,0,104,0,0,0,72,0,0,0,24,0,0,0,200,0,0,0,176,0,0,0,128,0,0,0,104,0,0,0],[0,-792,448,448,0,248,0,0,0,152,0,0,0,104,0,0,0,72 ,0,0,0,24,0,0,0,200,0,0,0,176,0,0,0,128,0,0,0,104,0,0],[0,0,-844,448,0,0,248,0,0,0,152,0,0,0,104,0,0,0,72,0,0,0,24,0,0,0,200,0,0,0,176,0,0,0,128,0,0,0,104,0]]

[0050] In other words, in the embodiments of this application, the first device can support multiple types of quantum programming kernel tools, including tools such as quantum circuit GUI programming, IDE simulation programming examples, IDE algorithm simulation examples, and file upload, thereby supporting the construction of different quantum tasks based on diverse programming tools. That is, in the embodiments of this application, quantum tasks corresponding to quantum gate models and quantum tasks corresponding to quantum annealing models can be constructed simultaneously, thereby handling complex computational problems and greatly improving the execution efficiency of quantum tasks.

[0051] Step 102: In the second layer, the first task is verified. If the first task passes the verification, a second task is constructed based on the first task, and the second task is scheduled to the corresponding second device for execution. The second task includes the first task, and the second device includes at least the first quantum real machine corresponding to the quantum gate model and the second quantum real machine corresponding to the quantum annealing model.

[0052] In the embodiments of this application, after the task management device constructs a first task at the first layer and sends the first task to the second layer, it can perform verification processing on the first task at the second layer. If the first task passes the verification, a second task is constructed based on the first task, and the second task is scheduled to the corresponding second device for execution.

[0053] It should be noted that, in the embodiments of this application, the second device includes at least the first quantum prototype corresponding to the quantum gate model and the second quantum prototype corresponding to the quantum annealing model, and may also include other types of quantum prototypes. This application does not specifically limit the type and number of devices included in the second device.

[0054] It should be noted that, in the embodiments of this application, when the task management device performs verification processing on the first task, it can perform verification processing on the first data format and the syntax rules of the first quantum task to obtain a first verification result; it can also perform verification processing on the second data format and the syntax rules of the second quantum task to obtain a second verification result; and then, if both the first verification result and the second verification result indicate that the verification is passed, it can be determined that the first task has passed verification.

[0055] For example, in an embodiment of this application, when the task management device performs verification processing on the first data format and syntax rules of the first quantum task, it may perform verification on the data format and syntax rules of the OpenQASM code.

[0056] For example, in an embodiment of this application, when the task management device performs verification processing on the second data format and the syntax rules of the second quantum task, it may perform verification on the data format and syntax rules of the QUBO matrix.

[0057] It should be noted that, in the embodiments of this application, if the first verification result and / or the second verification result indicate that the verification fails, the first task verification is determined to fail.

[0058] In other words, in the embodiments of this application, the task management device can verify the data format and syntax rules of the first quantum task and the second quantum task respectively. After the verification is passed, the second task is constructed based on the first task, thereby improving the success rate of subsequent execution of the second task.

[0059] Furthermore, in the embodiments of this application, when the task management device constructs a second task based on a first task, it can determine first parameter information corresponding to the first quantum task; wherein, the first parameter information includes at least parameter information of the quantum vendor associated with the first quantum task; then, it can construct a third quantum task based on the first parameter information and the first quantum task; it can also determine second parameter information corresponding to the second quantum task; wherein, the second parameter information includes at least parameter information of the quantum vendor associated with the second quantum task, and construct a fourth quantum task based on the second parameter information and the second quantum task; and then, it can construct a second task based on the third quantum task and the fourth quantum task.

[0060] It should be noted that, in the embodiments of this application, the first parameter information includes at least the parameter information of the quantum vendor associated with the first quantum task, such as the identification information (ID) of the quantum vendor, and may also include other parameter information, such as application ID, application name, user ID, computing power type, number of qubits, queue name, technology stack type, task priority, number of experiments, timeout time, etc. This application does not make specific limitations on the amount and type of information contained in the first parameter information.

[0061] It should be noted that, in the embodiments of this application, the second parameter information may include at least the parameter information of the quantum vendor associated with the second quantum task, such as the ID of the quantum vendor, and may also include other parameter information, such as application ID, application name, user ID, computing power type, number of qubits, queue name, technology stack type, task priority, number of experiments, timeout time, etc. This application does not make specific limitations on the amount and type of information contained in the second parameter information.

[0062] For example, in the embodiments of this application, when the task management device constructs a third quantum task based on the first parameter information and the first quantum task, it can first convert the data of the first quantum task into a standard data format, such as converting the OpenQASM code into a specific JavaScript Object Notation (JSON) array. Then, the converted task data can be combined with the first parameter information to construct the third quantum task. This application does not specifically limit the type of standard data format.

[0063] For example, in an embodiment of this application, when the task management device constructs a fourth quantum task based on the second parameter information and the second quantum task, it can combine the second parameter information and the QUBO matrix to construct the fourth quantum task.

[0064] It should be noted that, in the embodiments of this application, after constructing the third quantum task and the fourth quantum task, the task management device can construct a second task based on the third quantum task and the fourth quantum task.

[0065] It should be noted that, in the embodiments of this application, after the task management device constructs a second task based on the first task, it can schedule the second task to the corresponding second device for execution.

[0066] Optionally, in the embodiments of this application, when the task management device schedules the second task to the corresponding second device for execution, it may first schedule the third quantum task to the first message queue and the fourth quantum task to the second message queue; wherein, the first message queue contains a message queue of the quantum gate model and the second message queue contains a message queue of the quantum annealing model; then, it may query the first encryption rule of the quantum vendor associated with the first quantum task based on the first parameter information; then, it may encrypt the third quantum task through the first encryption rule and send the encrypted quantum task to the corresponding first quantum device so that the first quantum device can execute the encrypted quantum task.

[0067] For example, in an embodiment of this application, the task management device can schedule the third quantum task to the first message queue and the fourth quantum task to the second message queue through the quantum task scheduling module in the second layer. Then, it can query the first encryption rule of the quantum vendor associated with the first quantum task through the quantum gate model adaptation service. It can also query the application programming interface (API) and data parsing rules of the quantum vendor. Then, it can encrypt the third quantum task through the first encryption rule and send the encrypted quantum task to the corresponding first quantum device.

[0068] It should be noted that, in the embodiments of this application, the first quantum machine may include an ion trap quantum computer, a superconducting quantum computer, or other quantum computers. This application does not specifically limit the type of the first quantum machine.

[0069] Optionally, in embodiments of this application, when the task management device schedules the second task to the corresponding second device for execution, it can also query the second encryption rule of the quantum vendor associated with the fourth quantum task based on the second parameter information; then the fourth quantum task can be encrypted using the second encryption rule, and the encrypted quantum task can be sent to the corresponding second quantum device so that the second quantum device can execute the encrypted quantum task.

[0070] It should be noted that, in the embodiments of this application, the second quantum computer may include optical quantum computers, superconducting quantum computers, or other types of quantum computers. This application does not specifically limit the type of the second quantum computer.

[0071] In other words, in the embodiments of this application, the task management device can add first parameter information to construct a third quantum task based on the first quantum task, and add second parameter information to construct a fourth quantum task based on the second quantum task. Then, the third and fourth quantum tasks can be scheduled to the corresponding message queues. Furthermore, the encryption rules associated with the third and fourth quantum tasks can be queried, and the corresponding encryption rules can be used to encrypt the third and fourth quantum tasks respectively. The encrypted quantum tasks are then sent to the corresponding quantum real machines, thereby enabling the quantum real machines corresponding to the quantum gate model and the quantum real machines corresponding to the quantum annealing model to execute different quantum tasks. That is, the first device in the embodiments of this application can support the quantum computing capabilities of quantum gate model and quantum annealing model to the cloud, that is, support multiple types of quantum computing power, thereby scheduling different quantum tasks to different types of quantum real machines for execution, which greatly improves the execution efficiency of tasks.

[0072] It should be noted that, in the embodiments of this application, when the task management device schedules the third quantum task to the first message queue and the fourth quantum task to the second message queue, it can determine the corresponding first task adapter based on the first parameter information and schedule the third quantum task to the first message queue through the first task adapter; then it can determine the corresponding second task adapter based on the second parameter information and schedule the fourth quantum task to the second message queue through the second task adapter.

[0073] For example, in the embodiments of this application, Figure 3 This is a schematic diagram of the hybrid task scheduling process proposed in the embodiments of this application, such as... Figure 3 As shown, when the task management device schedules the third quantum task to the first message queue and the fourth quantum task to the second message queue, it can abstract the quantum gate model and the executor interface of quantum annealing. Then, it can automatically launch the corresponding task adapter for docking processing according to the task parameters (i.e., the first parameter information and the second parameter information). The task adapter can include superconducting quantum adapters, ion trap quantum adapters, neutral atom quantum adapters, and optical quantum adapters, etc. The quantum task can be routed to the corresponding message queue through the corresponding task adapter. The task adapter can decrypt and verify the received callback message and push it to the callback executor for processing, and asynchronously push it to the task scheduler for status refresh.

[0074] For example, in the embodiments of this application, the task management device can perform scheduling based on the quantum computer number, real machine simulation type, technology stack type, etc. in the first parameter information, and automatically launch the corresponding task adapter for docking processing. For example, launch the corresponding superconducting quantum adapter (i.e., the first task adapter), and then the third quantum task can be scheduled to the first message queue through the superconducting quantum adapter.

[0075] It should be noted that, in the embodiments of this application, after the task management device schedules the second task to the corresponding second device for execution, it can receive the first information sent by the first quantum machine and / or the second information sent by the second quantum machine; wherein, the first information includes the execution status information of the third quantum task and the second information includes the execution status information of the fourth quantum task; then, the status information of the first task can be updated synchronously based on the first information and / or the second information, and the computing power status information can also be updated.

[0076] Optionally, in embodiments of this application, the first quantum prototype and / or the second quantum prototype can also send the computation results, visualization results, and circuit optimization results of the quantum task back to the first device through the corresponding adaptation service interface, so that the first device can generate a visualization analysis report based on the computation results and display the actual running bits and quantum gates based on the optimized circuit; wherein, the adaptation service interface may include the adaptation service interface of the quantum gate model and the adaptation service interface of the quantum annealing model.

[0077] In summary, the first device can support multiple types of quantum programming kernel tools, including quantum circuit GUI programming, IDE simulation programming examples, IDE algorithm simulation examples, file upload tools, etc., thereby supporting the construction of different quantum tasks based on diverse programming tools. Specifically, in this embodiment, a first quantum task corresponding to a quantum gate model and a second quantum task corresponding to a quantum annealing model can be constructed simultaneously, thus handling complex computational problems and significantly improving the execution efficiency of quantum tasks. Then, the first data format and syntax rules of the first quantum task can be verified to obtain a first verification result; similarly, the second data format and syntax rules of the second quantum task can be verified to obtain a second verification result. If both the first and second verification results indicate successful verification, the second task can then be constructed based on the first task, thereby improving the success rate of subsequent execution of the second task. For example, task... The management device can add first parameter information to construct a third quantum task based on the first quantum task, and add second parameter information to construct a fourth quantum task based on the second quantum task. Then, it can schedule the third and fourth quantum tasks to their corresponding message queues, query the encryption rules associated with the third and fourth quantum tasks, encrypt the third and fourth quantum tasks respectively using the corresponding encryption rules, and send the encrypted quantum tasks to their respective quantum machines. This allows the quantum machines corresponding to the quantum gate model and the quantum annealing model to execute different quantum tasks. In other words, the first device in this embodiment can support the cloud deployment of quantum computing capabilities based on both the quantum gate model and the quantum annealing model, supporting multiple types of quantum computing power. This allows different quantum tasks to be scheduled to different types of quantum machines for execution, greatly improving task execution efficiency.

[0078] This application provides a task management method applied to a first device deployed in the cloud. The first device includes a first layer and a second layer. The method includes: in the first layer, constructing a first task and sending the first task to the second layer; wherein the first task includes at least a first quantum task corresponding to a quantum gate model and a second quantum task corresponding to a quantum annealing model; in the second layer, performing verification processing on the first task, and if the first task passes the verification, constructing a second task based on the first task and scheduling the second task to the corresponding second device for execution; wherein the second task includes the first task, and the second device includes at least a first quantum physical machine corresponding to a quantum gate model and a second quantum physical machine corresponding to a quantum annealing model. Therefore, it can be seen that a first quantum task corresponding to the quantum gate model and a second quantum task corresponding to the quantum annealing model can be constructed at the first layer. That is, the embodiments of this application can simultaneously construct quantum tasks (i.e., the first task) related to different quantum models at the first layer. Then, the first task can be verified at the second layer. If the verification is successful, the second task is constructed based on the first task, and the second task is scheduled to the first quantum machine corresponding to the quantum gate model and the second quantum machine corresponding to the quantum annealing model for execution. That is, the first device in the embodiments of this application can support multiple types of quantum computing power, thereby scheduling different types of quantum machines to execute corresponding quantum tasks, thereby improving the execution efficiency of quantum tasks.

[0079] Based on the above embodiments, another embodiment of this application provides a task management method and proposes a general technical architecture that adapts to the cloud deployment of quantum computing power using multiple technical routes, so as to support access to quantum computing power based on quantum gate models (e.g., superconducting, ion trap, etc.) and quantum annealing models (e.g., optical quantum coherent Ising machines) through a quantum cloud platform (i.e., the first device); secondly, this application embodiment proposes an end-to-end one-stop process for multi-technical route quantum computing power resources in the cloud, which realizes "data construction -> task submission -> security authentication -> status monitoring -> message exchange".

[0080] It should be noted that, in the embodiments of this application, Figure 4 This is a schematic diagram of the multi-technology route quantum computing power cloud architecture proposed in the embodiments of this application, such as... Figure 4 As shown, the architecture may include an application service layer (i.e., the first layer), an application support layer (i.e., the third layer), a core capability layer (i.e., the second layer), and a computing power base layer; wherein, the application service layer, the application support layer, and the core capability layer can be deployed on the quantum cloud platform (i.e., the first device), and the computing power base layer can be deployed on the quantum vendor's side.

[0081] It should be noted that, in the embodiments of this application, as... Figure 4As shown, the application service layer can be user-facing, supporting quantum physics real machine services, quantum simulation computing services, and quantum algorithm services to meet diverse quantum computing business needs. The quantum physics real machine service provides a list of real machines and detailed queries, including quantum manufacturers, availability status, and supported qubits. The quantum simulation computing service provides mainstream simulation computing backends, including information queries on mainstream full-amplitude and noisy computing backends, and supports the submission of simulated quantum computing tasks. The quantum algorithm service can provide experiments on commonly used algorithms, such as Grover's search algorithm, Shor's large number factorization algorithm, and the Max-cut algorithm, while also supporting dynamic configuration of algorithm cases.

[0082] It should be noted that, in the embodiments of this application, as... Figure 4 As shown, the application support layer provides programming kernels to support users in constructing quantum circuits, preparing QUBO matrices, conducting hybrid quantum algorithm experiments, and performing quantum simulations in various scenarios. It supports graphical GUI programming, IDE programming, and web-based file upload for quantum task construction. The quantum gate circuit programming kernel supports visual programming of typical quantum circuits such as superconductors and ion traps, generating corresponding qubit circuits and imposing corresponding restrictions on circuit operations based on the gate types supported by the actual device. The quantum annealing programming kernel offers two options: one provides a programming instance IDE environment associated with the user ID, enabling algorithm development and facilitating QUBO matrix preparation, while also supporting task plugin installation for file uploads and task submissions; the other provides QUBO matrix processing interfaces for matrix file parsing and format validation. The quantum simulation programming kernel provides a quantum simulation computation backend, supporting the parsing and execution of custom quantum gate circuit data formats. The hybrid quantum algorithm programming kernel supports commonly used algorithm case experiments, provides runtime environment examples, pre-built algorithm dependency toolkits, and the ability to call classical computing resources for algorithm experiments.

[0083] It should be noted that, in the embodiments of this application, as... Figure 4 As shown, the core capability layer can manage heterogeneous computing power in an integrated manner through standardized interfaces, covering both simulated and real machine computing power; resource scheduling can realize integrated monitoring and scheduling of multiple types of computing resources; task scheduling can realize "task-based" invocation of real machine computing power; scheduling services communicate internally through the RPC protocol to improve response efficiency. Task and real machine topology-related data are protected by asymmetric encryption and HTTPS protocol to ensure data transmission security with the quantum computer.

[0084] It should be noted that, in the embodiments of this application, as... Figure 4As shown, the computing power base layer can uniformly manage the underlying computing power resources and support the access of quantum real machine computing power resources with multiple technical routes through standardized APIs; among them, technical routes can include photonic quantum technology, superconducting technology, ion trap technology, neutral atom technology, and other technical routes; simulated computing power resources support high-availability instance clusters built with mainstream Kubernetes (K8S) and access using asynchronous task queues.

[0085] It should be noted that, in the embodiments of this application, the task-based computing power service can support the full lifecycle management of quantum computing power tasks adapted to multiple technical routes, and supports the construction of tasks through graphical GUI programming, IDE example programming, WEB file upload, etc.; the task-based computing power service provides secure isolation for tasks, performs quantum computing program conversion based on various programming kernels, and connects with the task service to generate corresponding task-based data (i.e., the first task), such as OpenQASM, JSON line array, QUBO matrix, etc., adapting to the task input and output structures of various computing powers, and using message queues (MQ) to ensure reliable data flow and task flow.

[0086] For example, in the embodiments of this application, the JSON line array may be in the form shown below. This application does not specifically limit the form of the JSON line array.

[0087] [{"control":[],"qasmdef":"sy q[0]","gate":"sy","target":[0],"rotate":[]},{"control":[],"qasmdef":"xq[1]","gate":"x","target":[1],"rotate":[]},{"control":[],"qasmdef":"id q[2]","gate":"id","target":[2],"rotate":[]}]

[0088] It should be noted that, in the embodiments of this application, the first device can provide a graphical GUI programming tool adapted to multi-standard computing backends, a quantum cloud IDE programming environment instance, and programming of superconducting, ion trap, and other circuits with integrated gate models. It supports quantum circuit data construction and verification, integrated quantum annealing model programming, and can prepare QUBO matrices by writing code in the IDE programming instance or by uploading matrix files.

[0089] For example, in the embodiments of this application, Figure 5 This is a schematic diagram of the task management method proposed in the embodiments of this application. Figure 2 ,like Figure 5As shown, the task management device on the first device can call the quantum task service interface to submit a quantum circuit task (i.e., the first quantum task) and a QUBO matrix task (i.e., the second quantum task). These two tasks constitute the first task. The quantum circuit task can include ion trap quantum circuit tasks, superconducting quantum circuit tasks, and simulated quantum circuit tasks. The QUBO matrix can be prepared using an IDE programming environment or uploaded as a file. The task management device can then perform validation on the circuit rules and QUBO matrix rules. For example, it can validate data format and syntax rules based on the task type, supporting OpenQASM syntax validation and QUBO matrix dynamic range validation. Validated task data is persisted and submitted to the next module for data conversion. The task data can be converted into a specific JSON array based on the computing power type, with attached platform parameters such as application ID, application name, user ID, computing power type, number of qubits, queue name, technology stack, task priority, number of experiments, timeout, etc. (e.g., the first parameter information). The system constructs quantum tasks (i.e., the second task) using information from the quantum gate model. Then, the task (i.e., the second task) is distributed through the quantum task scheduling module in the second layer, sending task data to the corresponding message queue (i.e., the task queue). The quantum gate model and the quantum annealing model respectively open subscription services to read queue messages. Different adaptation services can query quantum manufacturer APIs, encryption rules, data parsing rules, etc., based on the quantum computer number. Secure connections and system authentication are achieved using asymmetric encryption algorithms (Rivest-Shamir-Adleman, RSA) and HTTPS protocol. Finally, the task data is submitted to the quantum real machine computing resource (i.e., the second device). The adaptation services can include quantum gate model adaptation services and quantum annealing model adaptation services. The second device can include the quantum computer corresponding to the quantum gate model (i.e., the first quantum real machine) and the quantum computer corresponding to the quantum annealing model (i.e., the second quantum real machine). The first quantum real machine can include ion trap quantum computers and superconducting quantum computers; the second quantum real machine can include optical quantum computers and superconducting quantum computers.

[0090] It should be noted that, in the embodiments of this application, the task management device can verify the data format and syntax rules of the first quantum task and the second quantum task respectively. After the verification is passed, the second task is constructed based on the first task, thereby improving the success rate of subsequent execution of the second task.

[0091] For example, in the embodiments of this application, the task management device can perform verification processing on the first data format and the syntax rules of the first quantum task to obtain a first verification result; it can also perform verification processing on the second data format and the syntax rules of the second quantum task to obtain a second verification result; and then, if both the first verification result and the second verification result indicate that the verification is passed, it can be determined that the first task has passed verification.

[0092] Furthermore, in the embodiments of this application, when the task management device constructs a second task based on a first task, it can determine first parameter information corresponding to the first quantum task; wherein, the first parameter information includes at least parameter information of the quantum vendor associated with the first quantum task; then, it can construct a third quantum task based on the first parameter information and the first quantum task; it can also determine second parameter information corresponding to the second quantum task; wherein, the second parameter information includes at least parameter information of the quantum vendor associated with the second quantum task, and construct a fourth quantum task based on the second parameter information and the second quantum task; and then, it can construct a second task based on the third quantum task and the fourth quantum task.

[0093] It should be noted that, in the embodiments of this application, the first parameter information includes at least the parameter information of the quantum vendor associated with the first quantum task, such as the ID of the quantum vendor, and may also include other parameter information, such as application ID, application name, user ID, computing power type, number of qubits, queue name, technology stack type, task priority, number of experiments, timeout time, etc. This application does not make specific limitations on the amount and type of information contained in the first parameter information.

[0094] It should be noted that, in the embodiments of this application, the second parameter information may include at least the parameter information of the quantum vendor associated with the second quantum task, such as the ID of the quantum vendor, and may also include other parameter information, such as application ID, application name, user ID, computing power type, number of qubits, queue name, technology stack type, task priority, number of experiments, timeout time, etc. This application does not make specific limitations on the amount and type of information contained in the second parameter information.

[0095] For example, in an embodiment of this application, when the task management device schedules the second task to the corresponding second device for execution, it can first schedule the third quantum task to the first message queue and the fourth quantum task to the second message queue; wherein, the first message queue contains a message queue of the quantum gate model and the second message queue contains a message queue of the quantum annealing model; then, it can query the first encryption rule of the quantum vendor associated with the first quantum task based on the first parameter information; then, it can encrypt the third quantum task through the first encryption rule and send the encrypted quantum task to the corresponding first quantum device so that the first quantum device can execute the encrypted quantum task.

[0096] It should be noted that, in the embodiments of this application, the first quantum machine may include an ion trap quantum computer, a superconducting quantum computer, or other quantum computers. This application does not specifically limit the type of the first quantum machine.

[0097] Optionally, in embodiments of this application, when the task management device schedules the second task to the corresponding second device for execution, it can also query the second encryption rule of the quantum vendor associated with the fourth quantum task based on the second parameter information; then the fourth quantum task can be encrypted using the second encryption rule, and the encrypted quantum task can be sent to the corresponding second quantum device so that the second quantum device can execute the encrypted quantum task.

[0098] It should be noted that, in the embodiments of this application, the second quantum computer may include optical quantum computers, superconducting quantum computers, or other types of quantum computers. This application does not specifically limit the type of the second quantum computer.

[0099] In other words, in the embodiments of this application, the task management device can add first parameter information to construct a third quantum task based on the first quantum task, and add second parameter information to construct a fourth quantum task based on the second quantum task. Then, the third and fourth quantum tasks can be scheduled to the corresponding message queues. Furthermore, the encryption rules associated with the third and fourth quantum tasks can be queried, and the corresponding encryption rules can be used to encrypt the third and fourth quantum tasks respectively. The encrypted quantum tasks are then sent to the corresponding quantum real machines, thereby enabling the quantum real machines corresponding to the quantum gate model and the quantum real machines corresponding to the quantum annealing model to execute different quantum tasks. That is, the first device in the embodiments of this application can support the quantum computing capabilities of quantum gate model and quantum annealing model to the cloud, that is, support multiple types of quantum computing power, thereby scheduling different quantum tasks to different types of quantum real machines for execution, which greatly improves the execution efficiency of tasks.

[0100] It should be noted that, in the embodiments of this application, when the task management device schedules the third quantum task to the first message queue and the fourth quantum task to the second message queue, it can determine the corresponding first task adapter based on the first parameter information and schedule the third quantum task to the first message queue through the first task adapter; then it can determine the corresponding second task adapter based on the second parameter information and schedule the fourth quantum task to the second message queue through the second task adapter.

[0101] For example, in the embodiments of this application, such as Figure 3 As shown, when the task management device schedules the third quantum task to the first message queue and the fourth quantum task to the second message queue, it can abstract the quantum gate model and the executor interface of quantum annealing. Then, it can automatically launch the corresponding task adapter for docking processing according to the task parameters (i.e., the first parameter information and the second parameter information). The task adapter can include superconducting quantum adapters, ion trap quantum adapters, neutral atom quantum adapters, and optical quantum adapters, etc. The quantum task can be routed to the corresponding message queue through the corresponding task adapter. The task adapter can decrypt and verify the received callback message and push it to the callback executor for processing, and asynchronously push it to the task scheduler for status refresh.

[0102] For example, in the embodiments of this application, the task management device can perform scheduling based on the quantum computer number, real machine simulation type, technology stack type, etc. in the first parameter information, and automatically launch the corresponding task adapter for docking processing. For example, launch the corresponding superconducting quantum adapter (i.e., the first task adapter), and then the third quantum task can be scheduled to the first message queue through the superconducting quantum adapter.

[0103] It should be noted that, in the embodiments of this application, after the task management device schedules the second task to the corresponding second device for execution, it can receive the first information sent by the first quantum machine and / or the second information sent by the second quantum machine; wherein, the first information includes the execution status information of the third quantum task and the second information includes the execution status information of the fourth quantum task; then, the status information of the first task can be updated synchronously based on the first information and / or the second information, and the computing power status information can also be updated.

[0104] In other words, in this embodiment of the application, the task running status and the quantum computer status can be monitored in real time. The quantum computer (i.e., the first quantum machine and / or the second quantum machine) can call back the cloud platform (i.e., the first device) interface to send the status information (i.e., the first information and / or the second information) to the message queue status queue, and the task and computing power status can be updated synchronously through the quantum task scheduling module.

[0105] Optionally, in embodiments of this application, the first quantum prototype and / or the second quantum prototype can also send the computation results, visualization results, and circuit optimization results of the quantum task back to the first device through the corresponding adaptation service interface, so that the first device can generate a visualization analysis report based on the computation results and display the actual running bits and quantum gates based on the optimized circuit; wherein, the adaptation service interface may include the adaptation service interface of the quantum gate model and the adaptation service interface of the quantum annealing model.

[0106] In summary, the first device can support multiple types of quantum programming kernel tools, including quantum circuit GUI programming, IDE simulation programming examples, IDE algorithm simulation examples, file upload tools, etc., thereby supporting the construction of different quantum tasks based on diverse programming tools. Specifically, in this embodiment, a first quantum task corresponding to a quantum gate model and a second quantum task corresponding to a quantum annealing model can be constructed simultaneously, thus handling complex computational problems and significantly improving the execution efficiency of quantum tasks. Then, the first data format and syntax rules of the first quantum task can be verified to obtain a first verification result; similarly, the second data format and syntax rules of the second quantum task can be verified to obtain a second verification result. If both the first and second verification results indicate successful verification, the second task can then be constructed based on the first task, thereby improving the success rate of subsequent execution of the second task. For example, task... The management device can add first parameter information to construct a third quantum task based on the first quantum task, and add second parameter information to construct a fourth quantum task based on the second quantum task. Then, it can schedule the third and fourth quantum tasks to their corresponding message queues, query the encryption rules associated with the third and fourth quantum tasks, encrypt the third and fourth quantum tasks respectively using the corresponding encryption rules, and send the encrypted quantum tasks to their respective quantum machines. This allows the quantum machines corresponding to the quantum gate model and the quantum annealing model to execute different quantum tasks. In other words, the first device in this embodiment can support the cloud deployment of quantum computing capabilities based on both the quantum gate model and the quantum annealing model, supporting multiple types of quantum computing power. This allows different quantum tasks to be scheduled to different types of quantum machines for execution, greatly improving task execution efficiency.

[0107] This application provides a task management method applied to a first device deployed in the cloud. The first device includes a first layer and a second layer. The method includes: in the first layer, constructing a first task and sending the first task to the second layer; wherein the first task includes at least a first quantum task corresponding to a quantum gate model and a second quantum task corresponding to a quantum annealing model; in the second layer, performing verification processing on the first task, and if the first task passes the verification, constructing a second task based on the first task and scheduling the second task to the corresponding second device for execution; wherein the second task includes the first task, and the second device includes at least a first quantum physical machine corresponding to a quantum gate model and a second quantum physical machine corresponding to a quantum annealing model. Therefore, it can be seen that a first quantum task corresponding to the quantum gate model and a second quantum task corresponding to the quantum annealing model can be constructed at the first layer. That is, the embodiments of this application can simultaneously construct quantum tasks (i.e., the first task) related to different quantum models at the first layer. Then, the first task can be verified at the second layer. If the verification is successful, the second task is constructed based on the first task, and the second task is scheduled to the first quantum machine corresponding to the quantum gate model and the second quantum machine corresponding to the quantum annealing model for execution. That is, the first device in the embodiments of this application can support multiple types of quantum computing power, thereby scheduling different types of quantum machines to execute corresponding quantum tasks, thereby improving the execution efficiency of quantum tasks.

[0108] Based on the above embodiments, this application provides a task management device, which is applied to a first device. Figure 6 This is a schematic diagram of the composition of the task management device, such as... Figure 6 As shown, the device 10 includes: a construction unit 11, a transmission unit 12, a verification unit 13, and a scheduling unit 14; wherein,

[0109] The construction unit 11 is used to construct the first task in the first layer;

[0110] The sending unit 12 is used to send the first task to the second layer; wherein the first task includes at least a first quantum task corresponding to the quantum gate model and a second quantum task corresponding to the quantum annealing model;

[0111] The verification unit 13 is used to perform verification processing on the first task in the second layer;

[0112] The construction unit 11 is further configured to construct a second task based on the first task if the first task verification passes.

[0113] The scheduling unit 14 is used to schedule the second task to the corresponding second device for execution; wherein the second task includes the first task, and the second device includes at least the first quantum prototype corresponding to the quantum gate model and the second quantum prototype corresponding to the quantum annealing model.

[0114] In the embodiments of this application, further, Figure 7 This is a schematic diagram of the composition of the first device, such as... Figure 7 As shown, the first device 20 proposed in this application embodiment may further include a processor 15, a memory 16 storing instructions executable by the processor 15, and further, the first device 20 may further include a communication interface 17 and a bus 18 for connecting the processor 15, the memory 16 and the communication interface 17.

[0115] In the embodiments of this application, the processor 15 can be at least one of the following: Application-Specific Integrated Circuit (ASIC), Digital Signal Processor (DSP), Digital Signal Processing Device (DSPD), Programmable Logic Device (PLD), Field-Programmable Gate Array (FPGA), Central Processing Unit (CPU), Controller, Microcontroller, and Microprocessor. It is understood that for different devices, the electronic device used to implement the above-mentioned processor function can also be other types, and this application embodiment does not specifically limit this. The first device 20 may further include a memory 16, which can be connected to the processor 15. The memory 16 is used to store executable program code, which includes computer operation instructions. The memory 16 may include high-speed RAM memory and may also include non-volatile memory, such as at least two disk drives.

[0116] In embodiments of this application, bus 18 is used to connect communication interface 17, processor 15, and memory 16, as well as the mutual communication between these devices.

[0117] In embodiments of this application, memory 16 is used to store instructions and data.

[0118] Furthermore, in the embodiments of this application, the processor 15 is configured to construct a first task at a first layer of the first device and send the first task to a second layer of the first device; wherein the first task includes at least a first quantum task corresponding to a quantum gate model and a second quantum task corresponding to a quantum annealing model; at the second layer, the first task is verified, and if the verification of the first task passes, a second task is constructed based on the first task, and the second task is scheduled to the corresponding second device for execution; wherein the second task includes the first task, and the second device includes at least a first quantum prototype corresponding to a quantum gate model and a second quantum prototype corresponding to a quantum annealing model.

[0119] In practical applications, the aforementioned memory 16 can be volatile memory, such as random-access memory (RAM); or non-volatile memory, such as read-only memory (ROM), flash memory, hard disk drive (HDD), or solid-state drive (SSD); or a combination of the above types of memory, and provide instructions and data to the processor 15.

[0120] This application provides a task management device. In a first layer, the device constructs a first task and sends it to a second layer. The first task includes at least a first quantum task corresponding to a quantum gate model and a second quantum task corresponding to a quantum annealing model. In the second layer, the first task is verified. If the verification passes, a second task is constructed based on the first task, and the second task is scheduled to a corresponding second device for execution. The second task includes the first task, and the second device includes at least a first quantum physical machine corresponding to a quantum gate model and a second quantum physical machine corresponding to a quantum annealing model. Therefore, it can be seen that a first quantum task corresponding to the quantum gate model and a second quantum task corresponding to the quantum annealing model can be constructed at the first layer. That is, the embodiments of this application can simultaneously construct quantum tasks (i.e., the first task) related to different quantum models at the first layer. Then, the first task can be verified at the second layer. If the verification is successful, the second task is constructed based on the first task, and the second task is scheduled to the first quantum machine corresponding to the quantum gate model and the second quantum machine corresponding to the quantum annealing model for execution. That is, the first device in the embodiments of this application can support multiple types of quantum computing power, thereby scheduling different types of quantum machines to execute corresponding quantum tasks, thereby improving the execution efficiency of quantum tasks.

[0121] This application provides a computer-readable storage medium storing a program thereon, which, when executed by a processor, implements the task management method described above.

[0122] Specifically, the program instructions corresponding to a task management method in this embodiment can be stored on storage media such as optical discs, hard disks, and USB flash drives. When the program instructions corresponding to a task management method in the storage media are read or executed by an electronic device, the following steps are included:

[0123] In the first layer, a first task is constructed and sent to the second layer; wherein, the first task includes at least a first quantum task corresponding to the quantum gate model and a second quantum task corresponding to the quantum annealing model;

[0124] In the second layer, the first task is verified. If the first task passes the verification, the second task is constructed based on the first task and scheduled to the corresponding second device for execution. The second task includes the first task, and the second device includes at least the first quantum real machine corresponding to the quantum gate model and the second quantum real machine corresponding to the quantum annealing model.

[0125] This application also provides a computer program product, including a computer program that can be executed by the processor 15 of the first device 20 to perform the steps described in any of the foregoing methods.

[0126] Those skilled in the art will understand that embodiments of this application can be provided as methods, systems, or computer program products. Therefore, this application can take the form of hardware embodiments, software embodiments, or embodiments combining software and hardware aspects. Furthermore, this application can take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage and optical storage) containing computer-usable program code.

[0127] This application is described with reference to schematic and / or block diagrams of implementations of methods, apparatus (systems), and computer program products according to embodiments of this application. It should be understood that each block of the schematic and / or block diagrams can be implemented by computer program instructions, and combinations of blocks in the schematic and / or block diagrams can be implemented. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create a machine for implementing the schematic and / or block diagrams. Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0128] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in the implementation flow diagram. Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0129] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0130] The above description is merely a preferred embodiment of this application and is not intended to limit the scope of protection of this application.

Claims

1. A task management method, characterized in that, The method is applied to a first device, which is deployed in the cloud. The first device includes a first layer and a second layer. The method includes: In the first layer, a first task is constructed and sent to the second layer; wherein, the first task includes at least a first quantum task corresponding to the quantum gate model and a second quantum task corresponding to the quantum annealing model; In the second layer, the first task is verified. If the first task passes the verification, a second task is constructed based on the first task, and the second task is scheduled to the corresponding second device for execution. The second task includes the first task, and the second device includes at least the first quantum real machine corresponding to the quantum gate model and the second quantum real machine corresponding to the quantum annealing model.

2. The method according to claim 1, characterized in that, The first device further includes a third layer; the construction of the first task includes: N programming methods are obtained through the third layer; wherein, the programming methods are at least used to construct the first task, and N is a positive integer; The first quantum task is constructed based on a first programming method; wherein, the first programming method includes one or more of the N programming methods; The second quantum task is constructed based on the second programming method; wherein the second programming method includes one or more of the N programming methods.

3. The method according to claim 1, characterized in that, The verification process for the first task includes: The first data format and syntax rules of the first quantum task are verified to obtain the first verification result. The second data format and syntax rules of the second quantum task are verified to obtain the second verification result. If both the first verification result and the second verification result indicate that the verification is successful, the first task verification is determined to be successful.

4. The method according to claim 3, characterized in that, The method further includes: If the first verification result and / or the second verification result indicate that the verification failed, the first task verification is determined to have failed.

5. The method according to claim 1, characterized in that, The construction of the second task based on the first task includes: Determine the first parameter information corresponding to the first quantum task; wherein the first parameter information includes at least the parameter information of the quantum vendor associated with the first quantum task; Construct a third quantum task based on the first parameter information and the first quantum task; Determine the second parameter information corresponding to the second quantum task; wherein the second parameter information includes at least the parameter information of the quantum vendor associated with the second quantum task, and construct a fourth quantum task based on the second parameter information and the second quantum task; The second task is constructed based on the third quantum task and the fourth quantum task.

6. The method according to claim 5, characterized in that, The step of scheduling the second task to the corresponding second device for execution includes: The third quantum task is scheduled to the first message queue, and the fourth quantum task is scheduled to the second message queue; wherein, the first message queue contains the message queue of the quantum gate model, and the second message queue contains the message queue of the quantum annealing model; Based on the first parameter information, query the first encryption rule of the quantum vendor associated with the first quantum task; The third quantum task is encrypted using the first encryption rule, and the encrypted quantum task is sent to the corresponding first quantum machine so that the first quantum machine can execute the encrypted quantum task.

7. The method according to claim 6, characterized in that, The step of scheduling the second task to the corresponding second device for execution includes: Based on the second parameter information, query the second encryption rule of the quantum vendor associated with the fourth quantum task; The fourth quantum task is encrypted using the second encryption rule, and the encrypted quantum task is sent to the corresponding second quantum machine so that the second quantum machine can execute the encrypted quantum task.

8. The method according to claim 6, characterized in that, The step of scheduling the third quantum task to the first message queue and the fourth quantum task to the second message queue includes: Based on the first parameter information, a corresponding first task adapter is determined, and the third quantum task is scheduled to the first message queue through the first task adapter; Based on the second parameter information, a corresponding second task adapter is determined, and the fourth quantum task is scheduled to the second message queue through the second task adapter.

9. The method according to claim 1, characterized in that, After scheduling the second task to the corresponding second device for execution, the method further includes: Receive first information sent by the first quantum virtual machine, and / or second information sent by the second quantum virtual machine; wherein the first information contains execution status information of the third quantum task, and the second information contains execution status information of the fourth quantum task; Based on the first information, and / or the second information, the status information of the first task is updated synchronously.

10. A task management device, characterized in that, The task management device is applied to the first device, and the task management device includes: a construction unit, a sending unit, a verification unit, and a scheduling unit; wherein... The construction unit is used to construct the first task in the first layer; The sending unit is used to send the first task to the second layer; wherein the first task includes at least a first quantum task corresponding to the quantum gate model and a second quantum task corresponding to the quantum annealing model; The verification unit is used to perform verification processing on the first task in the second layer; The construction unit is further configured to construct a second task based on the first task if the first task passes the verification. The scheduling unit is used to schedule the second task to the corresponding second device for execution; wherein the second task includes the first task, and the second device includes at least the first quantum prototype corresponding to the quantum gate model and the second quantum prototype corresponding to the quantum annealing model.

11. A computer device, characterized in that, The computer device includes: a processor and a memory; wherein, The memory is used to store computer programs that can run on the processor; The processor is configured to perform the method as described in any one of claims 1-9 when running the computer program.

12. A computer-readable storage medium, characterized in that, The storage medium stores computer program code, which, when executed by a computer, performs the method described in any one of claims 1-9.

13. A computer program product, comprising a computer program, characterized in that, The computer program, when executed by a processor, implements the method according to any one of claims 1-9.

Images