Approximate quantum Fourier transform device, approximate quantum Fourier transform method, and approximate quantum Fourier transform program

JPWO2024121981A5Active Publication Date: 2024-11-06MITSUBISHI ELECTRIC CORP
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
JP2024550225
Authority / Receiving Office
JP · JP
Patent Type
Patents
Current Assignee / Owner
Filing Date
2022-12-07
Publication Date
2024-11-06
Estimated Expiration
2042-12-07

AI Technical Summary

Technical Problem

The calculation time for approximate quantum Fourier transform (QFT) is inefficient due to the sequential execution of each gate, which is not optimal for large-scale quantum computation.

Method used

An approximate quantum Fourier transform device that includes a quantum state storage unit to pre-calculate and store quantum states, allowing the actual calculation unit to call and utilize these states for immediate execution of phase gates, reducing the overall calculation time.

Benefits of technology

The device enables approximate QFT to be performed at high speed by executing phase gates in an average of 2 steps per gate, independent of the accuracy of the approximation, significantly reducing the overall calculation time compared to conventional methods.

✦ Generated by Eureka AI based on patent content.
Patent Text Reader

Abstract

The approximate quantum Fourier transform device (10) comprises functional components of a quantum calculation unit (20) and a classical calculation unit (30). The quantum calculation unit (20) comprises a real calculation unit (21) that performs an approximate quantum Fourier transform by converting the state of quantum bits, and a quantum state storage unit (22) that stores multiple quantum states used by the real calculation unit (21). The real calculation unit (21) calls and uses a quantum state required for conversion from the multiple quantum states stored in the quantum state storage unit (22).
Need to check novelty before this filing date? Find Prior Art

Description

[Technical field]

[0001] The present disclosure relates to techniques for performing approximate quantum Fourier transforms. [Background technology]

[0002] The quantum Fourier transform is an important operation that gives quantum computers an advantage over classical computers. Quantum Fourier transform is hereafter referred to as QFT. QFT is used for fast prime factorization and signal processing.

[0003] Conventionally, approximate QFT was performed quickly by omitting operations that only had a small effect on the calculation result (see Patent Document 1). However, in recent years, research on quantum error correction has progressed in order to realize large-scale quantum calculations. As a result, it has been found that the quantum phase gates used in approximate QFT require much longer calculation times than conventional methods.

[0004] In light of this fact, approximate QFTs that take quantum error correction into account have been proposed in recent years (see Non-Patent Documents 1 and 2). Non-Patent Documents 1 and 2 propose a method to improve the efficiency of approximate QFTs by reducing the number of T gates, which have a high computational cost, under the Clifford+T gate model, which is becoming mainstream in quantum computing. [Prior art documents] [Patent documents]

[0005] [Patent Document 1] JP 2008-52365 A [Non-patent literature]

[0006] [Non-Patent Document 1] R. Rines and I. Chuang, High Performance Quantum Modular Multipliers, eprint arXiv, 1801.01081, January 3rd, 2018. [Non-Patent Document 2] Y. Nam, Y. Su, and D. Maslov, Approximate Quantum Fourier Transform with O(n log(n)) T Gates, Npj Quantum Information, 6(26), March 13th, 2020. First online as eprint arXiv 1803.04933, March 13th, 2018. Summary of the Invention [Problem to be solved by the invention]

[0007] In the approximate QFT proposed in Non-Patent Documents 1 and 2, each gate constituting the approximate QFT is executed one by one, which results in a long calculation time and is inefficient. An object of the present disclosure is to make it possible to reduce the calculation time of approximate QFT. [Means for solving the problem]

[0008] The approximate quantum Fourier transform device according to the present disclosure comprises: a real calculation unit that performs an approximate quantum Fourier transform by converting the state of the quantum bit; a quantum state storage unit for storing a plurality of quantum states used in the actual calculation unit; Equipped with The actual calculation unit calls and uses a quantum state required for conversion from the plurality of quantum states stored in the quantum state storage unit. Effect of the Invention

[0009] In the present disclosure, the quantum state stored in the quantum state storage unit is called and used to transform the state of the quantum bit, which makes it possible to reduce the calculation time and perform an approximate QFT. [Brief description of the drawings]

[0010] [Figure 1] FIG. 1 is a configuration diagram of an approximate quantum Fourier transform device 10 according to a first embodiment. [Diagram 2] 3 is a flowchart showing an outline of the operation of the approximate quantum Fourier transform device 10 according to the first embodiment. [Diagram 3] 4 is a flowchart showing detailed operations of the approximate quantum Fourier transform device 10 according to the first embodiment. [Figure 4] 4 is a flowchart of a pre-processing according to the first embodiment. [Diagram 5] 4 is a flowchart of an actual calculation process according to the first embodiment. [Figure 6] 5 is a flowchart of post-processing according to the first embodiment. [Figure 7] FIG. 1 is a configuration diagram of an approximate quantum Fourier transform device 10 according to a first modified example. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0011] Embodiment 1 ***Configuration Description*** The configuration of an approximate quantum Fourier transform device 10 according to the first embodiment will be described with reference to FIG. The approximate quantum Fourier transform device 10 is a computer. The approximate quantum Fourier transform device 10 includes the following hardware components: a processor 11, a memory 12, and a storage 13. The processor 11 is connected to other hardware components via signal lines and controls the other hardware components. The approximate quantum Fourier transform device 10 is connected to a display 40.

[0012] The processor 11 is an IC that performs processing. IC is an abbreviation for Integrated Circuit. Specific examples of the processor 11 include a CPU, a DSP, and a GPU. CPU is an abbreviation for Central Processing Unit. DSP is an abbreviation for Digital Signal Processor. GPU is an abbreviation for Graphics Processing Unit.

