Superconducting quantum bit mapping method based on specific topological structure

Abstract

The present invention provides a superconducting quantum bit mapping method based on a specific topological structure, belonging to the field of quantum circuit compilation, and includes the following steps: S1: converting the quantum circuit into a graph format and storing it; S2: converting the quantum computer topology into a graph format and storing it; S3: collecting parameters of the quantum computer's physical characteristics; S4: sorting the logical bits according to the output of step S1; S5: sorting the device bits and completing the initial mapping; S6: completing the mapping of adjacent nodes of the initial mapping based on the initial mapping; S7: checking the logical bits that have not been mapped and repeating steps S5 and S6 until the final mapping is completed; S8: checking whether the final mapping obtained in step S7 can be executed on the device and making adjustments. This method realizes the functions of extracting the logical bits in the quantum circuit, extracting the physical characteristics of the device bits of the real quantum computer, finding the mapping between the logical bits and the device bits, and modifying the quantum circuit, thereby improving the speed of finding quantum circuit execution solutions.

Description

Technical Field

[0001] The present invention relates to the field of quantum circuit compilation, and in particular to a superconducting quantum bit mapping method based on a specific topological structure. Background Art

[0002] Quantum computers, a groundbreaking new technology, are rapidly developing and driving a revolution in computing power. However, despite their enormous potential, their practical application still faces many challenges, one of which is qubit mapping. As a key step in quantum computing, its optimization directly impacts its efficiency and reliability. As quantum devices continue to advance and become more complex, the exploration of new technologies and algorithms is necessary to meet evolving requirements. Research in this area not only promotes the practical application of quantum computers but also lays the foundation for future technological advancements.

[0003] Quantum bit mapping refers to the process of assigning logical qubits (used to represent logical operation units in quantum algorithms) to physical qubits (operation units that actually exist in the hardware). Qubit mapping is not only a critical link in quantum computing tasks, but also directly affects the execution time, error accumulation, and overall performance of quantum circuits. Due to the physical limitations of quantum computing hardware, the connection between each physical qubit is usually not complete. Therefore, many quantum algorithms require the insertion of swap (SWAP) gates to adjust the bit positions to make them adjacent during actual operation. These additional SWAP gate operations significantly increase the depth of the circuit and introduce more noise, which particularly affects the calculation accuracy in the high-noise environment of current quantum computers.

[0004] Existing challenges include:

[0005] 1. Physical topology limitations: The physical topology of a quantum computer (e.g., linear chains, two-dimensional grids, etc.) restricts direct connections between qubits. This limitation prevents many two-qubit gate operations from being performed directly, requiring the insertion of SWAP gates to adjust the positions of the qubits.

[0006] 2. Noise and error rate: Current quantum computers are still in a high-noise environment. The operation of quantum bits is easily affected by environmental interference, resulting in a high error rate. The increase of SWAP gates will further aggravate this problem because more operations mean more potential sources of error.

[0007] 3. Circuit depth: The inserted SWAP gates significantly increase the depth of the quantum circuit, thereby extending the execution time. Summary of the Invention

[0008] In view of the above-mentioned shortcomings of the prior art, the object of the present invention is to provide a superconducting quantum bit mapping method based on a specific topological structure to solve the problems of physical topological limitations, noise and error rate of quantum computers in the prior art.

[0009] To achieve the above-mentioned and other related purposes, the present invention provides the following technical solutions:

[0010] The superconducting quantum bit mapping method based on a specific topological structure specifically includes the following steps:

[0011] S1, initialize the circuit topology G of the quantum circuit Q to be executed. Each logical qubit in the quantum circuit Q represents a vertex in the circuit topology G. If there is a two-qubit gate between two logical qubits in the quantum circuit Q, the corresponding two vertices in the circuit topology G are connected, otherwise they are not connected;

[0012] S2, initialize the structure topology graph T of the quantum computer to be run. Each device qubit in the quantum computer represents a vertex in the structure topology graph T. If a two-qubit gate is allowed between two device qubits in the quantum computer, the corresponding two vertices in the structure topology graph T are connected, otherwise they are not connected;

[0013] S3, using quantum calibration technology, collects the physical properties of the device quantum bits, including the single-bit gate fidelity F single , two-bit gate fidelity F double , read fidelity F readout ;

[0014] S4, based on the output of step S1, sort all logic bits by mapping requirements and select the logic bit L0 with the highest mapping requirement;

[0015] S5, sorting all device bits by quality according to steps S2 and S3, and selecting the device bit D0 with the highest quality, and mapping the logic bit selected in step S4 to the device bit D0: L0→D0;

[0016] S6, treating the mapping completed in step S5 as the initial mapping, respectively searching for adjacent nodes whose logic bits and device bits are on the corresponding line topology graph obtained in step S1, sorting the adjacent nodes according to steps S4 and S5, completing the mapping according to the sorting, and updating the initial mapping according to the first one in the sorting;

