Simulation program, simulation method, and information processing device

The simulation program addresses the computational infeasibility of large-scale quantum error correction by efficiently determining logical errors through a two-dimensional lattice setup, reducing complexity from exponential to linear.

JP7583336B2Active Publication Date: 2024-11-14FUJITSU LTD
View PDF 3 Cites 0 Cited by

Patent Information

Application Number
JP2023562098
Authority / Receiving Office
JP · JP
Patent Type
Patents
Current Assignee / Owner
Filing Date
2021-11-22
Publication Date
2024-11-14
Estimated Expiration
2041-11-22

AI Technical Summary

Technical Problem

The simulation of error correction using surface codes in quantum computers becomes computationally infeasible as the number of qubits increases, making it difficult to determine whether logical errors occur, especially in large-scale quantum computers.

Method used

A simulation program that efficiently determines logical errors by generating a two-dimensional lattice of data and auxiliary qubits, setting error information, and calculating the number of inverted qubits in rows or columns to identify logical errors.

Benefits of technology

Enables efficient determination of logical errors in quantum computers, reducing computational complexity from exponential to linear, allowing for the evaluation of large-scale quantum error correction simulations.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 0007583336000010
    Figure 0007583336000010
  • Figure 0007583336000011
    Figure 0007583336000011
  • Figure 0007583336000012
    Figure 0007583336000012
Patent Text Reader

Abstract

The present invention enables efficient determination of whether or not a logical error has occurred. An information processing device (10) sets error information indicating occurrence of an error in a first quantum data bit for quantum bit information (1) indicating a two-dimensional lattice in which a plurality of quantum data bits and a plurality of auxiliary quantum bits are arranged alternately. Next, the information processing device (10) sets, for the quantum bit information, error detection information indicating an inverted initial value of the state of a first auxiliary quantum bit adjacent to the first quantum data bit in a row direction or column direction. The information processing device (10) sets, for the quantum bit information, error correction information indicating a second quantum data bit to be subjected to error correction by a surface code. Then, the information processing device (10) determines whether or not a logical error has occurred on the basis of the number of quantum data bits corresponding to either one of the first quantum data bit and the second quantum data bit in one row or one column of the two-dimensional lattice.
Need to check novelty before this filing date? Find Prior Art

Description

[Technical field]

[0001] The present invention relates to a simulation program, a simulation method, and an information processing device. [Background technology]

[0002] Calculations on quantum computers are realized by performing initialization, gate operations, and measurement processes on multiple quantum bits. In quantum computers, errors (physical errors) occur in the quantum bits during the process of such operations on the quantum bits due to environmental noise, etc. Therefore, in quantum computers, in order to identify error quantum bits and the contents of the errors, quantum bit redundancy is performed in the same way as in conventional computers (also called classical computers).

[0003] Surface coding is one of the methods to identify error quantum bits and the error content using redundant quantum bits. In surface coding, data quantum bits and auxiliary quantum bits are arranged alternately in a two-dimensional lattice. The state of a data quantum bit among multiple quantum bits (data quantum bits and auxiliary quantum bits) arranged in a lattice is encoded into one logical quantum bit. Each column of the auxiliary quantum bits is used for either X error detection or Z error detection. When performing surface coding, the quantum computer first properly initializes the logical quantum state, and when detecting an error, performs gate operations between one auxiliary quantum bit and the four surrounding data quantum bits and measures the auxiliary quantum bits. The quantum computer detects an X error or a Z error based on the value of the auxiliary quantum bit. Then, the quantum computer performs gate operations for error correction processing on the quantum bits using information indicating the type of error and position information of the data quantum bit identified as the error location.

[0004] As for technologies related to error correction in quantum computers, for example, a quantum error correction method that is independent of the system size has been proposed. A method for determining and correcting errors in an array of qubits that executes a quantum algorithm has also been proposed. Furthermore, a technology for correcting fault-tolerant quantum errors in one or more of a plurality of physical qubits based on measurements from at least one flag qubit has also been proposed. [Prior art documents] [Patent documents]

[0005] [Patent Document 1] JP 2014-241484 A [Patent Document 2] Special Publication No. 2020-535690 [Patent Document 3] US Patent Application Publication No. 2021 / 0019223 Summary of the Invention [Problem to be solved by the invention]

[0006] When an error occurs in two or more of the multiple quantum bits that make up one logical quantum bit, the error correction may fail even if a surface code is used. Such an error correction failure is called a logical error.

[0007] In surface codes, the probability of logical errors varies depending on the number of quantum bits in the lattice that represents one logical quantum bit. The probability of logical errors also varies depending on the rate of quantum bit errors caused by environmental noise. Therefore, in order to evaluate the performance of quantum error correction using surface codes, it is possible to simulate error correction using surface codes using a classical computer (also called a von Neumann computer). In an actual quantum computer, it is not possible to determine whether a logical error has occurred unless the data quantum bit itself is measured, but with a simulation, the location of the error can be known in advance. Therefore, by simulating error correction using surface codes under specified conditions, it is possible to determine whether a logical error has occurred under those conditions. This makes it possible to investigate the appropriate number of quantum bits per logical quantum bit when applying surface codes to a quantum computer.

[0008] However, in the process of determining whether or not a logical error has occurred in error-correcting simulations using conventional surface codes, the amount of calculations increases exponentially as the number of quantum bits per logical quantum bit increases, making it difficult to perform error-correcting simulations using surface codes on large-scale quantum computers.

[0009] In one aspect, an object of the present invention is to efficiently determine whether or not a logical error has occurred. [Means for solving the problem]

[0010] In one proposal, a simulation program is provided that causes a computer to execute the following processes. The computer generates quantum bit information indicating a two-dimensional lattice in which a plurality of data quantum bits and a plurality of auxiliary quantum bits are alternately arranged in the row direction and the column direction. The computer sets, for the quantum bit information, error information indicating an error occurrence in a first data quantum bit of the plurality of data quantum bits. The computer sets, for the quantum bit information, error detection information in which a state of an auxiliary quantum bit adjacent to the first data quantum bit in the row direction or the column direction is inverted from an initial value. The computer sets, for the quantum bit information, error correction information indicating a second data quantum bit that is to be subjected to error correction by a surface code based on the error detection information. The computer then determines whether or not a logical error has occurred based on the number of data quantum bits that correspond to either the first data quantum bit or the second data quantum bit in one row or one column of the two-dimensional lattice. Effect of the Invention

[0011] According to one aspect, it is possible to efficiently determine whether or not a logical error has occurred. The above and other objects, features and advantages of the present invention will become apparent from the following description taken in conjunction with the accompanying drawings illustrating preferred embodiments of the present invention. [Brief description of the drawings]

[0012] [Figure 1] FIG. 2 illustrates an example of a simulation method according to the first embodiment. [Diagram 2] FIG. 2 is a diagram illustrating an example of computer hardware for surface code simulation. [Diagram 3] FIG. 1 is a diagram illustrating a quantum bit. [Figure 4] FIG. 1 illustrates an example of a quantum circuit. [Diagram 5] FIG. 1 is a diagram illustrating an example of an error occurrence state in a quantum bit. [Figure 6] FIG. 1 is a diagram illustrating an example of quantum bit redundancy. [Figure 7]FIG. 1 illustrates an example of a measurement using an auxiliary qubit. [Figure 8] FIG. 1 is a diagram showing an example of a configuration of a quantum bit for performing a surface code. [Figure 9] FIG. 13 is a diagram illustrating an example of a gate operation for detecting an X error. [Figure 10] FIG. 13 is a diagram showing an example of gate operation for Z error detection. [Figure 11] FIG. 2 is a diagram illustrating the mathematical expressions of the logical Z operator Lz and the logical X operator Lx. [Figure 12] FIG. 13 is a diagram illustrating an example of X error detection. [Figure 13] FIG. 13 is a diagram illustrating an example of identifying an error location. [Figure 14] FIG. 13 is a diagram illustrating an example of a case where an error occurrence location cannot be uniquely identified. [Figure 15] FIG. 13 illustrates an example of error correction by correcting a data quantum bit other than the one where the error occurred. [Figure 16] FIG. 13 is a diagram showing an example of an error correction success pattern. [Figure 17] FIG. 13 is a diagram illustrating an example of a logical error caused by erroneous correction. [Figure 18] FIG. 13 is a diagram illustrating an example of logical error determination by searching an error chain. [Figure 19] FIG. 13 is a diagram showing an example of logical error determination based on state data of data quantum bits for one column of a two-dimensional lattice. [Figure 20] FIG. 13 is a diagram for explaining that a logical error occurs when the number of inverted quantum bits in one vertical column is an odd number. [Figure 21] FIG. 1 is a diagram showing an example of a data quantum bit used for logical error determination. [Figure 22] FIG. 2 is a block diagram showing the functions of a computer for performing a surface code simulation. [Diagram 23] 13 is a flowchart showing an example of a procedure for a logical error determination process using a surface code simulation. [Figure 24] FIG. 11 is a diagram illustrating an example of simulation conditions. [Diagram 25] 13 is a flowchart showing an example of a procedure for processing a surface code simulation. [Figure 26] 13 is a flowchart showing an example of a procedure for a logical error (Z error) determination process. [Figure 27] 13 is a flowchart showing an example of a procedure for a logical error (X error) determination process. [Figure 28] 1 is a graph showing the relationship between the number of data quantum bits on one side of a two-dimensional lattice and the number of searches. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0013] Hereinafter, the present embodiment will be described with reference to the drawings. Note that each embodiment can be implemented in combination with a plurality of other embodiments as long as no contradiction occurs. First Embodiment The first embodiment is a simulation method for efficiently determining whether or not a logical error occurs when a simulation of an error correction process is performed using a surface code to correct a quantum bit error that occurs in a quantum computer.

