Intercommunication system of quantum computer, intercommunication execution method, device, medium and product

Abstract

The invention provides an intercommunication system of a quantum computer, an intercommunication execution method, equipment, a medium and a product. The intercommunication system comprises the steps that a quantum routing system receives a to-be-executed task and carries out analysis and task decomposition on the to-be-executed task to obtain a plurality of sub-tasks; establishing a task allocation strategy based on the computing resource information of each quantum computer; the quantum repeater determines a quantum bit entanglement relationship in the quantum computers based on a task allocation strategy, and establishes quantum entanglement pairs for quantum bits in the quantum computers based on the quantum bit entanglement relationship so as to form a transmission link between the quantum computers; and the task distribution system distributes the sub-tasks to the corresponding quantum computers based on a task distribution strategy, so that at least one quantum computer corresponding to the sub-tasks executes the sub-tasks. Direct interconnection of multiple quantum computers is achieved, the number of transmission times between the quantum computers and classic computers in the task execution process is reduced, and the data transmission efficiency is improved.

Description

TECHNICAL FIELD

[0001] The present disclosure relates to the field of quantum computing, and in particular, to an interworking system of quantum computers, an interworking execution method, a device, a medium and a product. BACKGROUND

[0002] The current operation mode of quantum computers is usually executed by a single computer, which greatly limits the performance and application expansion. In the field of complex scientific simulation, a single quantum computer is limited by the number of qubits and computing resources, and it is difficult to complete high-precision simulation within a reasonable time.

[0003] During the execution of a task, the quantum computer needs to continuously and frequently communicate with the classical computer. Even if it is a distributed quantum computer system, different quantum computers are executed by different quantum computers after the classical computer completes task division. In the task execution process, different quantum computers need to be unified by the classical computer. In the actual execution process, the mode is the same as that of a single quantum computer.

[0004] However, the classical computer itself has inherent defects, such as the fact that the computing efficiency of the classical computer is much lower than that of the quantum computer, which indirectly affects the efficiency of the quantum computer in executing tasks, and inevitably leads to extremely low efficiency of the entire task execution. This situation not only cannot fully demonstrate the significant advantages of quantum computers, but also causes a waste of a large amount of resources. SUMMARY

[0005] The present disclosure provides an interworking system of quantum computers, an interworking execution method, a device, a medium and a product, to realize direct interconnection between quantum computers, improve the communication efficiency between quantum computers, reduce the number of communications between quantum computers and classical computers, and thus reduce the influence of the communication process between classical computers and quantum computers on the efficiency of task execution, and improve the efficiency of task execution.

[0006] According to an aspect of the present disclosure, an interworking system of quantum computers is provided, comprising: a quantum interworking device, a quantum relay and a hybrid register; wherein the quantum interworking device is connected with a plurality of quantum computers; the hybrid register is connected with the quantum computers and classical computers respectively; the quantum interworking device comprises a quantum routing system and a task distribution system;

[0007] The quantum routing system receives a task to be executed, analyzes and decomposes the task to be executed to obtain a plurality of subtasks; a task allocation strategy is established based on the computing resource information of each quantum computer, and the task classification strategy comprises a mapping relationship between each subtask and the qubits in at least one quantum computer;

[0008] The quantum repeater determines quantum qubit entanglement relationships in the quantum computers based on the task allocation strategy, establishes quantum entanglement pairs for the quantum qubits in the quantum computers based on the quantum qubit entanglement relationships, to form a transmission link between the quantum computers;

[0009] The task distribution system distributes each of the sub-tasks to a corresponding quantum computer based on the task allocation strategy, so that at least one quantum computer corresponding to the sub-task executes the sub-task, wherein the at least one quantum computer performs intermediate data transmission through the transmission link in the process of executing the sub-task, and stores the calculation result of the sub-task to the hybrid register, so that the classical computer reads the calculation result from the hybrid register.

[0010] Optionally, the quantum routing system is configured to: identify a quantum instruction identifier in the to-be-executed task, to distinguish a classical computing task module and a quantum computing task module, construct an execution path including a leading classical computing task, a quantum computing task and a trailing classical computing task executed in sequence based on a dependency relationship between the classical computing task module and the quantum computing task module; based on at least one of a task relationship, a data flow direction and a calculation scale, sub-task decomposition is performed on the quantum computing task in the execution path, to obtain a plurality of sub-tasks.

[0011] Optionally, the quantum routing system is configured to: obtain the computing resource information of the quantum computers, the computing resource information of the quantum computers including at least one of the number of quantum qubits, the current state of each quantum qubit and the fidelity of each quantum qubit; obtain the demand attribute of the sub-task, the demand attribute of the sub-task including at least one of quantum qubit demand and quantum qubit correlation constraint; based on a preset routing algorithm, the computing resource information of the quantum computers and the demand attribute of the sub-task are matched to obtain the task allocation strategy.

[0012] Optionally, the quantum routing system is configured to: for quantum computers having a communication relationship, a plurality of candidate quantum communication paths are determined according to a network topology structure; based on the network topology structure and the state information of the quantum computers, an influence factor corresponding to the candidate quantum communication path is determined, the influence factor including at least one of channel quality, transmission distance and quantum repeater position; based on the influence factors of each of the candidate quantum communication paths, a target quantum communication path corresponding to the quantum computers having a communication relationship is determined.

[0013] Optionally, the task distribution system is configured to: encapsulate each subtask and attach its metadata based on the task allocation strategy; distribute the subtask to the at least one quantum computer if the current state of the corresponding quantum computer satisfies the task requirements of the subtask; and update the task allocation strategy based on the current state of each quantum computer if the current state of the corresponding quantum computer does not satisfy the task requirements of the subtask.

[0014] Optionally, the quantum routing system is configured to: acquire the running state of the quantum computer during the execution of the subtask; if the running state of the quantum computer is abnormal, store the context of the currently executing subtask in the hybrid register and perform a state evaluation on the quantum computer; if the state evaluation result of the quantum computer indicates that execution can continue, reconstruct the computation path on the quantum computer and inject error correction code instructions to enable the quantum computer to continue executing the subtask; if the state evaluation result of the quantum computer indicates that execution cannot continue, update the task allocation strategy based on the current state of other quantum computers and redistribute the subtask to a new quantum computer for continued execution.

[0015] Optionally, the hybrid register is configured with a mutex lock, which is used to limit the access rights of the quantum computer and the classical computer to the hybrid register;

[0016] During the process of writing the calculation result to the hybrid register by any of the quantum computers, if the mutex is not occupied, the mutex is acquired, the calculation result is written to the hybrid register, and the mutex is released after the writing of the calculation result is completed.

[0017] When the mutex is occupied, the quantum computer enters a waiting state until the mutex is released. Then, it acquires the mutex, writes the calculation result into the hybrid register, and releases the mutex after writing the calculation result.

[0018] According to another aspect of this disclosure, this disclosure provides a method for interoperability of quantum computers, comprising:

[0019] Receive the task to be executed, parse and decompose the task to be executed to obtain multiple sub-tasks;

[0020] A task allocation strategy is established based on the computing resource information of each quantum computer. The task classification strategy includes the mapping relationship between each subtask and at least one qubit in the quantum computer.

[0021] In the case of establishing a transmission link between quantum computers, each of the subtasks is distributed to the corresponding quantum computer so that at least one quantum computer corresponding to the subtask executes the subtask. During the execution of the subtask by the at least one quantum computer, intermediate data is transmitted through the transmission link, and the calculation result of the subtask is stored in the hybrid register so that the classical computer can read the calculation result from the hybrid register.

[0022] According to another aspect of this disclosure, this disclosure provides a quantum interconnection device, the quantum interconnection device comprising:

[0023] At least one processor; and

[0024] A memory communicatively connected to the at least one processor; wherein,

[0025] The memory stores a computer program that can be executed by the at least one processor, the computer program being executed by the at least one processor to enable the at least one processor to execute the interoperability execution method of the quantum computer according to any embodiment of the present disclosure.

[0026] According to another aspect of this disclosure, a computer-readable storage medium is provided that stores computer instructions for causing a processor to execute the interoperability execution method of a quantum computer according to any embodiment of this disclosure.

[0027] According to another aspect of this disclosure, this disclosure provides a computer program product that, when executed by a processor, implements the interoperability execution method of a quantum computer as described in any of the embodiments of this disclosure.