[0017] S7, check whether there are any logic bits that have not been mapped in the line topology diagram G. If so, record all the logic bits that have not been mapped to form a set R G , all unmapped device bits form the set R T , and repeat S5, S6;

[0018] S8, based on the final mapping obtained in step S7, checking whether all quantum gates in the quantum circuit need to add additional auxiliary gates when executed on the quantum computer and outputting an executable quantum circuit corresponding to the final mapping.

[0019] In one embodiment of the present invention, step S1 includes:

[0020] S1.1, initialize an array A for each quantum gate in the quantum circuit Q to be executed, where each element in array A contains the name, action bit, and parameters of the quantum gate;

[0021] S1.2, initialize an undirected graph G0, where the vertex set V of the undirected graph G0 represents logical qubits, and the edge set E represents the existence of a two-qubit gate between two logical qubits;

[0022] S1.3, traverse each element in the array A. If the element is a two-qubit gate and acts on logical qubits i and j, then add an edge connecting vertex i and fixed point j to the undirected graph G0 and form a circuit topology graph G.

[0023] In one embodiment of the present invention, step S2 includes:

[0024] S2.1, obtain a list of device bits of the quantum computer, where each device bit is represented by a unique identifier;

[0025] S2.2, initialize an undirected graph T0, where the vertices of the undirected graph T0 represent device qubits, and the edges E′ represent the two-qubit gates that can be applied between two device qubits;

[0026] S2.3, traverse the device bit list and add the vertex corresponding to each device bit to the vertex set V′;

[0027] S2.4, according to the coupling information of the quantum computer, traverse all device bit pairs. If a two-qubit gate is allowed between a pair of device bits, add an edge connecting the two vertices in the undirected graph T0 and form a structural topology graph T.

[0028] In one embodiment of the present invention, step S3 includes:

[0029] S3.1, measuring the physical characteristics of the device bits, including the single-bit gate fidelity F single , two-bit gate fidelity F double , read fidelity F readout ;

[0030] S3.2, create F single Array, F doubleArrays and F readout array, and are used to store the measured single-bit gate fidelity F single , two-bit gate fidelity F double , read fidelity F readout ;

[0031] S3.3, for the collection of single Array, F double Arrays and F readout Verify the physical property data in the array to ensure the accuracy and completeness of the data;

[0032] S3.4, associate the verified physical characteristic data with the vertex set V′ of the structural topology graph T to ensure that the physical characteristic data of each vertex is accessible.

[0033] In one embodiment of the present invention, step S4 specifically includes the following steps:

[0034] S4.1. Based on the line topology G, count the degree of each vertex in the vertex set V, that is, the number of edges connected to it, and sort them from large to small. The result is recorded as the vertex list P. G ;

[0035] S4.2, if the vertex degrees in step S4.1 are the same, count the number of single-bit gates that appear on the logical bits in the quantum circuit Q according to array A, sort them from large to small according to the number of single-bit gates, and update the vertex list P G ;

[0036] S4.3, the vertex list P completed in step S4.2 G , the first vertex is selected as the logical bit with the highest mapping requirement.

[0037] In one embodiment of the present invention, S5 specifically includes the following steps:

[0038] S5.1, sort the device bits of the structure topology diagram T in S2.4 according to the method in S4.1, and record the sorting result as P0;

[0039] S5.2, if there are multiple vertices with the same degree, continue to count the sum of the degrees of the neighboring nodes of these vertices in the structural topology graph T, sort them from large to small, and update P0;

[0040] S5.3, according to F in S3.2 single Array, F double Arrays and F readout Array,sort the device bits by different parameters, and sort the three fidelities from largest to smallest, and record the three sortings as P1, P2, and P3 respectively;

[0041] S5.4, from steps S5.1, S5.2, and S5.3, obtain four rankings P0, P1, P2, and P3. For each vertex, calculate its comprehensive ranking: R T :=0.1R0+0.5R1+0.15R2+0.25R3, according to the comprehensive ranking R T Sort from small to large, and the result is recorded as P T ;

[0042] S5.5, sorting from high to low according to the comprehensive ranking, and selecting the highest device bit to map with the logic bit with the highest mapping requirement in step S4.3.

[0043] In one embodiment of the present invention, the iterative mapping search process in S6 includes the following steps:

[0044] S6.1, taking the initial mapping L0→D0 as input, find the neighboring nodes of the logic bit L0 and the device bit D0 in the initial mapping in the line topology G and the structure topology T respectively, and then delete the mapped device bits and logic bits, denoted as N respectively. G (L0), N T (D0), if Then go to step S6.5, otherwise sort the neighboring node bits according to steps S4 and S5, N G The element mapping requirements in (L0) are sorted from large to small as {L1, L2, ..., L m}, N T The elements in (D0) are sorted from high to low in quality as {D1, D2, ..., D n};