[0014] Fig. 1 is a diagram showing an example of a simulation method according to a first embodiment. Fig. 1 shows an information processing device 10 used to implement the simulation method. The information processing device 10 can implement the simulation method by, for example, executing a simulation program.

[0015] The information processing device 10 includes a storage unit 11 and a processing unit 12. The storage unit 11 is, for example, a memory or a storage device included in the information processing device 10. The processing unit 12 is, for example, a processor or an arithmetic circuit included in the information processing device 10.

[0016] The storage unit 11 stores quantum bit information 1 indicating a two-dimensional lattice in which a plurality of data quantum bits and a plurality of auxiliary quantum bits are alternately arranged in the row direction and the column direction. In the two-dimensional lattice, quantum bits are arranged at equal intervals within a rectangular region, and quantum bits arranged along the four sides of the rectangle form the boundaries of the two-dimensional lattice. In the two-dimensional lattice indicated in the quantum bit information 1, for example, columns in which auxiliary quantum bits for detecting phase inversion errors (Z errors) are arranged are alternated with columns in which auxiliary quantum bits for detecting bit inversion errors (X errors) are arranged. In such a two-dimensional lattice indicated in the quantum bit information 1, rows in which auxiliary quantum bits for detecting phase inversion errors are arranged are also alternated with rows in which auxiliary quantum bits for detecting bit inversion errors are arranged.

[0017] Processing unit 12 accepts input of simulation conditions from a user and generates quantum bit information 1 according to the simulation conditions. The simulation conditions include, for example, the number of quantum bits in each of the row and column directions of a two-dimensional lattice, the error occurrence rate in data quantum bits, etc. Processing unit 12 generates quantum bit information 1 based on the simulation conditions. Processing unit 12 then stores the generated quantum bit information 1 in storage unit 11.

[0018] The processing unit 12 sets error information indicating the occurrence of an error in a first data quantum bit of the multiple data quantum bits, for the quantum bit information 1. For example, the processing unit 12 randomly determines the first data quantum bit in which an error is to occur from among the multiple data quantum bits based on a predetermined error occurrence rate. The error to be caused in the first data quantum bit is an unintended inversion of the state of the data quantum bit (bit inversion or phase inversion). In the example of FIG. 1, the first data quantum bit is indicated by hatching in a striped pattern.

[0019] Next, the processing unit 12 sets error detection information for the quantum bit information 1, in which the state of the auxiliary quantum bit adjacent to the first data quantum bit in the row direction or column direction is inverted from the initial value. At this time, the processing unit 12 inverts the state of the auxiliary quantum bit a number of times equal to the number of adjacent first data quantum bits. Therefore, for example, the state of an auxiliary quantum bit adjacent to two first data quantum bits is inverted twice and returns to the initial state. In the example of FIG. 1, the auxiliary processing bits that have been inverted from their initial values ​​are indicated by hatching in a checkered pattern.

[0020] Furthermore, processing unit 12 sets, for quantum bit information 1, error correction information indicating a second data quantum bit to be subjected to error correction by a surface code based on the error detection information. Processing unit 12 determines a pattern of error occurrence of a data quantum bit such that the auxiliary quantum bit is inverted when error detection is performed, for example, based on the arrangement of the auxiliary quantum bit whose state is inverted. Processing unit 12 then sets the data quantum bit in which an error is said to have occurred in the error occurrence pattern as the second data quantum bit to be subjected to error correction. In the example of FIG. 1, the rectangle of the data quantum bit to be subjected to error correction is represented by a double line.

[0021] Note that there can be multiple patterns of arrangement of the second data quantum bits (error correction patterns). In the example of Figure 1, three error correction patterns are shown. The processing unit 12 determines whether a logical error has occurred based on the number of data qubits that correspond to either the first data qubit or the second data qubit in one row or one column in the two-dimensional lattice. For example, the processing unit 12 determines that a logical error has occurred when the number of data qubits (inversion qubits) that correspond to either the first data qubit or the second data qubit in one row or one column in the two-dimensional lattice is an odd number. Note that a data qubit that corresponds to both the first data qubit and the second data qubit is a data qubit in which an error has occurred but has been correctly corrected, and is not included in the inversion qubit.

[0022] In the example shown in Figure 1, the presence or absence of a logical error is determined based on the number of flipped quantum bits in the fifth column. For example, in the first error correction pattern, the number of flipped quantum bits is "0" (even number), and it is determined that no logical error has occurred. In the second error correction pattern, the number of flipped quantum bits is "2" (even number), and it is determined that no logical error has occurred. In the third error correction pattern, the number of flipped quantum bits is "1" (odd number), and it is determined that a logical error has occurred.

[0023] In this way, the presence or absence of a logical error can be determined based on the number of inverted quantum bits in a row or column, making it possible to efficiently determine the presence or absence of a logical error when executing a simulation of the surface code.

[0024] When rows in which auxiliary quantum bits for detecting phase inversion errors are arranged and rows in which bit inversion errors are arranged are alternately arranged, the boundaries of the four sides of the two-dimensional lattice include boundaries in which auxiliary quantum bits for detecting phase inversion errors are arranged (smooth boundaries) and boundaries in which auxiliary quantum bits for detecting bit inversion errors are arranged (rough boundaries). The processing unit 12 determines whether or not a logical error caused by a phase inversion error occurs based on the number of data quantum bits corresponding to either the first data quantum bit or the second data quantum bit in one row or one column in a direction parallel to the rough boundaries. The processing unit 12 also determines whether or not a logical error caused by a bit inversion error occurs based on the number of data quantum bits corresponding to either the first data quantum bit or the second data quantum bit in one row or one column in a direction parallel to the smooth boundaries.

[0025] In this manner, the presence or absence of a logic error caused by a phase inversion error or a bit inversion error can be determined individually. In addition, when determining the first data quantum bit by randomly generating errors from among a plurality of data quantum bits based on a predetermined error occurrence rate, whether or not a logical error occurs is determined probabilistically. Therefore, processing unit 12 may repeatedly execute the setting of error information, setting of error detection information, setting of error correction information, and determination of whether or not a logical error has occurred a predetermined number of times. In this case, processing unit 12 calculates the logical error occurrence probability based on the result of the determination of whether or not a logical error has occurred a predetermined number of times. This allows the probability of logical error occurrence corresponding to the error occurrence rate of the data quantum bit to be obtained.

[0026] Second Embodiment Next, a second embodiment will be described. The second embodiment is a computer that executes a simulation of error correction using a surface code for errors that randomly occur in a quantum computer (hereinafter, referred to as a surface code simulation) and efficiently determines whether or not a logical error has occurred.

[0027] 2 is a diagram showing an example of computer hardware for surface code simulation. The computer 100 is entirely controlled by a processor 101. A memory 102 and a plurality of peripheral devices are connected to the processor 101 via a bus 109. The processor 101 may be a multiprocessor. The processor 101 is, for example, a central processing unit (CPU), a micro processing unit (MPU), or a digital signal processor (DSP). At least a part of the functions realized by the processor 101 executing a program may be realized by an electronic circuit such as an application specific integrated circuit (ASIC) or a programmable logic device (PLD).

[0028] The memory 102 is used as a main storage device of the computer 100. The memory 102 temporarily stores at least a part of the OS (Operating System) program and application programs to be executed by the processor 101. The memory 102 also stores various data used in the processing by the processor 101. As the memory 102, for example, a volatile semiconductor storage device such as a RAM (Random Access Memory) is used.

[0029] The peripheral devices connected to the bus 109 include a storage device 103, a GPU (Graphics Processing Unit) 104, an input interface 105, an optical drive device 106, a device connection interface 107, and a network interface 108.

[0030] The storage device 103 electrically or magnetically writes and reads data to and from a built-in recording medium. The storage device 103 is used as an auxiliary storage device for the computer 100. The storage device 103 stores an OS program, application programs, and various data. Note that, for example, a hard disk drive (HDD) or a solid state drive (SSD) can be used as the storage device 103.

[0031] The GPU 104 is an arithmetic device that performs image processing, and is also called a graphics controller. The GPU 104 is connected to a monitor 21. The GPU 104 displays an image on the screen of the monitor 21 in accordance with an instruction from the processor 101. The monitor 21 may be a display device using an organic EL (Electro Luminescence) display device, a liquid crystal display device, or the like.

[0032] The input interface 105 is connected to the keyboard 22 and the mouse 23. The input interface 105 transmits signals sent from the keyboard 22 and the mouse 23 to the processor 101. Note that the mouse 23 is an example of a pointing device, and other pointing devices can also be used. Examples of other pointing devices include a touch panel, a tablet, a touch pad, and a trackball.

