A method, apparatus, medium, and electronic device for detecting data bit errors.

By constructing and measuring the color code diagram of a quantum circuit, pairing and identifying erroneous data bits, the problem of the inability to detect data bit errors during the operation of a quantum circuit in the existing technology is solved, realizing effective verification and correction of data bits and improving the reliability of quantum computing.

CN117648989BActive Publication Date: 2026-11-17ORIGIN QUANTUM COMPUTING TECH (HEFEI) CO LTD
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202311422592.1
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2023-10-27
Publication Date
2026-11-17
Estimated Expiration
2043-10-27

AI Technical Summary

Technical Problem

Existing color-coded data bit error detection methods cannot effectively detect erroneous data bits during the operation of quantum circuits.

Method used

The original color code diagram is constructed, and the measurement bits are measured before, during and after the operation of the quantum circuit. By pairing the measurement ratio characteristics in the color code diagram, the data bits in the closed figure enclosed by multiple paths and connection regions are identified as erroneous data bits, and the error is corrected by the logical bit Pauli operator error detection and correction method.

Benefits of technology

This enables effective verification and correction of erroneous data bits during the operation of quantum circuits, improving the reliability and accuracy of quantum computing.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN117648989B_ABST
    Figure CN117648989B_ABST
Patent Text Reader

Abstract

This application discloses a data bit error detection method, apparatus, medium, and electronic device. The method includes: constructing an original color code map, the original color code map including a first region representing two independent logic bits and a second region representing the connection between the two logic bits, the first region and the second region including points representing data bits and measurement bits; measuring the measurement bits before, during, and after the operation of a quantum circuit, respectively, to obtain a first measurement bit that reports an error before operation, a second measurement bit that reports an error during operation, and a third measurement bit that reports an error after operation; during the operation of the quantum circuit, the logic gates in the quantum circuit act on the logic bits; the first and third measurement bits are measurement bits in the first region, and the second measurement bit is a measurement bit in the first region and / or the second region; pairing the points corresponding to the first, second, and third measurement bits in the original color code map to obtain multiple paths; and taking the data bits in the closed figure enclosed by the multiple paths and the second region as the erroneous data bits. This method can detect erroneous data bits during the operation of a quantum circuit.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This application belongs to the field of quantum computing technology, and in particular to a method, apparatus, medium and electronic device for detecting qubit errors. Background Technology

[0002] Quantum error correction is a technique used to solve the error problem in quantum computing. In quantum computing, errors can occur during computation due to the volatility and interference of qubits.

[0003] The basic idea behind quantum error correction is to increase redundant qubits, including using multiple physical qubits to represent a single logical qubit. Quantum error-correcting codes can be used to check and correct errors in data bits. Among these, topological codes, including surface codes and color codes, are the most promising. Color codes are a type of topological QEC encoding cluster based on 3-colorable lattices. Because of their compatibility with local constraints in two-dimensional architectures, they have become a promising topological code for fault-tolerant quantum computing.

[0004] However, existing color-coded data bit error detection methods cannot detect data bits that err during the operation of quantum circuits.

[0005] Application content

[0006] The purpose of this application is to provide a data bit error detection method, apparatus, medium, and electronic device, which are designed to detect erroneous data bits during the operation of quantum circuits.

[0007] One embodiment of this application provides a data bit error detection method, the method comprising: Construct an original color code map, which includes a first region representing two independent logical bits and a second region representing the connection between the two logical bits. The first and second regions include points representing data bits and measurement bits. Before, during, and after the operation of the quantum circuit, the measurement bits are measured respectively to obtain the first measurement bit that reports an error before operation, the second measurement bit that reports an error during operation, and the third measurement bit that reports an error after operation. When the quantum circuit is running, the logic gates in the quantum circuit act on the logic bits. The first and third measurement bits are measurement bits in the first region, and the second measurement bit is a measurement bit in the first region and / or the second region. In the original color code diagram, the points corresponding to the first, second, and third measurement bits are paired up to obtain multiple paths; The data bits in the closed shape enclosed by the multiple paths and the second region are used as the data bits that caused the error.

[0008] Optionally, the closed shape includes sub-closed shapes with different areas, and the data bits in the closed shape enclosed by the plurality of paths and the second region are used as error data bits, including: The data bits in the sub-closed shape with the smallest area enclosed by the multiple paths and the second region are taken as the data bits of the error.

[0009] Optionally, the arrangement of the points representing data bits is at least one of a triangle, a quadrilateral, a regular hexagon, or an octagon, and the points representing data bits are located at the center point of the triangle, quadrilateral, regular hexagon, or octagon.

[0010] One embodiment of this application provides a logical bit Pauli operator error detection method, the method comprising: The method provided in the embodiments of this application is executed in which the initial state of the data bits is a pairwise Bell state, and after measuring the measured bits respectively, the Pauli operator of the measured bits at one of the measurements is also obtained; Based on the erroneous data bits and the error measurement bits obtained before one of the measurements, it is determined whether the logical bit Pauli operator is erroneous, wherein the logical bit Pauli operator is the product of the Pauli operators of the measurement bits during one of the measurements.

[0011] Optionally, determining whether the logical bit Pauli operator is erroneous based on the erroneous data bits and the erroneous measurement bits obtained before one of the measurements includes: If the number of error measurement bits in the measurement results prior to one of the measurements is odd, it is determined that the Pauli operator of the logical bit is incorrect.

[0012] Optionally, determining whether the logical bit Pauli operator is erroneous based on the erroneous data bits and the erroneous measurement bits obtained before one of the measurements includes: Based on the erroneous data bits, determine the number of measurement bits that should have been reported as erroneous in the measurement preceding one of the measurements; If the difference between the number of measurement bits that should report an error and the number of measurement bits that actually report an error is odd, it is determined that the Pauli operator of the logical bit is incorrect.

