A method, apparatus, medium, and electronic device for detecting data bit errors.
By constructing the original color code map and calculating the edge weights, the problem of insufficient consideration of the impact of depolarization error channels in existing technologies is solved, and higher accuracy of data bit error detection is achieved.
Patent Information
- Application Number
- CN202311422583.2
- 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
Existing color-coded data bit error detection methods fail to adequately consider the impact of different depolarization error channels on the path in quantum circuits, resulting in low detection accuracy.
The original color code map is constructed based on the input code distance. The measurement bits in the quantum chip are measured. Multiple paths are determined by pairing them up. The weight of each edge is calculated based on the physical bit error rate. Finally, the data bits in the closed graph are determined as the error bits, taking into account the differences in different path types and depolarization error channels.
It significantly improves the accuracy of data bit error detection and provides more accurate path assessment by comprehensively considering the impact of depolarization error channels.
Smart Images

Figure CN117540817B_ABST
Abstract
Description
Technical Field
[0001] This application belongs to the field of quantum computing technology, and in particular to a data bit error detection method, apparatus, medium and electronic device. Background Technology
[0002] Quantum error correction is a technique used to address errors in quantum computing. In quantum computing, errors can occur during computation due to the volatility and interference inherent in qubits. Currently, quantum error correction uses quantum error-correcting codes to detect erroneous qubits during the operation of quantum circuits, thereby correcting the faulty qubits.
[0003] Quantum error-correcting codes include CSS codes, surface codes, and color codes. Color codes are a type of topological QEC coding family based on 3-colorable lattices. Due to 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 simply treat the weight of each edge in each path as 1, without considering the differences in the impact of different depolarization error channels on different types of paths in actual quantum circuits, resulting in low detection accuracy.
[0005] Application content
[0006] The purpose of this application is to provide a data bit error detection method, apparatus, medium, and electronic device, aiming to improve the accuracy of data bit error detection.
[0007] One embodiment of this application provides a data bit error detection method, the method comprising:
[0008] The original color code map is constructed based on the input code distance, and each point in the original color code map represents a measurement bit or a data bit in the quantum chip;
[0009] Measure the measurement bits in the quantum chip, and obtain the error-reporting measurement bits based on the measurement results;
[0010] In the original color code diagram, the points corresponding to the erroneous measurement bits are paired up to obtain multiple paths. The sum of the weights of the edges in the multiple paths is minimized, and the weight of the edges in each path is determined based on the physical bit error rate.
[0011] The data bits in the closed pattern formed by the multiple paths are identified as the erroneous data bits.
[0012] Optionally, before determining the data bits in the closed graph enclosed by the plurality of paths as erroneous data bits, the method further includes:
[0013] If a target path exists among the multiple paths, the target path is transformed into a non-target path. In the target path, the two points connected by each edge are not adjacent, and in the non-target path, the two points connected by each edge are adjacent, and the number of edges included in the non-target path is minimized.
[0014] Optionally, 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.
[0015] Optionally, 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.
[0016] Optionally, constructing the original color code map based on the input code distance includes:
[0017] A planar color code map is constructed on a two-dimensional plane based on the input code distance. 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.
[0018] The planar color code image is copied multiple times, and the multiple planar color code images are stacked in three-dimensional space along a direction perpendicular to the two-dimensional plane to obtain the original color code image. The number of times the measurement bits in the quantum chip are measured is greater than or equal to the number of copies of the planar color code image.
[0019] Optionally, the original color code image includes three colors representing the points of the measured bits. After obtaining the original color code image, the method further includes:
[0020] Choose any two colors from the three colors representing the points of measurement bits to obtain... One combination method;
[0021] Copy the original color code image to Share, received The original color code image described above;
[0022] According to each combination, in the In each of the original color code images, two corresponding points are retained, and the remaining point is deleted to obtain... A new original color code image.
[0023] Optionally, before determining the data bits in the closed graph enclosed by the plurality of paths as erroneous data bits, the method further includes:
[0024] 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.
[0025] Optionally, the measurement bits include physical measurement bits and three virtual measurement bits, the three virtual measurement bits being located outside the area formed by the physical measurement bits and data bits; the original color code image also includes an equilateral triangle and a circle, the equilateral triangle representing the boundary of the area formed by the physical measurement bits and data bits, and the circle being the circumcircle formed by the points representing the three virtual measurement bits.
[0026] Another embodiment of this application provides a data bit error checking device, the device comprising:
[0027] 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;
[0028] 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;
[0029] 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.
[0030] The determination module is used to identify data bits in the closed pattern formed by the multiple paths as erroneous data bits.
[0031] 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.
[0032] 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.
[0033] This application provides a data bit error detection method, apparatus, medium, and electronic device. Unlike traditional data bit error detection methods, when pairing the points corresponding to the erroneous measurement bits in the original color code diagram, the weights of each edge in each possible path are calculated based on the physical bit error rate. This fully considers the differences in the impact of different depolarization error channels in quantum circuits on different types of paths, thereby obtaining a more accurate path. Compared with existing data bit error detection methods, the data bit error detection method provided in this application greatly improves the accuracy of data bit error detection. Attached Figure Description
[0034] 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;
[0035] Figure 2 A flowchart illustrating a data bit error detection method provided in an embodiment of this application;
[0036] Figure 3 An exemplary schematic diagram of a preset quantum circuit provided in an embodiment of this application;
[0037] Figure 4 An exemplary schematic diagram of a planar color code diagram provided in an embodiment of this application;
[0038] Figure 5 An exemplary schematic diagram of an original color code image provided in an embodiment of this application;
[0039] Figure 6 An exemplary schematic diagram of a second original color code image provided in an embodiment of this application;
[0040] Figure 7 An exemplary schematic diagram of a second path provided for embodiments of this application;
[0041] Figure 8 An exemplary schematic diagram of a path type provided in the embodiments of this application and an exemplary schematic diagram of a new path provided in the embodiments of this application;
[0042] Figure 9 An exemplary schematic diagram of a non-target path provided for an embodiment of this application;
[0043] Figure 10 A flowchart illustrating another data bit error detection method provided in an embodiment of this application;
[0044] Figure 11 This is a schematic diagram of a data bit error detection device provided in an embodiment of this application. Detailed Implementation
[0045] 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.
[0046] 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).
[0047] 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.
[0048] 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.
[0049] 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.
[0050] 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.
[0051] It should be noted that a true quantum computer has a hybrid structure, which includes at least... Figure 1The 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.
[0052] 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.
[0053] 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.
[0054] 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 usage time and is not always 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.
[0055] 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.
[0056] 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.
[0057] 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.
[0058] 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 improve the accuracy of data bit error detection.
[0059] See Figure 2 , Figure 2 A flowchart illustrating a data bit error detection method provided in this application embodiment may include the following steps:
[0060] S201, 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;
[0061] The code distance of a color code refers to the number of points representing data bits included on the boundary of the color code, usually denoted as d. In quantum computing, the code distance is an important indicator of the performance of quantum error-correcting codes. For an error-correcting code, a larger code distance means that more errors can be detected and corrected.
[0062] 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.
[0063] A data bit is a qubit that stores information. Quantum information is contained in the composition ratio of the |0> and |1> of the qubit and its phase. A system composed of multiple qubits can store more complex information.
[0064] 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>.
[0065] The original color code diagram will be explained in detail below.
[0066] S202, Measure the measurement bits in the quantum chip, and obtain the error-reporting measurement bits based on the measurement results;
[0067] S203, in the original color code diagram, the points corresponding to the erroneous measurement bits are paired up to obtain multiple paths, the sum of the weights of the edges in the multiple paths is minimized, and the weight of the edges in each path is determined based on the physical bit error rate.
[0068] 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.
[0069] An edge in a path is a line connecting any two points in the path.
[0070] 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.
[0071] 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.
[0072] 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.
[0073] S204, the data bits in the closed pattern formed by the multiple paths are identified as erroneous data bits.
[0074] 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:
[0075] If a target path exists among the multiple paths, the target path is transformed into a non-target path. In the target path, the two points connected by each edge are not adjacent, and in the non-target path, the two points connected by each edge are adjacent, and the number of edges included in the non-target path is minimized.
[0076] The specific method for converting the target path into a non-target path will be explained in detail below.
[0077] 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.
[0078] 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.
[0079] Furthermore, the specific steps to obtain the path type of each path are as follows:
[0080] 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.
[0081] After determining the path type to which each running result belongs, at least one path type can be obtained.
[0082] 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.
[0083] 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.
[0084] Quantum operations refer to a series of operations performed on qubits, including qubit initialization, application of unitary matrices (quantum logic gates), measurement, etc.
[0085] 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.
[0086] The specific method for determining the weight of each edge in the path based on the physical bit error rate will be explained below.
[0087] See Figure 3 , Figure 3 This is an exemplary schematic diagram of a preset quantum circuit provided in an embodiment of this application. Figure 3 The preset quantum circuit shown includes three qubits and includes quantum operations and a depolarization error channel added during the quantum operations.
[0088] Quantum operations include: initialization operations on three qubits, where the initial quantum state of the first qubit is |0> and the initial quantum state of the second qubit is |+>; quantum logic gates, including the CNOT gate acting on the first and second qubits, and the CNOT gate acting on the second and third qubits; and measurement operations.
[0089] The depolarization error channels added in quantum operations include: the depolarization error channel ε1 added in the initialization operation of the first qubit.
[0090] Figure 3The pre-defined quantum circuit shown also includes dashed boxes indicating other available depolarization error channels, including: a depolarization error channel ε1 added to the initialization operation of the second qubit; a depolarization error channel ε1 added to the initialization operation of the third qubit; a depolarization error channel ε2 added to the CNOT gate, a dual quantum logic gate acting on the first and second qubits; a depolarization error channel ε2 added to the CNOT gate, a dual quantum logic gate acting on the second and third qubits; a depolarization error channel ε1 added to the measurement operation of the first qubit; a depolarization error channel ε1 added to the measurement operation of the second qubit; and a depolarization error channel ε1 added to the measurement operation of the third qubit. ε1 and ε2 are pre-defined depolarization error channels, determined based on actual requirements.
[0091] by Figure 3 Taking a pre-defined quantum circuit as an example, the method for obtaining the running result by traversing each quantum operation in the pre-defined quantum circuit and adding the depolarization error channel in each quantum operation, and running the pre-defined quantum circuit with the added depolarization error channel, can be as follows:
[0092] exist Figure 3 The quantum operation included in the pre-defined quantum circuit is described. Each time, one of the aforementioned depolarization error channels is added, and the circuit operation result is measured using a measurement operation, iterating through each quantum operation in the pre-defined quantum circuit. It is important to note that only one depolarization error channel needs to be added to the pre-defined quantum circuit each time it runs, rather than adding further depolarization error channels based on the circuit from the previous run.
[0093] Based on the results of each run, the corresponding path is determined using the method provided in the embodiments of this application. The path corresponding to the results of each run is obtained, and the path corresponding to the results of each run is classified to obtain at least one path type. The methods for determining which depolarization error channels may cause each edge in each path are statistically analyzed, and the error rate of each depolarization error channel is calculated, such as the error rate P(ε1) of depolarization error channel ε1 and the error rate P(ε2) of depolarization error channel ε2.
[0094] In one embodiment of this application, the data bits and physical measurement bits are located in an equilateral triangular region included in the quantum chip, the data bits are arranged in a close regular hexagon, and the physical measurement bits are located at the center point of the regular hexagon.
[0095] In one embodiment of this application, constructing the original color code map based on the input code distance includes:
[0096] A planar color code map is constructed on a two-dimensional plane based on the input code distance. 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.
[0097] The planar color code image is copied multiple times, and the multiple planar color code images are stacked in three-dimensional space along a direction perpendicular to the two-dimensional plane to obtain the original color code image. The number of times the measurement bits in the quantum chip are measured is greater than or equal to the number of copies of the planar color code image.
[0098] In one embodiment of this application, the original color code image includes three colors representing the points of the measured bits. After obtaining the original color code image, the method further includes:
[0099] Choose any two colors from the three colors representing the points of measurement bits to obtain... One combination method;
[0100] Copy the original color code image to Share, received The original color code image described above;
[0101] According to each combination, in the In each of the original color code images, two corresponding points are retained, and the remaining point is deleted to obtain... A new original color code image.
[0102] 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.
[0103] Choose any two colors from the three colors representing the points of measurement bits to obtain... The method for combining these methods can be:
[0104] 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;
[0105] For ease of explanation, this application refers to the new original color code image obtained by retaining the red and green dots and deleting the blue dots as the first original color code image; the new original color code image obtained by retaining the red and blue dots and deleting the green dots as the second original color code image; and the new original color code image obtained by retaining the blue and green dots and deleting the red dots as the third original color code image.
[0106] 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.
[0107] exist The method for pairing the points corresponding to the error measurement bits in the new original color code image can be as follows:
[0108] 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.
[0109] 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.
[0110] The method for calculating the weight of the edges in each path will be introduced below. 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 smallest sum of edge weights in each new original color code map.
[0111] 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:
[0112] 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.
[0113] 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:
[0114] 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.
[0115] In one embodiment of this application, the measurement bits include physical measurement bits and three virtual measurement bits, the three virtual measurement bits being located outside the area formed by the physical measurement bits and data bits; the original color code image also includes an equilateral triangle and a circle, the equilateral triangle representing the boundary of the area formed by the physical measurement bits and data bits, and the circle being the circumcircle formed by the points representing the three virtual measurement bits.
[0116] See Figure 4 , Figure 4 This is an exemplary schematic diagram of a planar color code provided in an embodiment of this application. Figure 4 One type of planar color code diagram shown includes:
[0117] The dashed lines represent regular hexagons, with each vertex of the hexagon representing a data bit in the quantum chip;
[0118] The blue, green, and red dots located at the center of each regular hexagon represent physical measurement bits in the quantum chip, where the red dot v R Green dot v G Blue dot v B exist Figure 4 The dots are represented by three different shades of gray, with the gray levels of red, green, and blue dots increasing sequentially.
[0119] An equilateral triangle representing the boundary of the region formed by physical measurement bits and data bits;
[0120] The blue, green, and red dots located outside the equilateral triangle region represent three virtual measurement bits;
[0121] The circumcircle formed by the blue, green, and red dots located outside the equilateral triangle region.
[0122] The dashed lines representing regular hexagons do not represent any objective structure within the quantum chip; they are drawn for illustrative purposes only. Therefore, regular hexagons outside the equilateral triangle regions are not drawn. Similarly, equilateral triangles and circles do not represent any objective structure within the quantum chip; they are drawn for illustrative purposes only.
[0123] This application uses three different colored dots to represent physical measurement bits in the quantum chip and virtual measurement bits outside the quantum chip region. The vertices of regular hexagons represent data bits in the quantum chip. The dots representing physical measurement bits and data bits correspond one-to-one with the actual physical measurement bits and data bits in the quantum chip, so that each bit has a clear identification in the color code diagram. This helps to ensure the reliability of the error correction process and greatly improves the accuracy of data bit error detection.
[0124] Understandable, Figure 4In the planar color code diagram shown, the three vertices of the equilateral triangle coincide with the vertices of the regular hexagon represented by the dashed line. Therefore, the three vertices of the equilateral triangle region represent data bits in the quantum chip. Figure 4 In the planar color code diagram shown, the number of points representing data bits included on the boundary is 7, therefore the corresponding code distance of the quantum chip is 7.
[0125] See Figure 5 , Figure 5 This is an exemplary schematic diagram of an original color code image provided in an embodiment of this application. Figure 5 The original color code diagram shown consists of 2 Figure 4 The planar color code diagram shown is perpendicular to the three-dimensional space. Figure 4 The planar color code diagram shown is formed by stacking directions, and the number of times the measurement bits in the quantum chip are measured is greater than or equal to 2. Figure 5 The original color code diagram shown includes the specific structure of each planar color code diagram. Figure 4 The same planar color code diagram is shown, so it will not be described again here.
[0126] See Figure 6 , Figure 6 This is an exemplary schematic diagram of a second original color code image provided in an embodiment of this application.
[0127] Figure 6 The second original color code image shown is based on One of the original color code images is obtained, retaining the red and blue dots in the original color code image and deleting the green dots in the original color code image. Figure 6 The specific structure of the second original color code diagram shown is similar to Figure 5 The 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.
[0128] The first original color code image is based on Another version of the original color code image is obtained, which retains the red and green dots in the original color code image and deletes the blue dots in the original color code image. The specific structure of the first original color code image is the same as... Figure 5 The original color code diagram shown is basically the same, the only difference being the removal of the blue dots, which will not be elaborated here.
[0129] The third original color code image is based on Another original color code image is obtained, retaining the blue and green dots from the original color code image while deleting the red dots. The specific structure of the third original color code image is... Figure 5 The original color code diagram shown is basically the same, the only difference being the removal of the red dots, which will not be elaborated here.
[0130] See Figure 7 , Figure 7 This is an exemplary schematic diagram of a second path provided in an embodiment of this application. Figure 7 One of the second paths shown includes:
[0131] The red and blue dots correspond one-to-one with the error measurement bits in the quantum chip. In the two two-dimensional color code diagrams, the red and blue dots correspond to the error measurement bits during the two measurements, respectively.
[0132] The edges of the path formed by pairing and connecting the red dots;
[0133] The edges of the path formed by pairing and connecting the blue dots.
[0134] For ease of explanation, Figure 7 Added with Figure 6 The second original color code diagram shown includes patterns such as equilateral triangles, circles, and regular hexagons.
[0135] The structure of the first path and the third path and Figure 7 The second path shown is basically the same, except that: the first path includes red and green dots corresponding to the error measurement bits in the quantum chip, the edges of the paths formed by pairing and connecting red dots, and the edges of the paths formed by pairing and connecting green dots; the third path includes blue and green dots corresponding to the error measurement bits in the quantum chip, the edges of the paths formed by pairing and connecting blue dots, and the edges of the paths formed by pairing and connecting green dots.
[0136] See Figure 8 , Figure 8 This is an exemplary schematic diagram of a path type provided in an embodiment of this application. Figure 8 One type of path shown includes:
[0137] The two points corresponding to the error measurement bits in the quantum chip: point 1 and point 2;
[0138] The closed path formed by connecting points 1 and 2;
[0139] The two edges of the closed path formed by connecting points 1 and 2: edge a and edge b;
[0140] For ease of explanation, Figure 8 One of the path types shown has been added Figure 4 The planar color code diagram shown includes equilateral triangles, circles, and regular hexagons.
[0141] It should be noted that, Figure 8The path type shown is only one of all possible path types. Furthermore, due to differences in the arrangement of qubits and physical bit error rates in different quantum chips, the method provided in this application's embodiments may yield different path types. Figure 8 The path type shown is different from one or more path types.
[0142] 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:
[0143] 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: Where, P(ε) i ) represents the depolarization error channel ε i The error rate can be obtained using the method described above in the embodiments of this application. Figure 3 Taking a quantum circuit as an example, the above formula can be transformed into w = -log[P(ε1) + P(ε2)], where p is the physical bit error rate, and the specific values of a and b can be obtained by referring to the methods described above in the embodiments of this application.
[0144] 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 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, obtaining a more accurate path, and greatly improving the accuracy of data bit error detection.
[0145] See Figure 8 , Figure 8 This is an exemplary schematic diagram of a novel path provided in an embodiment of this application. Figure 8 The new path shown includes the path 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 8 The new path shown has the same structure as a path type, so it will not be described again here.
[0146] See Figure 9 , Figure 9 This is an exemplary schematic diagram of a non-target path provided in an embodiment of this application. Figure 9 One type of non-target path shown includes:
[0147] The four points corresponding to the error measurement bits in the quantum chip are: point 1, point 2, point 3, and point 4.
[0148] The closed path formed by connecting points 1, 2, 3, and 4;
[0149] The closed path formed by connecting points 1, 2, 3, and 4 has four edges: edge c, edge d, edge e, and edge f; where edge c is formed by connecting points 1 and 3, edge d is formed by connecting points 2 and 3, edge e is formed by connecting points 1 and 4, and edge f is formed by connecting points 2 and 4.
[0150] Among them, edge c, edge d, edge e, and edge f are... Figure 8 The new path shown is obtained by transforming edges a and b, where edges a and b are the target path. Figure 8 In the new path shown, points 1 and 2 connected by edges a and b are not adjacent, while Figure 9 In one type of non-target path shown, edge c connects adjacent points 1 and 3, edge d connects adjacent points 2 and 3, edge e connects adjacent points 1 and 4, and edge f connects adjacent points 2 and 4. Figure 9 The non-target path shown contains the fewest paths.
[0151] Can Figure 9 The data bits shown are considered as erroneous data bits within a closed graph enclosed by a non-target path.
[0152] This application simplifies the path structure, reduces the path complexity, and improves the reliability and efficiency of data bit error detection by transforming the target path into a non-target path and minimizing the number of edges included in the non-target path, thereby greatly improving the accuracy of data bit error detection.
[0153] See Figure 10 , Figure 10 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 10 For example, the flow of another data bit error detection method provided in this application embodiment will be described:
[0154] Based on the specific arrangement of data bits in the quantum chip, the code distance of the quantum bits is determined, and a planar color code map is constructed on a two-dimensional plane based on the input code distance.
[0155] Make multiple copies of the planar color code image, and stack the copies in three-dimensional space along a direction perpendicular to the two-dimensional plane to obtain the original color code image;
[0156] From the three colors representing the measurement bits included in the original color code image, any two can be selected to obtain... One combination method, copy the original color code image to Share, received One original color code image;
[0157] Depending on each combination, in In each of the original color code images, two corresponding points are retained, and the remaining point is deleted, resulting in... A new original color code image;
[0158] The measurement bits in the quantum chip are measured, and the error-reporting measurement bits are obtained based on the measurement results. In each of the original color code images, the points corresponding to the erroneous measurement bits are paired up to obtain... Each new original color code image corresponds to multiple paths, such that the sum of the weights of the edges in the multiple paths included in each new original color code image is minimized, and the weight of the edges in each path is determined based on the physical bit error rate.
[0159] Will The multiple paths corresponding to the new original color code image are projected onto the same two-dimensional plane, and the paths projected onto the two-dimensional plane are used together as the new path;
[0160] If a target path exists in the new path, the target path is transformed into a non-target path. In the target path, the two points connected by each edge are not adjacent, and in the non-target path, the two points connected by each edge are adjacent, and the number of edges included in the non-target path is minimized.
[0161] Data bits within the closed graph enclosed by the non-target path are treated as erroneous data bits.
[0162] See Figure 11 , Figure 11 This is a schematic diagram of the structure of a data bit error detection device provided in an embodiment of this application. Figure 2 Corresponding to the process shown, the apparatus includes:
[0163] Construction module 1101 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;
[0164] Measurement module 1102 is used to measure the measurement bits in the quantum chip and to obtain the error-reporting quantum bits based on the measurement results;
[0165] The pairing module 1103 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 the smallest. 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.
[0166] The determination module 1104 is used to determine the data bits in the closed pattern formed by the multiple paths as erroneous data bits.
[0167] Optionally, before determining the data bits in the closed graph enclosed by the plurality of paths as erroneous data bits, the method further includes:
[0168] If a target path exists among the multiple paths, the target path is transformed into a non-target path. In the target path, the two points connected by each edge are not adjacent, and in the non-target path, the two points connected by each edge are adjacent, and the number of edges included in the non-target path is minimized.
[0169] Optionally, 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.
[0170] Optionally, 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.
[0171] Optionally, constructing the original color code map based on the input code distance includes:
[0172] A planar color code map is constructed on a two-dimensional plane based on the input code distance. 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.
[0173] The planar color code image is copied multiple times, and the multiple planar color code images are stacked in three-dimensional space along a direction perpendicular to the two-dimensional plane to obtain the original color code image. The number of times the measurement bits in the quantum chip are measured is greater than or equal to the number of copies of the planar color code image.
[0174] Optionally, the original color code image includes three colors representing the points of the measured bits. After obtaining the original color code image, the method further includes:
[0175] Choose any two colors from the three colors representing the points of measurement bits to obtain... One combination method;
[0176] Copy the original color code image to Share, received The original color code image described above;
[0177] According to each combination, in the In each of the original color code images, two corresponding points are retained, and the remaining point is deleted to obtain... A new original color code image.
[0178] Optionally, before determining the data bits in the closed graph enclosed by the plurality of paths as erroneous data bits, the method further includes:
[0179] 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.
[0180] Optionally, the measurement bits include physical measurement bits and three virtual measurement bits, the three virtual measurement bits being located outside the area formed by the physical measurement bits and data bits; the original color code image also includes an equilateral triangle and a circle, the equilateral triangle representing the boundary of the area formed by the physical measurement bits and data bits, and the circle being the circumcircle formed by the points representing the three virtual measurement bits.
[0181] 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.
[0182] Specifically, in this embodiment, the storage medium may include, but is not limited to, USB flash drives, read-only memory (ROM), random access memory (RAM), portable hard drives, magnetic disks, or optical disks, and other media capable of storing computer programs.
[0183] 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.
[0184] 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.
[0185] Specifically, in this embodiment, the processor can be configured to perform the following steps via a computer program:
[0186] S1, 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;
[0187] S2, Measure the measurement bits in the quantum chip, and obtain the error-reporting measurement bits based on the measurement results;
[0188] S3, in the original color code diagram, pair the points corresponding to the erroneous measurement bits to obtain multiple paths, the sum of the weights of the edges in the multiple paths is minimized, and the weight of the edges in each path is determined based on the physical bit error rate.
[0189] S4, the data bits in the closed pattern formed by the multiple paths are identified as erroneous data bits.
[0190] 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.
[0191] 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: A planar color code map is constructed on a two-dimensional plane based on the input code distance. 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. The planar color code image is copied multiple times, and the multiple planar color code images are stacked in three-dimensional space along a direction perpendicular to the two-dimensional plane to obtain the original color code image. Each point in the original color code image represents a measurement bit or data bit in the quantum chip. The measurement bits in the quantum chip are measured, and the measurement bits that report errors are obtained based on the measurement results. The number of times the measurement bits in the quantum chip are measured is greater than or equal to the number of copies of the planar color code image. In the original color code diagram, the points corresponding to the erroneous measurement bits are paired up to obtain multiple paths. The sum of the weights of the edges in the multiple paths is the smallest. The paths include at least one path type. The weight of the edges 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 is determined based on the physical bit error rate. The data bits in the closed pattern formed by the multiple paths are identified as the erroneous data bits.
2. The method as described in claim 1, characterized in that, Before determining the data bits in the closed graph formed by the multiple paths as erroneous data bits, the method further includes: If a target path exists among the multiple paths, the target path is transformed into a non-target path. In the target path, the two points connected by each edge are not adjacent, and in the non-target path, the two points connected by each edge are adjacent, and the number of edges included in the non-target path is minimized.
3. The method as described in claim 1, characterized in that, 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.
4. The method as described in claim 1, characterized in that, The original color code image includes three colors representing the points of the measured bits. After obtaining the original color code image, the method further includes: Choose any two colors from the three colors representing the points of measurement bits to obtain... One combination method; Copy the original color code image to Share, received The original color code image described above; According to each combination, in the In each of the original color code images, two corresponding points are retained, and the remaining point is deleted to obtain... A new original color code image.
5. The method as described in claim 4, characterized in that, Before determining the data bits in the closed graph formed by the multiple 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.
6. The method as described in claim 1, characterized in that, The measurement bits include physical measurement bits and three virtual measurement bits, which are located outside the area formed by the physical measurement bits and data bits; the original color code image also includes an equilateral triangle and a circle, where the equilateral triangle represents the boundary of the area formed by the physical measurement bits and data bits, and the circle is the circumcircle formed by the points representing the three virtual measurement bits.
7. A data bit error detection device, characterized in that, The device includes: A construction module is used to construct a planar color code map on a two-dimensional plane based on the input code distance. The position of each point in the planar color code map corresponds one-to-one with the position of a measurement bit or a data bit in the quantum chip. The planar color code map is copied multiple times and stacked in three-dimensional space along a direction perpendicular to the two-dimensional plane to obtain an original color code map. Each point in the original color code map represents a measurement bit or a data bit in the quantum chip. The 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 number of times the measurement bits in the quantum chip are measured is greater than or equal to the number of copies of the planar color code image. A 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 the smallest. The paths include at least one path type. The weight of the edges 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 is determined based on the physical bit error rate. The determination module is used to identify data bits in the closed pattern formed by the multiple paths as erroneous data bits.
8. 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-6 when it is run.
9. 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-6.
Citation Information
Patent Citations
Cryogenic classical superconducting circuitry for error correction in quantum computing
CA3209079A1
Quantum error correction coding method and related equipment
CN116136970A
