2.4k citations · 2.5k across the 13 of their papers we have counts for
13 papers
Experimental implementation of quantum greedy optimization on quantum computer
Tadayoshi Matsumori, Tadashi Kadowaki
This paper implements a quantum greedy optimization algorithm based on the discretization of time evolution (d-QGO). Quantum greedy optimization, which was originally developed for…
Enhancing Quantum Annealing in Digital-Analog Quantum Computing
Tadashi Kadowaki
Digital-analog quantum computing (DAQC) offers a promising approach to addressing the challenges of building a practical quantum computer. By efficiently allocating resources betwe…
Demonstration of the excited-state search on the D-wave quantum annealer
Takashi Imoto, Yuki Susa, Ryoji Miyazaki +2
Quantum annealing is a way to prepare an eigenstate of the problem Hamiltonian. Starting from an eigenstate of a trivial Hamiltonian, we slowly change the Hamiltonian to the proble…
Lossy compression of matrices by black-box optimisation of mixed integer nonlinear programming
Tadashi Kadowaki, Mitsuru Ambai
In edge computing, suppressing data size is a challenge for machine learning models that perform complex tasks such as autonomous driving, in which computational resources (speed,…
Application of QUBO solver using black-box optimization to structural design for resonance avoidance
Tadayoshi Matsumori, Masato Taki, Tadashi Kadowaki
Quadratic unconstrained binary optimization (QUBO) solvers can be applied to design an optimal structure to avoid resonance. QUBO algorithms that work on a classical or quantum dev…
Greedy parameter optimization for diabatic quantum annealing
Tadashi Kadowaki, Hidetoshi Nishimori
A shorter processing time is desirable for quantum computation to minimize the effects of noise. We propose a simple procedure to variationally determine a set of parameters in the…