[0013] The memory 12 is a storage device that temporarily stores data. Specific examples of the memory 12 include SRAM and DRAM. SRAM is an abbreviation for Static Random Access Memory. DRAM is an abbreviation for Dynamic Random Access Memory.

[0014] The storage 13 is a storage device that stores data. A specific example of the storage 13 is an HDD. HDD is an abbreviation for Hard Disk Drive. The storage 13 may also be a portable recording medium such as an SD (registered trademark) memory card, CompactFlash (registered trademark), NAND flash, a flexible disk, an optical disk, a compact disk, a Blu-ray (registered trademark) disk, or a DVD. SD is an abbreviation for Secure Digital. DVD is an abbreviation for Digital Versatile Disk.

[0015] The approximate quantum Fourier transform device 10 comprises, as functional components, a quantum computing unit 20 and a classical computing unit 30. The quantum computing unit 20 comprises a real computing unit 21 and a quantum state storage unit 22. The quantum state storage unit 22 comprises a T-gate generating unit 23 and a state computing unit 24. The classical computing unit 30 comprises a measurement unit 31 and a progress output unit 32. The functions of the functional components of the approximate quantum Fourier transform device 10 are realized by software. The storage 13 stores a program that realizes the functions of each functional component of the approximate quantum Fourier transform device 10. This program is loaded into the memory 12 by the processor 11 and executed by the processor 11. In this way, the function of each functional component of the approximate quantum Fourier transform device 10 is realized.

[0016] 1 shows only one processor 11. However, there may be a plurality of processors 11, and the plurality of processors 11 may cooperate to execute programs that realize the respective functions.

[0017] ***Explanation of Operation*** The operation of the approximate quantum Fourier transform device 10 according to the first embodiment will be described with reference to FIGS. The operation procedure of the approximate quantum Fourier transform device 10 according to the embodiment 1 corresponds to the approximate quantum Fourier transform method according to the embodiment 1. Moreover, the program for realizing the operation of the approximate quantum Fourier transform device 10 according to the embodiment 1 corresponds to the approximate quantum Fourier transform program according to the embodiment 1.

[0018] An overview of the operation of the approximate quantum Fourier transform device 10 according to the first embodiment will be described with reference to FIG. (Step S101: Quantum state preservation process) The quantum state storage unit 22 pre-calculates and stores a plurality of quantum states. Specifically, the T gate generation unit 23 generates a T gate. The state calculation unit 24 uses the T gate generated by the T gate generation unit 23 to generate a quantum state required to execute a phase gate used by the real calculation unit 21. When using a T gate, the state calculation unit 24 performs correction using the measurement result by the measurement unit 31. Specifically, the state calculation unit 24 first applies a controlled NOT gate with the quantum bit to which the T gate is applied as the control bit and the quantum bit generated by the T gate generation unit 23 as the target bit. Next, the state calculation unit 24 causes the measurement unit 31 to measure the quantum bit of the T gate generation unit 23. If the measurement result is 0, the state calculation unit 24 ends the process, and if the measurement result is 1, the state calculation unit 24 applies an S gate to the quantum bit to which the T gate is applied. In the subsequent processing, the state calculation unit 24 also uses the T-gate generated by the T-gate generation unit 23 when generating or regenerating a quantum state.

[0019] (Step S102: Initial value setting process) The actual calculation unit 21 provides the initial values ​​of the executable phase gates.

[0020] Next, in loop 1 including steps S103 to S108, the actual calculation unit 21 executes the approximate QFT. At this time, the actual calculation unit 21 executes each phase gate by calling a necessary quantum state from the multiple quantum states stored in the quantum state storage unit 22. The actual calculation unit 21 uses the execution status of each phase gate to grasp the executable phase gates.

[0021] In loop 1, processing is performed on an incomplete executable phase gate as the target phase gate until all phase gates are completed.

[0022] (Step S103: Gate execution process) The actual calculation unit 21 executes the target phase gate. At this time, the actual calculation unit 21 calls up a necessary quantum state from the quantum state storage unit 22. Then, the measurement unit 31 performs a measurement on the classical bit. At this point, the quantum state called from the quantum state storage unit 22 collapses. The quantum state storage unit 22 starts regenerating the used quantum state. Note that step S103 only starts regenerating the quantum state, and the process proceeds to step S104 without waiting for the completion of the generation of the quantum state.

[0023] (Step S104: Measurement result determination process) The actual calculation unit 21 uses the measurement results from the measurement unit 31 to determine whether or not further phase gates need to be applied. Specifically, the actual calculation unit 21 determines whether the measurement result is 0 or not. If the measurement result is 0, the actual calculation unit 21 considers that the target phase gate has been applied. Then, the actual calculation unit 21 ends the application of the gate, and shifts the process to step S107. On the other hand, if the measurement result is not 0, the actual calculation unit 21 considers that the application of the target phase gate is incomplete. Then, the actual calculation unit 21 shifts the process to step S105 to apply a further gate.

[0024] (Step S105: Number of times determination process) The actual calculation unit 21 judges whether the number of measurements in step S103 has reached a designated number. It is assumed that the designated number is set in advance. If the number of measurements has reached the designated number, actual calculation unit 21 shifts the process to step S106. On the other hand, if the number of measurements has not reached the designated number, actual calculation unit 21 returns the process to step S103.

[0025] (Step S106: Gate application process) The actual calculation unit 21 applies an appropriate gate and moves the process to step S107.

[0026] (Step S107: Progress output process) The actual calculation unit 21 outputs the completion of the calculation of the target phase gate to the progress output unit 32. The progress output unit 32 receives the output of the completion of the calculation and displays on the display 300 the part of the approximate QFT that has been calculated. At this time, the actual calculation unit 21 updates the information of the executable phase gates upon completion of the calculation of the target phase gate.