[0013] One embodiment of this application provides a logical bit Pauli operator error correction method, characterized in that the method includes: Perform the methods described above in the embodiments of this application; If the Pauli operator of the logical bit is incorrect, the Pauli operator of the logical bit is negative to obtain the corrected Pauli operator of the logical bit.

[0014] Another embodiment of this application provides a data bit error checking device, the device comprising: A construction module is used to construct an original color code map based on the input code distance, wherein each point in the original color code map represents a measurement bit or a data bit in the quantum chip; A measurement module is used to measure the measurement bits in the quantum chip and to obtain the error-reporting quantum bits based on the measurement results; The pairing module is used to pair the points corresponding to the erroneous measurement bits in the original color code diagram to obtain multiple paths. The sum of the weights of the edges in the multiple paths is minimized. The weight of the edge in each path is determined based on the physical bit error rate of the measurement bits corresponding to the two points in the path. The determination module is used to identify data bits in the closed pattern formed by the multiple paths as erroneous data bits.

[0015] Another embodiment of this application provides a storage medium storing a computer program, wherein the computer program is configured to execute the method described in any of the preceding claims when running.

[0016] Another embodiment of this application provides an electronic device including a memory and a processor, wherein the memory stores a computer program and the processor is configured to run the computer program to perform the method described in any of the preceding claims.

[0017] This application provides a data bit error detection method, apparatus, medium, and electronic device. Unlike traditional data bit error detection methods, it constructs an original color code map based on the layout of qubits in a quantum chip, such that multiple regions in the original color code map correspond to logic bits in the quantum chip and the connection structures between logic bits. Measurement bits in the quantum chip are measured before, during, and after the quantum circuit operates to obtain corresponding error-reporting measurement bits. Points corresponding to the error-reporting measurement bits are paired in the original color code map, and multiple paths obtained from the pairings and a closed figure enclosed by the region representing the connection between two logic bits are determined. This allows the data bits in the closed figure to be identified as the data bits that err during the operation of the quantum circuit. Compared with existing data bit error detection methods, the data bit error detection method provided in this application can detect data bits that err during the operation of the quantum circuit. Attached Figure Description

[0018] Figure 1 A hardware structure block diagram of a computer terminal for a data bit error detection method provided in an embodiment of this application; Figure 2 A flowchart illustrating a data bit error detection method provided in an embodiment of this application; Figure 3 An exemplary schematic diagram of a planar color code diagram provided in an embodiment of this application; Figure 4 An exemplary schematic diagram of a first planar color code image provided in an embodiment of this application; Figure 5 An exemplary schematic diagram of a first original color code image provided in an embodiment of this application; Figure 6 An exemplary schematic diagram of a first path provided for an embodiment of this application; Figure 7 An exemplary schematic diagram illustrating a novel path provided in an embodiment of this application; Figure 8 A flowchart illustrating another data bit error detection method provided in an embodiment of this application; Figure 9 This is a schematic diagram of a data bit error detection device provided in an embodiment of this application. Detailed Implementation

[0019] The embodiments described below with reference to the accompanying drawings are exemplary and are only used to explain this application, and should not be construed as limiting this application.

[0020] Figure 1 This is a network block diagram of a data bit error detection system provided in an embodiment of this application. The data bit error detection system may include a network 110, a server 120, a wireless device 130, a client 140, storage 150, a classical computing unit 160, a quantum computing unit 170, and may also include additional memory, a classical processor, a quantum processor, and other devices (not shown).

[0021] Network 110 is a medium used to provide communication links between various devices and computers connected together within a data bit error checking system, including but not limited to the Internet, corporate intranets, local area networks, mobile communication networks, and combinations thereof. The connection method can be wired, wireless communication links, or fiber optic cables.

[0022] Server 120, wireless device 130, and client 140 are conventional data processing systems that may contain data and application programs or software tools that perform conventional computational processes. Client 140 may be a personal computer or a network computer, so the data may also be provided by server 120. Wireless device 130 may be a smartphone, tablet, laptop, smart wearable device, etc. Storage unit 150 may include database 151, which can be configured to store data such as qubit parameters, quantum logic gate parameters, quantum circuits, and quantum programs.

[0023] The classical computing unit 160 (quantum computing unit 170) may include a classical processor 161 (quantum processor 171) for processing classical data (quantum data) and a memory 162 (memory 172) for storing classical data (quantum data). The classical data (quantum data) may be a boot file, an operating system image, and an application program 163 (application program 173). The application program 163 (application program 173) may be used to implement a quantum algorithm compiled according to the data bit error detection method provided in the embodiments of this application.

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

[0025] It should be noted that a true quantum computer has a hybrid structure, which includes at least... Figure 1 The system consists of two main parts: the classical computing unit 160, which is responsible for performing classical calculations and control; and the quantum computing unit 170, which is responsible for running quantum programs to achieve quantum computing.

[0026] The aforementioned classical computing unit 160 and quantum computing unit 170 can be integrated into a single device or distributed across two different devices. For example, a first device including the classical computing unit 160 runs a classical computer operating system, providing quantum application development tools and services, as well as the storage and network services required for quantum applications. Users develop quantum programs using the quantum application development tools and services on the second device, and send these quantum programs to a second device including the quantum computing unit 170 via the network services. The second device runs a quantum computer operating system, which parses and compiles the quantum program's code into instructions that the quantum processor 170 can recognize and execute. The quantum processor 170 then implements the quantum algorithm corresponding to the quantum program based on these instructions.

[0027] The computing units of the classic processor 161 within the classic computing unit 160 are based on CMOS transistors on a silicon chip. These computing units are not limited by time or coherence; that is, they are available at any time without time constraints. Furthermore, the number of such computing units in a silicon chip is sufficient; currently, a single classic processor 161 contains tens of thousands of computing units. Given this sufficient number and the fixed selectable computing logic of the CMOS transistors (e.g., AND logic), computational performance is achieved by combining a large number of CMOS transistors with a limited set of logic functions during operation.

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

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

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

