Quantum circuit design program, quantum circuit design method, and quantum circuit design device
The quantum circuit design method addresses errors in quantum calculations by converting multiple-qubit gates into symmetric equivalent circuits, enhancing the accuracy of quantum algorithms by balancing gate operations across qubits.
Patent Information
- Application Number
- JP2023570516
- Authority / Receiving Office
- JP · JP
- Patent Type
- Patents
- Current Assignee / Owner
- Filing Date
- 2021-12-27
- Publication Date
- 2024-11-14
- Estimated Expiration
- 2041-12-27
AI Technical Summary
Quantum calculations in quantum computers are prone to errors due to noise in gate operations, particularly affecting qubits with a higher number of gate operations, which biases the error occurrence and affects the accuracy of calculations.
A quantum circuit design method that converts multiple-qubit gates into equivalent circuits using symmetric arrangements of one-qubit or two-qubit gates, reducing the bias in gate operations across qubits and minimizing the impact of noise.
Reduces errors in quantum calculations by balancing the number of gate operations across qubits, thereby improving the accuracy and reliability of quantum algorithms like Grover's algorithm.
Smart Images

Figure 0007583339000010 
Figure 0007583339000011 
Figure 0007583339000012
Abstract
Description
[Technical field]
[0001] The present invention relates to a quantum circuit design program, a quantum circuit design method, and a quantum circuit design device. [Background technology]
[0002] There are quantum computers that use quantum properties to perform calculations faster than classical computers. Quantum gate-based quantum computers perform quantum calculations by performing gate operations on quantum bits in the order shown in the quantum circuit.
[0003] One example of a quantum algorithm that can be executed by a quantum computer using quantum gates is Grover's algorithm for searching data. For example, when searching for one piece of data from N pieces of data (N is a natural number), the average number of calculations required by a classical computer is N / 2, whereas Grover's algorithm requires only N 1 / 2 It can be searched in one operation.
[0004] For example, automated techniques have been proposed for optimizing quantum circuits of sizes and types expected for quantum computing, random interference gates that perform random interference operations on vectors of an input set according to the Grover quantum search algorithm, and the compilation of quantum algorithms into optimized physical-level circuits that can be run in quantum information processing experiments using atomic ions. [Prior art documents] [Patent documents]
[0005] [Patent Document 1] Special Publication No. 2021-503116 [Patent Document 2] Special Publication No. 2003-526855 [Non-patent literature]
[0006] [Non-Patent Document 1] Dmitri Maslov, “Basic circuit compilation techniques for an ion-trap quantum Machine” New Journal of Physics, Volume 19, February 2017 Summary of the Invention [Problem to be solved by the invention]
[0007] A quantum bit is realized by using, for example, superconductivity or an ion trap. In addition, in a gate operation on a quantum bit, a quantum computer irradiates the quantum bit with, for example, microwaves. Noise contained in such a gate operation on a quantum bit can cause errors in quantum calculations.
[0008] In one aspect, the present invention aims to reduce errors in quantum computing. [Means for solving the problem]
[0009] In one proposal, a quantum circuit design program is provided that causes a computer to execute the following processes. The computer detects a first element indicating a predetermined operation on a plurality of first quantum bits among the plurality of quantum bits and a second element indicating a predetermined operation on the plurality of first quantum bits from a first quantum circuit including a plurality of elements, the first element indicating a predetermined operation on the plurality of first quantum bits, and the second element indicating a predetermined operation on the plurality of first quantum bits.The computer then converts the first element of the first quantum circuit into a first equivalent circuit for ion operation corresponding to the plurality of first quantum bits, and generates a second quantum circuit in which the second element is converted into a second equivalent circuit arranged by symmetrically moving the element of the first equivalent circuit in the arrangement direction of the plurality of first quantum bits. Effect of the Invention
[0010] According to one embodiment, errors in quantum computing can be reduced. 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]
[0011] [Figure 1] FIG. 1 is a diagram illustrating an example of a quantum circuit design method according to a first embodiment. [Diagram 2] FIG. 1 illustrates an example of a system configuration according to a second embodiment; [Diagram 3] FIG. 2 is a diagram illustrating an example of the hardware configuration of a control computer. [Figure 4] FIG. 13 is a diagram showing an example of a change in probability amplitude according to Grover's algorithm. [Diagram 5] FIG. 1 is a diagram showing an example of a quantum circuit that executes Grover's algorithm with three quantum bits. [Figure 6] FIG. 1 is a diagram showing an example of an equivalent circuit of a CCZ gate for a superconducting quantum computer. [Figure 7] FIG. 1 is a diagram showing an example of an equivalent circuit of a CX gate using an XX gate. [Figure 8] FIG. 1 is a diagram showing a first example of an equivalent circuit of a CCZ gate using an XX gate. [Figure 9] FIG. 13 is a diagram showing an example of the relationship between quantum computation results and noise when a CCZ gate is replaced with the same equivalent circuit. [Figure 10] FIG. 2 is a block diagram showing an example of functions of a control computer. [Figure 11] FIG. 11 is a diagram illustrating an example of conversion information. [Figure 12] FIG. 1 is a diagram showing an example of a quantum circuit after conversion when performing quantum computation using a superconducting quantum computer. [Figure 13] FIG. 13 is a diagram showing a second example of an equivalent circuit of a CCZ gate using an XX gate. [Figure 14] FIG. 13 is a diagram showing an example of a quantum circuit after conversion when performing quantum computation with an ion trap quantum computer. [Figure 15] FIG. 13 is a diagram showing an example of conversion processing of a CCX gate. [Figure 16] FIG. 13 is a diagram illustrating an example of conversion processing of a CnNOT gate. [Figure 17] FIG. 1 is a diagram illustrating an example of an equivalent circuit of a CnNOT gate. [Figure 18] 13 is a flowchart illustrating an example of a procedure for quantum circuit conversion processing. [Figure 19] FIG. 1 is a diagram showing an example of the relationship between quantum computing results and noise (part 1). [Figure 20] FIG. 13 is a diagram showing a third example of an equivalent circuit of a CCZ gate using an XX gate. [Figure 21] FIG. 13 is a diagram showing a fourth example of an equivalent circuit of a CCZ gate using an XX gate. [Figure 22] FIG. 13 is a diagram showing a fifth example of an equivalent circuit of a CCZ gate using an XX gate. [Figure 23] FIG. 13 is a diagram showing a sixth example of an equivalent circuit of a CCZ gate using an XX gate. [Figure 24] FIG. 2 is a diagram (part 2) showing an example of the relationship between quantum computing results and noise. [Diagram 25] FIG. 3 is a diagram showing an example of the relationship between quantum computing results and noise (part 3). [Figure 26] FIG. 4 is a diagram showing an example of the relationship between quantum computing results and noise (part 4). [Figure 27] FIG. 5 is a diagram showing an example of the relationship between quantum computing results and noise (part 5). [Figure 28] FIG. 1 is a diagram showing an example of a quantum circuit that executes Grover's algorithm with 6 qubits. [Figure 29] FIG. 13 is a diagram showing an example of transformation of a CCX gate in an equivalent circuit of a C5NOT gate. [Diagram 30] FIG. 6 is a diagram showing an example of the relationship between quantum computing results and noise (part 6). [Diagram 31] FIG. 7 is a diagram showing an example of the relationship between quantum computing results and noise (part 7). DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0012] 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 First, a first embodiment will be described. The first embodiment is a quantum circuit design method capable of reducing errors in quantum calculations in a trap-ion quantum computer.
[0013] Fig. 1 is a diagram showing an example of a quantum circuit design method according to a first embodiment. Fig. 1 shows a quantum circuit design device 10 that implements a quantum circuit design method capable of reducing errors in quantum computation. The quantum circuit design device 10 can implement the quantum circuit design method capable of reducing errors in quantum computation by, for example, executing a quantum circuit design program.
[0014] The quantum circuit design device 10 has a processing unit 11. The processing unit 11 is, for example, a processor or an arithmetic circuit included in the quantum circuit design device 10. The processing unit 11 generates a second quantum circuit by converting elements included in the first quantum circuit 1. The first quantum circuit 1 is a quantum circuit including a plurality of elements, and has a quantum bit q 0 ,q 1 ,q 2 The order of operations on each is shown by the arrangement of each of the multiple elements in the quantum circuit. For example, the first quantum circuit 1 has a quantum bit q 0 ,q 1 ,q 2 In the first quantum circuit 1, the quantum bit q 0 The corresponding line, qubit q 1 The corresponding line, qubit q 2 On each line of the first quantum circuit 1, an element indicating an operation on the quantum state of the corresponding quantum bit is placed. In the first quantum circuit 1, the element indicating the operation to be performed first is placed further to the left.
[0015] The elements arranged in the first quantum circuit 1 include, for example, an H gate, an X gate, a CCZ gate, and a measurement. Here, the CCZ gate is arranged by setting two control bits and one target bit. The CCZ gate indicates that when the two control bits are "1", a Z gate is applied to one target bit (phase inversion). Note that the CCZ gate is equivalent regardless of the combination of two control bits and one target bit set from three quantum bits.
[0016] The processing unit 11 detects a quantum bit q included in the first quantum circuit 1. 0 ,q 1 ,q 2 1 detects a first element 1a indicating a predetermined operation on a plurality of first quantum bits among the three quantum bits q 0 ,q 1 ,q 2 The qubit q depends on two control bits 0 ,q 1 ,q 2 That is, the processing unit 11 inverts the phase of one target bit of the quantum bit q 0 ,q 1 ,q 2 Detect two CCZ gates for.
[0017] Then, the processing unit 11 converts the first element 1a in the first quantum circuit 1 into a first equivalent circuit 2, and converts the second element 1b into a second equivalent circuit 3 arranged by moving the elements of the first equivalent circuit 2 symmetrically in the arrangement direction of the multiple first quantum bits to generate a second quantum circuit. The quantum gates included in the first equivalent circuit 2 are two-qubit gates 2a to 2e or one-qubit gates. Similarly, the quantum gates included in the second equivalent circuit 3 are two-qubit gates 3a to 3e or one-qubit gates. Since the number of qubits to be operated by each quantum gate in the first equivalent circuit 2 and the second equivalent circuit 3 is two or less, it becomes possible to operate the qubits according to each of the first equivalent circuit 2 and the second equivalent circuit 3.
[0018] The first equivalent circuit 2 is an equivalent circuit for ion manipulation corresponding to a quantum bit in a trap-ion quantum computer. An XX gate is used for ion manipulation corresponding to a quantum bit in a trap-ion quantum computer. The XX gate is a gate that indicates an operation of simultaneously rotating the state of two quantum bits by a predetermined angle around the X axis.
[0019] For example, the processing unit 11 detects a quantum bit q included in the first quantum circuit 1. 0 ,q 1 ,q 2 The CCZ gate for XX gate, R x Gate, R y Gate, R z Gate, T Gate, and T † This is a combination of gates, and is converted into the first equivalent circuit 2, which is equivalent to the CCZ gate. R x The gate is a gate that indicates the operation of rotating around the X axis by an arbitrary angle. y The gate represents an operation of rotating an object by any angle around the Y axis. z The T gate is a gate that indicates an operation of rotating an object by any angle around the Z axis. The T gate is a gate that indicates an operation of rotating an object by 45 degrees around the Z axis. † The gate is a gate that demonstrates a rotation operation with the rotation direction reversed to that of a T-gate.
[0020] In addition, the processing unit 11 converts the quantum bit q included in the first quantum circuit 1 into the first equivalent circuit 2, which is different from the CCZ gate. 0 ,q 1 ,q 2 The CCZ gate for qubit q 1 The elements of the first equivalent circuit 2 are transformed into a second equivalent circuit 3, which is arranged by symmetrically moving the elements of the first equivalent circuit 2 around the line corresponding to the line.
[0021] In this way, the processing unit 11 calculates the quantum bit q 0 ,q 1 ,q 2 A quantum bit q included in a first quantum circuit 1, which indicates the operation order for each by the arrangement of elements 0 ,q1 ,q 2 The processing unit 11 detects gates (first element 1a and second element 1b) that indicate a predetermined operation on a plurality of first quantum bits among the first quantum bits. The processing unit 11 then converts the first element 1a in the first quantum circuit 1 into a first equivalent circuit 2, and generates a second quantum circuit by converting the second element 1b into a second equivalent circuit 3 arranged by symmetrically moving the elements of the first equivalent circuit 2 in the arrangement direction of the plurality of first quantum bits.
[0022] In quantum computing, noise contained in the gate operation to the quantum bit may cause an error in each quantum bit, so if there is a bias in the number of gate operations for each quantum bit, the quantum bit with a large number of gate operations is more likely to cause an error. In the second quantum circuit, the second equivalent circuit 3 is arranged by symmetrically moving the elements of the first equivalent circuit 2 in the arrangement direction of the multiple first quantum bits, so there is little bias in the number of gate operations for each quantum bit. Therefore, by the ion trap quantum computer operating the quantum bits according to the second quantum circuit, it is possible to reduce the bias of the quantum bits affected by noise. Therefore, the quantum circuit design device 10 can reduce errors in quantum computing.
[0023] The predetermined operation is an operation of inverting the phase of one target bit of the first quantum bits according to two control bits of the three first quantum bits. The predetermined operation is, for example, a CCZ gate. This allows the quantum circuit design device 10 to reduce errors in quantum computation including the CCZ gate.
[0024] The processing unit 11 may convert a third element that inverts one target bit of the first quantum bits according to two control bits of the first quantum bits into a third equivalent circuit including a predetermined operation. The third element is, for example, a CCX gate. This allows the quantum circuit design device 10 to reduce errors in quantum computation including the CCX gate.
[0025] The processing unit 11 may also convert a fourth element that inverts one target bit of the second quantum bit in response to three or more control bits of the second quantum bit including the first quantum bit into a fourth equivalent circuit including the third element. The fourth element is, for example, a CnNOT gate. This allows the quantum circuit design device 10 to reduce errors in quantum computation including the CnNOT gate.
[0026] Second Embodiment Next, a second embodiment will be described. The second embodiment is a system in which an ion trap type quantum computer performs quantum calculations according to a quantum circuit.
[0027] FIG. 2 is a diagram showing an example of a system configuration of the second embodiment. The quantum computer 300 is an ion trap type quantum computer. The ion trap type quantum computer 300 is one of the gate type quantum computers. The quantum computer 300 has a control computer 100 and a quantum bit control device 200. The control computer 100 is connected to terminal devices 31, 32, . . . via a network 20. The terminal devices 31, 32, . . . are computers used by users who request quantum calculations by the quantum computer 300. The control computer 100 receives quantum circuits from the terminal devices 31, 32, . . . The quantum circuit indicates the order of operations on quantum bits by the arrangement of elements such as gates. The quantum bit is a bit that can express a superposition state of the "0" state and the "1" state.
[0028] The control computer 100 instructs the quantum bit control device 200 to control quantum bits in accordance with the quantum circuits received from the terminal devices 31, 32, .... The control computer 100 also obtains measurement results of each quantum bit from the quantum bit control device 200.
[0029] The quantum bit control device 200 has a plurality of quantum bits and a device for manipulating each of the plurality of quantum bits. For example, the quantum bit control device 200 has a laser signal generator 210 and a dilution cooler 220. The laser signal generator 210 outputs a plurality of laser beams 223 according to an instruction from the control computer 100. The dilution cooler 220 confines a plurality of ions (charged particles) 222 in free space using an electromagnetic field. The dilution cooler 220 keeps the plurality of ions 222 in a state cooled to an extremely low temperature. Each of the plurality of ions 222 is irradiated with the laser beam 223 output from the laser signal generator 210. The state of each of the plurality of ions 222 is observed by a photodetector 221 provided in the dilution cooler 220.
[0030] Each of the multiple ions 222 corresponds to a quantum bit, and the state of each of the multiple ions 222 represents the state of the corresponding quantum bit. After measuring the state of each of the multiple quantum bits, the quantum bit control device 200 transmits the measurement result to the control computer 100.
[0031] FIG. 3 is a diagram showing an example of the hardware configuration of a control computer. The entire control computer 100 is controlled by a CPU (Central Processing Unit) 101. The CPU 101 is a processor that executes program instructions. The CPU 101 may include multiple processor cores. The CPU 101 may also be multiple processors, or may be an MPU (Micro Processing Unit) or a DSP (Digital Signal Processor). At least a part of the functions that the CPU 101 realizes by executing a program may be realized by an electronic circuit such as an ASIC (Application Specific Integrated Circuit) or a PLD (Programmable Logic Device). A RAM (Random Access Memory) 102 and multiple peripheral devices are connected to the CPU 101 via a bus 110.
[0032] The RAM 102 is a main storage device of the control computer 100. The RAM 102 temporarily stores at least a part of the OS (Operating System) program and application programs executed by the CPU 101. The RAM 102 also stores various data used for processing by the CPU 101. The control computer 100 may include a type of memory other than a RAM, or may include multiple memories.
[0033] The peripheral devices connected to the bus 110 include a hard disk drive (HDD) 103 , a graphics processing unit (GPU) 104 , an input interface 105 , an optical drive device 106 , device connection interfaces 107 and 108 , and a network interface 109 .
[0034] The HDD 103 is an auxiliary storage device of the control computer 100. The HDD 103 magnetically writes and reads data to and from a built-in magnetic disk. The HDD 103 stores an OS program, application programs, and various data. The control computer 100 may be provided with other types of auxiliary storage devices, such as a flash memory or an SSD (Solid State Drive), or may be provided with multiple auxiliary storage devices.
[0035] 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 CPU 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.
[0036] 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 CPU 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, a trackball, etc.
[0037] The optical drive device 106 uses a laser beam or the like to read data recorded on 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.
[0038] The device connection interface 107 is a communication interface for connecting peripheral devices to the control 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.
[0039] The device connection interface is a communication interface for connecting the quantum bit control device 200 to the control computer 100. The control computer 100 transmits instructions for controlling the quantum bit to the quantum bit control device 200 via the device connection interface .
[0040] The network interface 109 is connected to the network 20. The network interface 109 transmits and receives data via the network 20 to and from other computers or communication devices.
[0041] The control computer 100 can realize the processing function of the second embodiment by the above-mentioned hardware configuration. The quantum circuit design device 10 shown in the first embodiment can also be realized by the same hardware as the control computer 100 shown in Fig. 3. The CPU 101 is an example of the processing unit 11 shown in the first embodiment.
[0042] The control computer 100 realizes the processing function of the second embodiment by executing a program recorded in, for example, a computer-readable recording medium. The program describing the processing contents to be executed by the control computer 100 can be recorded in various recording media. For example, the program to be executed by the control computer 100 can be stored in the HDD 103. The CPU 101 loads at least a part of the program in the HDD 103 into the RAM 102 and executes the program. The program to be executed by the control 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 HDD 103 under the control of, for example, the CPU 101. The CPU 101 can also read out the program directly from the portable recording medium and execute it.
[0043] In the second embodiment, the quantum computer 300 executes quantum computation. An example of a quantum algorithm that the quantum computer 300 can execute is Grover's algorithm.
[0044] FIG. 4 is a diagram showing an example of a change in probability amplitude by Grover's algorithm. In Grover's algorithm, the following inversion and amplification process of the probability amplitude is performed N 1 / 2By repeating this process times, it is possible to search for the correct data from N pieces of data.
[0045] Graph 41 shows the ground state x 1 ,x 2 ,x 3 ,x 4 In the superposition of states, the ground state x 1 ~x 4 The probability amplitudes of each are shown. Note that the ground state x 1 ~x 4 correspond to the data to be searched. In graph 41, the ground state x 1 ~x 4 The probability amplitude of each is N -1 / 2 It is.
[0046] In the inversion process of Grover's algorithm, the oracle U f applies. Oracle U f is expressed by the following equation (1).
[0047]
number
[0048] Graph 42 shows the ground state x shown in graph 41. 1 ~x 4 For the superposition state of f When is applied, the ground state x 1 ~x 4 The probability amplitudes of each are shown. The ground state corresponding to the correct data is the ground state x 3 In graph 42, the ground state x 1 ~x 4 The ground state x 3 Only in this case, the sign of the probability amplitude is reversed with respect to graph 41.
[0049] In the amplification process of Grover's algorithm, -W shown in the following equation (2) is applied.
[0050]
number
[0051] Next, a specific example of executing the Grover algorithm with three quantum bits will be described. The state |ψ> of the superposition of states represented by three quantum bits is expressed by the following formula (3).
[0052]
number
[0053]
number
[0054]
number
[0055]
number
[0056]
number
[0057] Next, a quantum circuit for causing the quantum computer 300 to execute Grover's algorithm will be described. 5 is a diagram showing an example of a quantum circuit that executes the Grover algorithm with three quantum bits. The quantum circuit 50 is a quantum bit q 0,q 1 ,q 2 The order of operations for each is shown. Quantum circuit 50 operates on quantum bit q 0 ,q 1 ,q 2 In quantum circuit 50, from the top, quantum bits q 0 The corresponding line, qubit q 1 The corresponding line, qubit q 2 In quantum circuit 50, elements that indicate operations that are performed first are placed further to the left.
[0058] Quantum bit q of quantum circuit 50 0 ,q 1 ,q 2 The blocks labeled H arranged on the corresponding lines indicate H gates (Hadamard gates). The H gates indicate an operation for creating a superposition state. In addition, the quantum bit q 0 ,q 1 ,q 2 The blocks marked with X and placed on the corresponding lines represent X gates, which represent the operation of inverting the quantum bit corresponding to the line on which they are placed.
[0059] In addition, the quantum bit q of the quantum circuit 50 0 ,q 1 ,q 2 The blocks marked with Z are arranged on the corresponding lines, and are connected to the blocks marked with Z by lines, forming quantum bits q 0 ,q 1 ,q 2 The two dots arranged on the corresponding lines indicate a CCZ gate. The block marked Z is arranged on the line corresponding to the quantum bit that is the target bit of the CCZ gate, and the two dots are arranged on the lines corresponding to the quantum bits that are the two control bits of the CCZ gate. The CCZ gate indicates that when the two control bits are "1", a Z gate is applied to one target bit (phase is inverted).
[0060] The CCZ gate is equivalent for any combination of two control bits and one target bit out of three qubits. 1 ,q 2 is the control bit, and the quantum bit q 0 The CCZ gate with target bit q 0 ,q 2 is the control bit, and the quantum bit q 1 can be replaced by a CCZ gate with the target bit q 1 ,q 2 is the control bit, and the quantum bit q 0 The CCZ gate with target bit q 0 ,q 1 is the control bit, and the quantum bit q 2 may be replaced by a CCZ gate with the target bit q 0 ,q 1 ,q 2 A CCZ gate with two control bits and one target bit set from 0 ,q 1 ,q 2 This is sometimes called a CCZ gate.
[0061] Quantum bit q of quantum circuit 50 0 ,q 1 ,q 2 The blocks with semicircular arcs and straight lines on their corresponding lines represent measurements. 0 ,q 1 ,q 2 are determined to be in the "0" or "1" state, respectively.
[0062] At the left end of quantum circuit 50 is a quantum bit q 0 ,q 1 ,q 2 The first operation shown in quantum circuit 50 is to 0 ,q 1,q 2 By applying the H gate to each of them, the quantum bit q 0 ,q 1 ,q 2 is in a superposition state (initialized) as shown in equation (3). In the quantum circuit 50, a combination of an X gate and a CCZ gate, which indicates a process of applying an oracle, is placed to the right of the H gate, which indicates initialization. In the quantum circuit 50, a combination of an H gate, an X gate, and a CCZ gate, which indicates an amplification process, is placed to the right of the combination of gates which indicates an oracle. In the quantum circuit 50, a combination of a quantum bit q 0 ,q 1 ,q 2 The observations shown in quantum circuit 50 output the results of one inversion amplification process of Grover's algorithm.
[0063] Note that quantum computer 300 may have devices that perform gate operations on two or less quantum bits, but may not have devices that can perform gate operations on three or more quantum bits. Thus, a gate for three quantum bits, such as a CCZ gate, is converted into an equivalent circuit that combines gates for two quantum bits or one quantum bit.
[0064] 6 is a diagram showing an example of an equivalent circuit of a CCZ gate for a superconducting quantum computer. 0 ,q 1 ,q 2 The quantum circuit is equivalent to a CCZ gate for q, and combines gates for two qubits or one qubit. 0 ,q 1 ,q 2 The blocks marked with T on the corresponding lines indicate T gates. The T gates indicate an operation of rotating the phase by a predetermined value. 0 ,q 1 ,q 2 T placed on the corresponding line †The block marked with is T † Indicates a gate. T † The gate indicates an operation of rotating the phase by a predetermined value in the opposite direction to the T gate.
[0065] In addition, the quantum bit q 0 ,q 1 ,q 2 The symbols that combine a circle and a + on the corresponding line are connected to the corresponding symbols by a line, and the quantum bit q 0 ,q 1 ,q 2 The dots on the corresponding lines indicate CNOT gates. The symbol combining a circle and a + is placed on the line corresponding to the quantum bit that is the target bit of the CNOT gate, and the dots are placed on the line corresponding to the quantum bit that is the control bit of the CNOT gate. The CNOT gate indicates that the target bit is inverted when the control bit is "1".
[0066] In this way, the CCZ gate can be converted into an equivalent circuit 51 that combines gates for two quantum bits or one quantum bit. However, the equivalent circuit 51 shown in FIG. 6 is for a superconducting quantum computer. In the case of an ion trap quantum computer, two quantum bits are replaced with an equivalent circuit using an XX gate. The XX gate is a gate that simultaneously rotates two quantum bits by a specified angle around the X axis. The XX gate is one of the gates called Ising gates.
[0067] 7 is a diagram showing an example of an equivalent circuit of a CX gate using an XX gate. The CX gate is expressed by the following formula (8).
[0068]
number
[0069]
number
[0070] In the equivalent circuit 60, the block spanning two quantum bits is an XX gate. The XX gate marked with "0" corresponds to the control bit in the CX gate, and the XX gate marked with "1" corresponds to the target bit in the CX gate. The angle marked in the block representing the XX gate is the rotation angle of the two quantum bits to be operated. In the case of the equivalent circuit 60 of the CX gate, the rotation angle by the XX gate is π / 2. The value obtained by dividing the rotation angle by 2 is the value of χ in equation (9) for the XX gate.
[0071] By using such an XX gate, it is possible to generate an equivalent circuit for a CCZ gate that can be applied to an ion trap quantum computer. 8 is a diagram showing a first example of an equivalent circuit of a CCZ gate using an XX gate. The equivalent circuit 61 of the CCZ gate includes an XX gate indicating a rotation operation of π / 2 to two quantum bits, and a gate (R x ,R y ,R z ), T gate, T † It is created by combining gates. There are several equivalent circuits using XX gates of CCZ gates other than the equivalent circuit 61 shown in Figure 8. Here, the identification number of the equivalent circuit 61 among the several equivalent circuits using XX gates of CCZ gates is "#0".
[0072] When the ion trap quantum computer 300 executes the process shown by the quantum circuit 50, the control computer 100 may generate a quantum circuit by converting each of the two CCZ gates included in the quantum circuit 50 into an equivalent circuit 61. Then, the control computer 100 may instruct the quantum bit control device 200 to control the quantum bit according to the generated quantum circuit.
[0073] In quantum computing using the quantum computer 300, errors may occur in each quantum bit due to noise contained in the gate operation. There are two types of quantum bit errors: errors caused by interference with the external environment (Stochastic Pauli, depolarization, amplitude damping, phase damping) and errors that occur only internally (coherent errors). Coherent errors are errors caused by imperfect implementation of quantum gates, and are difficult to eliminate completely. Coherent errors include one-qubit errors and two-qubit errors. In actual devices, the occurrence probability of a two-qubit error is about 10 times higher than that of a one-qubit error. Therefore, a two-qubit error has a greater impact on the overall error than a one-qubit error.
[0074] Therefore, when the two CCZ gates included in the quantum circuit 50 are converted into the equivalent circuit 61, an error is more likely to occur in the quantum bit with a larger number of gate operations in the equivalent circuit 61. For example, in the equivalent circuit 61 shown in FIG. 0 has more operations than other qubits, and qubit q 0 is prone to errors. In this case, when the quantum circuit 50 shown in Fig. 5 is calculated using the ion trap type quantum computer 300, if both CCZ gates are realized using the equivalent circuit 61, a bias in the probability of error occurrence for each quantum bit occurs. The bias in the probability of error occurrence for each quantum bit affects the probability of obtaining a correct calculation result in the calculation of Grover's algorithm.
[0075] FIG. 9 is a diagram showing an example of the relationship between the quantum computation result and noise when the CCZ gate is replaced with the same equivalent circuit. Graph 81 shows the results of simulating quantum computation using a quantum circuit in which two CCZ gates included in the 3-qubit Grover algorithm are converted into the equivalent circuit 61, with the amount of noise in the gate operation being changed. The vertical axis of graph 81 shows the probability that a state corresponding to the correct data is output. The horizontal axis of graph 81 shows the amount of noise included in the gate operation. Note that sqrt(ε) is an index of the amount of noise included in the gate operation. Each line of graph 81 shows the simulation result when the state corresponding to the correct data is "000" to "111".
[0076] For each line in graph 81, the probability in the absence of noise is "0.781". As the noise increases, the difference between each line and the probability in the absence of noise becomes greater. The extent of the difference from the probability in the absence of noise depends on the oracle. In other words, the probability in the presence of noise changes depending on which state is searched. And, regardless of which state is searched, the greater the coherent noise, the greater the difference between the output probability in the absence of noise. The greater the difference between the output probability in the absence of noise, the greater the influence of noise.
[0077] Therefore, in the second embodiment, when a quantum circuit includes multiple CCZ gates, the control computer 100 converts some of the CCZ gates into equivalent circuits 61, and converts the remaining CCZ gates into equivalent circuits in which each element of the equivalent circuit 61 is symmetrically moved up and down.
[0078] Next, the function of the control computer 100 will be described in detail. 10 is a block diagram showing an example of the functions of the control computer. The control computer 100 has a storage unit 120, a quantum computing control unit 130, a gate detection unit 140, and a gate conversion unit 150. The storage unit 120 stores conversion information 121. In the conversion information 121, a gate to be converted and an equivalent circuit are registered in association with each other.
[0079] The quantum computing control unit 130 controls the quantum computing. First, the quantum computing control unit 130 acquires a quantum circuit. For example, the quantum computing control unit 130 receives a request for quantum computing by the quantum computer 300 and the quantum circuit from the terminal devices 31, 32, . . . Then, the quantum computing control unit 130 controls the quantum bit control device 200 according to the quantum circuit converted by the gate conversion unit 150.
[0080] The gate detection unit 140 detects a CCZ gate from the quantum circuit acquired by the quantum computation control unit 130. Furthermore, when a CCZ gate is detected from the quantum circuit, the gate detection unit 140 detects a CCZ gate for the same combination of quantum bits as the detected CCZ gate.
[0081] The gate conversion unit 150 converts gates for three or more quantum bits included in a quantum circuit into an equivalent circuit that combines 1-bit gates or 2-bit gates. For example, the gate conversion unit 150 converts into an equivalent circuit that combines a 1-bit gate and an XX gate that indicate a rotation operation around an axis. For example, the gate conversion unit 150 converts a CCZ gate detected by the gate detection unit 140 into an equivalent circuit 61. The gate conversion unit 150 also converts a CCZ gate for the same combination of quantum bits as the CCZ gate converted into an equivalent circuit into an equivalent circuit in which the elements of the converted equivalent circuit are moved symmetrically. For example, the gate conversion unit 150 converts the CCZ gate into an equivalent circuit in which each element of the equivalent circuit 61 is moved symmetrically up and down.
[0082] Note that the lines connecting the elements shown in Fig. 10 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. 10 can be realized, for example, by having a computer execute a program module corresponding to that element.
[0083] Next, the conversion information 121 stored in the storage unit 120 will be described in detail. 11 is a diagram showing an example of conversion information. The conversion information 121 has columns for detection gate and equivalent circuit. The detection gate column contains a gate to be detected. The equivalent circuit column contains an equivalent circuit of the gate to be detected. For example, the conversion information 121 contains a CCZ gate, an equivalent circuit 61, and an equivalent circuit in which each element of the equivalent circuit 61 is symmetrically moved up and down, and registered in association with each other.
[0084] The gate conversion unit 150 can determine an equivalent circuit corresponding to gate operations of three or more quantum bits based on the conversion information 121. FIG. 12 is a diagram showing an example of a quantum circuit after conversion when performing quantum computation with a superconducting quantum computer. The gate conversion unit 150 converts the quantum circuit 50 into a quantum circuit 50a by a quantum circuit conversion process. The quantum circuit 50a is obtained by converting one of the two CCZ gates included in the quantum circuit 50 into an equivalent circuit 51 and the other into an equivalent circuit 52. The equivalent circuit 52 is an equivalent circuit in which each element of the equivalent circuit 51 is symmetrically moved up and down. In the equivalent circuit 52, the arrangement of each element of the equivalent circuit 51 is changed to that of the quantum bit q 1 The image is inverted around the line corresponding to the axis.
[0085] As in the example of FIG. 12, when generating an equivalent circuit for an ion trap type quantum computer, multiple CCZ gates can be converted into different equivalent circuits. 13 is a diagram showing a second example of an equivalent circuit of a CCZ gate using an XX gate. The equivalent circuit 66 is obtained by dividing the arrangement of each element in the equivalent circuit 61 of “#0” shown in FIG. 8 into the quantum bit q 1 The equivalent circuit 66 is equivalent to a CCZ gate, similar to the equivalent circuit 61. The identification number of this equivalent circuit is "#5" (the equivalent circuits with identification numbers "#1 to #4" will be described later).
[0086] 14 is a diagram showing an example of a quantum circuit after conversion when performing quantum computation with an ion trap quantum computer. When performing quantum computation with the quantum circuit 50 with an ion trap quantum computer, the gate conversion unit 150 converts, for example, the quantum circuit 50 into a quantum circuit 50b. The quantum circuit 50b is obtained by converting one of the two CCZ gates included in the quantum circuit 50 into an equivalent circuit 61 (see FIG. 8) and converting the other into an equivalent circuit 66 (see FIG. 13).
[0087] When the quantum computing control unit 130 acquires the quantum circuit 50, it controls the quantum bit control device 200 according to the quantum circuit 50b converted by the gate conversion unit 150. The quantum bit control device 200 performs gate operations on each quantum bit in the order shown in the quantum circuit 50b. This suppresses bias in gate operations on a specific quantum bit compared to the case where the two CCZ gates included in the quantum circuit 50 are converted into the equivalent circuit 61.
[0088] Next, a description will be given of the conversion process of the CCX gate by the gate conversion unit 150. The CCX gate is also called a Toffoli gate. FIG. 15 is a diagram showing an example of the conversion process of a CCX gate. The CCX gate 70 indicates that an X gate is applied to one target bit (a bit is inverted) when two control bits are "1". In a quantum circuit, a symbol combining a circle and a + is placed on a line corresponding to a quantum bit that is a target bit of the CCX gate 70, and a point connected to the symbol by a line is placed on a line corresponding to each of the quantum bits that are two control bits. The CCX gate 70 can convert a CCX gate included in a quantum circuit into an equivalent circuit 71 combining an H gate and a CCZ gate.
[0089] The equivalent circuit 71 is a quantum bit q 0 H gate for q 0 ,q 1 ,q 2 CCZ gate for q and the qubit q 0The gate conversion unit 150 converts the CCZ gate included in the equivalent circuit 71 into, for example, the equivalent circuit 61, thereby converting it into an equivalent circuit for an ion trap quantum computer equivalent to the CCX gate 70.
[0090] In this way, the gate conversion unit 150 can convert the CCX gate included in the quantum circuit into an equivalent circuit including a CCZ gate. By converting the CCZ gate into an equivalent circuit, the gate conversion unit 150 can suppress bias in gate operations on a specific quantum bit in a quantum circuit including a CCX gate. By using the equivalent circuit 71 of the CCX gate 70, it is possible to suppress bias in the number of operations between quantum bits even in operations on multiple bits of 4 or more bits.
[0091] Next, the conversion process of the CnNOT gate by the gate conversion unit 150 will be described. FIG. 16 is a diagram showing an example of conversion processing of a CnNOT gate. The CnNOT gate indicates that one target bit is inverted when n (n is an integer equal to or greater than 1) control bits are all "1". In a quantum circuit, a symbol combining a circle and a + is placed on a line corresponding to a quantum bit that is a target bit of the CnNOT gate, and a point connected to the symbol by a line is placed on a line corresponding to each of the quantum bits that are n control bits. The gate conversion unit 150 converts the CnNOT gate included in the quantum circuit into an equivalent circuit combining a CCX gate and a CNOT gate.
[0092] The equivalent circuit 73 shown in FIG. 0 ,q 1 ,q 2 ,q 3 ,q 4 is the control bit, and the quantum bit q 5 The equivalent circuit 73 is a quantum circuit equivalent to a C5NOT gate 72 with a target bit q 0 ~q 4 ,a 0 ,a 1 ,a2 ,a 3 Two of these are control bits, and the qubit q 0 ~q 4 ,a 0 ~a 3 The CCX gate includes a qubit a 0 ~a 3 are the ancillary bits. The transformation of the CnNOT gate uses n-1 ancillary bits.
[0093] The equivalent circuit 73 is a quantum bit q 0 ,q 1 is the control bit, and qubit a 0 The equivalent circuit 73 includes two CCX gates with the quantum bit q 2 ,a 0 is the control bit, and qubit a 1 The equivalent circuit 73 includes two CCX gates with the quantum bit q 3 ,a 1 is the control bit, and qubit a 2 The equivalent circuit 73 includes two CCX gates with the quantum bit q 4 ,a 2 is the control bit, and qubit a 3 The equivalent circuit 73 includes two CCX gates with the quantum bit a as the target bit. 3 is the control bit, and the quantum bit q 5 It contains one CNOT gate with the target bit as the
[0094] The gate conversion unit 150 can convert the CCX gate included in the equivalent circuit 73 into an equivalent circuit that combines a CCZ gate and an H gate (see FIG. 15). Therefore, the CnNOT gate can be converted into an equivalent circuit by combining a one-qubit gate and a two-qubit gate.
[0095] 17 is a diagram showing an example of an equivalent circuit of a CnNOT gate. The equivalent circuit 74 is obtained by converting the CCX gate included in the equivalent circuit 73 into an equivalent circuit that combines a CCZ gate and an H gate. In other words, the equivalent circuit 74 includes two CCZ gates for the same combination of quantum bits. For example, the equivalent circuit 74 is 0 ,q 1 ,a 0 It contains two CCZ gates for
[0096] The gate conversion unit 150 converts one of two CCZ gates for the same combination of quantum bits included in the equivalent circuit 74 into an equivalent circuit 61, and converts the other into an equivalent circuit 66 in which each element of the equivalent circuit 61 is symmetrically moved up and down. This allows the gate conversion unit 150 to suppress bias in gate operations toward a specific quantum bit in a quantum circuit including a CnNOT gate.
[0097] Next, the procedure of the quantum circuit conversion process will be described in detail. Fig. 18 is a flowchart showing an example of a procedure for quantum circuit conversion processing. The processing shown in Fig. 18 will be described below in order of step numbers.
[0098] [Step S101] The quantum computation control unit 130 acquires a quantum circuit. For example, the quantum computation control unit 130 receives a request for quantum computation by the quantum computer 300 and the quantum circuit from the terminal devices 31, 32, . . .
[0099] [Step S102] The gate conversion unit 150 converts the CnNOT gate included in the quantum circuit into a combination of a CCX gate and a CNOT gate. For example, the gate conversion unit 150 detects the CnNOT gate included in the quantum circuit acquired in step S101. The gate conversion unit 150 generates an equivalent circuit by combining a CNOT gate and a plurality of CCX gates in which two of the control bit and n-1 ancillary bits of the detected CnNOT gate are set as control bits and one is set as a target bit. Then, the gate conversion unit 150 converts the detected CnNOT gate into the generated equivalent circuit.
[0100] [Step S103] The gate conversion unit 150 converts the CCX gate included in the quantum circuit into a combination of a CCZ gate and an H gate. For example, the gate conversion unit 150 detects a CCX gate included in the quantum circuit converted in step S102. The gate conversion unit 150 generates an equivalent circuit in which an H gate for the target bit of the detected CCX gate, a CCZ gate for the control bit and the target bit, and an H gate for the target bit are arranged side by side. Then, the gate conversion unit 150 converts the detected CCX gate into the generated equivalent circuit.
[0101] [Step S104] The gate detection unit 140 detects one CCZ gate from the quantum circuit. [Step S105] The gate detection unit 140 determines whether or not a CCZ gate is detected from the quantum circuit in step S104. If the gate detection unit 140 determines that a CCZ gate is detected from the quantum circuit in step S104, the process proceeds to step S106. If the gate detection unit 140 determines that a CCZ gate is not detected from the quantum circuit in step S104, the process proceeds to step S110.
[0102] [Step S106] The gate conversion unit 150 converts the CCZ gate detected in step S104 into an equivalent circuit that is a combination of operations on one or two quantum bits. For example, the gate conversion unit 150 converts the CCZ gate detected in step S104 into the equivalent circuit 61 registered in the conversion information 121.
[0103] [Step S107] The gate detection unit 140 detects, from the quantum circuit, one CCZ gate for the same combination of quantum bits as the CCZ gate detected in step S104.
[0104] [Step S108] The gate detection unit 140 determines whether or not a CCZ gate is detected from the quantum circuit in step S107. If the gate detection unit 140 determines that a CCZ gate is detected from the quantum circuit in step S107, the process proceeds to step S109. If the gate detection unit 140 determines that a CCZ gate is not detected from the quantum circuit in step S107, the process proceeds to step S104.
[0105] [Step S109] The gate conversion unit 150 converts the CCZ gate detected in step S107 into an equivalent circuit in which the elements of the equivalent circuit converted in step S106 are symmetrically moved. For example, the gate conversion unit 150 converts the CCZ gate detected in step S107 into an equivalent circuit 66 in which the elements of the equivalent circuit 61 registered in the conversion information 121 are symmetrically moved up and down. Then, the process proceeds to step S104.
[0106] [Step S110] The quantum computing control unit 130 controls the quantum bit control device 200 in accordance with the converted quantum circuit. In this way, the gate conversion unit 150 converts one of the CCZ gates for the same combination of quantum bits into an equivalent circuit, and converts the other into an equivalent circuit in which each element of the equivalent circuit 51 is symmetrically shifted up and down. This allows the gate conversion unit 150 to suppress bias in gate operations toward a specific quantum bit.
[0107] The gate conversion unit 150 converts the CnNOT gate into a combination of a CCX gate and a CNOT gate, converts the CCX gate into a combination of a CCZ gate and an H gate, and then converts the CCZ gate. This allows the gate conversion unit 150 to suppress bias in gate operations toward a specific quantum bit even when the quantum circuit includes a CCX gate or a CnNOT gate.
[0108] Next, we explain the effect of noise contained in gate operations on quantum computation. FIG. 19 is a diagram (part 1) showing an example of the relationship between quantum computation results and noise. Graph 81 shows the results of simulating quantum computation using a quantum circuit in which two CCZ gates included in the three-qubit Grover algorithm are converted into equivalent circuit 61, with the amount of noise in the gate operation being changed. The vertical axis of graph 81 shows the output probability of the state corresponding to the correct data. The horizontal axis of graph 81 shows the amount of noise included in the gate operation. Note that sqrt(ε) is an index of the amount of noise included in the gate operation. Each line in graph 81 shows the simulation result when the state corresponding to the correct data is "000" to "111".
[0109] Graph 82 shows the results of simulating quantum computation using a quantum circuit in which one of the two CCZ gates included in the 3-qubit Grover algorithm is converted into equivalent circuit 61 and the other is converted into equivalent circuit 66, with the amount of noise in the gate operation being changed. The meanings of the vertical axis, horizontal axis, and each line in graph 82 are the same as those in graph 81.
[0110] Graphs 81 and 82 show that when there is no noise in the gate operation, the output probability of the state corresponding to the correct data is the theoretical value 0.781 shown in formula (7). Graphs 81 and 82 also show that when the amount of noise in the gate operation increases, the output probability of the state corresponding to the correct data decreases. Here, the difference between graph 82 and the theoretical value 0.781 of the output probability with respect to the increase in the amount of noise is smaller than that of graph 81. In other words, graphs 81 and 82 show that when quantum computing is performed with a quantum circuit in which one of two CCZ gates is converted to equivalent circuit 61 and the other is converted to equivalent circuit 66, the effect of noise can be reduced more than when quantum computing is performed with a quantum circuit in which two CCZ gates are converted to equivalent circuit 61.
[0111] In this way, the gate conversion unit 150 converts one of the CCZ gates for the same combination of quantum bits into the equivalent circuit 61 and the other into the equivalent circuit 66, thereby reducing errors that occur due to the influence of noise contained in the gate operation being biased toward specific quantum bits. Thus, the gate conversion unit 150 can reduce errors in quantum computation.
[0112] The CCZ gate can be converted into an equivalent circuit other than the equivalent circuits 61 and 66 shown in the above example. The gate conversion unit 150 may convert the CCZ gate into an equivalent circuit other than the equivalent circuits 61 and 66.
[0113] 20 is a diagram showing a third example of an equivalent circuit of a CCZ gate using an XX gate. In the equivalent circuit 62 shown in FIG. 20, the quantum bit q 0 Each element on the line corresponding to 0 In the equivalent circuit 62, the quantum bit q 1 Each element on the line corresponding to 2 In the equivalent circuit 62, the quantum bit q 2 Each element on the line corresponding to 1 The equivalent circuit 62 is placed on a line corresponding to the line 61. The identification number of this equivalent circuit 62 is "#1".
[0114] 21 is a diagram showing a fourth example of an equivalent circuit of a CCZ gate using an XX gate. In the equivalent circuit 63 shown in FIG. 21, the quantum bit q 0 Each element on the line corresponding to 1 In the equivalent circuit 63, the quantum bit q 1 Each element on the line corresponding to 0 In the equivalent circuit 63, the quantum bit q 2 Each element on the line corresponding to 2 The equivalent circuit 63 is placed on a line corresponding to the line 61. The identification number of this equivalent circuit 63 is "#2".
[0115] 22 is a diagram showing a fifth example of an equivalent circuit of a CCZ gate using an XX gate. The equivalent circuit 64 shown in FIG. 22 is obtained by dividing the arrangement of each element in the equivalent circuit 63 of “#2” shown in FIG. 21 into the quantum bit q 1 The equivalent circuit 64 is given the identification number "#3".
[0116] 23 is a diagram showing a sixth example of an equivalent circuit of a CCZ gate using an XX gate. The equivalent circuit 65 shown in FIG. 23 is obtained by dividing the arrangement of each element in the equivalent circuit 62 of “#1” shown in FIG. 20 by the quantum bit q 1 The equivalent circuit 65 is given the identification number "#4".
[0117] Among the six equivalent circuits 61 to 66 of the CCZ gate, three pairs of equivalent circuits can be generated by generating pairs of equivalent circuits in which one of the equivalent circuits is configured by symmetrically shifting the arrangement of the elements of the other. That is, a pair of the equivalent circuit 61 of "#0" and the equivalent circuit 66 of "#5", a pair of the equivalent circuit 62 of "#1" and the equivalent circuit 65 of "#4", and a pair of the equivalent circuit 63 of "#2" and the equivalent circuit 65 of "#4" can be generated. When there are two CCZ gates for the same combination of quantum bits, the gate conversion unit 150 may convert one CCZ gate into one of the equivalent circuits constituting one of the pairs, and convert the other CCZ gate into the other equivalent circuit constituting the pair.
[0118] FIG. 24 is a diagram (part 2) showing an example of the relationship between quantum computation results and noise. Graph 83 shows the results of simulating quantum computation by a quantum circuit in which two CCZ gates included in the three-qubit Grover algorithm are converted into the equivalent circuit 62, with the amount of noise in the gate operation being changed. Graph 84 shows the results of simulating quantum computation by a quantum circuit in which one of two CCZ gates included in the three-qubit Grover algorithm is converted into the equivalent circuit 62 and the other is converted into the equivalent circuit 65, with the amount of noise in the gate operation being changed. The meanings of the vertical axis, horizontal axis, and each line in graphs 83 and 84 are the same as those in graph 81. In graph 84, the line showing the result when the correct answer is "111" and the line showing the result when the correct answer is "101" are almost overlapped.
[0119] In graph 84, the difference in output probability with respect to an increase in the amount of noise compared to when there is no noise is smaller than in graph 83. Therefore, graphs 83 and 84 show that when performing quantum computing with a quantum circuit in which one of two CCZ gates is converted into equivalent circuit 62 and the other is converted into equivalent circuit 65, the effect of noise can be reduced more than when performing quantum computing with a quantum circuit in which the two CCZ gates are converted into equivalent circuit 62.
[0120] FIG. 25 is a diagram (part 3) showing an example of the relationship between quantum computation results and noise. Graph 85 shows the results of simulating quantum computation by a quantum circuit in which two CCZ gates included in the three-qubit Grover algorithm are converted into an equivalent circuit 63, with the amount of noise in the gate operation being changed. Graph 86 shows the results of simulating quantum computation by a quantum circuit in which one of two CCZ gates included in the three-qubit Grover algorithm is converted into an equivalent circuit 63 and the other is converted into an equivalent circuit 64, with the amount of noise in the gate operation being changed. The meanings of the vertical axis, horizontal axis, and each line in graphs 85 and 86 are the same as those in graph 81. In graph 86, the line showing the result when the correct answer is "111" and the line showing the result when the correct answer is "110" are almost overlapped.
[0121] In graph 86, the difference in output probability with respect to an increase in the amount of noise compared to when there is no noise is smaller than in graph 85. Therefore, graphs 85 and 86 show that when performing quantum computing with a quantum circuit in which one of two CCZ gates is converted into equivalent circuit 63 and the other is converted into equivalent circuit 64, the effect of noise can be reduced more than when performing quantum computing with a quantum circuit in which two CCZ gates are converted into equivalent circuit 63.
[0122] Figure 26 is a diagram (part 4) showing an example of the relationship between quantum computing results and noise. Graph 87 compares the difference between converting two CCZ gates included in the 3-qubit Grover algorithm into one type of equivalent circuit and converting them into two types of equivalent circuits. The vertical axis of graph 87 shows the average probability (average probability) of outputting a state corresponding to the correct data. The horizontal axis of graph 87 shows the amount of noise included in the gate operation.
[0123] The line showing the results in the case of one type of equivalent circuit in graph 87 indicates the average value for each noise amount of the output probability of correct data according to the amount of noise obtained for each correct value when quantum computing is performed using one type of equivalent circuit such as graphs 81, 83, 85, etc. The line showing the results in the case of two types of equivalent circuits in graph 87 indicates the average value for each noise amount of the output probability of correct data according to the amount of noise obtained for each correct value when quantum computing is performed using two types of equivalent circuits that are paired as in graphs 82, 84, 86.
[0124] As shown in graph 87, when two CCZ gates are converted into two types of equivalent circuits, the difference between the average probability and the probability in the absence of noise is smaller than when they are converted into one type of equivalent circuit.
[0125] FIG. 27 is a diagram (part 5) showing an example of the relationship between quantum computation results and noise. Graph 88 shows the output probability of the state corresponding to the correct data when sqrt(ε)=0.3 for each quantum computation used to generate graph 87 shown in FIG. 26. Graph 88 shows the output probability when quantum computation is performed at sqrt(ε)=0.3 using a quantum circuit (one type of equivalent circuit) in which two CCZ gates included in the quantum circuit are converted into the same equivalent circuit. Graph 88 also shows the output probability when quantum computation is performed at sqrt(ε)=0.3 using a quantum circuit (two types of equivalent circuits) in which one of the two CCZ gates included in the quantum circuit is converted into an equivalent circuit in which each element of the other equivalent circuit is symmetrically moved up and down.
[0126] In the graph 88, the probability obtained when performing quantum computation using a quantum circuit converted into two types of equivalent circuits for two CCZ gates is closer to the probability obtained when there is no noise than when performing quantum computation using a quantum circuit converted into one type of equivalent circuit. Therefore, the gate conversion unit 150 can reduce errors in quantum computation by converting two CCZ gates into two types of equivalent circuits.
[0127] Although the Grover algorithm for three quantum bits has been described above as an example, the Grover algorithm can also be executed for four or more quantum bits. 28 is a diagram showing an example of a quantum circuit that executes the Grover algorithm with six quantum bits. The quantum circuit 75 is a quantum bit q 0 ,q 1 ,q 2 ,q 3 ,q 4 ,q 5 The order of operations for each is shown below.
[0128] At the left end of quantum circuit 75 is a quantum bit q 0 ~q 5 The first operation shown in quantum circuit 75 is to convert qubit q 0 ~q 5 By applying the H gate to each of them, the quantum bit q 0 ~q 5 are in a superposition state (initialized). In quantum circuit 75, a combination of an X gate, an H gate, and a CnNOT gate, which indicates a process of applying an oracle, is placed to the right of the H gate, which indicates initialization. In quantum circuit 75, a combination of an H gate, an X gate, and a CnNOT gate, which indicates an amplification process, is placed to the right of the combination of gates which indicates an oracle. In quantum circuit 75, a combination of a quantum bit q 0 ~q 5 The observations shown in quantum circuit 75 output the results of a single inversion amplification process of the Grover algorithm for six qubits.
[0129] The gate conversion unit 150 converts the CnNOT gate included in the quantum circuit 75 into a combination of a CCX gate and a CNOT gate, and converts the CCX gate into a combination of a CCZ gate and an H gate. Then, the gate conversion unit 150 converts one of two CCZ gates for the same combination of quantum bits converted from the CnNOT gate into, for example, an equivalent circuit 61, and converts the other into an equivalent circuit 66.
[0130] FIG. 29 is a diagram showing a conversion example of the CCX gate in the equivalent circuit of the C5NOT gate. The equivalent circuit 76 is an example of converting each CCX gate in the equivalent circuit 73 of the C5NOT gate (see FIG. 16) into the equivalent circuit 71 shown in FIG. 15 by using one type of CCZ gate (#0). On the other hand, the equivalent circuit 77 is an example of converting the CCX gate in the equivalent circuit 73 of the C5NOT gate (see FIG. 16) into the equivalent circuit 71 shown in FIG. 15 by using one of two types of CCZ gates (#0, #5). For example, the first five CCX gates of the equivalent circuit 77 are converted into the equivalent circuit 71 of the CCX gate shown in FIG. 15 by using the equivalent circuit 61 of the CCZ gate "#0". The last five CCX gates of the equivalent circuit 77 are converted into the equivalent circuit 71 of the CCX gate shown in FIG. 15 by using the equivalent circuit 66 of the CCZ gate "#5".
[0131] Next, in a quantum circuit that executes Grover's algorithm with 6 quantum bits, the difference in probability of correct data when the C5NOT gate is converted to equivalent circuit 76 and when it is converted to equivalent circuit 77 will be explained.
[0132] FIG. 30 is a diagram (part 6) showing an example of the relationship between quantum computation results and noise. Graphs 91 and 92 show the results of simulating quantum computation using a quantum circuit converted from a C5NOT gate included in the 6-qubit Grover algorithm, changing the amount of noise in the gate operation. The vertical axis of graphs 91 and 92 shows the output probability of the state corresponding to the correct data when the state corresponding to the correct data is "000000" to "111111". The horizontal axis of graphs 91 and 92 shows the amount of noise included in the gate operation.
[0133] Graph 91 shows the simulation results of quantum computation using a quantum circuit (one type of equivalent circuit) in which two CCZ gates for the same combination of quantum bits converted from a C5NOT gate are converted into equivalent circuit 76 shown in Fig. 29. Graph 92 shows the simulation results of quantum computation using a quantum circuit (two types of equivalent circuits) in which two CCZ gates for the same combination of quantum bits converted from a C5NOT gate are converted into equivalent circuit 77 shown in Fig. 29.
[0134] 31 is a diagram (part 7) showing an example of the relationship between quantum computing results and noise. The vertical axis of graph 93 shows the average output probability of the state corresponding to the correct data when the state corresponding to the correct data is "000000" to "111111". The horizontal axis of graph 93 shows the amount of noise included in the gate operation.
[0135] One of the lines shown in graph 93 indicates the average output probability of the state corresponding to the correct data when the state corresponding to the correct data shown in graph 91 (one type of equivalent circuit) is "000000" to "111111." The other line indicates the average output probability of the state corresponding to the correct data when the state corresponding to the correct data shown in graph 92 (two types of equivalent circuits) is "000000" to "111111."
[0136] According to graph 93, the reduction in the output probability is smaller when quantum computing is performed using a quantum circuit in which two CCZ gates are converted into two types of equivalent circuits than when quantum computing is performed using a quantum circuit in which two CCZ gates are converted into one type of equivalent circuit. In other words, graph 93 shows that the effect of noise can be reduced more when quantum computing is performed using a quantum circuit in which two CCZ gates are converted into two types of equivalent circuits than when quantum computing is performed using a quantum circuit in which two CCZ gates are converted into one type of equivalent circuit.
[0137] In this way, the gate conversion unit 150 can reduce errors that occur due to the influence of noise contained in the gate operation being biased toward a specific quantum bit, even in quantum computation executed by a quantum circuit including a CnNOT gate.
[0138] Although the embodiments have been described above, the configurations of the parts shown in the embodiments can be replaced with other configurations having similar functions. Any other components or steps may be added. Furthermore, any two or more configurations (features) of the above-described embodiments may be combined.
[0139] 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]
[0140] 1 1st quantum circuit 1a First element 1b 2nd element 2. First equivalent circuit 2a~2e, 3a~3e 2-qubit gates 3 Second equivalent circuit 10 Quantum circuit design equipment 11 Processing section
Claims
1. Detecting a first element indicating a predetermined operation on a plurality of first quantum bits among the plurality of quantum bits and a second element indicating the predetermined operation on the plurality of first quantum bits from a first quantum circuit including a plurality of elements, the first quantum circuit indicating an operation order on each of a plurality of quantum bits included in a quantum computer by an arrangement of each of the plurality of elements in the quantum circuit; converting the first elements of the first quantum circuit into a first equivalent circuit for ion manipulation corresponding to the plurality of first quantum bits, and generating a second quantum circuit by converting the second elements into a second equivalent circuit arranged by symmetrically moving the elements of the first equivalent circuit in the arrangement direction of the plurality of first quantum bits; A quantum circuit design program that causes a computer to execute the processing.
2. The first equivalent circuit includes a two-qubit gate that indicates a rotation operation of a predetermined angle for two of the plurality of first qubits. The quantum circuit design program according to claim 1.
3. The predetermined operation is an operation of inverting a phase of one target bit among the plurality of first quantum bits in response to two control bits among the plurality of first quantum bits.
3. The quantum circuit design program according to claim 1 or 2.
4. In the process of generating the second quantum circuit, a third element that inverts a bit of one target bit of the plurality of first quantum bits in response to two control bits of the plurality of first quantum bits is converted into a third equivalent circuit including the predetermined operation. The quantum circuit design program according to claim 3.
5. In the process of generating the second quantum circuit, a fourth element that inverts a bit of a target bit of one of the second quantum bits in response to three or more control bits of the second quantum bits including the first quantum bits is converted into a fourth equivalent circuit including the third element. The quantum circuit design program according to claim 4.
6. 6. The quantum circuit design program according to claim 1, wherein the first element and the second element are each a quantum gate.
7. 5. The quantum circuit design program according to claim 4, wherein the third element is a CCX gate.
8. 6. The quantum circuit design program according to claim 5, wherein the fourth element is a CnNOT gate.
9. Detecting a first element indicating a predetermined operation on a plurality of first quantum bits among the plurality of quantum bits and a second element indicating the predetermined operation on the plurality of first quantum bits from a first quantum circuit including a plurality of elements, the first quantum circuit indicating an operation order on each of a plurality of quantum bits included in a quantum computer by an arrangement of each of the plurality of elements in the quantum circuit; converting the first elements of the first quantum circuit into a first equivalent circuit for ion manipulation corresponding to the plurality of first quantum bits, and generating a second quantum circuit by converting the second elements into a second equivalent circuit arranged by symmetrically moving the elements of the first equivalent circuit in the arrangement direction of the plurality of first quantum bits; A method for designing quantum circuits that allow processing to be executed by a computer.
10. a processing unit that detects, from a first quantum circuit including a plurality of elements, a first element indicating a predetermined operation on a plurality of first quantum bits among the plurality of quantum bits and a second element indicating the predetermined operation on the plurality of first quantum bits from a first quantum circuit including a plurality of elements, the first element being indicative of a predetermined operation on the plurality of first quantum bits, converts the first elements of the first quantum circuit into a first equivalent circuit for ion manipulation corresponding to the plurality of first quantum bits, and generates a second quantum circuit in which the second elements are converted into a second equivalent circuit having an arrangement in which the elements of the first equivalent circuit are symmetrically moved in the arrangement direction of the plurality of first quantum bits; A quantum circuit design device having the above structure.
Citation Information
Patent Citations
Methods and hardware architectures for controlling processes or processing data based on quantum soft computing
JP2003526855A
Automatic optimization of large-scale quantum circuits with continuous parameters
JP2021503116A
Methods and apparatuses for two-qubit gate reduction in quantum circuits
US20200184024A1
Automated optimization of large-scale quantum circuits with continuous parameters
US20210192113A1