[0045] S6.2, after sorting, recursively perform the following steps for i=1, 2, ..., min{m, n}: Execute the mapping L i →D i , regard i=1 as the initial mapping and recursively execute step S6.1 as input;

[0046] S6.3, check whether the logical bits found in step S6.1 have been mapped. If not, find the N bits in step S6.1. T (D0) The neighbor nodes of all elements are obtained by deleting the device bits that have been mapped. After sorting by quality, the remaining logical bits are mapped in sequence. Or if the number of elements still cannot meet the mapping requirements of logical bits, continue to look for The neighbor nodes of all elements are obtained by deleting the device bits that have been mapped. After sorting by quality, the remaining logical bits are mapped in sequence;

[0047] S6.4, repeat step S6.3 until all logic bits are mapped to device bits, or no suitable mapping can be found;

[0048] S6.5, Inspection If yes, go to step S6.6; if not, sort the remaining logic bits and device bits according to the result P. G 、P T , reselect a new initial mapping L0→D0 and go to step S6.1;

[0049] S6.6, output the final mapping result A subset of .

[0050] In one embodiment of the present invention, step S7 specifically includes:

[0051] S7.1, traverse all vertices of the line topology graph G, check whether each vertex has been mapped to a device bit, if so, record all unmapped logical bits to form a set R G ;

[0052] S7.2, traverse all vertices of the topology graph T and check whether each vertex has been mapped to a logic bit. If so, record all unmapped device bits to form a set R. T ;

[0053] S7.3, repeat steps S5 and S6 until the set R G and set R T Empty.

[0054] In one embodiment of the present invention, the process of adding an additional auxiliary quantum gate in S8 includes the following steps:

[0055] S8.1, based on the final mapping result generated in step S7, find the device bits corresponding to all mapped logical bits in the topology graph T, and form a new corresponding subgraph, denoted as graph G';

[0056] S8.2, according to step S1, check whether all two-bit gates in the circuit can be executed on the device represented by figure G'. If yes, proceed to step S8.4; if not, proceed to step S8.3;

[0057] S8.3. Use mapping to find the two device bits affected by this two-bit gate. Find a shortest path on the graph G'. Starting from the starting point of the path, perform swap operations with the adjacent nodes on the path in sequence, and update the corresponding positions in the circuit until the swap operation is completed at the end of the path. Execute the required two-bit gate on the end of the path and the previous vertex. Then, starting from the end, perform swap operations with the adjacent nodes on the path in sequence, and update the circuit until the swap operation is completed at the starting point.

[0058] S8.4, repeat steps S8.2 and S8.3 until all two-bit gates in the circuit can be executed;

[0059] S8.5 outputs the updated circuit.

[0060] As described above, the superconducting quantum bit mapping method based on a specific topological structure of the present invention has the following beneficial effects:

[0061] 1. Reduce the number of auxiliary gates: By optimizing the mapping of logical qubits to physical qubits, the use of unnecessary auxiliary gates (such as SWAP gates) is reduced. This not only reduces the depth and complexity of quantum circuits, but also reduces the noise and error rate caused by additional operations, thereby improving the efficiency of quantum computing.

[0062] 2. Improving mapping accuracy and efficiency: By initializing the circuit topology and structural topology, the connection relationship between the logical qubits in the quantum circuit and the device qubits in the quantum computer is clearly displayed. This provides a clear foundation for subsequent mapping and ensures mapping accuracy and efficiency.

[0063] 3. Enhanced quantum computing reliability: Prioritizing high-quality device qubits for mapping effectively reduces the error rates of single- and two-qubit gates. By comprehensively considering the physical properties of device qubits (such as single- and two-qubit gate fidelity, and readout fidelity), we ensure that the selected device qubits exhibit optimal performance, improving the overall reliability of quantum computing.

[0064] 3. Support for complex quantum algorithms: This method can handle complex quantum circuits containing a large number of two-bit gates, ensuring that these circuits can be correctly executed on quantum computers with specific topologies.

[0065] 4. Dynamic Adjustment and Adaptability: By regularly measuring and updating the physical properties of the device’s qubits, the mapping strategy can be dynamically adjusted to adapt to changes in the performance of the quantum computer. This ensures the continued effectiveness of the mapping method over time and on different devices, improving the robustness of the system.

[0066] 5. Handling complex topologies: Through recursion and multi-level neighbor node search, it can handle complex topologies and ensure that all logical bits can find appropriate device bits for mapping.

[0067] 6. Ensure the feasibility of two-bit gates: Ensure that all two-bit gates can be correctly executed on the actual device by generating corresponding subgraphs, checking the feasibility of the two-bit gates, adding SWAP gates, and repeatedly checking and adding SWAP gates.