[0031] Because qubits are susceptible to environmental noise and interference, error correction technology has become crucial for achieving reliable quantum information processing. In traditional computing, we use redundant information to detect and correct errors. A similar approach is adopted in quantum error correction. The basic idea of ​​quantum error correction is to increase redundant qubits, thereby enabling the detection and correction of qubit errors. Currently, quantum error-correcting codes are widely used to verify and correct qubit errors, with topological codes, including surface codes and color codes, being the most promising.

[0032] Topological codes protect qubits from errors by introducing measurement bits and error correction operations. The advantages of topological codes lie in their high tolerance for errors, their ability to correct errors in multiple qubits, and their effective resistance to noise and distortion. However, current implementations still face some challenges, such as the need to design precise measurement algorithms for qubit manipulation and detection. Based on this, this application proposes a data bit error detection method and related apparatus, aiming to detect erroneous data bits during the operation of quantum circuits.

[0033] See Figure 2 , Figure 2 A flowchart illustrating a data bit error detection method provided in this application embodiment may include the following steps: S201, Construct an original color code diagram, the original color code diagram including a first region representing two independent logical bits and a second region representing the connection of the two logical bits, the first region and the second region including points representing data bits and measurement bits; A logical qubit is a qubit in a quantum chip that consists of multiple physical qubits. Because qubits are susceptible to interference and errors, logical qubits need to be encoded onto multiple physical qubits to protect the integrity of quantum information, and errors on the physical qubits are corrected through error-correcting coding.

[0034] A physical bit, also known as a physical quantum bit, refers to a quantum bit that exists objectively in the physical world, such as a quantum bit composed of a superconducting quantum circuit or a photon.

[0035] A quantum chip is a miniature chip based on the principles of quantum mechanics, used to control, manipulate, and utilize qubits for quantum computing and quantum communication. A quantum chip typically consists of a series of tiny circuit elements and control devices used to create, manipulate, and measure quantum states to implement various operations and algorithms in quantum computing. The core component of a quantum chip is the qubit; in this embodiment, the qubit includes data bits and measurement bits.

[0036] It should be noted that the quantum chip is the physical carrier of the quantum circuit and also the physical carrier of the qubit. Therefore, the "running of the quantum circuit" mentioned in the embodiments of this application actually means running the quantum chip during the operation of the quantum circuit.

[0037] A data bit is a qubit that stores information. Quantum information is contained in the composition ratio of the |0> and |1> qubits and their phase. A system composed of multiple qubits can store more complex information.

[0038] Measurement bits are qubits used to verify data bits. They do not contain information and are only used to measure data bits. When an even number of adjacent data bits are faulty, the quantum state of the measurement bit is |0>, and when an odd number of adjacent data bits are faulty, the quantum state of the measurement bit is |1>.

[0039] S202, before, during, and after the operation of the quantum circuit, the measurement bits are measured respectively to obtain the first measurement bit that reports an error before operation, the second measurement bit that reports an error during operation, and the third measurement bit that reports an error after operation. When the quantum circuit is running, the logic gates in the quantum circuit act on the logic bits. The first and third measurement bits are measurement bits in the first region, and the second measurement bit is a measurement bit in the first region and / or the second region. Logic gates can be used to perform various quantum computing tasks, such as logical operations, quantum state transformations, and quantum error correction. In quantum circuits, logic gates operate on and transform logic bits. Each gate has a specific function, capable of changing the state of a logic bit or inducing interaction between two or more bits, thereby enabling various operations in quantum computing.

[0040] S203, in the original color code diagram, the points corresponding to the first, second, and third measurement bits are paired up in pairs to obtain multiple paths; The path refers to the line connecting the points in the color code diagram that represent the measurement bits that caused the error. It can be a line connecting two points or multiple points, and it can be a straight line or a curve.

[0041] The method of pairing the points corresponding to the first, second, and third measurement bits in the original color code diagram to obtain multiple paths will be explained in detail below.

[0042] In one embodiment of this application, the sum of the weights of the edges in the plurality of paths is minimized, and the weight of the edge in each path is determined based on the physical bit error rate.

[0043] An edge in a path is a line connecting any two points in the path.

[0044] The physical bit error rate (PBER) refers to the probability of an error occurring in a physical qubit during quantum computing. Because qubits in quantum computing are susceptible to noise, interference, and misoperation, a certain error rate exists. In practical quantum computing, the PBER is typically evaluated using the fidelity of the qubit. For example, the difference between 1 and the fidelity of the qubit labeled on the quantum chip can be used as a reference value for the PBER.

[0045] Weight refers to the relative importance of a certain indicator in the overall evaluation. In the embodiments of this application, the weight of each edge in the path will be explained in detail below.

[0046] S204, the data bits in the closed shape enclosed by the multiple paths and the second region are taken as the data bits of the error.

[0047] In one embodiment of this application, the data bit error detection method is applied during a lattice surgery, wherein the erroneous data bit is a data bit that erroneously occurs during the lattice surgery, and the quantum circuit is a quantum circuit that operates during the lattice surgery.

[0048] Lattice surgery is currently the mainstream approach for implementing fault-tolerant quantum computing on two-dimensional hardware. Lattice surgery can directly or indirectly perform operations and computations on logical bits by jointly measuring two or more logical bits. During lattice surgery, errors can occur in the data bits due to the volatility and interference inherent in qubits.

[0049] In one embodiment of this application, the path includes at least one path type, and the weight of the edge in each path is determined based on the path type to which each path belongs and the error rate of the depolarization error channel, the error rate of the depolarization error channel being determined based on the physical bit error rate.