[0033] The optical drive device 106 uses a laser beam or the like to read data recorded on the optical disc 24 or write data to the optical disc 24. The optical disc 24 is a portable recording medium on which data is recorded so that it can be read by reflection of light. The optical disc 24 includes a DVD (Digital Versatile Disc), a DVD-RAM, a CD-ROM (Compact Disc Read Only Memory), a CD-R (Recordable) / RW (ReWritable), etc.

[0034] The device connection interface 107 is a communication interface for connecting peripheral devices to the computer 100. For example, a memory device 25 or a memory reader / writer 26 can be connected to the device connection interface 107. The memory device 25 is a recording medium equipped with a function for communicating with the device connection interface 107. The memory reader / writer 26 is a device for writing data to the memory card 27 or reading data from the memory card 27. The memory card 27 is a card-type recording medium.

[0035] The network interface 108 is connected to the network 20. The network interface 108 transmits and receives data to and from other computers or communication devices via the network 20. The network interface 108 is a wired communication interface that is connected by a cable to a wired communication device such as a switch or a router. The network interface 108 may also be a wireless communication interface that is communicatively connected by radio waves to a wireless communication device such as a base station or an access point.

[0036] The computer 100 can realize the processing functions of the second embodiment by the above-mentioned hardware. The information processing device 10 shown in the first embodiment can also be realized by the same hardware as the computer 100 shown in FIG.

[0037] The computer 100 executes a program recorded in, for example, a computer-readable recording medium to realize the processing function of the second embodiment. The program describing the processing contents to be executed by the computer 100 can be recorded in various recording media. For example, the program to be executed by the computer 100 can be stored in the storage device 103. The processor 101 loads at least a part of the program in the storage device 103 into the memory 102 and executes the program. The program to be executed by the computer 100 can also be recorded in a portable recording medium such as the optical disk 24, the memory device 25, or the memory card 27. The program stored in the portable recording medium becomes executable after being installed in the storage device 103 under the control of, for example, the processor 101. The processor 101 can also directly read out and execute the program from the portable recording medium.

[0038] Before describing the surface code simulation, error correction by the surface code in a quantum computer and the cause of logical errors will be described below with reference to FIGS. Figure 3 is a diagram explaining quantum bits. A quantum bit is the smallest unit of quantum information, which corresponds to a "bit" (classical bit), the smallest unit of information in conventional computers. A quantum bit is in a quantum mechanical superposition state (quantum state) of "0" and "1." The quantum state of a quantum bit is mathematically represented as a two-dimensional vector as shown in the following formula (1), where |0>, |1> correspond to the classical bit states of "0" and "1," respectively.

[0039]

number

[0040] When α and β are rewritten as in equation (2) using real numbers φ and θ, and imaginary unit i, the quantum bit is expressed by the Bloch sphere 31 shown in FIG.

[0041]

number

[0042] While classical bits can only be in the states of "0" or "1," quantum bits can take any state on the 31 faces of the Bloch sphere. In quantum computers using quantum gates, gate operations can be performed on quantum bits to carry out desired calculations.

[0043] A gate operation is an operation that changes a quantum state, and is mathematically expressed as applying a matrix operator to a vector of the quantum state. An example of a gate operation is the X gate, which flips a quantum bit. The operation by the X gate can be expressed mathematically as follows:

[0044]

number

[0045] The operation of the Z gate to invert the phase of a quantum bit can be expressed mathematically as follows:

[0046]

number

[0047] The matrix operators corresponding to the X-gate and Z-gate operations are known as the Pauli operators. There are three Pauli operators:

[0048]

number

[0049] The product of Pauli operators has the property (XY=-YX, YZ=-ZY, ZX=-XZ). When such a relationship is satisfied, it is called an anticommutation relationship. Also, when a relationship without a minus sign (for example, the relationship between the identity operator I and XI=IX) is satisfied, it is called a commutation relationship.

[0050] Another operator used in gate operations is the Hadamard operator. The Hadamard operator is used in gate operations to create a superposition state between |0> and |1>. The Hadamard operator is expressed by the following formula (6).

[0051]

number

[0052] The above matrix operators act on one qubit. There are also operators that act on two qubits. The state of two qubits is expressed as the tensor product of the state of one qubit, "|a>×|b>" (the tensor product × is a symbol × in a circle), which is usually written as |ab>, a 2×2 four-dimensional vector. An example of a matrix operator that acts on two qubits is the CNOT operator.

[0053] The CNOT operator flips one quantum bit (the control quantum bit) when the other quantum bit (the target quantum bit) is 1 (|10>→|11>). Since the state of two quantum bits is a four-dimensional vector, the corresponding matrix operator is 4×4 dimensional. The CNOT operator is expressed by the following formula.

[0054]

number

[0055] A quantum circuit is used to collectively represent gate operations on multiple quantum bits. In a quantum circuit, the state transitions of the quantum bits are represented by lines, and each gate operation is represented by a corresponding symbol.

[0056] Fig. 4 is a diagram showing an example of a quantum circuit. Each horizontal line in the quantum circuit 32 corresponds to a quantum bit. The input to the quantum bit is shown to the left of the horizontal line. Above each horizontal line, symbols indicating gate operations for the corresponding quantum bit are arranged horizontally (from left to right) in chronological order. Meter-like symbols 32a and 32b to the right of the horizontal line indicate measurement operations.

[0057] Among the gate operations shown in the quantum circuit 32, for example, the symbol 32c of X enclosed in a rectangle indicates the Pauli operator "X" (X gate operation). The symbol 32d of Z enclosed in a rectangle indicates the Pauli operator "Z" (Z gate operation). The symbol 32e of H enclosed in a rectangle indicates the Hadamard operator "H" (Hadamard gate operation).

[0058] Gate operations for two qubits are written across multiple horizontal lines. For example, the CNOT operator C X The symbols 32f and 32g, which indicate gate operations corresponding to the above, are formed by connecting a white circle with a + inside and a black circle with a line. The black circle is placed on the horizontal line of the control qubit, and the white circle with a + inside is placed on the horizontal line of the target qubit.

[0059] For example, the quantum circuit 32 shown in FIG. 4 performs a gate operation “C X(2,1) Z (1) C X(1,2) H (2) X (1) " is performed. In the formula showing the gate operation, the matrix operators to be applied are written in order from right to left. The subscript to the bottom right of the matrix operator is the number of the quantum bit to be applied.

[0060] In a quantum computer, the gate operations shown in the quantum circuit 32 are executed in sequence. During this process, an error may occur in the quantum bit. To obtain a correct calculation result, it is important to be able to detect the occurrence of an error and correct the error.

[0061] FIG. 5 is a diagram showing an example of an error occurrence state in a quantum bit. The quantum bit 33 is affected by various noises. The types of noise include environmental noise, noise during quantum bit operation, and interference from other quantum bits. The quantum bit 33 may unintentionally change state due to the influence of noise. Such unintentional state changes are quantum bit errors. The types of errors that occur in quantum bits are classified into the following two types. Bit inversion error (X error): |0> → |1>, |1> → |0> Phase inversion error (Z error): |+>→|->, |->→|+> A bit-flip error is mathematically equivalent to applying the Pauli operator X to a quantum state. Similarly, a phase-flip error is equivalent to applying the Pauli operator Z to a quantum state.

[0062] In other words, quantum bit errors can be corrected by applying the same Pauli operator (X, Z) as the error. This type of operation is called quantum error correction. For example, consider the case where a quantum bit with an X error is corrected by the Pauli operator X. The X error is expressed by the following equation (8), and the correction gate operation is expressed by equation (9).

[0063]

number

[0064]

number

[0065] Due to the occurrence and correction of errors, the quantum state changes as follows: |0> → |1> → |0>. To correct such errors, it is necessary to identify the quantum bit where the error occurred (error quantum bit) and the nature of the error (whether it is a bit inversion (X error) or a phase inversion (Z error)). Therefore, quantum bit redundancy is used to identify the error quantum bit and the nature of the error.

[0066] FIG. 6 is a diagram showing an example of quantum bit redundancy. FIG. 6 shows an example of redundancy using eight quantum bits. When quantum bits are made redundant, a quantum state |ψ> represented by one quantum bit 34 is expressed as a logical quantum state |ψ> by a logical quantum bit 35. L The logical quantum bit 35 is composed of a plurality of quantum bits 35a to 35h.

[0067] Here, it is assumed that an error occurs in one quantum bit 35h that constitutes the logical quantum bit 35. In this case, the error quantum bit and the error content are identified by a process for identifying the error quantum bit and the error content.

[0068] If qubit 35h is correctly identified as an error qubit, and the nature of the error is also correctly identified, an error correction gate operation is performed on qubit 35h, which corrects the state of logical qubit 35 to the state it would be if no error had occurred.