[0068] 7. Improve overall performance: By comprehensively considering multiple factors (such as degree, neighbor node degree, and physical characteristics), the optimal device bit mapping is selected, reducing the error rate in quantum computing and improving overall computing performance. This enables quantum computers to better realize their potential in practical applications. BRIEF DESCRIPTION OF THE DRAWINGS

[0069] Figure 1 Shown is a schematic diagram of the process of the present invention;

[0070] Figure 2 An architectural diagram showing the bits of the device;

[0071] Figure 3 Displayed as IBM's heavy-hex architecture;

[0072] Figure 4 The following figure shows the demonstration of adding the SWAP operation in step 8.3. DETAILED DESCRIPTION

[0073] The following specific embodiments illustrate the implementation of the present invention. Those skilled in the art can easily understand other advantages and effects of the present invention from the contents disclosed in this specification. It should be noted that the following embodiments and features in the embodiments can be combined with each other unless there is a conflict.

[0074] See also Figure 1 The present invention provides a superconducting quantum bit mapping method based on a specific topological structure, the steps of which include: S1, initializing a circuit topology graph G of a quantum circuit Q to be executed, where each logical quantum bit in the quantum circuit Q represents a vertex in the circuit topology graph G, and if a double-qubit gate exists between two logical quantum bits in the quantum circuit Q, the corresponding two vertices in the circuit topology graph G are connected, otherwise they are not connected; S2, initializing a structural topology graph T of a quantum computer to be run, where each device quantum bit in the quantum computer represents a vertex in the structural topology graph T, and if a double-qubit gate is allowed to be applied between two device quantum bits in the quantum computer, the corresponding two vertices in the structural topology graph T are connected, otherwise they are not connected; S3, using quantum calibration technology to collect the physical properties of the device quantum bits, including the single-bit gate fidelity F single, two-bit gate fidelity F double , read fidelity F readout ; S4, according to the output of step S1, sort all the logic bits by mapping requirements, and select the logic bit L0 with the highest mapping requirement; S5, according to steps S2 and S3, sort all the device bits by quality, and select the device bit D0 with the highest quality, and map the logic bit selected in step S4 to the device bit D0: L0→D0; S6, regard the mapping completed in step S5 as the initial mapping, and find the adjacent nodes of its logic bits and device bits on the corresponding line topology graph obtained in step S1 respectively, sort the adjacent nodes according to steps S4 and S5, complete the mapping according to the sorting, and update the initial mapping according to the first bit in the sorting; S7, check whether there are any logic bits that have not been mapped in the line topology graph G, and if so, record all the unmapped logic bits to form a set R G , all unmapped device bits form the set R T , and repeat S5, S6; S8, according to the final mapping obtained in step S7, check whether all quantum gates in the quantum circuit need to add additional auxiliary gates when executed on the quantum computer and output the executable quantum circuit corresponding to the final mapping.

[0075] The present invention reduces the use of unnecessary auxiliary gates (such as SWAP gates) by optimizing the mapping of logical qubits to physical qubits, improves the execution efficiency of quantum circuits, and gives priority to mapping high-quality device qubits. This can effectively reduce the error rate of single-bit gates and two-bit gates, and improve the reliability of overall quantum computing.

[0076] The step S1 includes: S1.1, initializing an array A according to each quantum gate in the quantum circuit Q to be executed, wherein each element in the array A contains the name, action bit and parameters of the quantum gate; S1.2, initializing an undirected graph G0, wherein the vertex set V of the undirected graph G0 represents the logical quantum bit, and the edge set E represents the existence of a two-qubit gate between two logical quantum bits; S1.3, traversing each element in the array A, if the element represents a two-qubit gate and acts on logical quantum bits i and j, then adding an edge connecting vertex i and fixed point j to the undirected graph G0, and forming a circuit topology graph G.

[0077] By initializing the array A and the undirected graph G0, and the subsequent traversal and edge-adding process, the interaction relationship between the logical qubits in the quantum circuit is clarified, providing a clear foundation for subsequent mapping; the constructed circuit topology diagram G intuitively displays the structure of the quantum circuit, which helps to consider their interaction relationship when mapping the logical qubits in subsequent steps, thereby optimizing the mapping scheme and reducing the use of unnecessary auxiliary gates; the clear topological structure helps to quickly identify which logical qubits require special attention, thereby improving the efficiency and accuracy of the mapping process.

[0078] The step S2 includes: S2.1, obtaining a device bit list of the quantum computer, where each device bit is represented by a unique identifier; S2.2, initializing an undirected graph T0, where the vertices of the undirected graph T0 represent device quantum bits, and the edge E′ represents that a two-qubit gate is allowed between two device quantum bits; S2.3, traversing the device bit list, and adding the vertex corresponding to each device bit to the vertex set V′; S2.4, traversing all device bit pairs based on the coupling information of the quantum computer, and if a two-qubit gate is allowed between a pair of device bits, adding an edge connecting the two vertices to the undirected graph T0, and forming a structural topology graph T.