[0050] In one embodiment of this application, the path type of each path is determined based on the operation results of a preset quantum circuit, which includes quantum operations that add a depolarization error channel.

[0051] Furthermore, the specific steps to obtain the path type of each path are as follows: Traverse each quantum operation in the preset quantum circuit, and add the depolarization error channel in each quantum operation. Run the preset quantum circuit with the added depolarization error channel to obtain the running result; determine the path type to which each running result belongs.

[0052] After determining the path type to which each running result belongs, at least one path type can be obtained.

[0053] A depolarizing error channel is a special type of quantum channel that introduces errors, causing changes or loss of the polarization state of the input signal. Polarization refers to the directionality of a quantum state, similar to polarization in classical light. The existence of quantum depolarizing error channels is mainly due to noise, such as the non-ideals of optical devices and environmental interference. The error rate of a depolarizing error channel measures the probability that the polarization state of the input signal will be incorrect during channel transmission.

[0054] Noise refers to the interference and errors that affect qubits and quantum operations in quantum computing. Noise originates from factors such as qubit decoherence, energy level errors, quantum gate operation errors, interactions between qubits, and measurement errors, and can cause data bit errors to some extent.

[0055] Quantum operations refer to a series of operations performed on qubits, including qubit initialization, application of unitary matrices (quantum logic gates), measurement, etc.

[0056] Based on the results of each run, the method provided in this application is used to determine the corresponding path, obtain the path corresponding to the results of each run, classify the paths corresponding to the results of each run to obtain at least one path type, and statistically determine which depolarization error channels may cause each edge in each type of path, and calculate the error rate of each type of depolarization error channel, such as depolarization error channel. Error rate and depolarization error channel Error rate .

[0057] In the embodiments of this application, each data bit error is approximated as a depolarization error channel added in the quantum operation of the preset quantum circuit, and before the depolarization error channel is added, the preset quantum circuit is a perfect, noise-free ideal quantum circuit.

[0058] In one embodiment of this application, the closed shape includes sub-closed shapes with different areas, and the step of using the data bits in the closed shape enclosed by the plurality of paths and the second region as error data bits includes: The data bits in the sub-closed shape with the smallest area enclosed by the multiple paths and the second region are taken as the data bits of the error.

[0059] In one embodiment of this application, the original color code image includes three colors representing the points of the measured bits, and constructing the original color code image includes: A planar color code map is constructed on a two-dimensional plane, wherein the position of each point in the planar color code map corresponds one-to-one with the position of the measurement bit or data bit in the quantum chip; Choose any two colors from the three colors representing the points of measurement bits to obtain... One combination method; Copy the planar color code image to One, depending on each combination, in In each of the aforementioned planar color code diagrams, two corresponding points are retained, and the remaining point is deleted, resulting in... A new planar color code diagram; Will The aforementioned planar color code images are stacked in the time dimension to obtain... One original color code image.

[0060] In one embodiment of this application, the three colors representing the points of the measurement bits include: red, green, and blue; the original color code map also includes black points representing the data bits.

[0061] Choose any two colors from the three colors representing the points of measurement bits to obtain... The method for combining these methods can be: Selecting red and green from red, green, and blue, we get... One of the combination methods; selecting red and blue from red, green, and blue, to obtain... Another combination method; selecting blue and green from red, green, and blue, resulting in... Another of the combinations; For ease of explanation, this application refers to the new planar color code image obtained by retaining the red and green dots and deleting the blue dots as the first planar color code image; the new planar color code image obtained by retaining the red and blue dots and deleting the green dots as the second planar color code image; and the new planar color code image obtained by retaining the blue and green dots and deleting the red dots as the third planar color code image.

[0062] Meanwhile, this application refers to the original color code image obtained by stacking the first planar color code image in the time dimension as the first original color code image; the original color code image obtained by stacking the second planar color code image in the time dimension as the second original color code image; and the original color code image obtained by stacking the third planar color code image in the time dimension as the third original color code image.

[0063] In one embodiment of this application, the following is obtained: Following a new original color code image, including: In each of the new original color code images, the points corresponding to the measurement bits that reported the error are paired up in pairs to obtain... Each new original color code image corresponds to multiple paths, and the sum of the weights of the edges in the multiple paths included in each new original color code image is the smallest. The weights of the edges in each path are determined based on the physical bit error rate. exist The method for pairing the points corresponding to the error measurement bits in the new original color code image can be as follows: In the first original color code image, the red and green dots corresponding to the erroneous measurement bits are paired up in pairs; in the second original color code image, the red and blue dots corresponding to the erroneous measurement bits are paired up in pairs; in the third original color code image, the blue and green dots corresponding to the erroneous measurement bits are paired up in pairs.

[0064] For ease of explanation, this application refers to the path in the first original color code image as the first path; the path in the second original color code image as the second path; and the path in the third original color code image as the third path.

[0065] The method for determining the weights of edges in each path based on the path type and the error rate of the depolarization error channel can be as follows: The weights of edges in each path are determined based on the path type to which each path belongs, the error rate of the depolarization error channel, and the following formula: ,in, Indicates depolarization error channel The error rate can be obtained using the method described in the embodiments of this application. The above formula can be transformed into... ,in , , Physical bit error rate, The specific method for obtaining the value can be found in the method described above in the embodiments of this application.

[0066] In practice, the points corresponding to the erroneous measurement bits can be paired up in pairs to determine each possible path. The sum of the weights of the edges in each possible path can be calculated, and the Minimum Weighted Perfect Match (MWPM) algorithm can be applied to determine the multiple paths with the minimum sum of edge weights in each new original color code graph.

[0067] This application simulates each type of depolarization error channel that may occur during the operation of a quantum circuit. Based on the results of the circuit simulation, the path type that each depolarization error channel may cause is determined, and the error rate of the depolarization error channel is determined based on the results of the circuit simulation and the physical bit error rate. When pairing the points representing the measurement bits, the weight of each edge in the path can be calculated according to the path type and the error rate of the depolarization error channel, thus comprehensively considering the impact of each type of depolarization error channel on the path and obtaining a more accurate path.