[0028] The technical solution provided in this disclosure connects multiple quantum computers to a quantum interconnection device, enabling interconnection between them. A quantum routing system within the quantum interconnection device decomposes and allocates tasks to be processed, obtaining a task allocation strategy that provides a framework for collaborative task processing by multiple quantum computers. A quantum repeater establishes quantum entanglement pairs between qubits in the quantum computers based on the entanglement relationship corresponding to the task allocation strategy, forming transmission links between the quantum computers and achieving interconnection, thus providing a communication foundation for collaborative task execution. A task distribution system within the quantum interconnection device distributes multiple sub-tasks to each quantum computer, enabling collaborative execution of these sub-tasks. During sub-task execution, intermediate data is transmitted via pre-built communication links, reducing the number of transmissions between the quantum and classical computers and improving data transmission efficiency. Furthermore, a hybrid register is used to achieve data communication between the quantum and classical computers, further improving transmission efficiency.

[0029] It should be understood that the description in this section is not intended to identify key or essential features of the embodiments of this disclosure, nor is it intended to limit the scope of this disclosure. Other features of this disclosure will become readily apparent from the following description. Attached Figure Description

[0030] To more clearly illustrate the technical solutions of the embodiments of this disclosure, the accompanying drawings used in the embodiments will be briefly described below. It should be understood that the following drawings only show some embodiments of this disclosure and should not be regarded as a limitation of the scope. For those skilled in the art, other related drawings can be obtained based on these drawings without creative effort.

[0031] Figure 1 This is a schematic diagram of the structure of an interconnection system for a quantum computer according to an embodiment of this disclosure;

[0032] Figure 2 This is a flowchart of an interoperable execution method for a quantum computer according to an embodiment of this disclosure;

[0033] Figure 3 This is a flowchart of an interoperable execution method for a quantum computer according to an embodiment of this disclosure;

[0034] Figure 4 This is a flowchart of the quantum routing system provided in the embodiments of this disclosure;

[0035] Figure 5 This is a flowchart illustrating the operation of a quantum repeater provided in an embodiment of this disclosure;

[0036] Figure 6 This is a schematic diagram of the structure of a quantum interconnection device according to an embodiment of this disclosure. Detailed Implementation

[0037] To enable those skilled in the art to better understand the present disclosure, the technical solutions of the present disclosure will be clearly and completely described below with reference to the accompanying drawings of the embodiments. Obviously, the described embodiments are only some embodiments of the present disclosure, and not all embodiments. Based on the embodiments of the present disclosure, all other embodiments obtained by those skilled in the art without creative effort should fall within the scope of protection of the present disclosure.

[0038] It should be noted that the terms "first," "second," etc., in the specification, claims, and accompanying drawings of this disclosure are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate so that the embodiments of this disclosure described herein can be implemented in orders other than those illustrated or described herein. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover non-exclusive inclusion; for example, a process, method, system, product, or apparatus that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or apparatus.

[0039] It is understood that before using the technical solutions disclosed in the various embodiments of this disclosure, users should be informed of the types, scope of use, and usage scenarios of the personal information involved in this disclosure in an appropriate manner in accordance with relevant laws and regulations, and user authorization should be obtained.

[0040] In current quantum computing architectures, quantum computers are generally controlled by classical computers, acting as coprocessors. Although quantum computers theoretically possess superior computing power, their efficiency often falls short of expectations in practical tasks. Firstly, the computational speed of classical computers lags behind that of quantum computers. When classical computers transmit task instructions and data to quantum computers, their data processing speed bottleneck leads to significant delays in information synchronization. For example, in quantum computing tasks handling large-scale, complex data, classical computers spend considerable time preprocessing and transmitting data, while the quantum computer waits, wasting resources. Secondly, the frequent and cumbersome communication between classical and quantum computers consumes a significant amount of time. Each communication involves not only data transmission but also complex operations such as protocol conversion and data verification. These additional communication overheads severely reduce computational efficiency, resulting in substantial time consumption in communication interactions between the quantum computer and the classical computer during task execution, thus impacting the quantum computer's overall performance.

[0041] To address the aforementioned technical problems, this disclosure provides an interoperability system for quantum computers. Figure 1 This is a schematic diagram of the structure of a quantum computer interconnection system provided in an embodiment of the present disclosure. The quantum computer interconnection system includes a quantum interconnection device 110, a quantum repeater 120, and a hybrid register 130. The quantum interconnection device 110 is connected to multiple quantum computers. The hybrid register 130 is connected to both the quantum computers and classical computers. The quantum interconnection device 110 includes a quantum routing system 111 and a task distribution system 112.

[0042] Among them, the quantum routing system 111 receives the task to be executed, parses and decomposes the task to be executed to obtain multiple sub-tasks; and establishes a task allocation strategy based on the computing resource information of each quantum computer. The task classification strategy includes the mapping relationship between each sub-task and at least one quantum bit in the quantum computer.

[0043] The quantum repeater 120 determines the entanglement relationship of qubits in the quantum computer based on the task allocation strategy, and establishes quantum entanglement pairs for qubits in the quantum computer based on the entanglement relationship to form a transmission link between quantum computers.

[0044] The task distribution system 112 distributes each subtask to the corresponding quantum computer based on the task allocation strategy, so that at least one quantum computer corresponding to the subtask can execute the subtask. During the execution of the subtask by the at least one quantum computer, intermediate data is transmitted through the transmission link, and the calculation result of the subtask is stored in the hybrid register 130 so that the classical computer can read the calculation result from the hybrid register.

[0045] By connecting multiple quantum computers through the quantum interconnection device 110, the data transmission between the quantum computers and classical computers is reduced, thus avoiding the impact of frequent interactions between the quantum computers and classical computers on processing efficiency.

[0046] When the quantum communication device 110 is connected to the quantum computer, the quantum communication device 110 acquires the type of the quantum computer, such as a superconducting quantum computer, a neutral atom quantum computer, an ion trap quantum computer, or an optical quantum computer. The quantum communication device 110 is also configured to perform initialization detection on the quantum computer, which checks whether the quantum computer is in a normal operating state. In some embodiments of this disclosure, the quantum communication device 110 may further include an initialization module, which performs initialization detection on the quantum computer. Specifically, it checks whether the initialization of the quantum computer's qubits is successful, whether quantum gate operations can respond normally, and whether key parameters such as the temperature and voltage of each hardware module are within the normal operating range. If an initialization anomaly is detected in any quantum computer, an anomaly message is generated to prevent the initialization anomaly from affecting the task execution process.

[0047] In some embodiments of this disclosure, the quantum interconnection device 110 may further include an interaction system for interacting with the quantum computer and with the user. For example, the interaction system may initiate an information query request to each quantum computer according to a predetermined communication protocol, causing the quantum computer to respond to the query request and provide the quantum interconnection device 110 with its computational resource information. This computational resource information includes, but is not limited to, the number of qubits, the current state of each qubit, and the fidelity of each qubit. The current state of a qubit may include an idle state, a state where it is performing a computational task, or a fault state. The fidelity of a qubit is an indicator reflecting the accuracy with which it maintains its quantum state. Obtaining the computational resource information of the quantum computer provides a basis for subsequent task allocation and execution. The quantum interconnection device 110 can convert the computational resource information of the quantum computer into a predetermined data format and store it in a hybrid register, enabling fast and accurate retrieval in subsequent processing.

[0048] The interactive system also includes an interactive page displayed to the user, through which the user can input the task to be executed. For example, the interactive page may include code editing controls, allowing the user to edit code and input task code. The interactive system then compiles the task code into the task to be executed. Alternatively, the interactive page may include voice input controls or text input controls, allowing the user to obtain task description information. The interactive system then performs semantic parsing on the task description information, converts it into task code, and compiles the task code into the task to be executed. The content of the task to be executed can be determined according to the business requirements of the application scenario. For example, the task to be executed can be a task exceeding the computing power and / or number of bits of a single quantum computer. Such application scenarios include, but are not limited to, molecular drug development and new material design scenarios, complex optimization and quantum cryptography analysis scenarios in the financial field, wide-area quantum secure communication network scenarios, and quantum machine learning and artificial intelligence scenarios.

[0049] In some embodiments of this disclosure, the interactive page may also include a query control, through which the computing resource information of the quantum computer can be displayed by querying the query control, facilitating the query of the computing power of the quantum computer.

[0050] The interactive system transmits the tasks to be executed to the quantum routing system 111. The quantum routing system 111 can serve as the scheduling and communication management core in a quantum network, used to decompose and schedule the tasks to be executed. By decomposing tasks that cannot be executed by a single quantum computer into multiple sub-tasks, the quantum routing system 111 facilitates the collaborative completion of tasks by multiple quantum computers.

[0051] In some embodiments of this disclosure, the process of subtask decomposition in the quantum routing system 111 includes: identifying quantum instruction identifiers in the task to be executed to distinguish between classical computing task modules and quantum computing task modules; constructing an execution path based on the dependency relationship between the classical computing task modules and quantum computing task modules, including a preceding classical computing task, a quantum computing task, and a subsequent classical computing task to be executed sequentially; and decomposing the quantum computing task in the execution path into multiple subtasks based on at least one of task relationship, data flow direction, and computing scale.

