most citedEfficient partition of integer optimization problems with one-hot encoding

196 citations · 309 across the 5 of their papers we have counts for

collaborators

5 papers

quant-ph2019★ 196 cited

Efficient partition of integer optimization problems with one-hot encoding

Shuntaro Okada, Masayuki Ohzeki, Shinichiro Taguchi

Quantum annealing is a heuristic algorithm for solving combinatorial optimization problems, and D-Wave Systems Inc. has developed hardware for implementing this algorithm. The curr…

quant-ph2019★ 1 cited

Quantum Annealing of Vehicle Routing Problem with Time, State and Capacity

Hirotaka Irie, Goragot Wongpaisarnsin, Masayoshi Terabe +2

We propose a brand-new formulation of capacitated vehicle routing problem (CVRP) as quadratic unconstrained binary optimization (QUBO). The formulated CVRP is equipped with time-ta…

quant-ph2019★ 97 cited

Improving solutions by embedding larger subproblems in a D-Wave quantum annealer

Shuntaro Okada, Masayuki Ohzeki, Masayoshi Terabe +1

Quantum annealing is a heuristic algorithm that solves combinatorial optimization problems, and D-Wave Systems Inc. has developed hardware implementation of this algorithm. However…

cond-mat.dis-nn2018★ 1 cited

Optimization of neural networks via finite-value quantum fluctuations

Masayuki Ohzeki, Shuntaro Okada, Masayoshi Terabe +1

We numerically test an optimization method for deep neural networks (DNNs) using quantum fluctuations inspired by quantum annealing. For efficient optimization, our method utilizes…

cond-mat.stat-mech2018★ 14 cited

Statistical-mechanical analysis of compressed sensing for Hamiltonian estimation of Ising spin glass

Chako Takahashi, Masayuki Ohzeki, Shuntaro Okada +3

Several powerful machines, such as the D-Wave 2000Q, dedicated to solving combinatorial optimization problems through the Ising-model formulation have been developed. To input prob…