[0069] In the example of Figure 6, it is assumed that the error quantum bit has been correctly identified, but identifying the error quantum bit is not easy. Information about the states of the quantum bits 35a-35h that make up the logical quantum bit 35 is used to identify the error quantum bit, but if the quantum bits are measured directly, the quantum state will be destroyed and the calculation will not be able to continue. For this reason, auxiliary quantum bits are introduced, and by measuring the state of the auxiliary quantum bits, information about the states of the quantum bits 35a-35h that make up the logical quantum bit 35 can be obtained.

[0070] FIG. 7 is a diagram showing an example of measurement using an auxiliary quantum bit. The state of the quantum bit 36 ​​cannot be copied to the auxiliary quantum bit 37. Therefore, a two-qubit operation is performed on the quantum bit 36 ​​and the auxiliary quantum bit 37. The two-qubit operation changes the state of the auxiliary quantum bit 37 according to the state of the quantum bit 36. By measuring the state of the auxiliary quantum bit 37, it is possible to detect a change from the initial state of the auxiliary quantum bit 37. The state of the quantum bit 36 ​​can be known depending on whether the auxiliary quantum bit 37 has changed from its initial state.

[0071] Surface coding is a method for identifying error quantum bits based on the state of quantum bits obtained using auxiliary quantum bits. Surface coding is a typical coding (redundancy) method in quantum error correction.

[0072] Fig. 8 is a diagram showing an example of a configuration of quantum bits for performing surface coding. In the example of Fig. 8, quantum bits are arranged in a two-dimensional lattice. Data quantum bits 40a-40f and auxiliary quantum bits 41a-41d, 42a-42d are arranged alternately in the row direction and the column direction. Auxiliary quantum bits 41a-41d, 42a-42d are divided into auxiliary quantum bits 41a-41d for X error detection and auxiliary quantum bits 42a-42d for Z error detection. Auxiliary quantum bits 41a-41d for X error detection and auxiliary quantum bits 42a-42d for Z error detection are arranged alternately in each column.

[0073] The quantum bits shown in Fig. 8 are some of the quantum bits used for error correction using surface codes. When performing error correction using surface codes, the quantum number on one side of the two-dimensional lattice including all the quantum bits used for error correction (the sum of data quantum bits and ancillary quantum bits) is an odd number, and the quantum bits arranged at the four corners are data quantum bits (see Fig. 11).

[0074] First, the logical quantum state is properly initialized, and when an error is detected, a gate operation (two-qubit operation) is performed between one auxiliary quantum bit and the four surrounding data quantum bits, and the presence or absence of an error can be detected by measuring the auxiliary quantum bit.

[0075] 9 is a diagram showing an example of gate operations for X error detection. For example, assume that an ancillary qubit 41d is used to detect an error in any of data qubits 40d, 40e, 40h, and 40f adjacent to the ancillary qubit 41d. Here, the identifier of data qubit 40d is "a", the identifier of data qubit 40e is "b", the identifier of data qubit 40h is "c", the identifier of data qubit 40f is "d", and the identifier of ancillary qubit 41d is "e".

[0076] By performing gate operations as shown in quantum circuit 43 on these quantum bits, it becomes possible to detect X errors in data quantum bits 40d, 40e, 40h, and 40f. In quantum circuit 43, it is shown that CNOT gate operations are performed with data quantum bits 40d, 40e, 40h, and 40f as control quantum bits and auxiliary quantum bit 41d as a target quantum bit. By such gate operations, if an X error occurs in one of data quantum bits 40d, 40e, 40h, and 40f, auxiliary quantum bit 41d changes from its initial state. In the example of FIG. 6, since the initial state of auxiliary quantum bit 41d is |0>, if a state of |1> is detected by measuring auxiliary quantum bit 41d, it can be determined that an X error occurs in one of data quantum bits 40d, 40e, 40h, and 40f.

[0077] 10 is a diagram showing an example of gate operation for Z error detection. For example, assume that an ancillary qubit 42a is used to detect an error in any of data qubits 40a, 40c, 40d, and 40e adjacent to the ancillary qubit 42a. Here, the identifier of data qubit 40a is "g", the identifier of data qubit 40c is "f", and the identifier of ancillary qubit 42a is "h". As shown in FIG. 9, the identifier of data qubit 40d is "a", and the identifier of data qubit 40e is "b".

[0078] By performing gate operations as shown in quantum circuit 44 on these quantum bits, Z errors in data quantum bits 40a, 40c, 40d, and 40e can be detected. Quantum circuit 44 shows that a Hadamard gate operation is first performed on auxiliary quantum bit 42a. Then, a CNOT gate operation is performed on each of data quantum bits 40a, 40c, 40d, and 40e as a target quantum bit and auxiliary quantum bit 42a as a control quantum bit. Furthermore, a Hadamard gate operation is performed on auxiliary quantum bit 42a. Note that in the situation shown in quantum circuit 44, in the CNOT gate operation between a data quantum bit in which a Z error has occurred and auxiliary quantum bit 42a, the state of auxiliary quantum bit 42a, which is the control quantum bit, changes depending on the state of the target quantum bit, contrary to normal.

[0079] Such gate operations cause ancillary quantum bit 42a to change from its initial state if a Z error occurs in one of data quantum bits 40a, 40c, 40d, and 40e. In the example of Fig. 6, the initial state of ancillary quantum bit 42a is |0>, so if a measurement of ancillary quantum bit 42a detects a |1> state, it can be determined that a Z error has occurred in one of data quantum bits 40a, 40c, 40d, and 40e.

[0080] Next, we will explain the initialization of the data quantum bit. LIf |ψ> is determined arbitrarily, the gate operation for error detection shown in Figure 9 or Figure 10 will cause the states of the data qubits and ancillary qubits to change even when there are no errors. To avoid this, the logical quantum state |ψ> L is initialized to be an eigenstate of the stabilizer operator (eigenvalues ​​+1 or -1). The stabilizer operator is a product of Z or X operators acting on the four data qubits around the ancillary qubit.

[0081] For example, the stabilizer operator for X error detection shown in Figure 9 is "Z (i1) Z (i2) Z (i3) Z (i4) |ψ> L =±|ψ> L " where i is the index of the ancillary qubit for X error detection. The number to the right of i distinguishes the data qubits around the ancillary qubit. For example, with the ancillary qubit as the base, the data qubit above is "1", the data qubit to the left is "2", the data qubit below is "3", and the data qubit to the right is "4". For example, Z (i1) denotes the Z operator acting on a data qubit on the i-th ancillary qubit.

[0082] The stabilizer operator for Z error detection shown in Figure 10 is "X (j1) X (j2) X (j3) X (j4) |ψ> L =±|ψ> L " j is the index of the auxiliary qubit for Z error detection. The number to the right of j is a number that distinguishes the data qubits around the auxiliary qubit.

[0083] In this way, the logical quantum state |ψ> L Due to the initialization of ,measuring the ancillary qubit does not affect the state of the qubit. Next, we will explain the calculation of logical quantum bits. Error detection is a process that is frequently performed between calculations. Therefore, the logical quantum state must be maintained not only in the initial state but also in the eigenstate of the stabilizer operator during the calculation. Therefore, when performing operations on logical quantum bits, operators that change the logical quantum state without destroying the eigenstate of the stabilizer operator are used. These operators are called logical operators.

[0084] Logical operators include the logical Z operator Lz, the logical X operator Lx, etc. These logical operators satisfy the following properties. The first property is that logical operators satisfy a commutation relation with all stabilizer operators. For example, for a logical Z operator Lz, let S be the stabilizer operator, and let |ψ> be the logical quantum state. L Let S be the eigenstate of S (S|ψ> L =|ψ> L ) In this case, from the exchange relation SLz=LzS, SLz|ψ> L =LzS|ψ> L =Lz|ψ> L Lz|ψ> L is the original |ψ> L is different from, but is kept as an eigenstate of S.

[0085] The second property is that Lx and Lz satisfy the anticommutation relation, i.e., "LxLz=-LzLx". 11 is a diagram for explaining the mathematical expressions of the logical Z operator Lz and the logical X operator Lx. Among the left, right, and top and bottom boundaries in the lattice-like quantum bit arrangement that constitutes a logical quantum bit, the boundaries where the auxiliary quantum bits for X error detection are arranged are called rough boundaries 45, 46. Also, the boundaries where the auxiliary quantum bits for Z error detection are arranged are called smooth boundaries 47, 48.

[0086] The logical Z operator Lz is mathematically expressed as the product of Z operators for the number of data quantum bits from one rough boundary 45 to the opposite rough boundary 46. The logical Z operator Lz inverts the phase of the logical quantum state (Lz|0> L =|0> L , Lz|1>L =-|1> L ).

[0087] The logical X operator Lx is mathematically expressed as a product of X operators for the number of data quantum bits from one smooth boundary 47 to the opposite smooth boundary 48. The logical X operator Lx performs bit inversion of the logical quantum state (Lx|0> L =|1> L , Lx|1> L =|0> L ).

[0088] Next, we will explain how to detect errors using surface codes. In the surface code, when an X error occurs in one data quantum bit, the state |ψ> L is an eigenstate |ψ'> where the eigenvalues ​​of the stabilizer operator are different. L changes to.

