Novel real number representations in Ising machines and performance evaluation: Combinatorial random number sum and constant division

• Published in: PloS one Vol. 19; no. 6; p. e0304594
• Main Authors: Endo, Katsuhiro, Matsuda, Yoshiki, Tanaka, Shu, Muramatsu, Mayu
• Format: Journal Article
• Language: English
• Published: United States Public Library of Science 13.06.2024
• Subjects: Accuracy; Algorithms; Analysis; Annealing; Combinatorial analysis; Computer and Information Sciences; Computer Simulation; Computers; Energy; Ising model; Linear equations; Middleware; Models, Theoretical; Optimization; Performance evaluation; Physical Sciences; Physical simulation; Qubits (quantum computing); Random numbers; Real numbers; Real variables; Representations; Research and Analysis Methods; Simulation; Variables
• ISSN: 1932-6203; 1932-6203
• DOI: 10.1371/journal.pone.0304594

Quantum annealing machines are next-generation computers for solving combinatorial optimization problems. Although physical simulations are one of the most promising applications of quantum annealing machines, a method how to embed the target problem into the machines has not been developed except for certain simple examples. In this study, we focus on a method of representing real numbers using binary variables, or quantum bits. One of the most important problems for conducting physical simulation by quantum annealing machines is how to represent the real number with quantum bits. The variables in physical simulations are often represented by real numbers but real numbers must be represented by a combination of binary variables in quantum annealing, such as quadratic unconstrained binary optimization (QUBO). Conventionally, real numbers have been represented by assigning each digit of their binary number representation to a binary variable. Considering the classical annealing point of view, we noticed that when real numbers are represented in binary numbers, there are numbers that can only be reached by inverting several bits simultaneously under the restriction of not increasing a given Hamiltonian, which makes the optimization very difficult. In this work, we propose three new types of real number representation and compared these representations under the problem of solving linear equations. As a result, we found experimentally that the accuracy of the solution varies significantly depending on how the real numbers are represented. We also found that the most appropriate representation depends on the size and difficulty of the problem to be solved and that these differences show a consistent trend for two annealing solvers. Finally, we explain the reasons for these differences using simple models, the minimum required number of simultaneous bit flips, one-way probabilistic bit-flip energy minimization, and simulation of ideal quantum annealing machine.