[0052] The task to be executed is a compiled code task, which may include at least one of local tasks executed by a classical computer and local tasks executed by a quantum computer. The task is equipped with an identifier for task type classification, such as a quantum instruction identifier. This quantum instruction identifier is used to mark the local tasks executed by the quantum computer. The quantum instruction identifier may include, but is not limited to, identifiers representing qubit operations and quantum gate circuits. For example, a set of quantum instruction identifiers is pre-set, including multiple pre-written quantum instruction identifiers. By identifying the quantum instruction identifiers, the task to be executed can be divided into classical computing task modules and quantum computing task modules. Specifically, code blocks with quantum instruction identifiers can be identified as quantum computing task modules, and code blocks without quantum instruction identifiers can be identified as classical computing task modules. The classical computing task module and the quantum computing task module can each be at least one, and the dependency relationship between the classical computing task module and the quantum computing task module can be determined by parsing the task to be processed. A code dependency graph can be constructed based on the dependency relationship between the classical computing task module and the quantum computing task module. This code dependency graph can be constructed by nodes and edges. Each node can include a code block corresponding to either the classical computing task module or the quantum computing task module, and the edge can represent the dependency relationship between the task modules corresponding to two nodes.

[0053] This analysis, based on a code dependency graph, examines the execution path of interaction between quantum and classical computers. This path includes sequentially executed preceding classical computing tasks, quantum computing tasks, and subsequent classical computing tasks. It integrates and categorizes classical and quantum computing task modules, assigning the preceding and subsequent classical computing tasks to the classical computer and the quantum computing tasks to the quantum computer. This achieves complementary advantages and collaborative processes between the two computers, ensuring efficient and reliable execution of the tasks. There can be at least one execution path comprising these sequentially executed tasks, and the execution order of different paths is possible.

[0054] The quantum routing system 111 can store a preceding classical computation task and a setting classical computation task in a hybrid register 130. This allows a classical computer to read the preceding classical computation task and the setting classical computation task from the hybrid register 130, providing a preceding computation result for the execution of the quantum computation task. Furthermore, it allows the classical computer to continue executing subsequent computations based on the computation result of the quantum computation task, ensuring the coordinated execution of tasks to be executed. The hybrid register 130 supports read and write operations for both the quantum computer and the classical computer, enabling unified data storage and temporal coordination between the two systems. In some embodiments of this disclosure, the hybrid register 130 may include classical and quantum units. The classical computer writes the computation result of the preceding classical computation task into the classical unit of the hybrid register 130. The interface module of the hybrid register 130 converts the computation result of the preceding classical computation task into a format recognizable by the quantum computer and writes it into the quantum unit. The quantum computer can then read the computation result of the preceding classical computation task from the quantum unit. Similarly, the quantum computer writes the computation results of the quantum computing task into the quantum cell of the hybrid register 130. The interface module of the hybrid register 130 converts the computation results of the quantum computing task into a format that the classical computer can recognize and writes it into the classical cell. The classical computer reads the computation results of the quantum computing task from the classical cell and continues to execute subsequent classical computing tasks. By setting up the hybrid register 130, data interoperability and compatibility between the classical and quantum computers are achieved. Compared with direct communication between the classical and quantum computers, this provides communication efficiency and avoids the problems of long time consumption and low efficiency caused by direct communication between the classical and quantum computers.

[0055] Based on the above embodiments, the quantum routing system 111 decomposes the quantum computing tasks in the execution path into multiple sub-tasks. In some embodiments of this disclosure, the quantum computing tasks in the execution path are decomposed into multiple sub-tasks based on at least one of task relationships, data flow direction, and computational scale. The task relationships can be analyzed from a logical dependency perspective, examining the operational steps within the quantum computing task. These relationships can include, but are not limited to, serial, parallel, and nested relationships. By analyzing the task relationships within the operational steps of the quantum computing task, an analysis result is obtained, which includes the operational steps within the quantum computing task and the task relationships between these operational steps. The data flow direction can be analyzed from an information transmission perspective, examining the operational environment within the quantum computing task. By analyzing the data flow direction of the quantum computing task, an analysis result is obtained, which includes the operational steps within the quantum computing task and the data flow direction between these operational steps. The computational scale can be analyzed from the perspective of resource consumption in the operation links of a quantum computing task. By analyzing the computational scale of the operation links in a quantum computing task, the analysis results corresponding to the computational scale are obtained. The computational scale can include, for example, the number of qubits and the quantum gate depth.

[0056] Tensor network shrinkage techniques are used to divide tasks into subtasks based on the analysis results corresponding to task relationships, data flow, and computational scale. Specifically, a tensor network is constructed based on the analysis results corresponding to task relationships. Each operation in the analysis results related to task relationships is used to construct a tensor node, and connections between tensor nodes are established through the task relationships between these operations, thus forming the tensor network. The analysis results corresponding to data flow and computational scale provide optimization directions for the tensor network shrinkage technique. This technique shrinks the tensor network to obtain multiple subnetworks, each corresponding to a subtask.

[0057] Based on multiple subtasks, the subtasks can be sorted according to their priority and dependencies. For subtasks with dependencies, they are sorted according to their dependency order; for example, subtask A is a prerequisite task for subtask B, and subtask A is executed before subtask B. For subtasks without dependencies, they are sorted according to their priority. In some embodiments of this disclosure, the sorting of subtasks can be represented by a directed acyclic graph (DAG), where each node in the DAG represents a subtask, and each node can be configured with a timestamp, which can be the scheduling timestamp of the subtask. A scheduling table for multiple subtasks can be formed based on the DAG.

[0058] The quantum routing system 111 allocates at least one quantum computer to each subtask, thus obtaining a task allocation strategy. This at least one quantum computer can be used to execute the corresponding subtask. Specifically, the task allocation strategy is obtained by matching the requirement attributes of each subtask with the computational resource information of each quantum computer. The computational resource information of the quantum computer includes at least one of the following: the number of qubits, the current state of each qubit, and the fidelity of each qubit. The requirement attributes of the subtask include at least one of the following: qubit requirement and qubit correlation constraint. The qubit requirement can be the subtask's requirement for the number of qubits and / or fidelity, and the qubit correlation constraint can be the requirement for the cooperative relationship between qubits in the subtask.

[0059] In some embodiments of this disclosure, the quantum routing system 111 is further configured to: based on the order of subtasks, sequentially match the requirement attributes of each subtask with the computing resource information of each quantum computer to obtain a mapping relationship between each subtask and at least one qubit in a quantum computer. Specifically, it is determined whether the computing resource information of a single quantum computer meets the requirement attributes of the subtask; if so, the mapping relationship between the subtask and the qubit in the single quantum computer is determined; if not, it is determined whether the computing resource information of two or more quantum computers meets the requirement attributes of the subtask; if so, the mapping relationship between the subtask and the qubits in the two or more quantum computers is established.

[0060] In some embodiments of this disclosure, the quantum routing system 111 is further configured to: acquire computing resource information of the quantum computer; acquire the requirement attributes of the subtask; and perform route matching between the computing resource information of the quantum computer and the requirement attributes of the subtask based on a preset routing algorithm to obtain the task allocation strategy. The preset routing algorithm may include, but is not limited to, quantum ant colony algorithm and quantum genetic algorithm. Determining the task allocation algorithm through the above-mentioned preset routing algorithm can achieve a globally optimal match between subtask requirements and quantum computer resources, thereby improving the resource utilization, task execution efficiency, and overall reliability of the distributed quantum computer while meeting task requirements.

[0061] According to the task allocation strategy, subtasks may involve the collaborative execution of two or more quantum computer devices, or there may be quantum information dependencies between different subtasks, such as sharing quantum states or transmitting intermediate data. In order to speed up processing efficiency, communication links between quantum computers are established to realize the interconnection of quantum computers and facilitate data transmission during the execution of subtasks by quantum computers.

[0062] In some embodiments of this disclosure, a communication link between quantum computers can be established using a quantum repeater. The quantum repeater, through quantum storage and entanglement swapping, divides a long-distance quantum channel into multiple short-distance channels, achieving efficient transmission and amplification of quantum information and ensuring the stability of quantum communication. The quantum repeater acquires the entanglement relationship of qubits, stores the entanglement relationship in a hybrid register 130, and establishes quantum entanglement pairs for the qubits in the quantum computer based on this entanglement relationship to form a transmission link between the quantum computers.