[0079] By initializing an undirected graph T0 and adding edges based on coupling information, the connections between the qubits in the quantum computer are clearly represented. The establishment of the structural topology T allows the actual connections between the qubits in the devices to be considered during the mapping process, providing a clear foundation for subsequent mapping and optimization. This process not only improves the accuracy and efficiency of the mapping, but also supports complex quantum algorithms, optimizes resource utilization, and simplifies quantum circuit design.

[0080] The step S3 includes: S3.1, measuring the physical characteristics of the device bit, including the single-bit gate fidelity F single , two-bit gate fidelity F double , read fidelity F readout ; S3.2, create F single Array, F double Arrays and F readout array, and are used to store the measured single-bit gate fidelity F single , two-bit gate fidelity F double , read fidelity F readout ; S3.3, for the collection in F single Array, F double Arrays and F readout The physical characteristic data in the array is verified to ensure the accuracy and completeness of the data; S3.4, the verified physical characteristic data is associated with the vertex set V′ of the structural topology graph T to ensure that the physical characteristic data of each vertex is accessible.

[0081] By verifying the physical property data, the accuracy and integrity of the data are ensured, mapping errors caused by data errors are avoided, and the reliability of the mapping is improved; the verified physical property data is associated with the vertex set V′ of the structural topology graph T, so that the performance data of each device quantum bit can be easily obtained during the mapping process, thereby making the optimal mapping decision. By considering the single-bit gate fidelity F single , two-bit gate fidelity F double , read fidelity F readout , device qubits with better performance can be prioritized for mapping, thereby reducing the error rate in quantum computing. By regularly measuring and updating the physical properties of device qubits, it can support dynamic adjustment of mapping strategies to adapt to performance changes of quantum computers.

[0082] like Figure 2 This is the architecture diagram of the 66 device bits in the Tianyan-176 superconducting quantum computer. The device bits roughly follow a planar quadrilateral mesh architecture. By sorting the quantum computer devices according to special rules, a greedy search algorithm is used to quickly find the local optimal mapping, ensure the connectivity of the mapping subgraph, and issue a warning when the device cannot meet the quantum circuit. In actual applications, the topological structures of quantum devices vary, such as Figure 3 heavy-hex architecture, which is a different architecture from Tianyan's superconducting quantum computer.

[0083] Step S4 specifically includes the following steps: S4.1, based on the line topology graph G, count the degree of each vertex in the vertex set V, that is, the number of edges connected to it, and sort them from large to small. The result is recorded as the vertex list P G ; S4.2, if the vertex degrees in step S4.1 are the same, count the number of single-bit gates that appear on the logical bits in the quantum circuit Q according to array A, sort them from large to small according to the number of single-bit gates, and update the vertex list P G ; S4.3, the vertex list P completed in step S4.2 G , the first vertex is selected as the logical bit with the highest mapping requirement.

[0084] By counting the degree of each vertex in the vertex set V and sorting them from large to small, we can prioritize mapping those logical bits with the most connections in the network. When the degrees of multiple vertices are the same, further sorting them according to the number of single-bit gates can ensure that those logical bits that are used more frequently in quantum circuits are ranked first. By prioritizing the mapping of the logical bits with the highest demand, we can reduce the number of auxiliary gate operations in the quantum circuit, reduce the error rate in quantum computing, and improve the execution efficiency of the quantum circuit.

[0085] S5 specifically includes the following steps: S5.1, sort the device bits of the structure topology graph T in S2.4 according to the method of S4.1, and record the sorting result as P0; S5.2, if there are multiple vertices with the same degree, continue to count the sum of the degrees of the neighboring nodes of these vertices in the structure topology graph T, sort them from large to small, and update P0; S5.3, according to F in S3.2 single Array, F double Arrays and F readout Array, sort the device bits according to different parameters respectively, sort the three fidelity from large to small, and record the three sorts as P1, P2, and P3 respectively; S5.4, obtain four sorts P0, P1, P2, and P3 from steps S5.1, S5.2, and S5.3, and calculate the comprehensive ranking of each vertex with four rankings R0, R1, R2, and R3: T :=0.1R0+0.5R1+0.15R2+0.25R3, according to the comprehensive ranking R T Sort from small to large, and the result is recorded as P T ; S5.5, sort from high to low according to the comprehensive ranking, and select the highest device bit to map with the logical bit with the highest mapping requirement in step S4.3.

