3 citations · 3 across the 2 of their papers we have counts for
3 papers
quant-ph2020
Finding high-order Hadamard matrices by using quantum computers
Andriyan Bayu Suksmono, Yuichiro Minato
Solving hard problems is one of the most important issues in computing to be addressed by a quantum computer. Previously, we have shown that the H-SEARCH; which is the problem of f…
quant-ph2019★ 3 cited
Solving tiling puzzles with quantum annealing
Asa Eagle, Takumi Kato, Yuichiro Minato
To solve tiling puzzles, such as "pentomino" or "tetromino" puzzles, we need to find the correct solutions out of numerous combinations of rotations or piece locations. Solving thi…
quant-ph2019
Finding Hadamard matrices by a quantum annealing machine
Andriyan Bayu Suksmono, Yuichiro Minato
Finding a Hadamard matrix (H-matrix) among the set of all binary matrices of corresponding order is a hard problem, which potentially can be solved by quantum computing. We propose…