[0063] The entanglement relationship of the qubits can be obtained by the quantum repeater 120 through task allocation strategy analysis, or by the quantum routing system 111 through task allocation strategy analysis. Specifically, the analysis method of qubit entanglement relationship can include at least one of the following: determining the qubit entanglement relationship of the qubits of the quantum computers corresponding to the sub-tasks with dependencies; determining the qubit entanglement relationship of the qubits of the quantum computers executing the same sub-task; determining the qubit entanglement relationship of the qubits of the quantum computers corresponding to the sub-tasks with cooperative execution relationship.

[0064] Based on the above embodiments, and assuming the entanglement relationship of qubits in a quantum computer is determined, a target quantum communication path is identified to construct the communication link between quantum computers in order to improve the communication performance between them. Multiple candidate quantum communication paths can be formed based on the network topology. By screening these candidate paths based on communication performance, the target quantum communication path is obtained, thereby improving the communication security and stability of the quantum computers during task execution.

[0065] In some embodiments of this disclosure, the quantum routing system 111 is further configured to: for quantum computers with communication relationships, determine multiple candidate quantum communication paths based on the network topology; determine influencing factors corresponding to the candidate quantum communication paths based on the network topology and the state information of the quantum computers, the influencing factors including at least one of channel quality, transmission distance, and quantum repeater location; and determine the target quantum communication path corresponding to the quantum computers with communication relationships based on the influencing factors of each candidate quantum communication path.

[0066] The network topology includes the locations and connections of quantum computers and quantum repeaters. Nodes in this topology correspond to quantum devices, including quantum computers or quantum repeaters, and edges represent physical communication links between these devices. Quantum computers with communication relationships can be those to which a communication link needs to be established. Examples include: quantum computers corresponding to dependent sub-tasks; quantum computers executing the same sub-task; and quantum computers corresponding to sub-tasks with cooperative execution relationships. For quantum computers with communication relationships, a path search (e.g., depth-first search or breadth-first search) is performed within the network topology, traversing the topology to generate multiple candidate quantum communication paths from the source quantum computer to the target quantum computer. Here, the source and target quantum computers are quantum computers with a communication relationship. The influencing factors for each candidate quantum communication path are determined, including at least one of channel quality, transmission distance, and quantum repeater location. Channel quality is an indicator of a channel's ability to transmit quantum states and can be determined by at least one of quantum state fidelity, channel error rate, and channel loss. For example, channel quality can be determined based on quantum state fidelity. The transmission distance can be considered the total length of the candidate quantum communication path. The transmission distance affects the degree of quantum loss; the greater the distance, the stronger the photon attenuation and environmental interference, and the lower the quantum state fidelity. The location of the quantum repeater can be considered the distribution of the quantum repeaters within the candidate quantum communication path. This can be determined by the physical distance between the quantum repeaters and other quantum devices in the network topology. The more quantum repeaters there are, the more entanglement swaps occur, and the higher the risk of introducing errors. An unreasonable location of the quantum repeaters within the candidate quantum communication path (the physical distance from other quantum devices) may prevent entanglement from being established.

[0067] A performance score for each candidate quantum communication path can be obtained by weighting the influencing factors and their respective weights. The candidate quantum communication paths are then ranked based on their performance scores, and the path with the highest performance score is selected as the target quantum communication path.

[0068] Given a defined target quantum communication path between quantum computers, quantum repeaters construct entangled pairs of qubits in the quantum computers using quantum entanglement swapping technology to form a transmission link between the quantum computers.

[0069] In some embodiments of this disclosure, the quantum routing system 111 is further configured to: acquire the channel quality map and noise pattern of the target quantum communication path, and determine a quantum key distribution protocol adapted to the target quantum communication path based on the channel quality map and the noise pattern. The quantum key distribution protocol can be a data protocol used to generate shared keys for quantum devices communicating. Different quantum key distribution protocols differ in at least one of the following: tolerance to channel loss, noise type, transmission distance, etc. By determining a suitable quantum key distribution protocol for the target quantum communication path, key generation failures or security vulnerabilities caused by protocol-signal mismatch can be avoided.

[0070] Noise patterns can include information such as noise type, intensity, and distribution. These noise patterns can be identified using quantum process tomography (QT) techniques to analyze the target quantum communication path. The channel quality map includes at least one indicator characterizing the channel's transmission capability, such as qubit error rate, quantum state fidelity, and channel loss coefficient. Specifically, the channel quality map can be constructed by acquiring these time-varying indicators and forming time-varying indicator curves. It is understood that the channel quality map can be dynamically changing. Correspondingly, a dynamic channel quality map and noise patterns are acquired, and a quantum key distribution protocol adapted to the target quantum communication path is dynamically set. In some embodiments of this disclosure, multiple quantum key distribution protocols are pre-set with adaptation relationships between the channel quality map and the noise patterns. The channel quality map and noise patterns of the target quantum communication path are matched within these adaptation relationships to determine the quantum key distribution protocol adapted to the target quantum communication path.

[0071] In some embodiments of this disclosure, the quantum routing system 111 is further configured to: determine the data loss value during data transmission of the target quantum communication path using a path loss model, and compensate for the loss of the target quantum communication path using at least one of quantum entanglement distillation and quantum memory.

[0072] The path loss model can be a data model used to evaluate data loss in a target quantum communication path. The path loss model may include an optical fiber channel loss model based on the transmission distance and the light attenuation coefficient. Optionally, the optical fiber channel loss model may include a product term of the transmission distance and the light attenuation coefficient. Accordingly, the data loss value during data transmission can be determined based on the product of the transmission distance and the light attenuation coefficient. A loss compensation method is determined based on the magnitude of the data loss value during data transmission. This loss compensation method includes quantum entanglement distillation and setting at least one quantum memory in the target quantum communication path. For example, for low-fidelity cases during data transmission, loss compensation can be achieved through quantum entanglement distillation. Quantum entanglement distillation is a method for extracting high-fidelity entangled pairs from multiple low-fidelity entangled pairs to combat the fidelity reduction caused by path loss. Specifically, the entangled pairs to be distilled after determining the path loss are defined. These entangled pairs can be understood as those with fidelity below a threshold. For any entangled pair to be distilled (A0B0) and the auxiliary measurement pair (A1B1), a local CNOT operation is performed. Z-basis measurements are performed on the auxiliary bits (and), and the measurement results are recorded. If the measurement results are consistent, the entangled pair to be distilled (A0B0) is retained; if the measurement results are inconsistent, it is discarded. This quantum entanglement distillation process is repeated to purify each entangled pair to be distilled, resulting in a high-fidelity entangled pair.

[0073] For example, in cases where the coherence time of a quantum state cannot support long-distance transmission, quantum memories can be set up in the target quantum communication path to temporarily store the quantum state, extending the coherence time and providing a sufficient time window for quantum entanglement distillation and long-distance transmission. The number of quantum memories can be determined based on the transmission distance.

[0074] In some embodiments of this disclosure, the quantum routing system 111 is also configured to: construct a multi-level topology based on the entanglement switching efficiency and storage capacity of quantum repeaters, and develop a resource scheduling algorithm to balance local entanglement generation and global path success rate.

[0075] In some embodiments of this disclosure, the quantum routing system 111 is further configured to: predict the quality of the target quantum communication path using a pre-built quality prediction model to obtain the communication quality of the target quantum communication path in a future time period; and update the target quantum communication path when a decrease in the target quantum communication quality is detected or the communication quality of the target quantum communication path is less than a quality threshold, so as to ensure the communication performance between quantum computers.

[0076] In some embodiments of this disclosure, the quantum routing system 111 is further configured to: set a backup quantum communication path corresponding to the target quantum communication path, and switch the target quantum communication path to the backup quantum communication path in the event of an anomaly or a decrease in communication performance of the target quantum communication path, thereby ensuring the security and stability of communication between quantum computers.

[0077] When a communication link is established between quantum computers, the task distribution system 112 distributes tasks based on a task allocation strategy, assigning subtasks to the corresponding quantum computers so that the quantum computers can execute the corresponding subtasks.

[0078] In some embodiments of this disclosure, the task distribution system 112 is further configured to: encapsulate each subtask and attach metadata to it based on the task allocation strategy; distribute the subtask to the at least one quantum computer if the current state of the corresponding quantum computer satisfies the task requirements of the subtask; and update the task allocation strategy based on the current state of each quantum computer if the current state of the corresponding quantum computer does not satisfy the task requirements of the subtask.

[0079] The metadata of the subtasks includes, but is not limited to, information such as task identifier, priority, and data input / output requirements. By setting the metadata, the quantum computer can accurately identify the nature of the task and the execution requirements when receiving the subtasks.