[0086] Count the degree of each device bit (i.e., the number of edges connected to it) and sort them from highest to lowest by degree. The result is recorded as vertex list P0. This step aims to identify the device bit with the most connections in the network. If multiple vertices have the same degree in step S5.1, further sort the sum of the degrees of their neighboring nodes to ensure that the device bits that occupy a key position in the topology are ranked first. The highest-ranking device bit is then selected and mapped to the logic bit with the highest mapping requirement in step S4.3, ensuring that the most critical and needed logic bits are mapped to the device bit with the best performance.

[0087] The iterative mapping search process in S6 includes the following steps: S6.1, taking the initial mapping L0→D0 as input, respectively search for the neighboring nodes of the logic bit L0 and the device bit D0 in the initial mapping in the line topology graph G and the structure topology graph T, and then delete the mapped device bits and logic bits, respectively, and record them as N G (L0), N T (D0), if Then go to step S6.5, otherwise sort the neighboring node bits according to steps S4 and S5, N G The element mapping requirements in (L0) are sorted from large to small as {L1, L2, ..., L m}, N T The elements in (D0) are sorted from high to low in quality as {D1, D2, ..., D n}; S6.2, after sorting, recursively perform the following steps for i=1, 2, ..., mim{m, n}: Execute the mapping L i →D i , regard i=1 as the initial mapping, and recursively execute step S6.1 as input; S6.3, check whether all the logical bits found in step S6.1 have been mapped. If not, find N in step S6.1. T (D0) The neighbor nodes of all elements are obtained by deleting the device bits that have been mapped. After sorting by quality, the remaining logical bits are mapped in sequence. Or if the number of elements still cannot meet the mapping requirements of logical bits, continue to look for The neighbor nodes of all elements are obtained by deleting the device bits that have been mapped. After sorting by quality, complete the mapping with the remaining logical bits in turn; S6.4, repeat step S6.3 until all logical bits are mapped to device bits, or no suitable mapping can be found; S6.5, check If yes, go to step S6.6; if not, sort the remaining logic bits and device bits according to the result P. G 、P T , reselect the new initial mapping L0→D0, enter step S6.1; S6.6, output the final mapping result A subset of .

[0088] The mapping is gradually optimized through an iterative process to ensure that high-quality and high-demand bits are selected as much as possible for each mapping; through recursion and multi-level neighbor node search, complex topological structures can be handled; when a suitable mapping cannot be found, the initial mapping is reselected to ensure the flexibility and robustness of the entire mapping process; by comprehensively considering multiple factors (such as degree, neighbor node degree and physical properties), the optimal device bits are selected for mapping, reducing the error rate in quantum computing.

[0089] The step S7 specifically includes: S7.1, traversing all vertices of the line topology graph G, checking whether each vertex has been mapped to a device bit, if so, recording all unmapped logical bits to form a set R G ; S7.2, traverse all vertices of the topological graph T, check whether each vertex has been mapped to a logical bit, if so, record all unmapped device bits to form a set R T ; S7.3, repeat steps S5 and S6 until the set R G and set R T Empty.

[0090] By checking unmapped logical bits and device bits and repeating the mapping process, it is ensured that all logical bits can be successfully mapped to device bits to avoid omissions; through multiple checks and mappings, the integrity and accuracy of the mapping process are ensured; through multiple iterations and checks, complex quantum circuits can be processed to ensure that all logical bits can find appropriate device bits for mapping.

[0091] The process of adding additional auxiliary quantum gates in S8 includes the following steps: S8.1, based on the final mapping result generated in step S7, find the device bits corresponding to all mapped logical bits in the structural topology graph T, forming a new corresponding subgraph, recorded as graph G'; S8.2, based on step S1, check whether all two-bit gates in the circuit can be executed on the device represented by graph G'. If so, proceed to step S8.4; if not, proceed to step S8.3; S8.3, find the two device bits affected by this two-bit gate through mapping, and find a shortest path on graph G' , starting from the starting point of the path, perform SWAP operations with the adjacent nodes on the path in turn, and update them to the corresponding positions in the circuit until the SWAP operation is completed at the end point of the path, execute the required two-bit gates on the end point of the path and the previous vertex, and then start from the end point, perform SWAP operations with the adjacent nodes on the path in turn, and update them to the circuit until the SWAP operation is completed at the starting point; S8.4, repeat steps S8.2 and S8.3 until all two-bit gates in the circuit can be executed, and enter step S8.5; S8.5 outputs the updated circuit.

[0092] Figure 4 To demonstrate the addition of the SWAP operation in step S8.3, it is assumed that during the mapping process, there is a two-bit gate connection between the device bits q0 and q2. In the actual process, quantum routing is adopted to temporarily swap the positions of q0 and q1 by adding a SWAP gate, so that q0 and q2 can be temporarily connected.