[0089] FIG. 12 is a diagram showing an example of X error detection. For example, |ψ> L If is an eigenvalue of +1, then an X error in one of the data qubits around the i-th annular qubit results in |ψ'> L =X (i1) |ψ> L In the example of FIG. 12, it is assumed that an error has occurred in data qubit 40d.

[0090] At this time, if the Z stabilizer operator around the auxiliary quantum bit 41d is applied to the data quantum bit 40d where the error occurred, the result is "Z (i1) Z (i2) Z (i3) Z (i4) |ψ'> L " This formula is expressed as "|ψ'> L =X (i1) |ψ> L " can be transformed as follows:

[0091] Z (i1) Z (i2) Z (i3) Z (i4) |ψ'> L =Z (i1) Z (i2)Z (i3) Z (i4) X (i1) |ψ> L =Z (i1) X (i1) Z (i2) Z (i3) Z (i4) |ψ> L Since the Z operator and the Z operator satisfy the anticommutation relation, it can be further transformed as follows.

[0092] Z (i1) X (i1) Z (i2) Z (i3) Z (i4) |ψ> L =-X (i1) Z (i1) Z (i2) Z (i3) Z (i4) |ψ> L =-X (i1) |ψ> L =-|ψ'> L 「-|ψ'> L " indicates that the eigenvalue has changed to "-1." This change in the eigenvalue can be detected by using the quantum circuit 43 as a bit inversion of the ancillary quantum bit 41d (|ψ> L =|0000>+|1111>).

[0093] In this way, it can be explained that by measuring an ancillary qubit, it is possible to detect the occurrence of an error in one of the surrounding data qubits. However, a single ancillary qubit alone does not tell which of the surrounding data qubits the error occurred in. Therefore, the data qubit in which the error occurred is identified based on the relative positions of two or more ancillary qubits that detect an error among multiple ancillary qubits.

[0094] Fig. 13 is a diagram showing an example of identifying an error location. Fig. 13 shows an example of identifying an error location for a Z error, but a similar error location can be identified for an X error. In Fig. 13, among the auxiliary quantum bits, the auxiliary quantum bit for detecting an X error is omitted (the same applies to Figs. 14 to 20).

[0095] Here, it is assumed that a Z error has occurred in data quantum bit 51. In the error detection process, error detection is performed on all auxiliary quantum bits by gate operations similar to those of quantum circuit 44 shown in Fig. 10, and the states are measured. In Fig. 13, the auxiliary quantum bit to be measured and the data quantum bit to be subjected to error detection by that auxiliary quantum bit are surrounded by circles.

[0096] The data quantum bit 51 in which the error occurred is located within the same circle as the two auxiliary quantum bits 52, 53. In this case, the inversion of the states of the auxiliary quantum bits 52, 53 is detected by measurement. As the states of the auxiliary quantum bits 52, 53 have been inverted, the data quantum bit 51 located between them is identified as the location where the error occurred. An error correction operation (Z-gate operation) is then performed on the data quantum bit 51.

[0097] In this way, if there is only one error location, it is possible to uniquely identify the error location. However, if two or more errors occur and the error locations are close to each other, it may not be possible to uniquely identify the error locations.

[0098] However, there are also cases where errors that occur in two adjacent locations can be successfully corrected. It is known that if multiple errors occur in the data qubits on one side of a lattice of quantum bits arranged in a lattice, the errors can be successfully corrected if the number of errors is less than half the number of data qubits on one side of the lattice. For example, if a lattice has nine data qubits on one side, even if errors occur by chance on one side, up to four errors can in principle be corrected. Conversely, if five or more errors occur, the remaining four are incorrectly corrected according to the theory of surface codes. As a result, all the data qubits on that side are inverted. This state is a state in which a logical error has occurred. In this way, if errors occur in a sufficiently large number of data qubits, there is a high possibility that a logical error will occur.

[0099] FIG. 14 is a diagram showing an example of a case where the location of an error cannot be uniquely identified. In the example of FIG. 14, errors have occurred in two data quantum bits. The data quantum bits in which errors occur have a difference of one row and three columns in their positions. In this case, the states of four auxiliary quantum bits adjacent to one of the data quantum bits in which an error has occurred are inverted (measurement information becomes "-1"). An attempt is made to identify the location of the error quantum bit based on the four inverted auxiliary quantum bits.

[0100] There are three error occurrence patterns that invert the four inverted ancillary quantum bits and leave the remaining ancillary quantum bits unchanged. A first error occurrence pattern 61 is an example of a case where an error correctly identifies a generated data quantum bit. A second error occurrence pattern 62 and a third error occurrence pattern 63 are examples of a case where an error does not correctly identify a generated data quantum bit.

[0101] In this way, when there are multiple error occurrence patterns in which the four inverted ancillary quantum bits are inverted and the remaining ancillary quantum bits are not inverted, the location of the error cannot be uniquely determined. However, in quantum error correction, even if the data quantum bit in which the error occurred cannot be correctly identified, it is sufficient if the logical quantum state can be maintained in a correct state by error correction. Then, if certain conditions are met, the logical quantum state can be made correct by correcting the data quantum bit that is different from the data quantum bit in which the error occurred.

[0102] Fig. 15 is a diagram showing an example of error correction by correcting a data qubit other than the location where the error occurred. In Fig. 15, errors have occurred in two data qubits 64, 65. These data qubits 64, 65 are shifted by one row in the row direction and also by one row in the column direction. In this case, upon error detection, the state of the auxiliary qubit 66 adjacent above the data qubit 64 is inverted, and the state of the auxiliary qubit 67 adjacent to the right of the data qubit 65 is inverted. Note that the auxiliary qubit 70 adjacent below the data qubit 64 is adjacent to the left of the data qubit 65, so its state is not inverted.

[0103] At this time, an error occurrence pattern in which ancillary quantum bits 66 and 67 are inverted and the other ancillary quantum bits are not inverted is when an error occurs in data quantum bits 68 and 69, in addition to when an error occurs in data quantum bits 64 and 65. Here, it is assumed that the error correction operation is performed on data quantum bits 68 and 69, rather than on data quantum bits 64 and 65 in which the error occurred.

[0104] Then, loop 72 is formed by error-corrected data qubits 68, 69 and error-uncorrected data qubits 64, 65. Here, the formation of loop 72 means that a closed curve is formed when data qubits adjacent to the common auxiliary qubit for Z error detection are connected with a line among the erroneously corrected data qubits and the error-uncorrected data qubits. When correcting an X error, loop 72 is formed by connecting with a line data qubits adjacent to the common auxiliary qubit for Z error detection among the erroneously corrected data qubits and the error-uncorrected data qubits.

[0105] In the example of FIG. 15, the two uncorrected data qubits 64, 65 are both adjacent to the auxiliary qubit 70, and can therefore be connected by a line. The uncorrected data qubit 65 and the erroneously corrected data qubit 69 are both adjacent to the auxiliary qubit 67, and can therefore be connected by a line. The two erroneously corrected data qubits 68, 69 are both adjacent to the auxiliary qubit 71, and can therefore be connected by a line. The erroneously corrected data qubit 68 and the uncorrected data qubit 64 are both adjacent to the auxiliary qubit 66, and can therefore be connected by a line. As a result, the lines connecting the uncorrected data qubits 64, 65 and the erroneously corrected data qubits 68, 69 form a closed curve. That is, a loop 72 is formed.

[0106] Multiple loops may be formed. If all of the erroneously corrected data qubits and all of the error-uncorrected data qubits belong to any one of the loops, the logical quantum state is maintained in its original state (a state in which the data qubits in which errors have occurred have been correctly corrected). In other words, when a loop is formed, the error-uncorrected data qubits 64, 65 and the error-corrected data qubits 68, 69 are both mathematically in a state where the Z operator has acted on them, and they form a single stabilizer operator S = ZZZZ. Logical quantum state |ψ> L is the eigenstate of the stabilizer operator S (S|ψ> L =|ψ> L ), so the logical quantum state |ψ> L is kept at the eigenstates of the original eigenvalues.

[0107] In this way, in quantum error correction, it is sufficient if a loop is formed, even if the corrected location does not match the actual error location. 16 is a diagram showing examples of successful error correction patterns. Successful error correction pattern 75 is a case where the data quantum bit in which an error occurred and the corrected data quantum bit completely match. Successful error correction patterns 76 and 77 are a case where the error correction is successful due to a loop being formed between the data quantum bit in which the error has not been corrected and the data quantum bit that has been erroneously corrected. Thus, in order to successfully correct an error using a surface code, it is necessary that the correction location and the actual error location completely match or that a loop is formed.

[0108] Here, we focus on the number of corrected data qubits around the ancillary qubit. In a successful error correction state, an odd number of data qubits are corrected around the inverted ancillary qubit, and an even number of data qubits are corrected around the non-inverted ancillary qubit. This property is called the even-odd constraint.