[0080] Before distributing subtasks, the task distribution system 112 acquires the current state of the quantum computers in real time. This current state includes, but is not limited to, the number of available qubits, the current computational load, and the busy level of quantum gate operations. Based on the current state of the quantum computers, if the quantum computers to be assigned subtasks meet the requirements of the subtasks, the subtasks are distributed to at least one quantum computer. If not, the task distribution strategy is updated by re-determining at least one quantum computer to be assigned subtasks based on the current state of each quantum computer. During the update of the task distribution strategy, subtasks are preferentially distributed to quantum computers with lower loads and more abundant resources to ensure the overall computational efficiency of the system.

[0081] The quantum computer receives and executes subtasks. To prevent the quantum computer from encountering anomalies during task execution that would prevent it from continuing, the quantum routing system 111 is also equipped with a multi-level fault tolerance mechanism to ensure the normal execution of tasks.

[0082] In some embodiments of this disclosure, the quantum routing system 111 is further configured to: acquire the running state of the quantum computer during the execution of the subtask; if the running state of the quantum computer is abnormal, store the context of the subtask being executed in the hybrid register and perform a state evaluation on the quantum computer; if the state evaluation result of the quantum computer is that it can continue to execute, reconstruct the computation path on the quantum computer and inject error correction code instructions to enable the quantum computer to continue executing the subtask; if the state evaluation result of the quantum computer is that it cannot continue to execute, update the task allocation strategy based on the current state of other quantum computers and redistribute the subtask to a new quantum computer for continued execution.

[0083] The quantum routing system 111 acquires real-time metrics such as qubit error rate, fidelity, and qubit availability during task execution by the quantum computer. If at least one of these metrics—an increase in qubit error rate, a decrease in fidelity, or a decrease in qubit availability—is detected, an anomaly in the quantum computer's operating state is identified. To ensure normal task execution, a fault-tolerant response process is triggered. The system acquires the context of the currently executing subtask, which may include, for example, the quantum register state vector, intermediate results from the classical computer, and the execution pointer position. This context image is then stored in the hybrid register 130 to prevent data loss. The quantum computer performs a state assessment, evaluating its remaining available computing power using real-time parameters such as quantum volume and coherence time. The system compares the resource requirements of the subtask with the remaining available computing power to obtain the quantum computer's state assessment result. If the remaining available computing power of the quantum computer meets the resource requirements of the subtask, the state assessment result indicates that execution can continue; otherwise, the state assessment result indicates that execution cannot continue.

[0084] If the quantum computer's state assessment indicates that execution can continue, the computational path on the quantum computer is reconstructed based on the type of anomaly. For example, if a certain type of quantum gate in the original path has a high error rate, it is updated to an equivalent sequence of gates, with the updated equivalent sequence having a lower error rate than the original quantum gates. Alternatively, if the original path experiences crosstalk due to gate operation timing conflicts, the time interval between conflicting gates is extended, or the execution order of the quantum gates is reordered. Simultaneously, error-correcting code instructions are injected into the quantum computer. These error-correcting code instructions are the core operational instructions for implementing fault-tolerant quantum computing. Through instructions such as error-correcting codes, a fault-tolerant mechanism for real-time error detection and dynamic correction can be constructed to prevent the accumulation of errors from causing task failure again. The quantum computer reads the context of the currently executing subtask from the hybrid register 130 and performs breakpoint recovery and re-execution of the subtask.

[0085] If the state assessment result of the quantum computer indicates that execution cannot continue, the current state of each quantum computer is acquired in real time. Based on the current state of each quantum computer, at least one quantum computer for the current subtask is reassigned, i.e., the task allocation strategy is updated. The quantum computer for the reassigned subtask reads the context of the currently executing subtask from the hybrid register 130 and performs breakpoint recovery and re-execution of the subtask.

[0086] Based on the above embodiments, a mutex lock is configured in the hybrid register 130 to resolve concurrent conflicts between multiple quantum computers accessing shared resources in the hybrid register. When any quantum computer writes a computation result to the hybrid register 130, it acquires the mutex lock. If the mutex lock is not occupied, the quantum computer successfully acquires the mutex lock, i.e., gains write access to the hybrid register 130, and releases the mutex lock upon completion of the write operation. Alternatively, when any quantum computer writes a computation result to the hybrid register 130, it acquires the mutex lock. If the mutex lock is occupied, the quantum computer enters a waiting state until the mutex lock is released. Upon successful acquisition of the mutex lock, the quantum computer writes the computation result to the hybrid register 130 and releases the mutex lock.

[0087] Similarly, the process of writing data to the hybrid register 130 in a classic computer is similar and will not be described in detail here.

[0088] When the quantum computer completes a subtask, it sends feedback information indicating that the task has been completed to the task distribution system 112. The task distribution system 112 records the execution status of the subtask and checks whether multiple subtasks have been completed. If so, it integrates the calculation results stored in the hybrid register 130 and outputs the final result of the task to be processed. If not, it continues to wait for the calculation results of the subtask.

[0089] The technical solution disclosed herein connects multiple quantum computers via a quantum interconnection device, providing a device foundation for the interconnection of multiple quantum computers. The quantum routing system within the quantum interconnection device decomposes and allocates tasks to be processed, obtaining a task allocation strategy that provides an allocation strategy for multiple quantum computers to collaboratively process tasks. Quantum repeaters establish quantum entanglement pairs between qubits in the quantum computers based on the entanglement relationship corresponding to the task allocation strategy, forming transmission links between quantum computers and realizing interconnection. This facilitates communication between multiple quantum computers collaboratively executing tasks. The task distribution system within the quantum interconnection device distributes multiple sub-tasks to each quantum computer, enabling each quantum computer to collaboratively execute multiple sub-tasks. During the execution of sub-tasks, intermediate data is transmitted through pre-built communication links, reducing the number of transmissions between quantum and classical computers and improving data transmission efficiency. Furthermore, hybrid registers are used to achieve data communication between quantum and classical computers, further enhancing quantum computing efficiency.

[0090] The transmission efficiency between a computer and a classical computer.

[0091] Figure 2 This is a flowchart illustrating a quantum computer interoperability execution method provided in this embodiment. This embodiment is applicable to situations where multiple quantum computers are interconnected to collaboratively process tasks, thereby accelerating processing efficiency. The method can be executed by a quantum interoperability device in the quantum computer interoperability system of this embodiment. This device can be implemented in software and / or hardware, such as... Figure 2 As shown, the method includes the following steps:

[0092] S210. Receive the task to be executed, parse and decompose the task to be executed to obtain multiple sub-tasks.

[0093] S220. Establish a task allocation strategy based on the computing resource information of each quantum computer, wherein the task allocation strategy includes the mapping relationship between each subtask and at least one qubit in the quantum computer.

[0094] S230. In the case of forming a transmission link between quantum computers, each of the subtasks is distributed to the corresponding quantum computer so that at least one quantum computer corresponding to the subtask executes the subtask. During the execution of the subtask by the at least one quantum computer, intermediate data is transmitted through the transmission link, and the calculation result of the subtask is stored in the hybrid register so that the classical computer reads the calculation result from the hybrid register.

[0095] Based on the above embodiments, in some embodiments of this disclosure, the step of parsing and decomposing the task to be executed to obtain multiple subtasks includes: identifying quantum instruction identifiers in the task to be executed to distinguish between classical computing task modules and quantum computing task modules; constructing an execution path based on the dependencies between classical computing task modules and quantum computing task modules, including a preceding classical computing task, a quantum computing task, and a subsequent classical computing task to be executed sequentially; decomposing the quantum computing task in the execution path into subtasks based on at least one of task relationships, data flow direction, and computing scale to obtain multiple subtasks; and sorting the subtasks according to their priority and the dependencies between them.

[0096] Based on the above embodiments, in some embodiments of this disclosure, a task allocation strategy is established based on the computing resource information of each quantum computer, including: obtaining the computing resource information of the quantum computer, wherein the computing resource information of the quantum computer includes at least one of the number of qubits, the current state of each qubit, and the fidelity of each qubit; obtaining the requirement attributes of the subtask, wherein the requirement attributes of the subtask include at least one of the qubit requirement and the qubit correlation constraint; and performing route matching on the computing resource information of the quantum computer and the requirement attributes of the subtask based on a preset routing algorithm to obtain the task allocation strategy.

[0097] Based on the above embodiments, in some embodiments of this disclosure, the method is further configured to: for quantum computers with communication relationships, determine multiple candidate quantum communication paths according to the network topology; based on the network topology and the state information of the quantum computer, determine the influencing factors corresponding to the candidate quantum communication paths, the influencing factors including at least one of channel quality, transmission distance and quantum repeater location; based on the influencing factors of each candidate quantum communication path, determine the target quantum communication path corresponding to the quantum computer with communication relationships.