[0093] By generating the corresponding subgraphs, checking the feasibility of the two-qubit gates, adding SWAP gates, and repeating the process of checking and adding SWAP gates, the team ensured that all two-qubit gates could be correctly executed on the actual device and output the updated circuit. This process not only ensured the feasibility of the two-qubit gates but also optimized the circuit structure, improving the reliability and efficiency of quantum computing.

[0094] The above embodiments are merely illustrative of the principles and effects of the present invention and are not intended to limit the present invention. Any equivalent modifications or variations made by persons skilled in the art without departing from the spirit and technical concepts disclosed herein shall be encompassed by the claims of the present invention.

Claims

1. A superconducting quantum bit mapping method based on a specific topological structure, characterized in that: The specific steps include: S1, initialize the circuit topology G of the quantum circuit Q to be executed. Each logical qubit in the quantum circuit Q represents a vertex in the circuit topology G. If there is a two-qubit gate between two logical qubits in the quantum circuit Q, the corresponding two vertices in the circuit topology G are connected, otherwise they are not connected; S2, initialize the structure topology graph T of the quantum computer to be run. Each device qubit in the quantum computer represents a vertex in the structure topology graph T. If a two-qubit gate is allowed between two device qubits in the quantum computer, the corresponding two vertices in the structure topology graph T are connected, otherwise they are not connected; S3, using quantum calibration technology, collects the physical properties of the device quantum bits, including the single-bit gate fidelity F single , two-bit gate fidelity F double , read fidelity F readout ; S4, based on the output of step S1, sort all logic bits by mapping requirements and select the logic bit L0 with the highest mapping requirement; S5, sorting all device bits by quality according to steps S2 and S3, and selecting the device bit D0 with the highest quality, and mapping the logic bit selected in step S4 to the device bit D0: L0→D0; S6, treating the mapping completed in step S5 as the initial mapping, respectively searching for adjacent nodes whose logic bits and device bits are on the corresponding line topology graph obtained in step S1, sorting the adjacent nodes according to steps S4 and S5, completing the mapping according to the sorting, and updating the initial mapping according to the first one in the sorting; S7, check whether there are any logic bits that have not been mapped in the line topology diagram G. If so, record all the logic bits that have not been mapped to form a set R G , all unmapped device bits form the set R T , and repeat S5, S6; S8, based on the final mapping obtained in step S7, checking whether all quantum gates in the quantum circuit need to add additional auxiliary gates when executed on the quantum computer and outputting an executable quantum circuit corresponding to the final mapping.

2. The superconducting quantum bit mapping method based on a specific topological structure according to claim 1, characterized in that: The step S1 comprises: S1.1, initialize an array A for each quantum gate in the quantum circuit Q to be executed, where each element in array A contains the name, action bit, and parameters of the quantum gate; S1.2, initialize an undirected graph G0, where the vertex set V of the undirected graph G0 represents logical qubits, and the edge set E represents the existence of a two-qubit gate between two logical qubits; S1.3, traverse each element in the array A. If the element is a two-qubit gate and acts on logical qubits i and j, then add an edge connecting vertex i and fixed point j to the undirected graph G0 and form a circuit topology graph G.

3. The superconducting quantum bit mapping method based on a specific topological structure according to claim 1, characterized in that: The step S2 comprises: S2.1, obtain a list of device bits of the quantum computer, where each device bit is represented by a unique identifier; S2.2, initialize an undirected graph T0, where the vertices of the undirected graph T0 represent device qubits, and the edges E′ represent the two-qubit gates that can be applied between two device qubits; S2.3, traverse the device bit list and add the vertex corresponding to each device bit to the vertex set V′; S2.4, according to the coupling information of the quantum computer, traverse all device bit pairs. If a two-qubit gate is allowed between a pair of device bits, add an edge connecting the two vertices in the undirected graph T0 and form a structural topology graph T.

4. The superconducting quantum bit mapping method based on a specific topological structure according to claim 3, characterized in that: The step S3 comprises: S3.1, measuring the physical characteristics of the device bits, including the single-bit gate fidelity F single , two-bit gate fidelity F double , read fidelity F readout ; S3.2, create F single Array, F double Arrays and F readout array, and are used to store the measured single-bit gate fidelity F single , two-bit gate fidelity F double , read fidelity F readout ; S3.3, for the collection of single Array, F double Arrays and F readout Verify the physical property data in the array to ensure the accuracy and completeness of the data; S3.4, associate the verified physical characteristic data with the vertex set V′ of the structural topology graph T to ensure that the physical characteristic data of each vertex is accessible.

5. The superconducting quantum bit mapping method based on a specific topological structure according to claim 4, characterized in that: Step S4 specifically includes the following steps: S4.