[0109] For example, the number of data quantum bits corrected around the inverted ancillary quantum bits 75a and 75b in the error correction success pattern 75 is "1" (odd number). The number of data quantum bits corrected around the non-inverted ancillary quantum bit 75c is "0" (even number). The number of data quantum bits corrected around the inverted ancillary quantum bits 76a and 76b in the error correction success pattern 76 is "1" (odd number). The number of data quantum bits corrected around the non-inverted ancillary quantum bit 76c is "0" (even number). The number of data quantum bits corrected around the inverted ancillary quantum bits 77f and 77g in the error correction success pattern 77 is "1" (odd number). The number of data quantum bits corrected around the non-inverted ancillary quantum bits 77a to 77e is "2" (even number).

[0110] However, such an even-odd constraint is a necessary condition for successful error correction, but not a sufficient condition. In other words, even if the even-odd constraint is met after error correction, the error correction may fail. In that case, the sequence of data qubits that has been inverted due to an error or miscorrection does not form a loop, but is connected from one boundary to the opposite boundary. Mathematically, this is called the logical quantum state |ψ> L This is a state in which the logical Z operator Lz or the logical X operator Lx acts on this, and is called a logical error.

[0111] FIG. 17 is a diagram showing an example of a logical error due to miscorrection. In the error occurrence pattern 78 shown in FIG. 17, a Z error occurs in one data quantum bit 78a-78c on the same column. In this case, the state of an auxiliary quantum bit 78d-78h adjacent to any one of the data quantum bits 78a-78c on the same column is inverted. At this time, it is assumed that an error correction operation is performed on data quantum bits 78i-78k other than the data quantum bits 78a-78c in which the error occurred. Even with this type of error correction, the even-odd constraint is observed. However, the data quantum bits 78a-78c in which the error occurred do not match the corrected data quantum bits 78i-78k, and no loop is formed. That is, a logical error occurs due to miscorrection.

[0112] If a logical error occurs, correct calculations cannot be performed. The frequency with which logical errors occur in a surface code depends on the number of quantum bits that make up the logical quantum bit, the frequency with which errors occur in each quantum bit, and other factors. With an actual quantum computer, it is not possible to determine whether or not there is a logical error unless the data quantum bit itself is measured, and it is also not possible to grasp the frequency of occurrence. However, if a simulation of error correction with a surface code is performed using a classical computer, the location of the error can be known in advance, making it possible to determine whether or not a logical error has occurred. The occurrence of a logical error can be determined by searching for the connection (error chain) of the data quantum bits in which an error has occurred.

[0113] The usefulness of simulating surface codes will now be explained. At present, there are no quantum computers with 100 or more qubits. Therefore, it is currently not possible to verify large-scale quantum error correction using surface codes on an actual machine. However, in order to realize quantum computers with large-scale qubits in the future, it is important to start studying quantum error correction from now on. Therefore, at present, it is effective to reproduce large-scale quantum error correction using surface codes by simulation using a classical computer and verify the appropriateness of the error correction.

[0114] When performing a simulation of quantum error correction using a surface code (hereinafter referred to as a surface code simulation) assuming a large-scale quantum computer, it is desirable to be able to efficiently determine whether or not a logical error has occurred.

[0115] FIG. 18 is a diagram showing an example of logical error determination by searching an error chain. When simulating a surface code with a classical computer and determining a logical error, the computer searches whether an error chain is connected from one boundary to another boundary on a two-dimensional lattice. Specifically, if there is an inverted data quantum bit among the boundary data quantum bits, the computer first sets the data quantum bit as the starting point of the search. In the example of FIG. 18, data quantum bit 78a is the starting point of the search.

[0116] Next, starting from the starting data qubit 78a, the computer determines whether data qubits adjacent to the same ancillary qubit are inverted. If the state of a data qubit adjacent to the same ancillary qubit as the data qubit whose state is inverted is inverted, the computer connects that data qubit to an error chain. Finally, if the error chain is connected to data qubit 78i at the opposite boundary, the computer determines that a logical error has occurred.

[0117] When determining logical errors as shown in Figure 18, the more errors there are, the more searches are required. In addition, if the number of data quantum bits on one side of a two-dimensional lattice is N (N is a natural number), then when N is sufficiently large, the number of searches increases exponentially with N. As a result, when performing a large-scale surface code simulation, the time required to determine logical errors increases, and execution efficiency deteriorates.

[0118] Therefore, computer 100 according to the second embodiment determines the presence or absence of a logical error using only the state data of data quantum bits for one row of a two-dimensional lattice. 19 is a diagram showing an example of logical error determination based on state data of data quantum bits for one column of a two-dimensional lattice. Three error correction patterns are shown when an error similar to error occurrence pattern 78 shown in FIG. 17 occurs. Error correction success pattern 81-1 is an example when data correction is performed with perfect agreement for data quantum bits 81a to 81c in which an error occurs. Error correction success pattern 81-2 is an example in which data correction is performed for data quantum bits 81a and 81c in which an error occurs and data quantum bits 81d to 81f in which no error occurs, but the error correction is successful due to the formation of a loop. Error correction failure pattern 81-3 is an example of logical error occurrence due to data correction being performed for data quantum bits 81g to 81i in which no error occurs.

[0119] As shown in Figure 19, as a result of error correction, if the even-odd constraint is observed, the state of the data quantum bit will be one of the following. 1. The error qubit is fully corrected. 2. The inverted qubits (an uncorrected data qubit and a miscorrected data qubit) form a loop. 3. A logical error has occurred.

[0120] The computer investigates whether the number of inverted quantum bits among the data quantum bits in one column (columns 82a to 82c under investigation) of the two-dimensional lattice in Fig. 19 is an even number or an odd number. Note that the columns 82a to 82c under investigation are arbitrarily selected from columns in which data quantum bits exist on smooth boundaries, for example.

[0121] In the error correction success pattern 81-1, the number of inverted quantum bits in the column 82a under investigation is "0" (even number). In the error correction success pattern 81-2, the number of inverted quantum bits in the column 82b under investigation is "2" (even number). In the error correction failure pattern 81-3, the number of inverted quantum bits in the column 82c under investigation is "1" (odd number).

[0122] In this way, if the error correction is successful, the number of flipped quantum bits in the column under investigation will be an even number, and if a logical error occurs, the number of flipped quantum bits in the column under investigation will be an odd number. Therefore, computer 100 determines that a logical error has occurred when the number of flipped quantum bits in a vertical column is odd.

[0123] The reason why it is correct to determine that a logical error occurs when the number of inverted quantum bits in a vertical column is odd is as follows. Fig. 20 is a diagram for explaining that a logical error occurs when the number of inverted quantum bits in one vertical column is an odd number. Fig. 20 shows a state 83 in which a logical Z operator Lz acts on a two-dimensional lattice array, and a state 84 in which a logical X operator Lx acts on a two-dimensional lattice array.

[0124] Here, we define the logical quantum state as |ψ> L Then, through the generation and correction of Z errors, |ψ> L Let Az be the set of operators that act on A. In this case, whether a logical error has occurred can be determined by whether Az is equal to the logical Z operator Lz.

[0125] As mentioned above, the logical Z operator Lz has the following properties. ·Lz satisfies all stabilizer operators and commutations. ·Lz and Lx satisfy the anticommutation relation (LzLx=-LxLz).

[0126] If the even-odd constraint is satisfied, Az always satisfies a commutation relationship with all stabilizer operators. If Az satisfies an anticommutation relationship with the logical X operator Lx, then Az is said to be equal to Lz. For example, if the number of data qubits between the smooth boundaries is 3, then Lx = X1X2X3. For Az to satisfy the anticommutation relationship with Lx, it is required that Az = Z1, Az = Z2, Az = Z3, or Az = Z1Z2Z3. This indicates that the number of Z (= the number of inversion qubits) is odd.

[0127] The above explanation is about the method of determining logical errors in Z errors, but logical error determination in X errors can also be performed in a similar manner. In determining logical errors in X errors, logical errors are determined based on the data quantum bits in one row of the lattice (the row under investigation).

[0128] Fig. 21 is a diagram showing an example of data qubits used in logical error determination. In the example of Fig. 21, the rough boundaries are edges in the column direction, and the smooth boundaries are edges in the row direction. In this case, any one of the columns in which a data qubit exists on a smooth boundary becomes a column 85 to be examined to be used in logical error determination for a Z error. Also, any one of the rows in which a data qubit exists on a rough boundary becomes a row 86 to be examined to be used in logical error determination for an X error.

[0129] Below, a surface code simulation accompanied by logical error determination based on the number of inverted quantum bits will be specifically described. 22 is a block diagram showing the functions of a computer for performing a surface code simulation. The computer 100 has a storage unit 110, a surface code simulation management unit 120, an error occurrence state generation unit 130, an error correction unit 140, and a logical error determination unit 150.

[0130] The storage unit 110 stores simulation conditions 111 and simulation results 112. The simulation conditions 111 include information such as the size of a two-dimensional lattice, the error rate of a quantum bit, etc. The simulation results 112 include information such as the rate of occurrence of logical errors, etc.

[0131] The surface code simulation management unit 120 manages the progress of the surface code simulation. For example, it accepts input of simulation conditions 111 and stores the input simulation conditions 111 in the storage unit 110. In addition, the surface code simulation management unit 120 causes the error occurrence state generation unit 130, the error correction unit 140, and the logical error determination unit 150 to execute the surface code simulation a predetermined number of times. Furthermore, the surface code simulation management unit 120 stores the simulation result 112 in the storage unit 110.