[0027] (Step S108: quantum state update process) The quantum state storage unit 22 discards the quantum states that are not to be used among the multiple quantum states stored, and starts regenerating the quantum states to be used later. Here, there is no quantum entanglement in each quantum state stored by the quantum state storage unit 22. Therefore, the quantum state storage unit 22 returns to the initial state after having the measurement unit 31 perform a measurement. Then, the regeneration of the quantum states starts. In step S108, similarly to step S103, the regeneration of the quantum state is merely started, and the process proceeds to step S104 without waiting for the generation of the quantum state to be completed.

[0028] Next, the prerequisites for the operation of the approximate quantum Fourier transform device 10 according to the first embodiment will be described. In the following description, the number of quantum bits in a quantum state transformed by an approximate QFT is denoted by n, and the quantum bit numbers are denoted by 1, 2, . . . , n.

[0029] In the following explanation, the approximation accuracy ε of the approximate QFT is ε~n -a We will assume that (a is a constant) in the description. However, it can also be applied to more accurate approximations. The usual QFT, which is not approximate, is ε=2 -n Therefore, the maximum accuracy of the approximation is ε=2 -n It is.

[0030] In the following description, the value log(1 / ε) is used. This is originally the number 11, and is intended to be the smallest integer greater than or equal to log(1 / ε), but for simplicity we will write it as log(1 / ε).

number

[0031] In the following explanation, for a natural number j, R j The gate is as shown in Equation 12. Here, R j The inverse matrix of the gate, R j -1 The gate is shown in Equation 13. Here, the phase gate is R j Gate and R j -1 It means a set of gates represented as a product of gates.

number

number

[0032] The quantum state stored by the quantum state storage unit 22 will be described. There are three types of quantum states stored by the quantum state storage unit 22 according to each quantum bit: (1) pre-processing state, (2) actual calculation state, and (3) post-processing state. These quantum states are used in the order of (1) to (3). Specifically, each quantum bit transitions in sequence between two states: (a) a state in which it is processed as a target bit of a control operation, and (b) a state in which it is processed as a control bit of a control operation. These two states are separated by an H gate (Hadamard gate) shown in Equation 14.

number

[0033] Specifically, the quantum state stored by the quantum state storage unit 22 is as follows. (1) Pretreatment conditions The quantum state storage unit 22 is R2R when the quantum bit number j is 2≦j≦log(1 / ε). j+1 -1 to the gate, otherwise R2R log(1 / ε)+1 -1 Save the quantum state corresponding to the gate, where R2R j -1 At the gate, j-2 quantum states shown in Equation 15 are preserved.

number

[0034] (2) Actual calculation state The quantum state storage unit 22 is R3 when the quantum bit number j is 1≦j≦n-log(1 / ε)+1. -1 ,R4 -1 ,···,R log(1 / ε)+1 -1 to the gate, otherwise R3 -1 ,R4 -1 ,···,R n-j+2 -1 Save the quantum state corresponding to the gate, where R j -1At the gate, j-2 quantum states shown in Equation 16 are preserved.

number

[0035] (3) Post-processing status The quantum state storage unit 22 is R2R when the quantum bit number j is 1≦j≦n-log(1 / ε)+1. log(1 / ε)+1 -1 to the gate, otherwise R2R n-j+2 -1 The quantum state corresponding to the gate is stored.

[0036] The quantum state storage unit 22 does not store all of the quantum states for (1) to (3) above. The quantum state storage unit 22 stores only some of the quantum states and makes them immediately executable. In addition, the quantum states that have been used in the actual calculation part 110 and collapsed are regenerated, thereby reducing the number of quantum bits used. Here, the computation time required to generate a T gate is d T When the step size is set as 1, the time required to recreate the quantum state is approximately 3d T log(1 / ε) steps. Here, a "step" is the total time of one execution of a controlled NOT gate and one execution of a measurement of a quantum state, or an equivalent calculation time. Therefore, a phase gate that should be immediately executable is 3d T Whatever is needed for log(1 / ε) steps is sufficient.

[0037] We will provide an overview of the number of quantum states that will actually be stored for quantum states (1) to (3). A specific usage schedule will be described later with reference to Figure 3. Note that in the following, when the number of quantum states is written as "about x," "about" indicates that sufficiently small terms are ignored and the main terms are extracted.

[0038] (1) Pretreatment conditions R2R j -1The consumption interval of one gate is at least two steps. Therefore, R2R used in one step j -1 The number of gates can be considered to be at most 1 / 2. Therefore, 3 / 2d T log(1 / ε) rounds, R2R j -1 If the quantum state to be used for the gate is saved, the preprocessing state can be executed immediately. In other words, the number of quantum states to be prepared is about 3 / 2d T (log(1 / ε)) 2 There are 10 pieces.

[0039] (2) Actual calculation state Each R j -1 The consumption interval of one gate is at least two steps. Therefore, the R used in one step j -1 The number of gates can be considered to be at most 1 / 2. Here, R3 prepared in the actual calculation state -1 ,R4 -1 ,···,R log(1 / ε)+1 -1 The total number of quantum states required for a gate is approximately 1 / 2(log(1 / ε)) 2 Therefore, the number of quantum states used in one step is at most 1 / 4(log(1 / ε)) 2 Therefore, the number of quantum states to be prepared is about 3 / 4d T (log(1 / ε)) 3 There are 10 pieces.

