18 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
5 papers
Evaluating the solution performance of the augmented Lagrangian function on Ising machines
Shunsuke Awai, Takuro Itoh, Keita Takahashi +2
We apply the augmented Lagrangian function (ALF) as a formulation for Ising machines and evaluate its performance by time-to-epsilon (\mathrm{TT\varepsilon}). The ALF has been well…
Systematic and Efficient Construction of Quadratic Unconstrained Binary Optimization Forms for High-order and Dense Interactions
Hyakka Nakada, Shu Tanaka
Quantum Annealing (QA) can efficiently solve combinatorial optimization problems whose objective functions are represented by Quadratic Unconstrained Binary Optimization (QUBO) for…
Annealing-Assisted Column Generation for Inequality-Constrained Combinatorial Optimization Problems
Hiroshi Kanai, Masashi Yamashita, Kotaro Tanahashi +1
Ising machines are expected to solve combinatorial optimization problems faster than the existing integer programming solvers. These problems, particularly those encountered in pra…
Fermionic Quantum Approximate Optimization Algorithm
Takuya Yoshioka, Keita Sasada, Yuichiro Nakano +1
Quantum computers are expected to accelerate solving combinatorial optimization problems, including algorithms such as Grover adaptive search and quantum approximate optimization a…
Log-aesthetic Curves as Similarity Geometric Analogue of Euler's Elasticae
Jun-ichi Inoguchi, Kenji Kajiwara, Kenjiro T. Miura +3
In this paper we consider the log-aesthetic curves and their generalization which are used in CAGD. We consider those curves under similarity geometry and characterize them as stat…