[0132] The error occurrence state generating unit 130 generates an X error or a Z error in a data quantum bit in a two-dimensional lattice in accordance with the simulation condition 111. Furthermore, the error occurrence state generating unit 130 inverts the state of the ancillary quantum bit in response to the generated error.

[0133] The error correction unit 140 performs an error correction process based on the inverted state of the ancillary quantum bit. The error correction process inverts the state of the data quantum bit that is presumed to have had an error.

[0134] The logical error determination unit 150 determines whether or not the state of the logical quantum bit shown in the two-dimensional lattice after error correction has a logical error. The logical error determination unit 150 notifies the surface code simulation management unit 120 of the determination result.

[0135] Note that the lines connecting the elements shown in Fig. 22 indicate part of the communication paths, and communication paths other than those shown in the figure can also be set. The function of each element shown in Fig. 22 can be realized, for example, by having a computer execute a program module corresponding to that element.

[0136] Next, the procedure of the logical error determination process using the surface code simulation will be described in detail. 23 is a flow chart showing an example of a procedure for a logical error determination process using a surface code simulation. The process shown in FIG. 23 will be described below in order of step numbers.

[0137] [Step S101] The surface code simulation management unit 120 accepts an input of the simulation conditions 111 from the user. When the simulation conditions 111 are input, the surface code simulation management unit 120 stores the simulation conditions 111 in the storage unit 110.

[0138] [Step S102] The surface code simulation management unit 120 executes a surface code simulation in cooperation with the error occurrence state generation unit 130, the error correction unit 140, and the logical error determination unit 150. Details of the surface code simulation process will be described later (see FIG. 24). The surface code simulation provides information indicating whether or not a logical error occurs when error correction is performed using the surface code indicated in the simulation conditions 111.

[0139] [Step S103] The surface code simulation management unit 120 judges whether the surface code simulation has been repeated a predetermined number of times (for example, 10,000 times). If the number of repetitions reaches the predetermined number, the surface code simulation management unit 120 advances the process to step S104. If the number of repetitions does not reach the predetermined number, the surface code simulation management unit 120 advances the process to step S102.

[0140] [Step S104] The surface code simulation management unit 120 calculates the occurrence rate of logical errors based on the information indicating the presence or absence of logical errors obtained from a predetermined number of surface code simulations. The occurrence rate of logical errors is, for example, a value obtained by dividing the number of times that a logical error is determined to have occurred by the surface code simulation by the number of times the surface code simulation is repeated.

[0141] Furthermore, when there are multiple data correction patterns according to an error occurrence pattern, the surface code simulation can also determine whether or not a logical error occurs in each of the multiple data correction patterns according to one error occurrence pattern. In this case, the surface code simulation management unit 120 calculates, for example, the logical error occurrence rate for each error occurrence pattern. The logical error occurrence rate in this case is the proportion of data correction patterns determined to be a logical error among the multiple data correction patterns according to one error occurrence pattern. The surface code simulation management unit 120 calculates, for example, the average of the logical error occurrence rates for each of the multiple error occurrence patterns as the simulation result 112. Then, the surface code simulation management unit 120 stores the simulation result 112 including the logical error occurrence rate in the storage unit 110.

[0142] In this manner, the occurrence rate of logical errors according to the simulation conditions 111 is obtained. 24 is a diagram showing an example of the simulation conditions 111. The simulation conditions 111 include, for example, the following data. Data qubit state data: q i (i=1,...,N data ) (N data is the number of data qubits) · State data of auxiliary qubits: a i (i=1,...,N sub ) (N sub is the number of data qubits) ·Z error rate data: Rz ·X error rate data:Rx The Z error rate data is data that indicates the probability that a Z error occurs in a data quantum bit. The X error rate data is data that indicates the probability that an X error occurs in a data quantum bit.

[0143] Next, the surface code simulation process will be described in detail. Fig. 25 is a flow chart showing an example of a procedure for processing a surface code simulation. The processing shown in Fig. 25 will be described below in order of step numbers.

[0144] [Step S111] The surface code simulation manager 120 acquires the simulation conditions 111 from the storage unit 110. Based on the acquired simulation conditions 111, the surface code simulation manager 120 generates quantum bit information indicating a two-dimensional lattice in which quantum bits are arranged at equal intervals in the row and column directions within a rectangular region. The quantum bit information includes state data indicating the quantum state of each quantum bit. The surface code simulation manager 120 transmits the generated quantum bit information to the error occurrence state generator 130, and instructs the error occurrence state generator 130 to generate an error occurrence state for the data quantum bits in the two-dimensional lattice.

[0145] [Step S112] The error occurrence status generating unit 130 counts up the variable i from 1 to N. data The process of steps S113 to S115 is executed for each value of i until

[0146] [Step S113] The error occurrence status generation unit 130 generates a random number r that is greater than 0 and less than 1. [Step S114] The error occurrence state generation unit 130 judges whether the value of the random number r is smaller than Rz, which indicates the Z error rate. If the value of the random number r is smaller than Rz, the error occurrence state generation unit 130 advances the process to step S115. If the value of the random number r is equal to or greater than Rz, the error occurrence state generation unit 130 advances the process to step S116.

[0147] [Step S115] The error occurrence state generation unit 130 inverts the phase of the state of the i-th data quantum bit. In addition, the error occurrence state generation unit 130 generates state data of an auxiliary quantum bit for Z error detection adjacent to the data quantum bit whose phase has been inverted (for the j-th auxiliary quantum bit, j ) value (a j =-a j ).

[0148] [Step S116] The error occurrence status generating unit 130 checks whether the value of the variable i is N data If so, the process proceeds to step S117. [Step S117] The error occurrence status generating unit 130 counts up the variable i from 1 to N. data The process of steps S118 to S121 is executed for each value of i until

[0149] <Step S118> The error occurrence status generation unit 130 generates a random number r that is greater than 0 and less than 1. [Step S119] The error occurrence state generation unit 130 judges whether the value of the random number r is smaller than Rx indicating the X error rate. If the value of the random number r is smaller than Rx, the error occurrence state generation unit 130 proceeds to step S120. If the value of the random number r is equal to or greater than Rx, the error occurrence state generation unit 130 proceeds to step S121.

[0150] [Step S120] The error occurrence state generation unit 130 inverts the bit of the i-th data quantum bit. In addition, the error occurrence state generation unit 130 generates state data of an auxiliary quantum bit for X error detection adjacent to the data quantum bit whose bit has been inverted (for the j-th auxiliary quantum bit, j ) value (a j =-a j ).

[0151] [Step S121] The error occurrence status generating unit 130 checks whether the value of the variable i is N data If so, the process proceeds to step S122. [Step S122] Error correction unit 140 performs error correction processing on the data quantum bit based on the state data of the ancillary quantum bit. For example, error correction unit 140 identifies a data quantum bit in which a Z error or an X error has occurred, as shown in FIG. 14, based on the data quantum bit whose value has been inverted. Then, error correction unit 140 performs error correction processing on the data quantum bit in which an error is estimated to have occurred, according to the error that has occurred. For example, error correction unit 140 inverts the phase of the data quantum bit in which a Z error is estimated to have occurred, and inverts the bit of the data quantum bit in which an X error is estimated to have occurred.

[0152] [Step S123] The logical error checking unit 150 performs a logical error (Z error) checking process based on the number of inverted quantum bits in one column. The details of this process will be described later (see FIG. 26). [Step S124] The logical error checking unit 150 performs a logical error (X error) checking process based on the number of inverted quantum bits in one row. The details of this process will be described later (see FIG. 27).

[0153] In this way, the presence or absence of a logical error when errors are randomly generated in the data quantum bits is determined. Next, the logical error determination process based on the number of inverted quantum bits will be described in detail with reference to Figs. 26 and 27.

[0154] 26 is a flowchart illustrating an example of a procedure for a logical error (Z error) determination process. The process shown in FIG. 26 will be described below in order of step number. [Step S131] The logical error determination unit 150 calculates the state data q i (i=1,...,N cc ) is prepared. N cc is the number of data qubits in one row of the two-dimensional lattice.

[0155] [Step S132] The logical error determination unit 150 inverts the number of quantum bits N r Set to the initial value "0". [Step S133] The logical error determination unit 150 counts up the variable i from 1 to N. cc The process of steps S134 to S135 is executed for each value of i until it reaches i=0.

[0156] [Step S134] The logical error determination unit 150 calculates state data q i The logical error determination unit 150 determines whether the value of is "1". If the value is "1", the logical error determination unit 150 advances the process to step S135. If the value is "0", the logical error determination unit 150 advances the process to step S136.

[0157] [Step S135] The logical error determination unit 150 determines the number of inverted quantum bits N r Add "1" to. [Step S136] The logical error determination unit 150 checks whether the value of the variable i is N cc If so, the process proceeds to step S137.

[0158] [Step S137] The logical error determination unit 150 determines the number of inverted quantum bits N r The logical error determination unit 150 determines whether or not is an odd number. If it is an odd number, the logical error determination unit 150 advances the process to step S138. If it is an even number, the logical error determination unit 150 advances the process to step S139.