[0040] (3) Post-processing status As in the pretreatment state, R2R j -1 The consumption interval of one gate is at least two steps. Therefore, R2R used in one step j -1 The number of gates can be considered to be at most 1 / 2. Therefore, 3 / 2d T log(1 / ε) rounds, R2R j -1 If the quantum state used for the gate is saved, the post-processing state can be executed immediately. In other words, the number of quantum states to be prepared is about 3 / 2dT (log(1 / ε)) 2 There are 10 pieces.

[0041] From the above, the number of quantum states to be prepared is determined by the number of quantum states of the actual calculation state (2). In other words, the number of quantum states to be prepared is about 3 / 4d T (log(1 / ε)) 3 It becomes an individual.

[0042] The operation of the approximate quantum Fourier transform device 10 according to the first embodiment will be described in detail with reference to FIG. In the flowchart of FIG. 3 and its explanation, a symbol indicating the application number is introduced for the application of a gate. First, when a gate is applied to [j], a quantum gate for one quantum bit is applied to the quantum bit numbered j. Also, when a controlled NOT gate is applied to [j,k], a controlled NOT gate is applied with the quantum bit numbered j as the control bit and the quantum bit numbered k as the target bit. Also, for [j,k] appearing in the flowchart of FIG. 3 and its explanation, if j or k is not within the quantum bit number range of 1 to n, then that [j,k] is considered to have been processed. Furthermore, element [j,k] for which j≧k holds is also considered to have been processed.

[0043] The process of step S201 corresponds to the process of step S101 in Fig. 2. The processes of steps S202 and S203 correspond to the process of step S102 in Fig. 2. The processes from step S204 onwards correspond to the processes of loop 1 in Fig. 2.