[0068] In one embodiment of this application, the arrangement of the points representing data bits is at least one of a triangle, a quadrilateral, a regular hexagon, or an octagon, and the points representing data bits are located at the center point of the triangle, quadrilateral, regular hexagon, or octagon.

[0069] In one embodiment of this application, before determining the data bits in the closed pattern enclosed by the plurality of paths as erroneous data bits, the method further includes: The paths included in the original color code image are projected onto a two-dimensional plane, and the paths projected onto the two-dimensional plane are used as new paths.

[0070] The method for projecting the paths included in the original color code image onto a two-dimensional plane and using the paths projected onto the two-dimensional plane as new paths can be as follows: The first path, the second path, and the third path are projected onto the same two-dimensional plane, and the first path, the second path, and the third path projected onto the two-dimensional plane are used together as a new path.

[0071] In one embodiment of this application, the measurement bits include physical measurement bits and virtual measurement bits, the virtual measurement bits being located outside the area formed by the physical measurement bits and data bits; the original color code map also includes triangles and circles, the triangles representing the boundary of the area formed by the physical measurement bits and data bits, and the circles being circles passing through the virtual measurement bits.

[0072] join Figure 3 , Figure 3 This is an exemplary schematic diagram of a planar color code provided in an embodiment of this application. Figure 3 One type of planar color code diagram shown includes: The first region represents two independent logical qubits, wherein the two independent logical qubits include a first logical qubit and a second logical qubit; The second parallelogram region represents the connection between two logical qubits; Both the first and second regions include: The dashed lines represent quadrilaterals, regular hexagons, and octagons, with each vertex of the quadrilateral, regular hexagon, and octagon representing a data bit in the quantum chip; The blue, green, and red dots located at the center of each quadrilateral, hexagon, and octagon represent physical measurement bits in the quantum chip. The red, green, and blue dots are located at... Figure 3 The dots are represented by three different shades of gray, with the gray levels of red, green, and blue dots increasing sequentially. The blue and green dots located outside the first region represent two virtual measurement bits; The circle passing through the blue and green dots outside the first area.

[0073] The dashed lines represent quadrilaterals, regular hexagons, and octagons. These quadrilaterals do not represent any objective structure within the quantum chip; they are drawn for illustrative purposes only. Therefore, quadrilaterals, regular hexagons, and octagons outside the first and second regions are not drawn. Similarly, the blue and green dots outside the first region do not represent any objective structure within the quantum chip; they are drawn for illustrative purposes only.

[0074] This application uses a first region and a second region to represent the logical bits and the structure connecting the logical bits in the quantum chip. Three different colored dots are used to represent the physical measurement bits in the quantum chip and the virtual measurement bits outside the quantum chip region. The vertices of quadrilaterals, regular hexagons and octagons are used to represent the data bits in the quantum chip. The dots representing logical bits, physical measurement bits and data bits correspond one-to-one with the actual logical bits, physical measurement bits and data bits in the quantum chip, so that each bit has a clear identification in the color code diagram, which helps to ensure the reliability of the error correction process.

[0075] See Figure 4 , Figure 4 This is an exemplary schematic diagram of a first planar color code provided in an embodiment of this application. Figure 4 The first planar color code diagram shown is based on One of the planar color code diagrams was obtained, retaining the red and green dots in the planar color code diagram, and deleting the blue dots in the planar color code diagram. Figure 4 The specific structure of the first planar color code diagram shown is similar to Figure 3 The two-dimensional color code diagram shown is basically the same, except that the blue dots have been removed, which will not be elaborated here.

[0076] The second-plane color code map is based on Another version of the aforementioned planar color code diagram is obtained, retaining the red and blue dots in the planar color code diagram and deleting the green dots. The specific structure of the first planar color code diagram is the same as... Figure 3The two-dimensional color code diagram shown is basically the same, except that the green dots have been removed, which will not be elaborated on here.

[0077] The third-plane color code map is based on Another one of the aforementioned planar color code diagrams is obtained, retaining the blue and green dots in the planar color code diagram and deleting the red dots. The specific structure of the first planar color code diagram is the same as... Figure 3 The two-dimensional color code diagram shown is basically the same, except that the red dots have been removed, which will not be elaborated on here.

[0078] See Figure 5 , Figure 5 This is an exemplary schematic diagram of a first original color code image provided in an embodiment of this application. Figure 5 The first original color code diagram shown consists of 11... Figure 4 The first planar color code diagram shown is stacked along the time dimension. Figure 5 The specific structure of each first planar color code image included in the first original color code image shown is similar to... Figure 4 The first planar color code diagram shown is the same, but the two dimensions of the two-dimensional color code diagram are compressed into one dimension, and the virtual measurement bits are omitted.

[0079] Figure 5 The first original color code diagram shown also marks the following areas: Region a: Represents the first region where the first qubit is located; Region b: Represents the boundary between the first qubit and the second region; Region c: Represents the second region connecting the first and second qubits; Region d: represents the boundary between the second qubit and the second region; Region e: Represents the first region where the second qubit is located; Region f: Region f is used to mark the measurement bits that report errors after the quantum circuit runs, i.e. the third measurement bit, so that the measurement bits that report errors can be paired up in pairs on the original color code diagram; Region g: Region g is used to mark the measurement bits that report errors during the operation of the quantum circuit, i.e. the second measurement bits, so that the measurement bits that report errors can be paired up on the original color code map; Region h: Region h is used to mark the measurement bits that report errors before the quantum circuit runs, i.e. the first measurement bit, so that the measurement bits that report errors can be paired up on the original color code map.