[0098] Based on the above embodiments, in some embodiments of this disclosure, distributing each subtask to a corresponding quantum computer includes: encapsulating each subtask and attaching its metadata based on the task allocation strategy; distributing the subtask to the at least one quantum computer if the current state of the at least one quantum computer corresponding to the subtask meets the task requirements of the subtask; and updating the task allocation strategy based on the current state of each quantum computer if the current state of the at least one quantum computer corresponding to the subtask does not meet the task requirements of the subtask.

[0099] Based on the above embodiments, in some embodiments of this disclosure, the method is further configured to: acquire the running state of the quantum computer during the execution of the subtask by the quantum computer; if the running state of the quantum computer is abnormal, store the context of the subtask being executed in the hybrid register and perform a state evaluation on the quantum computer; if the state evaluation result of the quantum computer is that it can continue to execute, reconstruct the computation path on the quantum computer and inject error correction code instructions so that the quantum computer can continue to execute the subtask; if the state evaluation result of the quantum computer is that it cannot continue to execute, update the task allocation strategy based on the current state of other quantum computers and redistribute the subtask to a new quantum computer for continued execution.

[0100] Based on the above embodiments, in some embodiments of this disclosure, the hybrid register is configured with a mutex lock. The technical solution of this embodiment uses a quantum routing system to decompose and allocate tasks to obtain a task allocation strategy, providing an allocation strategy for multiple quantum computers to collaboratively process tasks. Quantum repeaters establish quantum entanglement pairs between qubits in the quantum computers based on the entanglement relationship corresponding to the task allocation strategy, forming transmission links between quantum computers and realizing interconnection of quantum computers, which is beneficial for communication between multiple quantum computers collaboratively executing tasks. The task distribution system in the quantum interconnection device distributes multiple sub-tasks to each quantum computer, enabling each quantum computer to collaboratively execute multiple sub-tasks. During the execution of sub-tasks, intermediate data is transmitted through pre-built communication links, reducing the number of transmissions between quantum computers and classical computers and improving data transmission efficiency. Furthermore, the hybrid register enables data communication between quantum computers and classical computers, further improving the transmission efficiency between them.

[0101] In some embodiments of this disclosure, an embodiment of an interoperable execution method for a quantum computer is provided. Figure 3 This is a flowchart of a quantum computer interoperability execution method provided in this disclosure. The method includes the following steps:

[0102] S100 connects the quantum computer to the quantum interconnection device to obtain detailed information about the quantum computer.

[0103] When a quantum computer is connected to a quantum interconnection device, a pre-set initial protocol within the device is activated, initiating an automated detection process. A pre-configured detection algorithm identifies the hardware type of the quantum computer, determining whether it qualifies as a quantum computer. The operational status of the quantum computer is monitored, including but not limited to checking whether the initialization of the qubits was successful, whether the quantum gate operations within the system respond normally, and whether key parameters such as the temperature and voltage of each hardware module are within their normal operating ranges. This ensures that the quantum computer is in a good working condition upon connection.

[0104] The quantum interconnection device, based on a communication protocol, can initiate information query requests to each quantum computer. The quantum computers then respond to these requests, providing the interconnection device with detailed information about their respective quantum computers. This detailed information may include computational resource information, including but not limited to the number of qubits, the current state of each qubit (e.g., whether it is idle, performing a computational task, or experiencing a malfunction), and the fidelity of each qubit. The quantum interconnection device stores the received detailed information from each quantum computer in a pre-planned hybrid register according to a specific data format and storage rules, enabling rapid and accurate retrieval in subsequent task scheduling and resource allocation processes.

[0105] The S200 uses the Software Development Kit (SDK) provided by the quantum interconnection device to obtain the task code for the multi-quantum computer written by the user.

[0106] The SDK provided by the quantum interconnection device can display an interactive page to users, i.e., the interactive page of the interactive system. Users can input tasks to be executed through the interactive page. For example, the interactive page may include code editing controls, allowing users to edit code, input task code, and the interactive system to compile the task code into an executable task.

[0107] The SDK's built-in query function allows users to obtain real-time computing power information for multiple quantum computers connected to the quantum interconnection device. For example, it can query whether each quantum computer is currently idle, available for use, and the number of qubits available on each available quantum computer. The SDK employs encapsulation technology to hide task allocation and the underlying details of quantum computer usage, allowing users to write code without needing to understand the complex quantum computer resource scheduling and task allocation logic. After completing the code, users can directly use the SDK's integrated compilation tool to compile the code using default compilation parameters or custom compilation options based on task requirements. Once compiled, the written task logic is submitted to the quantum interconnection device for further processing.

[0108] S300 decomposes and sorts the tasks.

[0109] The quantum interconnection device includes a quantum routing system. This system receives tasks to be executed, decomposes and schedules them. Specifically, it uses compiler analysis techniques to semantically parse the codebase, identifying features such as quantum gate operators and entanglement instruction sets to construct a heterogeneous dependency graph containing classical computing nodes (i.e., classical computing task modules) and quantum computing nodes (i.e., quantum computing task modules). Based on execution strategy annotations embedded in the code (such as quantum resource allocation tags and measurement feedback conditions), it constructs a hybrid computing state transition graph under time constraints. Data flow analysis determines the optimal execution chain (including the execution paths of the preceding classical computing task, the quantum computing task, and the subsequent classical computing task executed sequentially). Then, a multi-dimensional decomposition strategy is employed, constructing a hierarchical tree based on task dependencies, tracking data flow through quantum state evolution, evaluating computational complexity in conjunction with hardware parameters, and using a tensor network contraction algorithm to decompose the quantum task into multiple sub-tasks.

[0110] The quantum routing system enters a phase of sorting multiple subtasks, based on their priority and dependencies. Higher-priority subtasks are placed earlier in the execution order to quickly acquire computing resources and begin computation. Simultaneously, dependent subtasks are arranged according to their dependencies; that is, after all preceding dependent subtasks have been completed, subsequent dependent subtasks are added to the executable queue. For example, if subtask A is a predecessor to subtask B, subtask A is executed before subtask B. Furthermore, considering the real-time load of each quantum computer, subtasks are evenly distributed across different quantum computers to avoid overloading any single computer, thereby further improving the overall system efficiency. Through this subtask sorting method, the combined computing advantages of multiple quantum computers are fully utilized, ensuring that tasks can be completed quickly and accurately.

[0111] S400 establishes connections between quantum computers based on the order and requirements of subtasks.

[0112] Based on the sorting results of the subtasks, the system determines the execution order of each subtask and the task allocation strategy for the quantum computer. For subtasks that need to be executed collaboratively, the system uses a quantum routing system and quantum repeaters to establish a communication link between quantum computers under the property of quantum entanglement. For example, if the computation result of subtask A is the input data of subtask B, an effective communication link is established between the quantum computers executing subtask A and subtask B.

[0113] The quantum routing system determines quantum communication links based on the state of each quantum computer and the network topology. During this process, the system considers factors such as quantum channel quality, transmission distance, and the location of quantum repeaters to ensure communication stability and efficiency. Optionally, a dynamic channel quality map is constructed by continuously monitoring parameters such as qubit error rate and fidelity decay curves. This is combined with quantum process tomography to identify specific noise patterns and adapt to different quantum key distribution protocols. A path loss model based on fiber attenuation coefficient and free space loss is established, and quantum entanglement distillation and quantum memory are used to extend quantum state retention time to compensate for distance-related losses. A multi-level topology is constructed based on repeater entanglement switching efficiency and storage capacity, and a resource scheduling algorithm is developed to balance local entanglement generation with global path success rate. A reinforcement learning framework is used to maximize long-term communication success rate, and a channel reservation protocol is designed to handle sudden demands and a predictive model is built to anticipate quality degradation. A k-connected path protection mechanism, a quantum information splitting transmission protocol, and a hybrid feedback control loop are established. Through continuous learning and adaptation to dynamic network changes, routing decisions that maintain both stability and quantum properties are achieved.

[0114] The system uses quantum repeaters and quantum entanglement operations to establish entangled pairs between qubits in related quantum computers, enabling rapid data transmission and synchronization between quantum computers and ensuring that subtasks can be executed collaboratively in a predetermined order. For example, by utilizing the properties of entangled photon pairs, photons in different quantum computers can be entangled to achieve instantaneous information transmission. During task execution, the system monitors the operating status of the quantum computers and the progress of subtasks in real time. If a quantum computer malfunctions or becomes overloaded, the quantum routing system automatically reassesses the task requirements, adjusts the subtask allocation scheme, and re-establishes connections between quantum computers accordingly to ensure the smooth progress of the tasks. For example, subtasks originally assigned to a faulty quantum computer can be reassigned to other available quantum computers, and new communication links can be re-established.