[0044] (Step S201: Quantum state preservation process) The quantum state storage unit 22 pre-calculates and stores a plurality of quantum states. (1) For the preprocessing state, the quantum state storage unit 22 stores the quantum bit number j in a state where 2≦j≦min(n, 3 / 2d T log(1 / ε)+1) quantum states corresponding to the gates required for each quantum bit j. Specifically, the quantum state storage unit 22 stores the R2R min(j+1,log(1 / ε)+1) -1Store the quantum state required for the gate. (2) For the actual computation state, the quantum state storage unit 22 stores R3 -1 ,R4 -1 , R log(1 / ε)+1 -1 Gate set 3 / 2d T Store all quantum states to be prepared in log(1 / ε) pairs. (3) For the post-processing state, the quantum state storage unit 22 stores the quantum bit number j in the range of 1≦j≦min(n, 3 / 2d T Specifically, the quantum state storage unit 22 stores the quantum states corresponding to the gates required for each quantum bit j. min(n-j+2,log(1 / ε)+1) -1 Store the quantum state required for the gate. The quantum state described above is generated by the state calculation unit 24 using the T-gate generated by the T-gate generation unit 23.

[0045] (Step S202: Initial value setting process) The actual calculation unit 21 provides an initial value of a feasible phase gate. Here, the actual calculation unit 21 provides [1, 2] to the set of subscripts S as the initial value of the phase gate.

[0046] (Step S203: First pre-processing) The actual calculation unit 21 performs (1) preprocessing using the preprocessing state on the quantum bit numbered 1. The specific processing will be described later with reference to FIG.

[0047] Next, the actual calculation unit 21 executes an approximate QFT. The actual calculation unit 21 repeatedly executes a loop 2 (the processes from step S204 to step S214) for each element s of the set S. Note that operations on each element s can be executed in parallel. In particular, it is assumed here that all elements s in an executable state included in the set S are executed in parallel. That is, the actual calculation unit 21 regards each element s in an executable state as a target element s and repeatedly executes the processes from step S204 to step S214 in parallel for all target elements s.

[0048] (Step S204: Element setting process) The actual calculation unit 21 sets the first component of the target element s to j and the second component to k.

[0049] (Step S205: Standby determination process) The actual calculation unit 21 judges whether or not both the processes of the element [j-1, k] and the element [j, k-1] have been completed. If both the processes have been completed, the actual calculation unit 21 shifts the process to step S206. On the other hand, if at least either process has not been completed, the actual calculation unit 21 returns the process to the beginning of the loop 2.

[0050] (Step S206: First Controlled NOT Gate Application Processing) The actual calculation unit 21 applies a controlled NOT gate with the quantum bit numbered j as the control bit and the quantum bit numbered k as the target bit.

[0051] (Step S207: Actual calculation process) The actual calculation unit 21 (2) uses the actual calculation state to apply a phase gate R k-j+2 -1 The specific process will be described later with reference to FIG.

[0052] (Step S208: Second Controlled NOT Gate Application Processing) The actual calculation unit 21 applies a controlled NOT gate with the quantum bit numbered j as the control bit and the quantum bit numbered k as the target bit. Then, the actual calculation unit 21 completes the processing of the element [j, k]. Specifically, the actual calculation unit 21 outputs the completion of the calculation of the element [j, k] to the progress output unit 32. The progress output unit 32 receives the output of the calculation completion and displays the calculation-completed part of the approximate QFT on the display 300.

[0053] (Step S209: k completion determination process) The actual calculation unit 21 judges whether the quantum bit with number k has been used as a target bit. Specifically, when kj=1, the actual calculation unit 21 judges that the quantum bit with number k has been used as a target bit. On the other hand, when kj=1 is not true, the actual calculation unit 21 judges that the quantum bit with number k has not been used as a target bit. When the actual calculation unit 21 has completed using the quantum bit with the number k as the target bit, the process proceeds to step S210. On the other hand, when the actual calculation unit 21 has not completed using the quantum bit with the number k as the target bit, the process proceeds to step S211.

[0054] (Step S210: Second pre-processing) The actual calculation unit 21 performs (1) preprocessing using the preprocessing state on the quantum bit numbered k. Specific processing will be described later with reference to FIG. 4, similar to the processing in step S203.

[0055] (Step S211: First element addition process) The actual calculation unit 21 adds the element [j+1, k] to the set S.

[0056] (Step S212: j completion determination process) The actual calculation unit 21 judges whether or not the condition that the operation with the quantum bit numbered j as the control bit is completed and the post-processing is not completed is satisfied for the quantum bit numbered j. If kj=log(1 / ε)−1 or k=n, the operation with the quantum bit numbered j as the control bit is completed. If the condition is satisfied, the actual calculation unit 21 shifts the process to step S213. On the other hand, if the condition is not satisfied, the actual calculation unit 21 shifts the process to step S214.

[0057] (Step S213: Post-processing) The actual calculation unit 21 performs (3) post-processing using the post-processing state on the quantum bit with number j. The specific processing will be described later with reference to FIG.

[0058] (Step S214: Adding a second element) The actual calculation unit 21 adds the element [j, k+1] to the set S.

[0059] (Step S215: Processing to determine whether all elements are complete) The actual calculation unit 21 judges whether or not the processing for all elements of the set S has been completed. When the processing of all elements is completed, the actual calculation unit 21 ends the processing. On the other hand, when there are elements for which the processing is not completed, the actual calculation unit 21 returns the processing to the beginning of the second loop.

[0060] The pre-processing according to the first embodiment (steps S203 and S210 in FIG. 3) will be described with reference to FIG. In the flowchart of FIG. 4 and its explanation, the parameters j and ε are assumed to be externally determined. In particular, the parameter j represents the number of the quantum bit to be preprocessed, and is unrelated to the subscript j in the previous explanation. The internal variable k is also unrelated to the previous explanation.

[0061] (Step S301: 1jth determination process) The actual calculation unit 21 judges whether the parameter j=1 or not. If the parameter j=1, the actual calculation unit 21 shifts the process to step S311. On the other hand, if the parameter j=1 is not true, the actual calculation unit 21 shifts the process to step S302.

[0062] (Step S302: Initialization process) The actual calculation unit 21 sets the parameter k to an initial value of 0. The parameter k represents the cumulative number of measurements.

[0063] (Step S303: Gate application process) The actual calculation unit 21 calls the (1) preprocessing state, which corresponds to the value of the parameter k and is stored in the quantum state storage unit 22. Specifically, the actual calculation unit 21 calls the (1) preprocessing state shown in Equation 17.

number

[0064] (Step S304: Measurement count accumulation process) The actual calculation unit 21 adds 1 to the parameter k.

[0065] (Step S305: Measurement process) The actual calculation unit 21 causes the measurement unit 31 to measure the quantum state called in step S303.

[0066] (Step S306: 2j-th determination process) The actual calculation unit 21 judges whether the parameter j≧log(1 / ε) holds. If the parameter j≧log(1 / ε), the actual calculation unit 21 shifts the process to step S307. On the other hand, if the parameter j≧log(1 / ε) does not hold, the actual calculation unit 21 shifts the process to step S308.

[0067] (Step S307: Quantum state regeneration process) The quantum state storage unit 22 starts regenerating the quantum state that was called and used in step S303. In step S307, the regeneration of the quantum state is merely started, and the process proceeds to step S308 without waiting for the generation of the quantum state to be completed.

[0068] (Step S308: Measurement result determination process) Actual calculation unit 21 determines whether the result measured in step S305 is zero or not. If the measurement result is 0, actual calculation unit 21 shifts the process to step S311. On the other hand, if the measurement result is not 0, actual calculation unit 21 shifts the process to step S309.

[0069] (Step S309: Measurement count determination process) The actual calculation unit 21 judges whether the number of measurements reaches a reference number. The reference number is min(j-1, log(1 / ε)-1). If the number of measurements has reached the reference number, actual calculation unit 21 moves the process to step S310. On the other hand, if the number of measurements has not reached the reference number, actual calculation unit 21 returns the process to step S303.

[0070] (Step S310: R2 -1 Gate application process) The actual calculation unit 21 calculates R2 -1 Apply the gate.

number

[0071] (Step S311: H-gate application process) The actual calculation unit 21 applies an H gate (Hadamard gate).

[0072] (Step S312: Progress output process) The actual calculation unit 21 outputs a signal indicating the completion of the calculation of the phase gate to the progress output unit 32. The progress output unit 32 receives the signal indicating the completion of the calculation and displays on the display 300 the part of the approximate QFT that has been calculated.

[0073] (Step S313: 3jth determination process) The actual calculation unit 21 judges whether the parameter j≧log(1 / ε) holds. The actual calculation unit 21 ends the process if the parameter j≧log(1 / ε). On the other hand, if the parameter j≧log(1 / ε) is not satisfied, the actual calculation unit 21 shifts the process to step S314.

[0074] (Step S314: Quantum state update process) The quantum state storage unit 22 is R2R j+1 -1 The quantum state for the gate is discarded. The quantum state storage unit 22 also discards the R2R log(1 / ε)+1 -1Generation of one set of quantum states for the gate is started. In step S314, the regeneration of the quantum states is merely started, and the process proceeds to the end state without waiting for the completion of the generation of the quantum states.

[0075] The actual calculation process (step S207 in FIG. 3) according to the first embodiment will be described with reference to FIG. In the flowchart of FIG. 5 and its explanation, j -1 The execution method of the gate is shown. The subscript j here is unrelated to the j that appeared in the previous explanation. The internal variable k is also unrelated to the previous explanation.

[0076] (Step S401: Initialization process) The actual calculation unit 21 sets the parameter k to an initial value of 0. The parameter k represents the cumulative number of measurements.

[0077] (Step S402: Gate application process) The real calculation unit 21 calls the (2) real calculation state, which corresponds to the value of the parameter k and is stored in the quantum state storage unit 22. Specifically, the real calculation unit 21 calls the (2) real calculation state shown in Equation 19.

number

[0078] (Step S403: Measurement count accumulation process) The actual calculation unit 21 adds 1 to the parameter k.

[0079] (Step S404: Measurement process) The actual calculation unit 21 causes the measurement unit 31 to measure the quantum state called in step S402.

[0080] (Step S405: Quantum state regeneration process) The quantum state storage unit 22 starts regenerating the quantum state that was called and used in step S402. In step S405, the regeneration of the quantum state is merely started, and the process proceeds to step S406 without waiting for the generation of the quantum state to be completed.

[0081] (Step S406: Measurement result determination process) The actual calculation unit 21 determines whether the result measured in step S404 is zero. If the measurement result is 0, actual calculation unit 21 shifts the process to step S409. On the other hand, if the measurement result is not 0, actual calculation unit 21 shifts the process to step S407.

[0082] (Step S407: Measurement count determination process) The actual calculation unit 21 judges whether the number of measurements has reached a reference number, which is j-2. If the number of measurements has reached the reference number, actual calculation unit 21 moves the process to step S408. On the other hand, if the number of measurements has not reached the reference number, actual calculation unit 21 returns the process to step S402.

[0083] (Step S408: R2 -1 Gate application process) The actual calculation unit 21 calculates R2 -1 Apply the gate.

number

[0084] (Step S409: Progress output process) The actual calculation unit 21 outputs a signal indicating that the phase gate has been calculated to the progress output unit 32. The progress output unit 32 receives the signal indicating that the calculation has been completed and displays on the display 300 the portion of the approximate QFT that has been calculated.

[0085] The post-processing according to the first embodiment (step S213 in FIG. 3) will be described with reference to FIG. In the flowchart of FIG. 6 and its explanation, the parameters j and ε are assumed to be externally determined. In particular, the parameter j represents the number of the quantum bit to be post-processed, and is unrelated to the subscript j in the previous explanation. The internal variable k is also unrelated to the previous explanation.

[0086] (Step S501: Initialization process) The actual calculation unit 21 sets the parameter k to an initial value of 0. The parameter k represents the cumulative number of measurements.

[0087] (Step S502: Gate application process) The actual calculation unit 21 calls the (3) post-processing state, which corresponds to the value of the parameter k and is stored in the quantum state storage unit 22. Specifically, the actual calculation unit 21 calls the (3) post-processing state shown in Equation 21.

number

[0088] (Step S503: Measurement count accumulation process) The actual calculation unit 21 adds 1 to the parameter k.

[0089] (Step S504: Measurement process) The actual calculation unit 21 causes the measurement unit 31 to measure the quantum state called in step S502.

[0090] (Step S505: 1jth determination process) The actual calculation unit 21 calculates the parameter j≦n-(3d T +1)log(1 / ε)+1 or not. The actual calculation unit 21 calculates the parameter j≦n-(3d T +1)log(1 / ε)+1, the process proceeds to step S506. TIf it is not equal to (+1)log(1 / ε)+1, the process proceeds to step S507.

[0091] (Step S506: Quantum state regeneration process) The quantum state storage unit 22 starts regenerating the quantum state that was called and used in step S502. Step S502 merely starts regenerating the quantum state, and the process proceeds to step S507 without waiting for the generation of the quantum state to be completed.

[0092] (Step S507: Measurement result determination process) The actual calculation unit 21 determines whether the result measured in step S504 is zero or not. If the measurement result is 0, actual calculation unit 21 shifts the process to step S510. On the other hand, if the measurement result is not 0, actual calculation unit 21 shifts the process to step S508.

[0093] (Step S508: Measurement count determination process) The actual calculation unit 21 judges whether the number of measurements reaches a reference number. The reference number is min(nj, log(1 / ε)−1). If the number of measurements has reached the reference number, actual calculation unit 21 moves the process to step S509. On the other hand, if the number of measurements has not reached the reference number, actual calculation unit 21 returns the process to step S502.

[0094] (Step S509: R2 -1 Gate application process) The actual calculation unit 21 calculates R2 -1 Apply the gate.

number

[0095] (Step S510: Progress output process) The actual calculation unit 21 outputs a signal indicating the completion of the calculation of the phase gate to the progress output unit 32. The progress output unit 32 receives the signal indicating the completion of the calculation and displays on the display 300 the part of the approximate QFT that has been calculated.

[0096] (Step S511: 2j-th determination process) The actual calculation unit 21 calculates the parameter j as follows: T +1)log(1 / ε)+1 <j≦n-3d T Determine whether log(1 / ε)-1 is satisfied. If the condition is satisfied, the actual calculation unit 21 shifts the process to step S512. On the other hand, if the condition is not satisfied, the actual calculation unit 21 ends the process.