1. Based on the line topology G, count the degree of each vertex in the vertex set V, that is, the number of edges connected to it, and sort them from large to small. The result is recorded as the vertex list P. G ; S4.2, if the vertex degrees in step S4.1 are the same, count the number of single-bit gates that appear on the logical bits in the quantum circuit Q according to array A, sort them from large to small according to the number of single-bit gates, and update the vertex list P G ; S4.3, the vertex list P completed in step S4.2 G , the first vertex is selected as the logical bit with the highest mapping requirement.

6. The superconducting quantum bit mapping method based on a specific topological structure according to claim 5, characterized in that: S5 specifically includes the following steps: S5.1, sort the device bits of the structure topology diagram T in S2.4 according to the method in S4.1, and record the sorting result as P0; S5.2, if there are multiple vertices with the same degree, continue to count the sum of the degrees of the neighboring nodes of these vertices in the structural topology graph T, sort them from large to small, and update P0; S5.3, according to F in S3.2 single Array, F double Arrays and F readout Array,sort the device bits by different parameters, and sort the three fidelities from largest to smallest, and record the three sortings as P1, P2, and P3 respectively; S5.4, from steps S5.1, S5.2, and S5.3, obtain four rankings P0, P1, P2, and P3. For each vertex, calculate its comprehensive ranking: R T :=0.1R0+0.5R1+0.15R2+0.25R3, according to the comprehensive ranking R T Sort from small to large, and the result is recorded as P T ; S5.5, sorting from high to low according to the comprehensive ranking, and selecting the highest device bit to map with the logic bit with the highest mapping requirement in step S4.

3.

7. The superconducting quantum bit mapping method based on a specific topological structure according to claim 1, characterized in that: The iterative mapping search process in S6 includes the following steps: S6.1, taking the initial mapping L0→D0 as input, find the neighboring nodes of the logic bit L0 and the device bit D0 in the initial mapping in the line topology G and the structure topology T respectively, and then delete the mapped device bits and logic bits, denoted as N respectively. G (L0), N T (D0), if Then go to step S6.5, otherwise sort the neighboring node bits according to steps S4 and S5, N G The element mapping requirements in (L0) are sorted from large to small as {L1, L2, ..., L m }, N T The elements in (D0) are sorted from high to low in quality as {D1, D2, ..., D n }; S6.2, after sorting, recursively perform the following steps for i=1, 2, ..., min{m, n}: Execute the mapping L i →D i , regard i=1 as the initial mapping and recursively execute step S6.1 as input; S6.3, check whether the logical bits found in step S6.1 have been mapped. If not, find the N bits in step S6.

1. T (D0) The neighbor nodes of all elements are obtained by deleting the device bits that have been mapped. After sorting by quality, the remaining logical bits are mapped in sequence. Or if the number of elements still cannot meet the mapping requirements of logical bits, continue to look for The neighbor nodes of all elements are obtained by deleting the device bits that have been mapped. After sorting by quality, the remaining logical bits are mapped in sequence; S6.4, repeat step S6.3 until all logic bits are mapped to device bits, or no suitable mapping can be found; S6.5, Inspection If yes, go to step S6.6; if not, sort the remaining logic bits and device bits according to the result P. G 、P T , reselect a new initial mapping L0→D0 and go to step S6.1; S6.6, output the final mapping result A subset of .

8. The superconducting quantum bit mapping method based on a specific topological structure according to claim 1, characterized in that: The step S7 specifically includes: S7.1, traverse all vertices of the line topology graph G, check whether each vertex has been mapped to a device bit, if so, record all unmapped logical bits to form a set R G ; S7.2, traverse all vertices of the topology graph T and check whether each vertex has been mapped to a logic bit. If so, record all unmapped device bits to form a set R. T ; S7.3, repeat steps S5 and S6 until the set R G and set R T Empty.

9. The superconducting quantum bit mapping method based on a specific topological structure according to claim 1, characterized in that: The process of adding additional auxiliary quantum gates to S8 includes the following steps: S8.1, based on the final mapping result generated in step S7, find the device bits corresponding to all mapped logical bits in the topology graph T, and form a new corresponding subgraph, denoted as graph G'; S8.2, according to step S1, check whether all two-bit gates in the circuit can be executed on the device represented by figure G'. If yes, proceed to step S8.4; if not, proceed to step S8.3; S8.

3. Use mapping to find the two device bits affected by this two-bit gate. Find a shortest path on the graph G'. Starting from the starting point of the path, perform swap operations with the adjacent nodes on the path in sequence, and update the corresponding positions in the circuit until the swap operation is completed at the end of the path. Execute the required two-bit gate on the end of the path and the previous vertex. Then, starting from the end, perform swap operations with the adjacent nodes on the path in sequence, and update the circuit until the swap operation is completed at the starting point. S8.4, repeat steps S8.2 and S8.3 until all two-bit gates in the circuit can be executed; S8.5 outputs the updated circuit.

Images