[0115] See Figure 4 and Figure 5 , Figure 4 This is a flowchart of the quantum routing system provided in the embodiments of this disclosure; Figure 5This is a flowchart illustrating the operation of a quantum repeater provided in an embodiment of this disclosure. The quantum routing system is configured to decompose the task to be executed into subtasks, sort the subtasks, and determine a task allocation strategy for each subtask relative to a quantum computer. This strategy determines the mapping relationship between each subtask and at least one qubit in the quantum computer, providing a basis for constructing communication links between quantum computers. The quantum repeater determines the entanglement relationship of the qubits in the quantum computer based on the task allocation strategy, and establishes quantum entanglement pairs for the qubits in the quantum computer based on the entanglement relationship to form a transmission link between the quantum computers.

[0116] S500 distributes subtasks.

[0117] The task distribution system, based on a task allocation scheme, distributes subtasks to corresponding quantum computers. Each subtask is encapsulated, carrying its metadata such as task identifier, priority, and data input / output requirements, ensuring that the quantum computer can accurately identify the nature and execution requirements of the subtask upon receipt. Before distributing subtasks, the system acquires real-time status information from each quantum computer, including the number of available qubits, current computational load, and the activity level of quantum gate operations. Subtasks are prioritized for distribution to quantum computers with lower loads and more abundant resources to ensure overall system computational efficiency. Based on the subtask allocation scheme and quantum computer status assessment results, the system sends the encapsulated subtasks to the corresponding quantum computers via a quantum communication link. Upon receiving the subtask, the target quantum computer sends an acknowledgment message to the task distribution system. The system records the distribution status of each subtask; if no acknowledgment message is received within a specified time, the system retransmits the subtask until acknowledgment is received. Meanwhile, if the quantum computer discovers problems with the task data or insufficient resources to complete the task during the execution of subtasks, it will promptly report this to the task distribution system. The task distribution system will then adjust the task allocation or provide additional resource support based on the feedback.

[0118] The S600 quantum computer collaborates with other quantum computers to execute sub-tasks based on pre-assigned sub-tasks.

[0119] Quantum computers perform quantum gate operations using qubits based on the received sub-tasks. During this process, communication is achieved through quantum entanglement to enable collaborative computation with other quantum computers. For example, if the task involves matrix operations, different quantum computers are responsible for calculating different parts of the matrix. The quantum computer responsible for a particular sub-matrix calculation exchanges intermediate results in real time with another quantum computer responsible for the same sub-matrix calculation using entangled qubit pairs. Computations performed on different qubits are interconnected, functioning collaboratively within a unified computational system to complete the computational steps defined by various quantum algorithms. When executing the quantum Fourier transform algorithm, the quantum computer transforms the input quantum state through a series of specific quantum gate operations to obtain the corresponding computational result. During this transformation, entanglement is used to facilitate information exchange with other quantum computers, optimizing the computational process.

[0120] The quantum routing system integrates a multi-layered fault-tolerance mechanism to cope with anomalies in the quantum computing environment. When the system detects anomalies such as decreased computing power or increased qubit error rate in the quantum processor through the real-time performance monitoring module, it triggers a fault-tolerance response process. Specifically, it calls the state snapshot engine to capture the context of the current subtask, including the quantum register state vector, intermediate results of classical computation, and execution pointer position, and stores the context image of the current subtask in a hybrid storage array. It then starts the device health assessment system to dynamically assess the remaining available computing power based on real-time parameters such as quantum volume and coherence time, and predicts the feasibility of subsequent execution based on task resource requirements. If the assessment result indicates that execution can continue, the system will reconstruct the computation path through a quantum state transfer algorithm, automatically adjust the routing strategy, and inject error correction code instructions to ensure that the task continues to run under degraded conditions. If the anomaly exceeds the fault tolerance range, the system immediately sends an error report containing the fault type and scope of impact to the upper-level scheduler, and simultaneously executes a data erasure protocol to securely clear sensitive quantum information and prevent state contamination.

[0121] The S700 stores the execution results of subtasks in a hybrid register, waits for the classical computer to retrieve the calculation results, and then reclaims resources after the task is completed.

[0122] After computation, the quantum computer temporarily stores and processes the results locally. This processing includes classical data conversion of the quantum computer's calculation results to conform to the storage format requirements of the hybrid register. For example, the probability amplitude obtained from quantum state measurement is converted into a binary digital representation. As the hybrid register is a shared resource, a mutex mechanism is introduced to prevent data conflicts caused by multiple quantum computers writing data simultaneously. When a quantum computer is ready to write processed data back to the hybrid register, it attempts to acquire the mutex. If the mutex is unoccupied, the quantum computer successfully acquires the mutex and gains write access to the hybrid register, preventing other quantum computers from writing simultaneously. If the mutex is already occupied by another quantum computer, the requesting quantum computer will enter a waiting state until the mutex is released. The quantum computer that acquires the mutex writes the processed task result data to the designated location in the hybrid register. During the writing process, the accuracy and integrity of the data are ensured. After writing is complete, the quantum computer immediately releases the mutex so that other waiting quantum computers can acquire the mutex and perform data writing operations.

[0123] After the quantum computer completes the data write-back, it sends feedback information indicating that the task has been completed to the task distribution system. The task distribution system records the execution status of the subtask and checks if there are any other incomplete subtasks. If all subtasks are completed, the system will proceed with the next step of data integration and output processing based on the final result in the hybrid register; if there are still subtasks in progress, it will continue to wait for feedback from other quantum computers.

[0124] Figure 6 A schematic diagram of a quantum interconnect device 10, which can be used to implement embodiments of the present disclosure, is shown. The quantum interconnect device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workbenches, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The quantum interconnect device can also represent various forms of mobile devices, such as personal digital processors, cellular phones, smartphones, wearable devices (such as helmets, glasses, watches, etc.), and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely illustrative and are not intended to limit the implementation of the present disclosure described and / or claimed herein.

[0125] like Figure 6As shown, the quantum interconnection device 10 includes at least one processor 11 and a memory, such as a read-only memory (ROM) 12 and a random access memory (RAM) 13, communicatively connected to the at least one processor 11. The memory stores computer programs executable by the at least one processor. The processor 11 can perform various appropriate actions and processes based on the computer program stored in the ROM 12 or loaded from storage unit 18 into the RAM 13. The RAM 13 can also store various programs and data required for the operation of the quantum interconnection device 10. The processor 11, ROM 12, and RAM 13 are interconnected via a bus 14. An input / output (I / O) interface 15 is also connected to the bus 14.

[0126] Multiple components in the quantum interconnect device 10 are connected to the I / O interface 15, including: an input unit 16, such as a keyboard, mouse, etc.; an output unit 17, such as various types of displays, speakers, etc.; a storage unit 18, such as a disk, optical disk, etc.; and a communication unit 19, such as a network card, modem, wireless transceiver, etc. The communication unit 19 allows the quantum interconnect device 10 to exchange information / data with other devices through computer networks such as the Internet and / or various telecommunications networks.

[0127] Processor 11 can be a variety of general-purpose and / or special-purpose processing components with processing and computing capabilities. Some examples of processor 11 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various special-purpose artificial intelligence (AI) computing chips, various processors running machine learning model algorithms, a digital signal processor (DSP), and any suitable processor, controller, microcontroller, etc. Processor 11 performs the various methods and processes described above, such as interoperable execution methods of a quantum computer.

[0128] In some embodiments, the interoperability execution method of the quantum computer can be implemented as a computer program tangibly contained in a computer-readable storage medium, such as storage unit 18. In some embodiments, part or all of the computer program can be loaded and / or installed onto the quantum interoperability device 10 via ROM 12 and / or communication unit 19. When the computer program is loaded into RAM 13 and executed by processor 11, one or more steps of the interoperability execution method of the quantum computer described above can be performed. Alternatively, in other embodiments, processor 11 can be configured to execute the interoperability execution method of the quantum computer by any other suitable means (e.g., by means of firmware).

[0129] Various embodiments of the systems and techniques described above herein can be implemented in digital electronic circuit systems, integrated circuit systems, field-programmable gate arrays (FPGAs), application-specific integrated circuits (ASICs), application-specific standard products (ASSPs), systems-on-a-chip (SoCs), payload-programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various embodiments may include implementations in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which may be a dedicated or general-purpose programmable processor, capable of receiving data and instructions from a storage system, at least one input device, and at least one output device, and transmitting data and instructions to the storage system, the at least one input device, and the at least one output device.

[0130] Computer programs used to implement the methods of this disclosure may be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing apparatus, such that when executed by the processor, the computer programs cause the functions / operations specified in the flowcharts and / or block diagrams to be performed. The computer programs may be executed entirely on a machine, partially on a machine, or as a standalone software package, partially on a machine and partially on a remote machine, or entirely on a remote machine or server.