[0159] [Step S138] The logical error determination section 150 determines that a logical error has occurred, and ends the logical error determination process. <Step S139> The logical error determining section 150 determines that a logical error has not occurred.

[0160] The above is the logical error determination process for Z errors. Next, the logical error determination process for X errors will be described in detail. 27 is a flowchart illustrating an example of a procedure for a logical error (X error) determination process. The process shown in FIG. 27 will be described below in order of step numbers.

[0161] [Step S141] The logical error determination unit 150 calculates the state data q i (i=1,...,N cr ) is prepared. N cr is the number of data qubits in one row of the two-dimensional lattice.

[0162] [Step S142] The logical error determination unit 150 inverts the number of quantum bits N r Set to the initial value "0". [Step S143] The logical error determination unit 150 counts up the variable i from 1 to N. cr The process of steps S144 to S145 is executed for each value of i until it reaches i=0.

[0163] [Step S144] The logical error determination unit 150 calculates state data q i The logical error determination unit 150 determines whether the value of is "1". If the value is "1", the logical error determination unit 150 advances the process to step S145. If the value is "0", the logical error determination unit 150 advances the process to step S146.

[0164] [Step S145] The logical error determination unit 150 determines the number of inverted quantum bits N r Add "1" to. [Step S146] The logical error checker 150 checks whether the value of the variable i is N cr If so, the process proceeds to step S147.

[0165] [Step S147] The logical error determination unit 150 inverts the number of inverted quantum bits N r The logical error determination unit 150 determines whether or not is an odd number. If it is an odd number, the logical error determination unit 150 proceeds to step S148. If it is an even number, the logical error determination unit 150 proceeds to step S149.

[0166] [Step S148] The logical error determination section 150 determines that a logical error has occurred, and ends the logical error determination process. [Step S149] The logical error determining section 150 determines that a logical error has not occurred.

[0167] The above process is the logical error determination process for the X error. In this way, the logical error determination section 150 can determine the presence or absence of a logical error simply by checking the values ​​of data quantum bits in one column or one row of the two-dimensional lattice, thereby enabling efficient logical error determination.

[0168] FIG. 28 is a graph showing the relationship between the number of data quantum bits on one side of a two-dimensional lattice and the number of searches. In graph 90, the horizontal axis is the number of data quantum bits N on one side of the two-dimensional lattice, and the vertical axis is the number of searches. The number of searches is counted as one each time the state of one data quantum bit is confirmed. Line 91 in graph 90 is a line showing the number of searches when logical error determination is performed by searching an error chain as shown in FIG. 18. Approximation curve 92 is an approximation curve for line 91 when logical error determination is performed by searching an error chain. Approximation curve 92 is expressed as y=2 1.13x It is an exponential function of . The line shows the number of searches when logical error detection is performed based on the number of inverted quantum bits in one column (or one row) of a two-dimensional lattice. If the horizontal axis is x and the vertical axis is y, line 93 can be expressed as a straight line y = x + 1.

[0169] The example in Figure 28 shows the number of searches for each logical error judgment when the number of data quantum bits on one side, N, is 2 to 10. The error probability under the simulation conditions is 20%. As shown in Figure 28, in the error chain search, the number of searches increases exponentially with N, whereas in the logical error judgment based on the number of inverted quantum bits, the number of searches increases as a linear function of N.

[0170] As described above, by determining whether a logical error has occurred based on the number of inverted quantum bits, it is possible to quickly determine whether a logical error has occurred. In other words, if the number of data quantum bits on one side of a two-dimensional lattice is N, it is possible to reduce the number of searches from an exponential function of N to a linear function. For example, in the case of 40 quantum bits, when processed by a processor with a clock speed of 1 GHz, the processing time in an error chain is 2 1.13×40 ×10 -9 On the other hand, by detecting logical errors using the number of inverted quantum bits, the processing time is reduced to 40 + 1 = 41 (nsec).

[0171] Other embodiments In the second embodiment, the logical quantum bit is composed of quantum bits arranged in a two-dimensional lattice of 5 rows and 11 columns, but even if the number of rows or columns changes, logical errors can be determined using the same process.

[0172] The foregoing merely illustrates the principles of the present invention. Further, since numerous modifications and changes are possible to those skilled in the art, the present invention is not limited to the exact construction and application shown and described above, and all corresponding modifications and equivalents are deemed to be within the scope of the present invention according to the appended claims and their equivalents. [Explanation of symbols]

[0173] 1 Quantum bit information 10. Information processing device 11 Storage section 12 Processing section

Claims

1. generating quantum bit information indicative of a two-dimensional lattice in which a plurality of data quantum bits and a plurality of auxiliary quantum bits are alternately arranged in rows and columns; setting error information indicating an error occurrence in a first data quantum bit of the plurality of data quantum bits for the quantum bit information; For the quantum bit information, set error detection information in which a state of an auxiliary quantum bit adjacent to the first data quantum bit in a row direction or a column direction is inverted from an initial value; setting error correction information indicating a second data quantum bit to be subjected to error correction by a surface code based on the error detection information for the quantum bit information; determining whether or not a logical error has occurred based on the number of data quantum bits corresponding to either the first data quantum bit or the second data quantum bit in one row or one column of the two-dimensional lattice; A simulation program that causes a computer to execute processing.

2. In determining whether or not a logical error has occurred, it is determined that the logical error has occurred when a number of data quantum bits corresponding to either the first data quantum bit or the second data quantum bit in a row or a column in the two-dimensional lattice is odd. The simulation program according to claim 1.

3. In the generation of the quantum bit information, the quantum bit information is generated which indicates the two-dimensional lattice in which columns in which auxiliary quantum bits for phase inversion error detection are arranged and columns in which auxiliary quantum bits for bit inversion error detection are arranged are alternately arranged; In determining whether or not a logical error has occurred, the presence or absence of the logical error caused by a phase inversion error is determined based on the number of data quantum bits corresponding to either the first data quantum bit or the second data quantum bit in one row or one column in a direction parallel to a boundary on which the auxiliary quantum bit for detecting a bit inversion error is arranged, among the four boundaries of the two-dimensional lattice. The simulation program according to claim 1 or 2.

4. In the generation of the quantum bit information, the quantum bit information is generated which indicates the two-dimensional lattice in which columns in which auxiliary quantum bits for phase inversion error detection are arranged and columns in which auxiliary quantum bits for bit inversion error detection are arranged are alternately arranged; In determining whether or not a logical error has occurred, the presence or absence of the logical error caused by a bit inversion error is determined based on the number of data quantum bits corresponding to either the first data quantum bit or the second data quantum bit in one row or one column in a direction parallel to a boundary on which the auxiliary quantum bit for detecting a phase inversion error is arranged, among the four boundaries of the two-dimensional lattice. A simulation program according to any one of claims 1 to 3.

5. In setting the error information, the first data quantum bit in which an error is to be generated is randomly determined from among the plurality of data quantum bits based on a predetermined error occurrence rate; repeating the steps of setting the error information, setting the error detection information, setting the error correction information, and determining whether or not a logical error has occurred a predetermined number of times; A simulation program according to any one of claims 1 to 4.

6. The computer includes: calculating a logical error occurrence probability based on a result of determining whether or not the logical error has occurred the predetermined number of times; 6. The simulation program according to claim 5, which executes processing.

7. generating quantum bit information indicative of a two-dimensional lattice in which a plurality of data quantum bits and a plurality of auxiliary quantum bits are alternately arranged in rows and columns; setting error information indicating an error occurrence in a first data quantum bit of the plurality of data quantum bits for the quantum bit information; For the quantum bit information, set error detection information in which a state of an auxiliary quantum bit adjacent to the first data quantum bit in a row direction or a column direction is inverted from an initial value; setting error correction information indicating a second data quantum bit to be subjected to error correction by a surface code based on the error detection information for the quantum bit information; determining whether or not a logical error has occurred based on the number of data quantum bits corresponding to either the first data quantum bit or the second data quantum bit in one row or one column of the two-dimensional lattice; A simulation method in which processing is performed by a computer.

8. a processing unit that generates quantum bit information indicating a two-dimensional lattice in which a plurality of data quantum bits and a plurality of auxiliary quantum bits are alternately arranged in each of row and column directions, sets, for the quantum bit information, error information indicating an error occurrence in a first data quantum bit of the plurality of data quantum bits, sets, for the quantum bit information, error detection information in which a state of an auxiliary quantum bit adjacent to the first data quantum bit in the row direction or column direction is inverted from an initial value, and sets, for the quantum bit information, error correction information indicating a second data quantum bit that is to be subject to error correction by a surface code based on the error detection information, and determines whether or not a logical error has occurred based on the number of data quantum bits corresponding to either the first data quantum bit or the second data quantum bit in a row or a column in the two-dimensional lattice; An information processing device having the above configuration.

Citation Information

Patent Citations

  • Quantum error correction method, quantum error correction device and quantum information storage device

    JP2014241484A

  • quantum error correction

    JP2020535690A

  • Using flag qubits for fault-tolerant implementations of topological codes with reduced frequency collisions

    US20210019223A1