[0097] (Step S512: quantum state update process) The quantum state storage unit 22 is R2R log(1 / ε)+1 -1 The quantum state for the gate is discarded. The quantum state storage unit 22 also discards the R2R n-3dTlog(1 / ε)+2-j -1 We start generating quantum states for the gate. Here, dT is d T In step S512, the regeneration of the quantum state is merely started, and the process proceeds to the end state without waiting for the completion of the generation of the quantum state.

[0098] ***Advantages of the First Embodiment*** As described above, the approximate quantum Fourier transform device 10 according to the first embodiment generates and stores in advance a quantum state for a phase gate that can be immediately executed by the quantum state storage unit 22. Then, the actual calculation unit 21 applies the phase gate by using the quantum state stored in the quantum state storage unit 22. As a result, a phase gate that conventionally required gate execution of approximately 3log(1 / ε) steps can be executed with a gate of expectation value 2 steps. Therefore, the approximate QFT executed by the approximate quantum Fourier transform device 10 according to the first embodiment differs from the conventional one in that each phase gate can be executed with a calculation time that does not depend on the approximation accuracy. Therefore, the approximate quantum Fourier transform device 10 can execute the approximate QFT at an extremely high speed compared to the conventional technology.

[0099] In addition to the n quantum bits used in the approximate QFT, the approximate quantum Fourier transform device 10 according to the first embodiment also uses approximately (3 / 4)d T (log(1 / ε)) 3 In the above explanation, the approximation accuracy of the approximate QFT is ε~n -a We assume that (a is a constant), and under this assumption, the number of additional qubits is approximately ((3a 3 ) / 4)d T (logn) 3 Here, in large-scale calculations where n becomes extremely large, ((3a 3 ) / 4)d T (logn) 3 <<n. Therefore, in the approximate QFT realized by the approximate quantum Fourier transform device 10, the number of quantum bits in the actual calculation unit 21 is the main term in the number of quantum bits. Therefore, the quantum bits in the quantum state storage unit 22 do not have a significant effect on the number of quantum bits required by the approximate quantum Fourier transform device 10.