[0131] In the context of this disclosure, a computer-readable storage medium can be a tangible medium that may contain or store a computer program for use by or in conjunction with an instruction execution system, apparatus, or device. A computer-readable storage medium can be, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, apparatus, or devices, or any suitable combination of the foregoing. Alternatively, a computer-readable storage medium can be a machine-readable signal medium. More specific examples of machine-readable storage media include electrical connections based on one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination of the foregoing.

[0132] To provide interaction with the user, the systems and techniques described herein can be implemented on a quantum interconnect device having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and pointing device (e.g., a mouse or trackball) through which the user provides input to the quantum interconnect device. Other types of devices can also be used to provide interaction with the user; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including sound input, voice input, or tactile input).

[0133] The systems and technologies described herein can be implemented in computing systems that include backend components (e.g., as data servers), or middleware components (e.g., application servers), or frontend components (e.g., user computers with graphical user interfaces or web browsers through which users can interact with implementations of the systems and technologies described herein), or any combination of such backend, middleware, or frontend components. The components of the system can be interconnected via digital data communication of any form or medium (e.g., communication networks). Examples of communication networks include local area networks (LANs), wide area networks (WANs), blockchain networks, and the Internet.

[0134] A computing system can include clients and servers. Clients and servers are generally located far apart and typically interact through communication networks. The client-server relationship is created by computer programs running on the respective computers and having a client-server relationship with each other. The server can be a cloud server, also known as a cloud computing server or cloud host, which is a hosting product within the cloud computing service system to address the shortcomings of traditional physical hosts and VPS services, such as high management difficulty and weak business scalability.

[0135] It should be understood that the various forms of processes shown above can be used to rearrange, add, or delete steps. For example, the steps described in this disclosure can be executed in parallel, sequentially, or in different orders, as long as the desired result of the technical solution of this disclosure can be achieved, and this is not limited herein.

[0136] This disclosure also provides a computer program product, including a computer program that, when executed by a processor, implements the interoperability execution method of a quantum computer according to any embodiment of this disclosure.

[0137] In implementing a computer program product, computer program code for performing the operations of this disclosure can be written in one or more programming languages ​​or a combination thereof. Programming languages ​​include object-oriented programming languages ​​such as Java, Smalltalk, and C++, as well as conventional procedural programming languages ​​such as C or similar languages. The program code can be executed entirely on the user's computer, partially on the user's computer, as a standalone software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving remote computers, the remote computer can be connected to the user's computer via any type of network—including a local area network (LAN) or a wide area network (WAN)—or can be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0138] The specific embodiments described above do not constitute a limitation on the scope of protection of this disclosure. Those skilled in the art should understand that various modifications, combinations, sub-combinations, and substitutions can be made according to design requirements and other factors. Any modifications, equivalent substitutions, and improvements made within the spirit and principles of this disclosure should be included within the scope of protection of this disclosure.

Claims

1. An interworking system of quantum computers, characterized in that, The application relates to a quantum interworking device, a quantum repeater and a hybrid register; wherein the quantum interworking device is connected with a plurality of quantum computers; the hybrid register is connected with the quantum computers and a classical computer respectively; the quantum interworking device comprises a quantum routing system and a task distribution system; The quantum routing system receives a to-be-executed task, analyzes and task decomposes the to-be-executed task to obtain a plurality of subtasks; a task allocation strategy is established based on the computing resource information of each quantum computer, and the task allocation strategy comprises a mapping relationship between each subtask and quantum bits in at least one quantum computer; The quantum repeater determines the entanglement relationship of quantum bits in the quantum computer based on the task allocation strategy, establishes quantum entanglement pairs based on the entanglement relationship of the quantum bits in the quantum computer, and forms a transmission link between the quantum computers; The task distribution system distributes each subtask to the corresponding quantum computer based on the task allocation strategy, so that at least one quantum computer corresponding to the subtask executes the subtask, wherein the at least one quantum computer performs intermediate data transmission through the transmission link in the process of executing the subtask, and stores the calculation result of the subtask to the hybrid register, so that the classical computer reads the calculation result from the hybrid register. The quantum routing system is configured to:

2. The interworking system of quantum computers of claim 1, wherein, identify the quantum instruction identifier in the to-be-executed task to distinguish a classical computing task module and a quantum computing task module, and construct an execution path comprising a leading classical computing task, a quantum computing task and a post-classical computing task which are executed in sequence based on the dependency relationship between the classical computing task module and the quantum computing task module; based on at least one of task relationship, data flow direction and computing scale, the quantum computing task in the execution path is subtask decomposed to obtain a plurality of subtasks. The quantum routing system is configured to:

3. The interworking system of quantum computers of claim 1, wherein, obtain the computing resource information of the quantum computer, wherein the computing resource information of the quantum computer comprises at least one of the number of quantum bits, the current state of each quantum bit and the fidelity of each quantum bit; obtain the demand attribute of the subtask, wherein the demand attribute of the subtask comprises at least one of quantum bit demand and quantum bit correlation constraint; based on a preset routing algorithm, the computing resource information of the quantum computer and the demand attribute of the subtask are matched to obtain the task allocation strategy. The quantum routing system is configured to:

4. The interworking system of quantum computers according to any of claims 1-3, characterized in that, for quantum computers with a communication relationship, a plurality of candidate quantum communication paths are determined according to a network topology structure; based on the network topology structure and the state information of the quantum computers, influence factors corresponding to the candidate quantum communication paths are determined, wherein the influence factors comprise at least one of channel quality, transmission distance and quantum repeater position; based on the influence factors of each candidate quantum communication path, a target quantum communication path corresponding to the quantum computers with a communication relationship is determined. The task distribution system is configured to:

5. The interworking system of quantum computers of claim 1, wherein, ​ based on the task allocation strategy, encapsulating each subtask and attaching metadata of the subtask; in a case where the current state of the at least one quantum computer corresponding to the subtask meets the task requirement of the subtask, distributing the subtask to the at least one quantum computer; in a case where the current state of the at least one quantum computer corresponding to the subtask does not meet the task requirement of the subtask, updating the task allocation strategy based on the current state of each quantum computer.

6. The interworking system of quantum computers of claim 1, wherein, The quantum routing system is configured to: in the process that the quantum computer executes the subtask, obtaining the running state of the quantum computer; in a case where the running state of the quantum computer is abnormal, saving the context of the subtask being executed to the hybrid register and performing state evaluation on the quantum computer; in a case where the state evaluation result of the quantum computer is that the execution can continue, reconstructing the calculation path on the quantum computer, injecting error correction code instructions, and enabling the quantum computer to continue executing the subtask; in a case where the state evaluation result of the quantum computer is that the execution cannot continue, updating the task allocation strategy based on the current state of other quantum computers, and re-distributing the subtask to a new quantum computer to continue executing.

7. The interworking system of quantum computers of claim 1, wherein, The hybrid register is configured with a mutex, which is used to limit the access authority of the quantum computer and the classical computer to the hybrid register; in the process that any quantum computer writes the calculation result to the hybrid register, in a case where the mutex is not occupied, obtaining the mutex, writing the calculation result to the hybrid register, and releasing the mutex after completing the writing of the calculation result; in a case where the mutex is occupied, the quantum computer enters a waiting state until the mutex is released, obtains the mutex, writes the calculation result to the hybrid register, and releases the mutex after completing the writing of the calculation result.

8. An interworking execution method of a quantum computer, characterized by, comprising: receiving a task to be executed, analyzing and task decomposing the task to be executed to obtain a plurality of subtasks; establishing a task allocation strategy based on the calculation resource information of each quantum computer, the task allocation strategy including a mapping relationship between each subtask and a quantum bit in at least one quantum computer; in a case where a transmission link between quantum computers is formed, distributing each subtask to a corresponding quantum computer, so that at least one quantum computer corresponding to the subtask executes the subtask, wherein the at least one quantum computer performs intermediate data transmission through the transmission link in the process of executing the subtask, and stores the calculation result of the subtask to the hybrid register, so that the classical computer reads the calculation result from the hybrid register.

9. A quantum interconnect device, comprising: The quantum interworking device comprises: at least one processor; and a memory connected in communication with the at least one processor; wherein The memory stores a computer program executable by the at least one processor, and the computer program is executed by the at least one processor to enable the at least one processor to perform the interworking execution method of the quantum computer in claim 8.

10. A computer-readable storage medium, characterized in that, The computer readable storage medium stores computer instructions for enabling the processor to implement the interworking execution method of the quantum computer in claim 8 when executed.

11. A computer program product, characterised in that, The computer program product comprises a computer program which, when executed by the processor, implements the interworking execution method of the quantum computer according to claim 8.

Images