[0080] Regions f and h intersect only with regions a, b, d, and e, therefore the first and third measurement bits are the measurement bits in the first region; region g intersects with regions a, b, c, d, and e, therefore the second measurement bit is the measurement bit in the first region and / or the second region.

[0081] The second original color code image is composed of 11 second plane color code images stacked along the time dimension, and the third original color code image is composed of 11 third plane color code images stacked along the time dimension, which will not be elaborated here.

[0082] See Figure 6 , Figure 6 This is an exemplary schematic diagram of a first path provided in an embodiment of this application. Figure 6 One of the first paths shown includes: The red and green dots correspond one-to-one with the error measurement bits in the quantum chip. Among them, the red and green dots in the six planar color code diagrams correspond to the error measurement bits in the six measurements, respectively. The edges of the path formed by pairing and connecting the red dots; The edges of the path formed by pairing and connecting the green dots.

[0083] The structure of the second and third paths and Figure 6 The first path shown is basically the same, the only difference being: the second path includes red and blue points corresponding one-to-one with the error measurement bits in the quantum chip, the edges of the path formed by pairing and connecting the red points in pairs, and the edges of the path formed by pairing and connecting the blue points in pairs; the third path includes blue and green points corresponding one-to-one with the error measurement bits in the quantum chip, the edges of the path formed by pairing and connecting the blue points in pairs, and the edges of the path formed by pairing and connecting the green points in pairs.

[0084] See Figure 7 , Figure 7 This is an exemplary schematic diagram of a novel path provided in an embodiment of this application. Figure 7 The new path shown is formed by the projections of the first path onto the two-dimensional plane, the second path onto the two-dimensional plane, and the third path onto the two-dimensional plane. Figure 7 One of the new paths shown includes: The four points corresponding to the error measurement bits in the quantum chip are: point 1, point 2, point 3, and point 4. The four edges of the path formed by connecting points 1, 2, 3, and 4 are: the edge formed by connecting points 1 and 2, the edge formed by connecting points 2 and 3, the edge formed by connecting points 3 and 4, and the edge formed by connecting points 4 and 5. For ease of explanation, Figure 7A new path was added as shown Figure 3 The planar color code diagram shown includes quadrilaterals, regular hexagons and octagons represented by dashed lines, a first region, a second region, and a circle.

[0085] Can Figure 7 The data bits shown are within a closed graph enclosed by a new path and a second region. , As the data bit that is incorrect.

[0086] One embodiment of this application provides a logical bit Pauli operator error detection method, which may include the following steps: The method provided in the embodiments of this application is executed in which the initial state of the data bits is a pairwise Bell state, and after measuring the measured bits respectively, the Pauli operator of the measured bits at one of the measurements is also obtained; Based on the erroneous data bits and the error measurement bits obtained before one of the measurements, it is determined whether the logical bit Pauli operator is erroneous, wherein the logical bit Pauli operator is the product of the Pauli operators of the measurement bits during one of the measurements.

[0087] A Bell state is a special type of superposition state in quantum mechanics. A Bell state describes the interdependence and quantum entanglement between two qubits. A standard Bell state can be represented in the following form: , , , Among them, |00>, |01>, |10>, and |11> are the four ground states that two qubits can be in. It is the normalization factor.

[0088] Pauli operators are a commonly used set of operators in quantum mechanics, related to spin operations. There are four Pauli operators: Pauli X, Pauli Y, Pauli Z, and the identity operator (also known as the Pauli I operator). The Pauli X operator describes the measurement or manipulation of the spin of a qubit in the X-direction. The Pauli Y operator describes the measurement or manipulation of the spin of a qubit in the Y-direction. The Pauli Z operator describes the measurement or manipulation of the spin of a qubit in the Z-direction. The identity operator (Pauli I operator) is an identity transformation, meaning it has no effect on the qubit.

[0089] The following example illustrates the calculation method for the logical bit Pauli operator: Run the quantum circuit corresponding to the method described above in the embodiments of this application, and measure the measurement bit 3 times before the quantum circuit runs, measure the measurement bit 5 times during the quantum circuit runs, and measure the measurement bit 3 times after the quantum circuit runs; The second measurement result during the operation of the quantum circuit is selected to obtain the Pauli operator for each measurement bit. The Pauli operators for each measurement bit are multiplied in sequence, and the result of the multiplication is the Pauli operator for the first logic bit and the second logic bit.

[0090] When the Pauli operator for each measurement bit is a Pauli X operator At that time, the Pauli operator for the first and second logical bits can be... When the Pauli operator for each measurement bit is a Pauli Z operator At that time, the Pauli operator for the first and second logical bits can be... When the Pauli operator for each measurement bit is any combination of two or more of the Pauli X, Pauli Y, Pauli Z, and identity operators, multiplying the corresponding Pauli operators sequentially yields the corresponding result, such as... , The results are used as Pauli operators for the first and second logical bits, and will not be described further in this application.

[0091] Referring to the method described above in the embodiments of this application, the erroneous data bits are obtained. In one embodiment of this application, determining whether the logical bit Pauli operator is erroneous based on the erroneous data bit and the erroneous measurement bit obtained before one of the measurements includes: If the number of error measurement bits in the measurement results prior to one of the measurements is odd, it is determined that the Pauli operator of the logical bit is incorrect.

[0092] Based on the calculation method for the logical bit Pauli operator provided in this application, the following examples further illustrate the method for determining whether the logical bit Pauli operator is erroneous: The measurement results of the three measurements performed on the measurement bit before the quantum circuit runs, and the measurement results of the first two measurements performed on the measurement bit before the quantum circuit runs, are selected to obtain the error measurement bit corresponding to the measurement results of the five measurements. If the sum of the number of error measurement bits corresponding to the 5 measurements is odd, the Pauli operator of the logic bits is determined to be faulty.

