System, information processing method and program
The system addresses measurement errors in quantum annealing by clustering and calculating representative values from multiple spin calculations, enhancing the accuracy of problem-solving in quantum annealing systems.
Patent Information
- Application Number
- JP2020102891
- Authority / Receiving Office
- JP · JP
- Patent Type
- Patents
- Current Assignee / Owner
- Filing Date
- 2020-06-15
- Publication Date
- 2024-11-11
- Estimated Expiration
- 2040-06-15
AI Technical Summary
Existing quantum annealing systems face measurement errors that occur when determining quantum states, with limited research on reducing such errors.
A system and method that utilizes an annealing machine to interact between multiple spins, calculates low energy states, clusters calculation results based on Hamming distances, and calculates representative values using majority vote or predetermined ratios to reduce measurement errors.
Reduces measurement errors in quantum states, enabling more accurate estimation of solutions to problems by obtaining spin values closer to the ground state.
Smart Images

Figure 0007580209000001 
Figure 0007580209000002 
Figure 0007580209000003
Abstract
Description
[Technical field]
[0001] The present invention relates to a system, an information processing method, and a program. [Background technology]
[0002] In recent years, annealing machines have been used to estimate a solution to a given problem by setting desired interactions between multiple spins and determining the ground states of the multiple spins.
[0003] For example, the following Patent Document 1 describes the results of research into error correction for reducing the effects of decoherence in quantum annealing. [Prior art documents] [Non-patent literature]
[0004] [Non-Patent Document 1] Kristen L. Pudenz, Tameem Albash and Daniel A. Lidar, "Error-corrected quantum annealing with hundreds of qubits", Nature Communications volume 5, Article number: 3243, 2014 Summary of the Invention [Problem to be solved by the invention]
[0005] Although the technique described in Non-Patent Document 1 can reduce the effects of decoherence in quantum annealing, unintended changes in the quantum state can also occur when measuring the quantum state. There has been relatively little research to date on reducing such measurement errors.
[0006] Therefore, the present invention provides a system, an information processing method, and a program for reducing measurement errors of a quantum state and estimating a solution to a problem. [Means for solving the problem]
[0007] A system according to one embodiment of the present disclosure includes one or more processors, and the one or more processors execute a process of setting interactions between multiple spins corresponding to a specified problem in an annealing machine, acquiring multiple calculation results obtained by controlling the annealing machine to calculate low-energy states of the multiple spins from the annealing machine, calculating one representative value from the multiple calculation results for each of the multiple spins, and estimating a solution to the specified problem based on the representative value of each of the multiple spins.
[0008] According to this aspect, a representative value with reduced measurement error can be calculated for each of a plurality of spins, and a solution to a predetermined problem can be estimated with higher accuracy. Effect of the Invention
[0009] According to the present invention, it is possible to provide a system, an information processing method, and a program for reducing measurement errors of a quantum state and estimating a solution to a problem. [Brief description of the drawings]
[0010] [Figure 1] FIG. 1 is a diagram illustrating an overview of a system according to an embodiment of the present disclosure. [Diagram 2] FIG. 11 is a diagram showing an example of a spin value of an annealing machine obtained by the system according to the present embodiment. [Diagram 3] FIG. 4 is a diagram showing a first example of a representative value of spin calculated by the system according to the present embodiment. [Figure 4] FIG. 11 is a diagram showing a second example of the representative value of spin calculated by the system according to the embodiment. [Diagram 5] FIG. 11 is a diagram showing a third example of a representative value of spin calculated by the system according to the embodiment. [Figure 6] FIG. 2 is a diagram illustrating a configuration of a client computer according to the present embodiment. [Figure 7]FIG. 2 is a diagram showing a configuration of a server computer according to the present embodiment. [Figure 8] 4 is a flowchart of a process executed by the system according to the present embodiment. [Figure 9] 4 is a flowchart of a process executed by the system according to the present embodiment. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0011] Hereinafter, embodiments of the present disclosure will be described in detail with reference to the drawings. Note that the same elements are denoted by the same reference numerals, and duplicated descriptions will be omitted.
[0012] In this embodiment, a system 10 is described that calculates low energy states of multiple spins corresponding to a solution to a specified problem multiple times using an annealing machine 20, and estimates the solution to the specified problem based on representative values of each of the multiple spins.
[0013] <System application examples> FIG. 1 is a diagram showing an overview of a system 10 according to an embodiment of the present disclosure. The system 10 includes a client computer 500, a server computer 600, and an annealing machine 20. The client computer 500 and the server computer 600 are configured as general-purpose classical computers, as will be described in detail later. The annealing machine 20 is configured as a classical computer or a quantum computer, and may be, for example, a quantum computer that includes multiple quantum bits, adjusts the interactions between the quantum bits to set a desired Hamiltonian, and uses quantum annealing to find the basis state of the quantum bits. However, the annealing machine 20 may also be a classical computer that reproduces quantum annealing.
[0014] The client computer 500 is connected to the server computer 600 via a communication network such as the Internet. The server computer 600 is connected to the annealing machine 20 via a communication network such as a LAN (Local Area Network). A user of the client computer 500 operates the client computer 500 to indirectly send commands to the annealing machine 20, and uses the annealing machine 20 to estimate a solution to a given problem. Note that the configuration of the system 10 is not limited to that shown in this application example. For example, the annealing machine 20 may be connected to the client computer 500 via a communication network such as a LAN, not via the server computer 600.
[0015] 2 is a diagram showing an example of the spin value of the annealing machine 20 acquired by the system 10 according to this embodiment. The system 10 sets interactions between multiple spins corresponding to a predetermined problem in the annealing machine 20, and acquires multiple calculation results from the annealing machine 20, which are obtained by controlling the annealing machine 20 to calculate low energy states of multiple spins. In this example, for the sake of simplicity, the results of calculating low energy states six times for six spins are shown, but the number of spins and the number of calculations of the low energy state are arbitrary.
[0016] In this example, in the first calculation, the value of the first spin is 1, and the values of the second to sixth spins are 0. In the second calculation, the values of the first to sixth spins are 0. In the fourth calculation, the values of the first to fourth spins are 0, the value of the fifth spin is 1, and the value of the sixth spin is 0. Here, the Hamming distance between the spin sequence in the first calculation and the spin sequence in the second calculation is 1, and the Hamming distance between the spin sequence in the first calculation and the spin sequence in the fourth calculation is also 1.
[0017] In this example, in the third calculation, the values of the first to sixth spins are 1, and in the fifth calculation, the values of the first to third spins are 1, the value of the fourth spin is 0, and the values of the fifth to sixth spins are 1. Furthermore, in the sixth calculation, the value of the first spin is 0, and the values of the second to sixth spins are 1. Here, the Hamming distance between the spin sequence in the third calculation and the spin sequence in the fifth calculation is 1, and the Hamming distance between the spin sequence in the third calculation and the spin sequence in the sixth calculation is also 1.
[0018] Furthermore, the Hamming distance between the spin sequence in any one of the first, second and fourth calculations and the spin sequence in any one of the third, fifth and sixth calculations is 4 or greater.
[0019] The system 10 clusters the calculation results based on the Hamming distances of the spin values in the calculation results. In this example, the first, second and fourth calculation results are classified into a first cluster C1, and the third, fifth and sixth calculation results are classified into a second cluster C2.
[0020] 3 is a diagram showing a first example of a representative value of spins calculated by the system 10 according to the present embodiment. This figure shows an example of calculating representative values of multiple spins for the first cluster C1 and the second cluster C2 defined in FIG.
[0021] The system 10 calculates one representative value for each of the multiple spins for one or more clusters obtained by clustering. For example, for the first, second, and fourth calculation results included in the first cluster C1, the system 10 calculates the representative value for each spin by majority vote. That is, the system 10 calculates the most frequently observed value for each spin as the representative value.
[0022] The method of calculating the representative value is not limited to the above method, and the system 10 may calculate a value that accounts for a predetermined percentage or more of the calculation results for each of the multiple spins as the representative value. Here, the predetermined percentage is, for example, 60%. In other words, the system 10 may calculate an average value of the multiple calculation results for each spin, and set the representative value to 1 if the average value is equal to or greater than an upper threshold value (e.g., 0.6), and set the representative value to 0 if the average value is equal to or less than a lower threshold value (e.g., 0.4).
[0023] As a result of the calculation of the representative value by the system 10, the representative value of the spin sequence for the first cluster C1 becomes 000000, and the representative value of the spin sequence for the second cluster C2 becomes 111111. In this way, the calculated representative value of the spin sequence does not necessarily have to be the spin sequence included in the original cluster. The system 10 calculates the energy of multiple spins based on the representative value for each of one or multiple clusters, and estimates the value of multiple spins with the lowest energy as the solution to the specified problem. In this example, the system 10 calculates the energy when the values of the first to sixth spins are 000000 and the energy when the values of the first to sixth spins are 111111, and estimates the value of multiple spins with the lowest energy as the solution to the specified problem. The energy of multiple spins is calculated by substituting the representative value into the Hamiltonian of the multiple spins.
[0024] In this way, the system 10 according to the present embodiment can obtain a spin value with reduced measurement error by calculating a representative value for each of the multiple spins, and can estimate a solution to a given problem with higher accuracy. Even if the multiple calculation results include not only the ground state but also the excited state, the system 10 can distinguish the calculation results corresponding to different energy levels by clustering the multiple calculation results, and can obtain a spin value closer to the ground state while reducing the measurement error.
[0025] 4 is a diagram showing a second example of the representative values of spins calculated by the system 10 according to this embodiment. In this example, the Hamming distance between the spin sequence in the first calculation and the spin sequence in the second calculation is 1, the Hamming distance between the spin sequence in the first calculation and the spin sequence in the third calculation is 1, and the Hamming distance between the spin sequence in the second calculation and the spin sequence in the fourth calculation is 1. Therefore, when multiple calculation results are clustered based on the Hamming distance, the first to fourth calculation results are classified into one cluster.
[0026] In the examples shown in Figs. 2 and 3, it was possible to calculate a representative value for the first to sixth spins included in each cluster by majority vote, but in this example, it is not possible to calculate a representative value for the first spin by majority vote on the four calculation results. In other words, the values of the first spin are 0 and 1 at a ratio of 50% each, and it is unclear which value should be adopted. In this way, when no value appears that occupies a predetermined ratio or more in the multiple calculation results for one of the multiple spins, the system 10 estimates a solution to the specified problem based on the two values of one spin and the representative value of the multiple spins excluding that one spin.
[0027] The system 10 calculates the energy for a first representative value (101110) in which the value of the first spin is 1 and the values of the second to sixth spins are each representative values determined by majority vote, and for a second representative value (001110) in which the value of the first spin is 0 and the values of the second to sixth spins are each representative values determined by majority vote, and estimates the multiple spin values with the lowest energy to be the solution to the specified problem.
[0028] In this way, the system 10 according to this embodiment can obtain a spin value closer to the ground state even when it is not possible to calculate a representative value for any one of the multiple spins by majority vote.
[0029] 5 is a diagram showing a third example of the representative values of spins calculated by the system 10 according to this embodiment. In this example, the Hamming distance between the spin sequence in the first calculation and the spin sequence in the third calculation is 2, the Hamming distance between the spin sequence in the first calculation and the spin sequence in the fourth calculation is 2, and the Hamming distance between the spin sequence in the second calculation and the spin sequence in the fourth calculation is 2. Therefore, when multiple calculation results are clustered based on the Hamming distance, the first to fourth calculation results are classified into one cluster.
[0030] In the example shown in Figs. 2 and 3, it was possible to calculate a representative value by majority vote for the first to sixth spins included in each cluster, but in this example, it is not possible to calculate a representative value for the first and second spins by majority vote for the four calculation results. That is, the values of the first and second spins are 0 and 1 at a ratio of 50% each, and it is not clear which value should be adopted. In this way, when a value that occupies a predetermined ratio or more in the multiple calculation results does not appear for one or more spins among the multiple spins, the system 10 clusters the values of one or more spins based on the Hamming distance for the values of the one or more spins, and calculates a representative value of one or more spins for each of one or more clusters obtained by clustering. Then, a solution to a predetermined problem is estimated based on the representative value of one or more spins and the representative value of multiple spins excluding the one or more spins. In this way, for one or more spins for which it is not possible to calculate a representative value by majority vote, recursive clustering is performed to calculate a representative value of the cluster.
[0031] The system 10 performs clustering on the first spins and second spins for which a representative value cannot be calculated by majority vote. In this example, the pattern "10" appears 50% of the time, and the pattern "01" appears 50% of the time, so the system 10 calculates the two patterns "10" and "01" as representative values of the clusters of the first spin and second spin values.
[0032] The system 10 calculates the energy for a first representative value (101110) in which the representative value of the cluster of the first spin and the second spin is "10" and the values of the third to sixth spins are each determined by majority vote, and for a second representative value (011110) in which the representative value of the cluster of the first spin and the second spin is "01" and the values of the third to sixth spins are each determined by majority vote, and estimates the value of the multiple spins with the lowest energy to be the solution to the specified problem.
[0033] In this way, the system 10 according to this embodiment can obtain a spin value closer to the ground state even when it is not possible to calculate a representative value by majority vote for one or more of the multiple spins.
[0034] <Example of configuration> 6 is a block diagram illustrating a client computer 500 according to one embodiment. The client computer 500 typically includes one or more processing units (CPUs) 502, one or more network or other communication interfaces 508, memory 504, and one or more communication buses 514 for interconnecting these components.
[0035] The client computer 500 may also include a user interface 506 that includes a display device 510 and a keyboard and / or mouse (or some other pointing device) 512 .
[0036] Memory 504 may be, for example, a high-speed random access memory such as DRAM, SRAM, DDR RAM, or other random access solid-state storage device, or may be a non-volatile memory such as one or more magnetic disk storage devices, optical disk storage devices, flash memory devices, or other non-volatile solid-state storage devices.
[0037] As another example, memory 504 may be one or more storage devices located remotely from CPU 502. In one embodiment, memory 504 stores the following programs, modules and data structures, or a subset thereof:
[0038] Operating system 516, for example, handles various basic system services and contains procedures for executing tasks using the hardware.
[0039] The network communications module 518 is used, for example, to connect the client computer 500 to other computers via one or more communications network interfaces 508 and one or more communications networks, such as the Internet, other wide area networks, local area networks, metropolitan area networks, etc.
[0040] The annealing machine control module 520 accepts, for example, input of information for setting multiple spins of the annealing machine 20 and the Hamiltonian of the spins via a keyboard and / or mouse 512, and transmits the input to the server computer 600. The annealing machine control module 520 obtains multiple calculation results obtained by controlling the annealing machine 20 to calculate low energy states of multiple spins from the annealing machine 20 via the server computer 600, or obtains the results directly from the annealing machine 20 without going through the server computer 600.
[0041] The calculation module 522 calculates one representative value for each of the multiple spins from multiple calculation results by the annealing machine 20. The calculation module 522 clusters the multiple calculation results based on, for example, the Hamming distances related to the values of the multiple spins in the multiple calculation results, and calculates one representative value for each of the multiple spins for one or more clusters obtained by the clustering.
[0042] The estimation module 524 estimates a solution to the predetermined problem based on the representative values of the plurality of spins. For example, the estimation module 524 calculates the energies of the plurality of spins based on the representative values for one or more clusters obtained by the calculation module 522, and estimates the values of the plurality of spins with the lowest energy as the solution to the predetermined problem.
[0043] The client application 530 may include, for example, a web browser.
[0044] One or more processing units (CPUs) 502 read out and execute each module from memory 504 as necessary. For example, one or more processing units (CPUs) 502 may configure a communication unit by executing a network communication module 518 stored in memory 504. Also, one or more processing units (CPUs) 502 may configure an annealing machine control unit by executing an annealing machine control module 520 stored in memory 504, may configure a calculation unit by executing a calculation module 522, or may configure an estimation unit by executing an estimation module 524. Here, the annealing machine control unit, the calculation unit, and the estimation unit may be configured inside the CPU 502.
[0045] In other embodiments, the annealing machine control module 520, the calculation module 522, and the estimation module 524 may be standalone applications stored in the memory 504 of the client computer 500. Standalone applications include, but are not limited to, an annealing machine control application, a calculation application, and an estimation application. In yet other embodiments, the annealing machine control module 520, the calculation module 522, and the estimation module 524 may be add-ons or plug-ins to another application. For example, the annealing machine control module 520 may be a plug-in to a web browser application or an email application.
[0046] In one embodiment, the received data items may be cached locally in memory 504. Similarly, information regarding the low energy states of spins determined by annealing machine 20 may be cached locally in memory 504.
[0047] Each of the elements identified above may be stored in one or more of the storage devices discussed above. Each of the modules identified above corresponds to a set of instructions for performing a function described above. The modules or programs (i.e., sets of instructions) identified above need not be implemented as separate software programs, procedures, or modules, and thus various subsets of these modules may be combined or reconfigured in various embodiments. In some embodiments, memory 504 may store a subset of the modules and data structures identified above. Additionally, memory 504 may store additional modules and data structures not described above.
[0048] 7 is a block diagram illustrating a server computer 600 according to one embodiment. The server computer 600 typically includes one or more processing units (CPUs) 602, one or more network or other communication interfaces 608, memory 604, and one or more communication buses 610 for interconnecting these components.
[0049] Server system 600 may optionally include a user interface 606, which may include a display device (not shown), and a keyboard and / or mouse (not shown).
[0050] Memory 604 may be, for example, a high-speed random access memory such as DRAM, SRAM, DDR RAM, or other random access solid-state storage device, or may be a non-volatile memory such as one or more magnetic disk storage devices, optical disk storage devices, flash memory devices, or other non-volatile solid-state storage devices.
[0051] Additionally, another example of memory 604 may include one or more storage devices located remotely from CPU 602. In one embodiment, memory 604 stores the following programs, modules and data structures, or a subset thereof:
[0052] Operating system 612, for example, handles various basic system services and contains procedures for executing tasks using the hardware.
[0053] The network communications module 614 is used, for example, to connect the server system 600 to other computers via one or more communications network interfaces 606 and one or more communications networks, such as the Internet, other wide area networks, local area networks, metropolitan area networks, etc.
[0054] The annealing machine control module 616 receives, for example, information for setting multiple spins of the annealing machine 20 and Hamiltonians for the spins from the client computer 500, and controls the annealing machine 20. The annealing machine control module 616 acquires, from the annealing machine 20, multiple calculation results obtained by controlling the annealing machine 20 to calculate low-energy states of multiple spins.
[0055] The calculation module 618 calculates one representative value for each of the multiple spins from the multiple calculation results by the annealing machine 20. The calculation module 618 clusters the multiple calculation results based on, for example, the Hamming distances related to the multiple spin values in the multiple calculation results, and calculates one representative value for each of the multiple spins for one or more clusters obtained by the clustering.
[0056] The estimation module 620 estimates a solution to the predetermined problem based on the representative values of the plurality of spins. For example, the estimation module 620 calculates the energies of the plurality of spins based on the representative values for one or more clusters obtained by the calculation module 618, and estimates the values of the plurality of spins with the lowest energy as the solution to the predetermined problem.
[0057] Each of the elements identified above may be stored in one or more of the storage devices discussed above. Each of the modules identified above corresponds to a set of instructions for performing a function described above. The modules or programs (i.e., sets of instructions) identified above need not be implemented as separate software programs, procedures, or modules, and thus various subsets of these modules may be combined or reconfigured in various embodiments. In some embodiments, memory 604 may store a subset of the modules and data structures identified above. Additionally, memory 604 may store additional modules and data structures not described above.
[0058] Although Figure 7 illustrates a "server computer," Figure 7 is intended as an illustration of various features that may be present in a set of servers, rather than as a structural overview of the embodiments described herein. In practice, and as will be recognized by those skilled in the art, items shown separately could be combined and certain items could be separated. For example, items shown separately in Figure 7 could be implemented on a single server and a single item could be implemented by one or more servers.
[0059] <Operation description> Next, the operation of the system 10 according to this embodiment will be described. Figures 8 and 9 are flowcharts showing an example of the processing of the system 10 according to this embodiment. In the example shown in Figure 8, in step S15, the system 10 estimates a solution to a given problem based on the low-energy state obtained by the annealing machine 20.
[0060] (Step S10) The system 10 first sets up interactions between multiple spins corresponding to a given problem in an annealing machine 20 .
[0061] (Step S11) The system 10 obtains from the annealing machine 20 a plurality of calculation results obtained by controlling the annealing machine 20 to calculate a plurality of low energy states of spins.
[0062] (Step S12) The system 10 clusters the plurality of calculation results based on the Hamming distances for the values of the plurality of spins in the plurality of calculation results.
[0063] (Step S13) Thereafter, if a value that occupies a predetermined proportion or more of the multiple calculation results does not appear for one or more of the multiple spins, the system 10 executes the process shown in Fig. 9. On the other hand, if a value that occupies a predetermined proportion or more of the multiple calculation results appears for all of the multiple spins, the system 10 executes the processes of steps S14 and S15.
[0064] (Step S14) The system 10 then calculates, for each of the plurality of spins, one representative value for each of the one or more clusters determined by the clustering.
[0065] (Step S15) Finally, the system 10 calculates the energies of the spins based on the representative values for one or more clusters, and estimates the values of the spins with the lowest energies as a solution to the given problem.
[0066] As a result, the system 10 according to the present embodiment can reduce measurement errors by calculating a representative value for each of a plurality of spins, and can estimate the solution to a given problem with higher accuracy.
[0067] (Step S20) When no value occupying a predetermined ratio or more appears among the multiple calculation results, it is considered that a group of spins that should be decomposed into two or more clusters in step S12 has been classified into one cluster. Therefore, the system 10 recursively performs clustering on one or more spins that do not have a value occupying a predetermined ratio or more among the multiple calculation results.
[0068] (Step S21) Furthermore, the system 10 calculates a representative value for each of one or more clusters calculated for one or more spins in which no value occupies a predetermined percentage or more of the multiple calculation results.
[0069] (Step S22) The system 10 then estimates a solution to the given problem based on the representative values of the one or more spins and the representative values of a number of spins excluding the one or more spins.
[0070] As a result, the system 10 of this embodiment can calculate a representative value for each of the multiple spins to reduce measurement error, even if no value appears that accounts for a predetermined percentage or more of the multiple calculation results for one or more spins, and can more accurately estimate the solution to a specified problem.
[0071] The disclosed technology is not limited to the above-mentioned embodiments, and can be implemented in various other forms without departing from the spirit of the disclosed technology. Therefore, the above-mentioned embodiments are merely examples in every respect and should not be interpreted as being restrictive. For example, the above-mentioned processing steps can be arbitrarily changed in order or executed in parallel as long as there is no contradiction in the processing content.
[0072] The program of the embodiment of the present disclosure may be provided in a state stored in a computer-readable storage medium. The storage medium can store the program in a "non-transitory tangible medium." The program includes, but is not limited to, a software program or a computer program. [Explanation of symbols]
[0073] 10...system, 20...annealing machine, 21a...first spin, 21b...second spin, 21c...third spin, 22a...first auxiliary spin, 22b...second auxiliary spin, 22c...third auxiliary spin, 500...client computer, 502...CPU, 504...memory, 506...user interface, 508...network communication interface, 510...display, 512...keyboard / mouse, 514...communication bus, 516...operating system, 518...network communication module, 520...annealing machine control module, 522...calculation module, 524...estimation module, 530...client application, 600...server computer, 602...CPU, 604...memory, 606...user interface, 608...network communication interface, 610...communication bus, 612...operating system, 614...network communication module, 616...annealing machine control module, 618...calculation module, 620...estimation module
Claims
1. 1. A system comprising: one or more processors; the one or more processors: The interactions between multiple spins corresponding to a given problem are set in the annealing machine, acquiring, from the annealing machine, a plurality of calculation results obtained by controlling the annealing machine so as to calculate low energy states of the plurality of spins; calculating a representative value from the plurality of calculation results for the predetermined problem for each of the plurality of spins; estimating a solution to the predetermined problem based on the representative values of each of the plurality of spins. The system that performs the processing.
2. clustering the plurality of calculation results based on Hamming distances related to the plurality of spin values in the plurality of calculation results; Calculating the representative value calculating one representative value for each of one or more clusters obtained by the clustering; The estimating step comprises: estimating the predetermined solution based on a representative value for each of the one or more clusters. The system of claim 1 .
3. The estimating step comprises: calculating energies of the plurality of spins for each of the one or more clusters based on the representative value, and estimating a value of the plurality of spins for which the energy is minimum as a solution to the predetermined problem. The system of claim 2.
4. Calculating the representative value calculating, for each of the plurality of spins, a value that occupies a predetermined proportion or more of the plurality of calculation results as the representative value; A system according to any one of claims 1 to 3.
5. The estimating step comprises: when no value occupying a predetermined ratio or more of the multiple calculation results appears for one or more of the multiple spins, clustering the values of the one or more spins based on a Hamming distance for the values of the one or more spins, calculating a representative value of the one or more spins for each of one or more clusters obtained by the clustering, and estimating a solution to the predetermined problem based on the representative value of the one or more spins and the representative value of the multiple spins excluding the one or more spins. The system of claim 4.
6. when no value occupying a predetermined ratio or more of the multiple calculation results appears for one or more of the multiple spins, recursively clustering the values of the one or more spins based on a Hamming distance for the values of the one or more spins, calculating a representative value of the one or more spins for each of one or more clusters obtained by the clustering, and estimating a solution to the predetermined problem based on the representative value of the one or more spins and the representative value of the multiple spins excluding the one or more spins. The system of claim 5.
7. 1. An information processing method executed by a system including one or more processors, comprising: the one or more processors The interactions between multiple spins corresponding to a given problem are set in the annealing machine, acquiring, from the annealing machine, a plurality of calculation results obtained by controlling the annealing machine so as to calculate low energy states of the plurality of spins; calculating a representative value from the plurality of calculation results for the predetermined problem for each of the plurality of spins; estimating a solution to the predetermined problem based on the representative values of each of the plurality of spins. A method for processing information.
8. One or more processors included in the system The interactions between multiple spins corresponding to a given problem are set in the annealing machine, acquiring, from the annealing machine, a plurality of calculation results obtained by controlling the annealing machine so as to calculate low energy states of the plurality of spins; calculating a representative value from the plurality of calculation results for the predetermined problem for each of the plurality of spins; estimating a solution to the predetermined problem based on the representative values of each of the plurality of spins. A program that executes a process.
Citation Information
Patent Citations
Information processing device and information processing method
JP2015191340A