[0100] ***Other configurations*** <Variation 1> In the first embodiment, each functional component is realized by software. However, as a first modification, each functional component may be realized by hardware. The following describes the first modification in terms of differences from the first embodiment.

[0101] The configuration of an approximate quantum Fourier transform device 10 according to the first modification will be described with reference to FIG. When each functional component is realized by hardware, the approximate quantum Fourier transform device 10 includes an electronic circuit 14 instead of the processor 11, the memory 12, and the storage 13. The electronic circuit 14 is a dedicated circuit for realizing the functions of each functional component, the memory 12, and the storage 13.

[0102] The electronic circuit 14 may be a single circuit, a composite circuit, a programmed processor, a parallel programmed processor, a logic IC, a GA, an ASIC, or an FPGA. GA is an abbreviation for Gate Array. ASIC is an abbreviation for Application Specific Integrated Circuit. FPGA is an abbreviation for Field-Programmable Gate Array. Each functional component may be realized by one electronic circuit 14, or each functional component may be distributed across multiple electronic circuits 14.

[0103] <Variation 2> As a second modification, some of the functional components may be realized by hardware, and other functional components may be realized by software.

[0104] The processor 11, the memory 12, the storage 13, and the electronic circuit 14 are collectively referred to as a processing circuit. In other words, the functions of the respective functional components are realized by the processing circuit.

[0105] In addition, the word "part" in the above description may be read as a "circuit," "step," "procedure," "processing," or "processing circuit."

[0106] The above describes the embodiments and modifications of the present disclosure. Some of these embodiments and modifications may be combined and implemented. Also, one or some of them may be partially implemented. Note that the present disclosure is not limited to the above embodiments and modifications, and various modifications are possible as necessary. [Explanation of symbols]

[0107] 10 Approximate quantum Fourier transform device, 11 Processor, 12 Memory, 13 Storage, 14 Electronic circuit, 20 Quantum calculation unit, 21 Real calculation unit, 22 Quantum state storage unit, 23 T-gate generation unit, 24 State calculation unit, 30 Classical calculation unit, 31 Measurement unit, 32 Progress output unit, 40 Display.

Claims

1. a real calculation unit that performs an approximate quantum Fourier transform by converting the state of the quantum bit; a quantum state storage unit for storing a plurality of quantum states used in the actual calculation unit; Equipped with The actual calculation unit calls and uses a quantum state required for conversion from the plurality of quantum states stored in the quantum state storage unit, The real calculation unit sequentially transitions the quantum bit to an operation state a in which an operation process is performed as a target bit of a control operation, and an operation state b in which an operation process is performed as a control bit of a control operation, The quantum state storage unit stores, for quantum bits that can be immediately executed, quantum states including a pre-processing state used to correct the phase shift when processing of the calculation state a is completed, an actual calculation state used in processing the calculation state b, and a post-processing state used to correct the phase shift when processing of the calculation state b is completed.

2. an actual calculation unit that performs an approximate quantum Fourier transform by converting the state of the quantum bit; a quantum state storage unit for storing a plurality of quantum states used in the actual calculation unit; Equipped with The actual calculation unit calls and uses a quantum state required for conversion from the plurality of quantum states stored in the quantum state storage unit, The actual calculation unit applies a phase gate, a Hadamard gate, and a controlled NOT gate to the quantum bit, and when applying the phase gate, calls up and uses the quantum state stored in the quantum state storage unit.

3. an actual calculation unit that performs an approximate quantum Fourier transform by converting the state of the quantum bit; a quantum state storage unit for storing a plurality of quantum states used in the actual calculation unit; Equipped with The actual calculation unit calls and uses a quantum state required for conversion from the plurality of quantum states stored in the quantum state storage unit, The quantum state storage unit discards quantum states for quantum bits that no longer require real-time execution, and generates and stores quantum states for quantum bits that require real-time execution, in accordance with the operation of the actual calculation unit.

4. an actual calculation unit that performs an approximate quantum Fourier transform by converting the state of the quantum bit; a quantum state storage unit for storing a plurality of quantum states used in the actual calculation unit; Equipped with The actual calculation unit calls and uses a quantum state required for conversion from the plurality of quantum states stored in the quantum state storage unit, The quantum state storage unit is an approximate quantum Fourier transform device that regenerates and stores a quantum state for a quantum bit that has been destroyed by the operation of the real calculation unit and still requires immediate execution.