[0093] In one embodiment of this application, determining whether the logical bit Pauli operator is erroneous based on the erroneous data bit and the erroneous measurement bit obtained before one of the measurements includes: Based on the erroneous data bits, determine the number of measurement bits that should have been reported as erroneous in the measurement preceding one of the measurements; If the difference between the number of measurement bits that should report an error and the number of measurement bits that actually report an error is odd, it is determined that the Pauli operator of the logical bit is incorrect.

[0094] Based on the calculation method for the logical bit Pauli operator provided in this application, the following examples further illustrate the method for determining whether the logical bit Pauli operator is erroneous: The measurement results of the three measurements performed on the measurement bit before the quantum circuit runs, and the measurement results of the first two measurements performed on the measurement bit before the quantum circuit runs, are selected to obtain the error measurement bits corresponding to the measurement results of the five measurements. The error measurement bits corresponding to the measurement results of the five measurements are then used as the actual error measurement bits. Referring to the method provided in the embodiments of this application, the erroneous data bit is obtained, and based on the erroneous data bit, the measurement bit that should be reported as an error corresponding to the measurement results of the 5 measurements is obtained. For example, in the planar color code diagram, the measurement bit adjacent to the erroneous data bit can be taken as the measurement bit that should be reported as an error in the measurement results of the 5 measurements. If the difference between the actual error-reported measurement bit and the measurement bit that should have been reported is odd, the Pauli operator of the logic bit is determined to be faulty.

[0095] One embodiment of this application provides a logical bit Pauli operator correction method, which may include the following steps: Perform the methods described above in the embodiments of this application; If the Pauli operator of the logical bit is incorrect, the Pauli operator of the logical bit is negative to obtain the corrected Pauli operator of the logical bit.

[0096] This application measures auxiliary bits multiple times before, during, and after the operation of a quantum circuit, and calculates logical bit Pauli operators based on the measured bit Pauli operators. Then, based on the error-reporting measured bits and the erroneous data bits, it judges whether the calculation result of the logical bit Pauli operators is correct, thereby correcting the errors of the logical bit Pauli operators and revising the calculation results. The error judgment and correction method of logical bit Pauli operators provided by this application greatly improves the accuracy of logical bit Pauli operator measurement.

[0097] See Figure 8 , Figure 8 This is a flowchart illustrating another data bit error detection method provided in an embodiment of this application. The following is a schematic diagram of the process. Figure 8 For example, the flow of another data bit error detection method provided in this application embodiment will be described: Based on the specific arrangement of data bits and measurement bits in the quantum chip, a planar color code map is constructed on a two-dimensional plane. The planar color code map includes a first region representing two independent logical qubits and a second region representing the connection between the two logical qubits. Both the first and second regions include blue dots, green dots, and red dots representing data bits and black dots representing measurement bits. Select any two of the blue, green, and red dots to obtain Several combination methods, and copy the planar color code image to... One, depending on each combination, in In each planar color code image, two corresponding points are retained, and the remaining point is deleted, resulting in... A planar color code diagram; Will Each planar color code image is stacked along the time dimension to obtain... One original color code image; Run the quantum circuit corresponding to the quantum chip, and measure the measurement bits before, during and after the quantum circuit runs to obtain the measurement bits that report errors; exist On the original color code image, the points corresponding to the erroneous measurement bits are paired up in pairs to obtain multiple paths, and then... The paths corresponding to the original color code images are projected onto the same two-dimensional plane to obtain new paths on the two-dimensional plane. The data bits in the closed figure enclosed by the new path and the second region are used as the data bits of the error.

[0098] See Figure 9 , Figure 9 This is a schematic diagram of the structure of a data bit error checking device provided in an embodiment of this application. Figure 2 Corresponding to the process shown, the apparatus includes: Construction module 901 is used to construct an original color code map, the original color code map including a first region representing two independent logical bits and a second region representing the connection of the two logical bits, the first region and the second region including points representing data bits and measurement bits; The measurement module 902 is used to measure the measurement bits before, during, and after the operation of the quantum circuit to obtain a first measurement bit that reports an error before operation, a second measurement bit that reports an error during operation, and a third measurement bit that reports an error after operation. When the quantum circuit is running, the logic gates in the quantum circuit act on the logic bits. The first and third measurement bits are measurement bits in the first region, and the second measurement bit is a measurement bit in the first region and / or the second region. The pairing module 903 is used to pair the points corresponding to the first, second and third measurement bits in the original color code diagram to obtain multiple paths; The determination module 904 is used to identify the data bits in the closed shape enclosed by the multiple paths and the second region as the data bits that are erroneous.

[0099] Optionally, the closed shape includes sub-closed shapes with different areas, and the data bits in the closed shape enclosed by the plurality of paths and the second region are used as error data bits, including: The data bits in the sub-closed shape with the smallest area enclosed by the multiple paths and the second region are taken as the data bits of the error.

[0100] Optionally, the arrangement of the points representing data bits is at least one of a triangle, a quadrilateral, a regular hexagon, or an octagon, and the points representing data bits are located at the center point of the triangle, quadrilateral, regular hexagon, or octagon.

[0101] This application also provides a storage medium storing a computer program, wherein the computer program is configured to execute the steps in any of the above method embodiments when running.

[0102] Specifically, in this embodiment, the storage medium may include, but is not limited to, various media capable of storing computer programs, such as USB flash drives, read-only memory (ROM), random access memory (RAM), portable hard drives, magnetic disks, or optical disks.

[0103] Another embodiment of this application provides an electronic device including a memory and a processor, wherein the memory stores a computer program and the processor is configured to run the computer program to perform the steps in any of the method embodiments described above.

[0104] Specifically, the aforementioned electronic device may further include a transmission device and an input / output device, wherein the transmission device is connected to the aforementioned processor, and the input / output device is connected to the aforementioned processor.

