Quantum computer, quantum computing method and program
The quantum computer employs an imaginary time evolution method to reduce gate operations, addressing the limitations of NISQ systems by enhancing error resilience and operational efficiency.
Patent Information
- Application Number
- JP2022505105
- Authority / Receiving Office
- JP · JP
- Patent Type
- Patents
- Current Assignee / Owner
- Priority Date
- 2020-03-06
- Filing Date
- 2021-02-17
- Publication Date
- 2024-11-01
- Estimated Expiration
- 2041-02-17
AI Technical Summary
The number of gate operations in NISQ (Noisy Intermediate-Scale Quantum) systems has a strict upper limit, making it difficult to realize quantum computers, and they are greatly affected by errors during gate operations, necessitating a reduction in the number of gate operations to enhance their practicality.
A quantum computer utilizing an imaginary time evolution method with a quantum processor and storage unit, where a cost function is set as a series of first operators acting on two qubits, and an imaginary time evolution operator is used to increase the probability of a desired level, with the first operator expressed as a series sum of second operators consisting of fewer qubit operations, reducing the total number of gate operations.
The method significantly reduces the number of gate operations, making it feasible for practical NISQ hardware implementation by minimizing errors and operational complexity.
Smart Images

Figure 0007576804000011 
Figure 0007576804000012 
Figure 0007576804000013
Abstract
Description
[Technical field]
[0001] The present invention relates to a quantum computer, a quantum computing method, and a program. [Background technology]
[0002] Quantum information processing, which uses quantum mechanics in information processing, has been proposed, and quantum computers based on this quantum information processing have been extensively studied.
[0003] For example, Non-Patent Document 1 discloses a quantum computing algorithm using the imaginary time evolution method. [Prior art documents] [Non-patent literature]
[0004] [Non-Patent Document 1] Mario Motta, Chong Sun, Adrian TKTan, Matthew J.O'Rourke, Erika Ye, Austin J.Minnich, Fernando GSL Brandao and Garnet Kin-Lic Chan “Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution”, Nature Physics 16,205-210(2020) Summary of the Invention [Problem to be solved by the invention]
[0005] However, there is a strict upper limit on the number of gate operations in NISQ that means it cannot be made too large. If the number of gate operations becomes enormous, not only will it be difficult to realize it as a quantum computer in the first place, but it will also be greatly affected by errors that occur during gate operations. For this reason, quantum computers, quantum computing methods, and programs that reduce the number of gate operations as much as possible are becoming important.
[0006] In view of the above circumstances, the present invention provides a technique for a quantum computer that reduces the total number of gate operations. [Means for solving the problem]
[0007] According to one aspect of the present invention, there is provided a quantum computer capable of processing an optimization problem using an imaginary time evolution method. The quantum computer includes a quantum processor and a storage unit. The quantum processor is configured to execute the following steps by reading out a program stored in the storage unit. In the cost function setting step, a predetermined cost function is set as a series sum of a first operator acting on two quantum bits. The cost function has a plurality of levels probabilistically. In the operation step, an imaginary time evolution operation that increases the existence probability of a desired level among the plurality of levels is performed by a quantum gate including an imaginary time evolution operator that depends on the first operator. When the imaginary time evolution operator is unitarized, the first operator is expressed as a series sum of a second operator that is composed of only a few quantum bit operations.
[0008] In such a quantum computer, the total number of gate operations is smaller than the usual number of gate operations when using the imaginary time evolution method, so it can be realized as realistic NISQ hardware. [Brief description of the drawings]
[0009] [Figure 1] FIG. 2 is a block diagram showing the hardware configuration of the quantum computer 1. [Diagram 2] FIG. 2 is a block diagram showing the functional configuration of the quantum computer 1 (control unit 5). [Diagram 3] This shows the relationship between the number of gate operations required to execute the imaginary time evolution operator U(Δτ) when truncated at a given number of quantum bits and the size of the problem. [Figure 4] This is an example of a schematic diagram of a Max-cut problem with N=10 elements. [Diagram 5]13 shows the manner in which the light converges to a desired level E in the conventional method (comparative example) and in the present embodiment when developed in imaginary time. [Figure 6] Another example of a schematic diagram for the Max-cut problem with N=10 elements. [Figure 7] 13 shows the manner in which the light converges to a desired level E in the conventional method (comparative example) and in the present embodiment when developed in imaginary time. [Figure 8] FIG. 2 is a block diagram showing a gate operation according to the present embodiment. [Figure 9] This shows the state of convergence to the desired level E when the Max-cut problem shown in Figure 4 is evolved in imaginary time using the new quantum computing method (D = 2) and when it is evolved in imaginary time using the new quantum computing method (D = 2) plus bundling of gate operations. [Figure 10] FIG. 1 is an activity diagram illustrating an example of a quantum computing method. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0010] DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Hereinafter, embodiments of the present invention will be described with reference to the drawings. Various characteristic features shown in the following embodiments can be combined with each other.
[0011] Incidentally, the program for realizing the software appearing in this embodiment may be provided as a non-transitory computer-readable recording medium, or may be provided so as to be downloadable from an external server, or may be provided so that the program is started on an external computer and its functions are realized on a client terminal (so-called cloud computing).
[0012] In this embodiment, the term "unit" may include, for example, a combination of hardware resources implemented by a circuit in the broad sense and software information processing that can be specifically realized by these hardware resources. In addition, this embodiment handles various information, which may be represented by, for example, physical values of signal values representing voltage and current, high and low signal values as a binary bit set consisting of 0 or 1, or quantum superposition (so-called quantum bits), and communication and calculation may be performed on a circuit in the broad sense.
[0013] In addition, a circuit in the broad sense is a circuit realized by at least appropriately combining a circuit, circuitry, a processor, and a memory, etc. In other words, it includes an application specific integrated circuit (ASIC), a programmable logic device (e.g., a simple programmable logic device (SPLD), a complex programmable logic device (CPLD), and a field programmable gate array (FPGA)), etc.
[0014] 1. Hardware Configuration In this section, a hardware configuration of a quantum computer 1 configured to be able to process optimization problems using the imaginary time evolution method will be described.
[0015] Fig. 1 is a block diagram showing the hardware configuration of a quantum computer 1. As shown in Fig. 1, the quantum computer 1 has a communication unit 3, a storage unit 4, a control unit 5, a display unit 6, and an input unit 7, and these components are connected via a communication bus 2 inside the quantum computer 1. Each component will be further described below.
[0016] (Communications Department 3) The communication unit 3 is used by the quantum computer 1 to communicate information with other information processing devices (including classical computers, quantum computers, or computers combining these) or peripheral devices. The communication unit 3 is preferably a wired communication means such as a quantum memory, USB, IEEE1394, Thunderbolt, wired LAN network communication, etc., but may also include wireless LAN network communication, mobile communication such as 3G / LTE / 5G, Bluetooth (registered trademark) communication, etc. as necessary. In other words, it is more preferable to implement it as a collection of multiple communication means.
[0017] (Storage unit 4) The storage unit 4 stores various information defined by the above description. This can be implemented as a storage device such as a quantum memory or a solid state drive (SSD), or as a memory such as a quantum memory or a random access memory (RAM) that stores temporarily necessary information (arguments, arrays, etc.) related to the calculation of a program. It may also be a combination of these.
[0018] In particular, the storage unit 4 stores a cost function setting unit program, an initialization program, a quantum gate program, a number determination program, and a specific program that can be read by the control unit 5 described below. The storage unit 4 also stores an optimization problem that can be processed by the quantum computer 1 as necessary.
[0019] (Control unit 5) The control unit 5 performs processing and control of the overall operation related to the quantum computer 1. The control unit 5 is, for example, a central processing unit (CPU) not shown. More preferably, the control unit 5 is a quantum processor. The control unit 5 realizes various functions related to the quantum computer 1 by reading a predetermined program stored in the storage unit 4 or input via the communication unit 3. Specifically, the functions include a cost function setting function, an initialization function, a quantum gate function, a number determination function, and a specification function. That is, information processing by software (stored in the storage unit 4 or input from another information processing device via the communication unit 3) is specifically realized by hardware (the control unit 5), and can be executed as a cost function setting unit 51, an initialization unit 52, a quantum gate 53, a number determination unit 54, and a specification unit 55 as shown in FIG. 2. These will be described in detail in Section 2.
[0020] 1, a single control unit 5 is shown, but in reality, this is not limited to this, and multiple control units 5 may be provided for different functions. Also, a combination of these may be used.
[0021] (Display section 6) The display unit 6 may be, for example, included in the housing of the quantum computer 1, or may be externally attached. The display unit 6 displays a screen of a graphical user interface (GUI) that can be operated by a user. This is preferably implemented as an appropriate display device such as a CRT display, a liquid crystal display, an organic EL display, or a plasma display.
[0022] (Input section 7) The input unit 7 may be included in the housing of the quantum computer 1, or may be externally attached. For example, the input unit 7 may be implemented as a touch panel integrated with the display unit 6. If it is a touch panel, the user can input tap operations, swipe operations, and the like. Of course, a switch button, a mouse, a QWERTY keyboard, and the like may be used instead of a touch panel. The user can input an optimization problem (for example, a Max-cut problem described later) to be processed by the quantum computer 1 via the input unit 7.
[0023] 2. Functional configuration In this section, the functional configuration of the quantum computer 1 according to this embodiment will be described. Fig. 2 is a block diagram showing the functional configuration of the quantum computer 1 (control unit 5). With respect to the above-mentioned control unit 5, the quantum computer 1 includes a cost function setting unit 51, an initialization unit 52, a quantum gate 53, a number determination unit 54, and an identification unit 55. Each component will be further described below.
[0024] (Cost function setting unit 51) The cost function setting unit 51 is configured to set a predetermined cost function L as a series sum of a first operator L_ij acting on two quantum bits for an optimization problem input by a user via the input unit 7 or the communication unit 3. Here, the cost function L has a plurality of levels probabilistically. In other words, the cost function L holds a plurality of solutions superimposed on each other in a quantum mechanical manner, one of which is determined probabilistically by observation.
[0025] (Initialization unit 52) The initialization unit 52 is configured to initialize the cost function L set by the cost function setting unit 51. For example, the initialization unit 52 can initialize the cost function L by applying a Hadamard gate to all quantum bits as an initial state. The initialized cost function L has a plurality of levels with equal probability. In addition to using an initial state having a plurality of levels with equal probability, a state generated by some other method can also be used as the initial state.
[0026] (Quantum Gate 53) The quantum gate 53 includes an imaginary time evolution operator U that depends on the first operator L_ij. The quantum gate 53 is composed of a plurality of (for example, X) quantum gates 531, 532, 533, ..., 53X (see FIG. 2). The quantum gate 53 is configured to execute an imaginary time evolution operation that increases the existence probability of a desired level E among a plurality of levels by the imaginary time evolution operator U. Incidentally, in the operation by the quantum gate 53, it is essential to make the operator unitary. For example, when making the imaginary time evolution operator U unitary, the first operator L_ij can be expressed as a series sum of two quantum bits, three quantum bits, four quantum bits, or more quantum bits.
[0027] However, the number of gate operations increases exponentially with the number of quantum bits, for example, the number of gate operations when cutting off at 2 quantum bits is about 16N using the number of quantum bits N, the number of gate operations when cutting off at 3 quantum bits is about 96N, the number of gate operations when cutting off at 4 quantum bits is about 512N, and the number of gate operations when cutting off at D quantum bit operations is generally 4^D*D(N-1) / 2. In addition, it is generally known that at least 6 quantum bit operations are necessary to maintain meaningful calculation accuracy, so a large number of gate operations are required, and using such an imaginary time evolution operator U does not result in a computational complexity suitable for NISQ. (See Figure 3)
[0028] Therefore, in this embodiment, when the imaginary time evolution operator U is unitarized, the first operator L_ij is expressed as a series sum of second operators A_kl, A_klm, . . . consisting of only a few quantum bit operations. The few quantum bits referred to here are 2, 3, 4, 5 quantum bits, preferably 2, 3, 4 quantum bits, more preferably 2, 3 quantum bits, and most preferably 2 quantum bits. In other words, by cutting off the operation up to a few quantum bit operations, the number of gate operations in one quantum gate 53 can be reduced. Preferably, the first operator L_ij includes a first subscript set ij that is independent of each other, and the second operators A_kl, A_klm, . . . include a second subscript set kl, klm, . . . that is independent of the first subscript set ij. As a result, the number of gate operations when cutting off the operation up to D quantum bit operations can generally be suppressed to the order of 4^D*N^{D-1}. For example, if the second operator is truncated to 2 qubit operations, the number of gate operations will be about 16N, and if it is truncated to 3 qubit operations, the number of gate operations will be about 64N^2. (However, even if it is truncated to 3 qubit operations, the number of gate operations can be reduced to the order of N by incorporating only a part of the second operator A_klm.) For example, the problem of dividing the nodes of a weighted graph into two groups (so-called Max-cut problem) is an example of an optimization problem that can be handled without loss of generality. For such optimization problems, it has been confirmed that truncating to 2 qubit operations as the second operator provides sufficient accuracy, and one quantum gate 53 has a number of gate operations of the order of about 16N to solve the optimization problem. FIG. 4 is a schematic diagram of a Max-cut problem with the number of elements N=10. Of course, this is merely an example, and any problem may be set as long as it includes optimization problems in which the number of calculations increases exponentially in classical computers, as well as optimization problems that appear in electronic state calculations, machine learning, etc.
[0029] (Number of times determination unit 54) In this embodiment, when the imaginary time evolution operator U is unitarized, it is more preferable to treat the first gate operation originally performed in the imaginary time step Δτ unit as one new second gate operation by integrating the critical number of times Δk. In such a case, the number of times determination unit 54 is configured to determine the critical number of times Δk so that the error of the imaginary time evolution between the case where the first gate operation is performed and the case where the second gate operation is performed falls within a predetermined range. The number of times of the critical number of times Δk determined by the number of times determination unit 54 does not need to be uniquely determined, and preferably, the number of times determination unit 54 is configured to determine the critical number of times Δk for each second gate operation. In other words, the number of times determination unit 54 can be reduced to about 1 / Δk times.
[0030] As a method for determining the critical number Δk, preferably, the number determination unit 54 repeatedly executes an increase process for increasing the critical number by one, and when the energy of the system rises in the increase process in a predetermined number of times, the increase process is interrupted and the critical number is set to the predetermined number of times or a value one smaller than the predetermined number of times. In other words, while appropriately performing an increase process for increasing the value of Δk by one, a first gate operation is sequentially generated as a second gate operation, and when the energy of the system rises when the second operator is applied before and after the increase process for increasing Δk by one at a certain timing, the update of the value of Δk can be terminated at that point. This is because the error of the imaginary time evolution accumulates due to the consolidation, and the magnitude of the error becomes larger to the same level as the effect of lowering the energy by the imaginary time evolution operator U.
[0031] (Specific Section 55) The identifying unit 55 is configured to identify a desired level E of the cost function L evolved in imaginary time by the quantum gate 53. As described above, the quantum gate 53 and the number determining unit 54 are repeated a required number of times to evolve the cost function L in imaginary time, and as a result, the probability of existence of the desired level E (low cost or low energy) increases. In the case of the Max-cut problem shown in Fig. 4, a value obtained by multiplying the level E identified by the identifying unit 55 by -1 can be identified as the solution to the optimization problem, and 11 is identified as the solution.
[0032] 3. Theory In this paper, we supplement the quantum mechanical theory of functional organization mentioned above.
[0033] 3.1 Two-qubit truncation The cost function L for a given problem is expressed as shown in Equation 1 using the first operator L_i.
number
[0034] In contrast, the imaginary time evolution operator U(NΔτ), which advances time in the imaginary time direction by NΔτ, is expressed as in Equation 2.
number
[0035] Furthermore, the imaginary time evolution operator U(Δτ), which advances time in the imaginary time direction by Δτ, is expressed as in Equation 3.
number
[0036] Therefore, the imaginary time evolution operator U(NΔτ) is expressed as the product of the imaginary time evolution operator U(Δτ) as shown in Equation 4.
number
[0037] In each imaginary time evolution operator U(Δτ), there are N_pair (order of magnitude of N^2) gate operations. If the number of steps in Δτ is N_step, the total number of gate operations is generally expressed as in Equation 5.
number
[0038] Here, the first operator L_i is an operator that usually acts on two quantum bits, so we will write it as the first operator L_ij again. When unitarizing the imaginary time evolution operator U, in order to realize a good unitarization of the imaginary time step, L_ij included in the imaginary time evolution operator U is expressed by two or more quantum bit operations (see Equation 6).
number
[0039] Figure 3 shows the relationship between the number of gate operations required to execute the imaginary time evolution operator U(Δτ) when truncated at a specified number of quantum bits, and the problem size. Comparative Example A is truncated at 4 quantum bit operations. Comparative Example B is truncated at 3 quantum bit operations. Comparative Example C is truncated at 2 quantum bit operations. As such, since D quantum bit operations include 4^D*D(N-1) / 2 gate operations, it is desirable to avoid including operations with multiple quantum bits or more whenever possible. On the other hand, the following demonstration example shows that 6 quantum bit operations or more are necessary to achieve unitarization while maintaining calculation accuracy.
[0040] The inventors have newly discovered that by expressing the first operator L_ij as a series sum of second operators A_kl, A_klm, ... having a second subscript set kl, klm, ... that is independent of the first subscript set ij contained in the first operator L_ij, as shown in Equation 7, sufficient accuracy can be maintained even when truncated to a small number of quantum bit operations, and this is adopted in the present embodiment.
number
[0041] As a proof of the effectiveness of this computational method, Fig. 5 shows the result of applying it to the Max-cut problem shown in Fig. 4. This computational method, program, and quantum computer are executed on a quantum computer, but here, the effectiveness of the computational method, program, and quantum computer were demonstrated by simulating the quantum computer using a classical computer.
[0042] FIG. 5 shows the state of convergence to the desired level E in the conventional method (for comparison) and the present embodiment in the case of imaginary time evolution. From FIG. 5, the effectiveness of the new calculation method is demonstrated. It can be seen that the conventional method does not provide accuracy when it is terminated at D=2, but sufficient accuracy is obtained by truncating at D=6. On the other hand, it can be seen that the new calculation method already provides accuracy equivalent to D=6 (conventional method) at D=2. On the other hand, it should be noted that the number of gate operations at the new D=2 is 1 / 768 of the number of gate operations at D=6 (conventional method), which is suitable for NISQ. Furthermore, when the conventional method and the new calculation method are applied to another Max-cut problem with the number of elements N=10 shown in FIG. 6 and compared, it can be seen that the conventional method does not provide accuracy even at D=6, while the new calculation method already provides good accuracy at D=2. (See FIG. 7)
[0043] Fig. 8 is a block diagram showing gate operations according to this embodiment. As shown in Fig. 7, in the case of this embodiment where the operation is truncated to 2 quantum bits (and it has been confirmed that sufficient accuracy is achieved even when the operation is truncated to 2 quantum bits), the number of gate operations is significantly reduced to the order of N (N is the number of quantum bits). It should be noted that by reducing the number of gate operations in this way, the possibility of implementation in NISQ has increased.
[0044] 3.2 Bundling of gate operations In this embodiment, in order to further reduce the number of gate operations, attention is focused on the approximation shown in Equation 8.
number
[0045] Such an approximation is preferably one in which Δτ is sufficiently small and is acceptable on the first order of Δτ. Since it is merely an approximation, it is not preferable to use it as the entire imaginary time evolution, but within a certain error range, it can be, for example, an operation (second gate operation) in which three gate operations (first gate operations) are combined into one (see Equation 9). In this way, the number N_critical of first gate operations combined into the second gate operation corresponds to the above-mentioned critical number Δk.
number
[0046] Therefore, by bundling the gate operations in this way, the total number of gate operations can be expressed as follows: Note that by further reducing the number of gate operations in this way, the feasibility of implementing it on NISQ has been further improved.
number
[0047] Figure 9 shows the state of convergence to the desired level E when the Max-cut problem shown in Figure 4 is evolved in imaginary time using the new quantum computing method (D=2) and when the imaginary time evolution is performed by bundling gate operations in addition to the new quantum computing method (D=2). By repeating the second gate operation, as shown in Figure 9, it is possible to converge the existence probability of the desired level E to a value close to 1. It can be seen that this is comparable to the case where bundling of gate operations is not performed.
[0048] 4.Quantum calculation method In this section, a quantum computing method based on the quantum computer 1 will be described. This quantum computing method includes a cost function setting step and an imaginary time evolution step. In the cost function setting step, a predetermined cost function L is set as a series sum of a first operator L_ij acting on two quantum bits. Here, the cost function L has a plurality of levels probabilistically. In the imaginary time evolution step, an imaginary time evolution is performed that increases the existence probability of a desired level E among a plurality of levels by an imaginary time evolution operator U that depends on the first operator L_ij. Here, when the imaginary time evolution operator U is unitarized, the first operator L_ij is expressed as a series sum of second operators A_kl, A_klm, . . . that are composed of only a few quantum bit operations. Preferably, when the imaginary time evolution operator U is unitarized, the first gate operation that is originally performed in an imaginary time step Δτ unit is treated as one new second gate operation by combining them with a critical number of times Δk. This computational technique is performed on a quantum computer, or as a quantum computer simulation on a classical computer.
[0049] 10 is an activity diagram showing an example of a quantum computing method. Hereinafter, this quantum computing method will be described along with each activity in FIG.
[0050] (Activity A1) For an optimization problem input in advance via the input unit 7 or the communication unit 3, the cost function setting unit 51 sets a cost function L. In other words, the quantum processor, which is an example of the control unit 5, reads out a program stored in the storage unit 4, thereby executing the cost function setting step.
[0051] (Activities A2 and A3) An initialization unit 52 initializes the quantum bits of the cost function L. The first operator L_ij that is truncated at the above-mentioned small number of quantum bit operations (operations of about two quantum bits or three quantum bits) is set.
[0052] (Activities A4-A6) Activities A4 to A6 are repeatedly executed as a process of imaginary time evolution. First, the number determining unit 54 determines a critical number Δk at which a plurality of first gate operations are bundled as a second gate operation within an allowable error range. In other words, the quantum processor, which is an example of the control unit 5, executes the critical number determining step by reading a program stored in the storage unit 4. Then, the quantum gate 53 collectively executes these as a second gate operation. After that, k is advanced by Δk and the process is repeated. This progresses the imaginary time evolution. In other words, the quantum processor, which is an example of the control unit 5, executes the calculation step by reading a program stored in the storage unit 4.
[0053] (Activity A7) When the imaginary time evolution is performed, the identification unit 55 identifies a desired level E whose existence probability converges to 1. In other words, a quantum processor, which is an example of the control unit 5, executes an identification step by reading out a program stored in the storage unit 4.
[0054] 5. Variations This section describes modified examples of the quantum computer 1. That is, the quantum computer 1 according to this embodiment may be further improved in the following manner.
[0055] (1) The effect of the small number of quantum bits truncation and the effect of bundling of gate operations occur independently, so it is possible to implement only one of them. (2) A program may be implemented to cause a computer to execute each step in the quantum computer 1. This program may be in a form that can be downloaded from a server, or the program may be executed or distributed on a cloud computer, or such a program may be stored in a non-volatile or volatile storage medium and distributed.
[0056] 6. Conclusion As described above, according to this embodiment, it is possible to implement a quantum computer, a quantum computing method, and a program that reduce the total number of gate operations.
[0057] It may be provided in any of the following ways: In the quantum computer, the first operator includes a first set of indices that are independent of each other, and the second operator includes a second set of indices that is independent of the first set of indices. In the quantum computer, the quantum processor is configured to further execute a specific step by reading out a program stored in the memory unit, and in the specific step, a desired level of the cost function evolved in imaginary time by the quantum gate is specified. In the quantum computer, one of the quantum gates has a number of gates on the order of the number of quantum bits included in the cost function for solving the optimization problem. In the quantum computer, the optimization problem includes a problem in which the number of calculations increases exponentially in a classical computer, a problem that appears in electronic state calculations, or an optimization problem that appears in machine learning. A quantum computer capable of processing an optimization problem using an imaginary time evolution method, comprising a quantum processor, the quantum processor being configured to execute each of the following steps by reading out a program stored in the storage unit, wherein in a cost function setting step, a predetermined cost function is set as a series sum of a first operator acting on two quantum bits, where the cost function has a plurality of levels probabilistically, in a calculation step, an imaginary time evolution calculation is executed by a quantum gate including an imaginary time evolution operator depending on the first operator, which increases the existence probability of a desired level among the plurality of levels, and when the imaginary time evolution operator is unitized, a first gate operation that is originally executed in an imaginary time step unit is treated as one new second gate operation a critical number of times to execute the calculation. In the quantum computer, the quantum processor is configured to further execute a number determination step by reading out a program stored in the memory unit, and in the number determination step, the critical number is determined so that an error in imaginary time evolution between a case where the first gate operation is performed and a case where the second gate operation is performed falls within a predetermined range. In the quantum computer, in the number determination step, the critical number is determined for each of the second gate operations. In the quantum computer, in the count determination step, an increase process for increasing the critical count by one is repeatedly executed, and if the energy of the system increases in the increase process in a predetermined iteration, the increase process is interrupted and the critical count is set to the value of the predetermined iteration or one less than that. A quantum computing method capable of processing an optimization problem using an imaginary time evolution method, comprising: a cost function setting step; and an operation step, wherein in the cost function setting step, a predetermined cost function is set as a series sum of a first operator acting on two quantum bits, wherein the cost function has a plurality of levels probabilistically, and in the operation step, an imaginary time evolution operation is performed by a quantum gate including an imaginary time evolution operator depending on the first operator, which increases the existence probability of a desired level among the plurality of levels, wherein, when the imaginary time evolution operator is unitarized, the first operator is expressed as a series sum of a second operator consisting of only a few quantum bit operations. 11. The quantum computing method of claim 10, wherein the first operators include a first set of indices that are independent of each other, and the second operators include a second set of indices that are independent of the first set of indices. The quantum computing method further comprises a specifying step, in which the desired level of the cost function evolved in imaginary time by the quantum gate is specified. In the quantum computing method, one of the quantum gates has a number of gates on the order of the number of quantum bits included in the cost function for solving the optimization problem. In the quantum computing method, the optimization problem includes a problem in which the number of calculations increases exponentially in a classical computer, a problem that appears in electronic state calculations, or an optimization problem that appears in machine learning. A quantum computing method capable of processing an optimization problem using an imaginary time evolution method, comprising: a cost function setting step; and a calculation step, wherein in the cost function setting step, a predetermined cost function is set as a series sum of a first operator acting on two quantum bits, where the cost function has a plurality of levels probabilistically, and in the calculation step, an imaginary time evolution is performed by a quantum gate including an imaginary time evolution operator depending on the first operator, which increases the existence probability of a desired level among the plurality of levels, and when the imaginary time evolution operator is unitized, a first gate operation that is originally performed per imaginary time step is treated as one new second gate operation a critical number of times to execute the calculation. The quantum computing method further includes a count determination step, in which the critical count is determined so that an error in imaginary time evolution between a case where the first gate operation is performed and a case where the second gate operation is performed falls within a predetermined range. In the quantum computing method, in the number determination step, the critical number is determined for each of the second gate operations. In the quantum computing method, in the count determination step, an increase process for increasing the critical count by one is repeatedly performed, and if the energy of the system increases in the increase process in a predetermined iteration, the increase process is interrupted and the critical count is set to the value of the predetermined iteration or one less than this. A program that causes a computer to execute each step of the quantum computing method. Of course, this is not the case.
[0058] Finally, although various embodiments of the present invention have been described, these are presented as examples and are not intended to limit the scope of the invention. The novel embodiments can be implemented in various other forms, and various omissions, substitutions, and modifications can be made without departing from the spirit of the invention. The embodiments and their modifications are included within the scope and spirit of the invention, and are included in the scope of the invention and its equivalents described in the claims. [Explanation of symbols]
[0059] 1:Quantum computer 2: Communication bus 3: Communications Department 4: Storage section 5: Control section 51: Cost function setting section 52: Initialization section 53: Quantum Gate 531: Quantum Gate 532: Quantum Gate 533: Quantum Gate 53X: Quantum Gate 54: Number of times determination section 55: Specific part 6:Display section 7: Input section
Claims
1. A quantum computer capable of processing optimization problems using an imaginary time evolution method, A quantum processor and a memory unit are provided. The quantum processor is configured to execute each of the following steps by reading out the program stored in the storage unit: In the cost function setting step, a predetermined cost function is set as a series sum of a first operator acting on two quantum bits, where the cost function has a plurality of levels probabilistically; In the operation step, an operation of imaginary time evolution that increases the existence probability of a desired level among the plurality of levels is executed by a quantum gate including an imaginary time evolution operator that depends on the first operator, and in this case, when the imaginary time evolution operator is unitarized, the first operator is expressed as a series sum of a second operator consisting of only a few quantum bit operations.
2. 2. The quantum computer according to claim 1, the first operator includes a first set of mutually independent subscripts; The second operator includes a second index set that is independent of the first index set.
3. 3. The quantum computer according to claim 1, The quantum processor is configured to further execute a specific step by reading a program stored in the storage unit; In the identifying step, the desired level of the cost function evolved in imaginary time by the quantum gate is identified.
4. In the quantum computer according to any one of claims 1 to 3, One of the quantum gates has a number of gates on the order of the number of quantum bits included in the cost function for solving the optimization problem.
5. 5. The quantum computer according to claim 4, The optimization problem includes a problem in which the number of calculations increases exponentially in a classical computer, a problem that appears in electronic state calculations, or an optimization problem that appears in machine learning.
6. A quantum computer capable of processing optimization problems using an imaginary time evolution method, A quantum processor and a memory unit are provided. The quantum processor is configured to execute each of the following steps by reading out the program stored in the storage unit: In the cost function setting step, a predetermined cost function is set as a series sum of a first operator acting on two quantum bits, where the cost function has a plurality of levels probabilistically; In the calculation step, performing an imaginary time evolution operation that increases the existence probability of a desired level among the plurality of levels by a quantum gate including an imaginary time evolution operator that depends on the first operator; When the imaginary time evolution operator is unitarized, a first gate operation that is originally performed in an imaginary time step unit is treated as one new second gate operation a critical number of times together to execute an operation.
7. 7. The quantum computer according to claim 6, The quantum processor is configured to further execute a number determination step by reading out a program stored in the storage unit; In the number determination step, the critical number is determined so that an error in imaginary time evolution between a case where the first gate operation is performed and a case where the second gate operation is performed falls within a predetermined range.
8. 8. The quantum computer according to claim 7, In the number determining step, the critical number is determined for each of the second gate operations.
9. 9. The quantum computer according to claim 8, In the number determining step, Repeatedly executing an increase process of increasing the critical count by one; If the energy of the system rises during the increase process for a predetermined number of times, the increase process is interrupted and the critical number is set to the predetermined number of times or a value one smaller than the predetermined number of times.
10. A quantum computing method capable of processing an optimization problem using an imaginary time evolution method, comprising: The method includes a cost function setting step and a calculation step, In the cost function setting step, a predetermined cost function is set as a series sum of a first operator acting on two quantum bits, where the cost function has a plurality of levels probabilistically; In the operation step, an operation of imaginary time evolution that increases the existence probability of a desired level among the plurality of levels is performed by a quantum gate including an imaginary time evolution operator that depends on the first operator, and in this case, when the imaginary time evolution operator is unitarized, the first operator is expressed as a series sum of a second operator consisting of only a few quantum bit operations.
11. 11. The quantum computing method according to claim 10, the first operator includes a first set of mutually independent subscripts; The method of claim 1, wherein the second operator includes a second index set that is independent of the first index set.
12. The quantum computing method according to claim 10 or 11, Further comprising a specific step, The method of claim 1, wherein the identifying step identifies the desired level of the cost function evolved in imaginary time by the quantum gate.
13. The quantum computing method according to any one of claims 10 to 12, One of the quantum gates has a number of gates on the order of the number of quantum bits included in the cost function for solving the optimization problem.
14. 14. The quantum computing method according to claim 13, The method, wherein the optimization problem includes a problem in which the number of calculations increases exponentially in a classical computer, a problem that appears in electronic state calculations, or an optimization problem that appears in machine learning.
15. A quantum computing method capable of processing an optimization problem using an imaginary time evolution method, comprising: The method includes a cost function setting step and a calculation step, In the cost function setting step, a predetermined cost function is set as a series sum of a first operator acting on two quantum bits, where the cost function has a plurality of levels probabilistically; In the calculation step, Implementing an imaginary time evolution that increases the existence probability of a desired level among the multiple levels by a quantum gate including an imaginary time evolution operator that depends on the first operator; When the imaginary time evolution operator is unitarized, a first gate operation that is originally performed in an imaginary time step unit is treated as one new second gate operation a critical number of times together to perform an operation.
16. 16. The quantum computing method according to claim 15, Further comprising a number determining step, The method of claim 1, wherein in the number determining step, the critical number is determined so that an error in imaginary time evolution between a case where the first gate operation is performed and a case where the second gate operation is performed falls within a predetermined range.
17. 17. The quantum computing method according to claim 16, In the number determining step, the critical number of times is determined for each of the second gate operations.
18. 18. The quantum computing method according to claim 17, In the number determining step, Repeatedly executing an increase process of increasing the critical count by one; A method for setting the critical number to the predetermined number or a value one smaller than the predetermined number when the energy of the system rises during the increasing process for a predetermined number of times, the increasing process is interrupted.
19. A program, A method for causing a computer to execute each step of the quantum computing method according to any one of claims 10 to 18.