5. When the progress of the process of converting the state of the quantum bit makes it possible to execute a process of converting the state of a new quantum bit, the actual calculation unit starts the process of converting the state of the new quantum bit.

5. An approximate quantum Fourier transform device according to claim 1.

6. The total time required to execute one control NOT gate and one measurement of the quantum state is defined as one step, and the time required to generate a T gate is defined as d T When the approximation accuracy is ε, the quantum bit that can be executed immediately is 3d T The quantum bit required in log(1 / ε) steps is 2. The approximate quantum Fourier transform device according to claim 1.

7. an actual calculation unit in the approximate quantum Fourier transform device performs an approximate quantum Fourier transform by converting the state of the quantum bit; a quantum state storage unit in the approximate quantum Fourier transform device stores a plurality of quantum states to be used in the actual calculation unit; The actual calculation unit calls and uses a quantum state required for conversion from the plurality of quantum states stored in the quantum state storage unit, The real calculation unit sequentially transitions the quantum bit to an operation state a in which an operation process is performed as a target bit of a control operation, and an operation state b in which an operation process is performed as a control bit of a control operation, The quantum state storage unit stores, for a quantum bit that can be immediately executed, quantum states including a pre-processing state used to correct the phase shift when processing of the calculation state a is completed, an actual calculation state used in processing the calculation state b, and a post-processing state used to correct the phase shift when processing of the calculation state b is completed.

8. an actual calculation unit in the approximate quantum Fourier transform device performs an approximate quantum Fourier transform by converting the state of the quantum bit; a quantum state storage unit in the approximate quantum Fourier transform device stores a plurality of quantum states to be used in the actual calculation unit; The actual calculation unit calls and uses a quantum state required for conversion from the plurality of quantum states stored in the quantum state storage unit, The actual calculation unit applies a phase gate, a Hadamard gate, and a controlled NOT gate to the quantum bit, and when applying the phase gate, calls and utilizes the quantum state stored in the quantum state storage unit.

9. an actual calculation unit in the approximate quantum Fourier transform device performs an approximate quantum Fourier transform by converting the state of the quantum bit; a quantum state storage unit in the approximate quantum Fourier transform device stores a plurality of quantum states to be used in the actual calculation unit; The actual calculation unit calls and uses a quantum state required for conversion from the plurality of quantum states stored in the quantum state storage unit, The quantum state storage unit discards quantum states for quantum bits that no longer require real-time execution, and generates and stores quantum states for quantum bits that require real-time execution, in accordance with the operation of the actual calculation unit.

10. an actual calculation unit in the approximate quantum Fourier transform device performs an approximate quantum Fourier transform by converting the state of the quantum bit; a quantum state storage unit in the approximate quantum Fourier transform device stores a plurality of quantum states to be used in the actual calculation unit; The actual calculation unit calls and uses a quantum state required for conversion from the plurality of quantum states stored in the quantum state storage unit, The quantum state storage unit regenerates and stores a quantum state for a quantum bit that is destroyed by the operation of the real calculation unit and still requires immediate execution.

11. an actual computation process that performs an approximate quantum Fourier transform by transforming the state of the quantum bit; A quantum state preservation process for preserving a plurality of quantum states used in the actual computation process; and causing the computer to function as an approximate quantum Fourier transform device that performs The actual computation process calls and utilizes a quantum state required for conversion from the plurality of quantum states stored in the quantum state storage process, The actual computation process sequentially transitions the quantum bit to an computation state a in which computation processing is performed as a target bit of a control computation, and an computation state b in which computation processing is performed as a control bit of a control computation, The quantum state preservation process is an approximate quantum Fourier transform program that preserves quantum states of a preprocessing state used to correct the phase shift when the processing of the calculation state a is completed, an actual calculation state used in the processing of the calculation state b, and a post-processing state used to correct the phase shift when the processing of the calculation state b is completed, for quantum bits that can be executed immediately.

12. an actual computation process that performs an approximate quantum Fourier transform by transforming the state of the quantum bit; A quantum state preservation process for preserving a plurality of quantum states used in the actual computation process; and causing the computer to function as an approximate quantum Fourier transform device that performs The actual computation process calls and utilizes a quantum state required for conversion from the plurality of quantum states stored in the quantum state storage process, The actual calculation process is an approximate quantum Fourier transform program that applies a phase gate, a Hadamard gate, and a controlled NOT gate to the quantum bit, and when applying the phase gate, calls and utilizes the quantum state stored in the quantum state storage process.

13. an actual computation process that performs an approximate quantum Fourier transform by transforming the state of the quantum bit; A quantum state preservation process for preserving a plurality of quantum states used in the actual computation process; and causing the computer to function as an approximate quantum Fourier transform device that performs The actual computation process calls and utilizes a quantum state required for conversion from the plurality of quantum states stored in the quantum state storage process, The quantum state preservation process is an approximate quantum Fourier transform program that discards quantum states for quantum bits that no longer require real-time execution and generates and preserves quantum states for quantum bits that require real-time execution, depending on the operation of the actual calculation process.

14. an actual computation process that performs an approximate quantum Fourier transform by transforming the state of the quantum bit; A quantum state preservation process for preserving a plurality of quantum states used in the actual computation process; and causing the computer to function as an approximate quantum Fourier transform device that performs The actual computation process calls and utilizes a quantum state required for conversion from the plurality of quantum states stored in the quantum state storage process, The quantum state preservation process is an approximate quantum Fourier transform program that regenerates and preserves the quantum state of quantum bits that have been destroyed by the operation of the actual calculation process and that still require immediate execution.