[0105] Specifically, in this embodiment, the processor can be configured to perform the following steps via a computer program: S1, Construct the original color code map, which includes a first region representing two independent logical bits and a second region representing the connection between the two logical bits. The first and second regions include points representing data bits and measurement bits. S2, before, during, and after the quantum circuit runs, the measurement bits are measured respectively to obtain the first measurement bit that reports an error before running, the second measurement bit that reports an error during running, and the third measurement bit that reports an error after running. When the quantum circuit runs, the logic gates in the quantum circuit act on the logic bits. The first and third measurement bits are measurement bits in the first region, and the second measurement bit is a measurement bit in the first region and / or the second region. S3, in the original color code diagram, the points corresponding to the first, second, and third measurement bits are paired up in pairs to obtain multiple paths; S4, the data bits in the closed shape enclosed by the multiple paths and the second region are taken as the data bits of the error.

[0106] Specifically, the specific examples in this embodiment can be referred to the examples described in the above embodiments and optional implementations, and will not be repeated here.

[0107] The above description, based on the embodiments shown in the drawings, details the structure, features, and effects of this application. The above description is only a preferred embodiment of this application, but this application does not limit the scope of implementation to what is shown in the drawings. Any changes made in accordance with the concept of this application, or modifications to equivalent embodiments, that do not exceed the spirit covered by the specification and drawings, should be within the protection scope of this application.

Claims

1. A method for detecting data bit errors, characterized in that, The method includes: Construct an original color code map, which includes a first region representing two independent logical bits and a second region representing the connection between the two logical bits. The first and second regions include points representing data bits and measurement bits, and each of the two independent logical bits corresponds to a first region. Before, during, and after the operation of the quantum circuit, the measurement bits are measured respectively to obtain the first measurement bit that reports an error before operation, the second measurement bit that reports an error during operation, and the third measurement bit that reports an error after operation. When the quantum circuit is running, the logic gates in the quantum circuit act on the logic bits. The first and third measurement bits are measurement bits in the first region, and the second measurement bit is a measurement bit in the first region and / or the second region. In the original color code diagram, the points corresponding to the first, second, and third measurement bits are paired up to obtain multiple paths; The data bits in the closed shape enclosed by the multiple paths and the second region are used as the data bits that caused the error.

2. The method as described in claim 1, characterized in that, The closed shape includes sub-closed shapes with different areas, and the data bits in the closed shape enclosed by the multiple paths and the second region are used as error data bits, including: The data bits in the sub-closed shape with the smallest area enclosed by the multiple paths and the second region are taken as the data bits of the error.

3. The method as described in claim 1, characterized in that, The arrangement of the points representing data bits is at least one of a triangle, quadrilateral, regular hexagon, or octagon, and the points representing data bits are located at the center of the triangle, quadrilateral, regular hexagon, or octagon.

4. A method for detecting errors in logical bit Pauli operators, characterized in that, The method includes: Perform the method as described in claim 1, wherein the initial state of the data bits is a pairwise Bell state, and after measuring the measured bits respectively, the Pauli operator of the measured bits at one of the measurements is also obtained; Based on the erroneous data bits and the error measurement bits obtained before one of the measurements, it is determined whether the logical bit Pauli operator is erroneous, wherein the logical bit Pauli operator is the product of the Pauli operators of the measurement bits during one of the measurements.

5. The method as described in claim 4, characterized in that, The step of determining whether the logical bit Pauli operator is erroneous based on the erroneous data bits and the erroneous measurement bits obtained before one of the measurements includes: If the number of error measurement bits in the measurement results prior to one of the measurements is odd, it is determined that the Pauli operator of the logical bit is incorrect.

6. The method as described in claim 4, characterized in that, The step of determining whether the logical bit Pauli operator is erroneous based on the erroneous data bits and the erroneous measurement bits obtained before one of the measurements includes: Based on the erroneous data bits, determine the number of measurement bits that should have been reported as erroneous in the measurement preceding one of the measurements; If the difference between the number of measurement bits that should report an error and the number of measurement bits that actually report an error is odd, it is determined that the Pauli operator of the logical bit is incorrect.

7. A method for correcting errors in a logical bit Pauli operator, characterized in that, The method includes: Perform the method as described in claim 5 or 6; If the Pauli operator of the logical bit is incorrect, the Pauli operator of the logical bit is negative to obtain the corrected Pauli operator of the logical bit.

8. A data bit error detection device, characterized in that, The device includes: A construction module is used to construct an original color code image, which includes a first region representing two independent logical bits and a second region representing the connection between the two logical bits. The first and second regions include points representing data bits and measurement bits, and each of the two independent logical bits corresponds to a first region. The measurement module is used to measure the measurement bits before, during, and after the operation of the quantum circuit to obtain a first measurement bit that reports an error before operation, a second measurement bit that reports an error during operation, and a third measurement bit that reports an error after operation. When the quantum circuit is running, the logic gates in the quantum circuit act on the logic bits. The first and third measurement bits are measurement bits in the first region, and the second measurement bit is a measurement bit in the first region and / or the second region. The pairing module is used to pair the points corresponding to the first, second, and third measurement bits in the original color code diagram to obtain multiple paths. The determination module is used to identify data bits in the closed shape enclosed by the multiple paths and the second region as erroneous data bits.

9. A storage medium, characterized in that, The storage medium stores a computer program, wherein the computer program is configured to execute the method described in any one of claims 1-7 when it is run.

10. An electronic device comprising a memory and a processor, characterized in that, The memory stores a computer program, and the processor is configured to run the computer program to perform the method described in any one of claims 1-7.

Citation Information

Patent Citations

  • Quantum error correction decoding system and method, fault-tolerant quantum error correction system and chip

    CN112988451A

  • Quantum error correction decoding method and related equipment

    CN116136971A