3 papers
cs.LG2024
Efficient Bit Labeling in Factorization Machines with Annealing for Traveling Salesman Problem
Shota Koshikawa, Aruto Hosaka, Tsuyoshi Yoshida
To efficiently find an optimum parameter combination in a large-scale problem, it is a key to convert the parameters into available variables in actual machines. Specifically, quad…
quant-ph2024
Simplification of tensor updates toward performance-complexity balanced quantum computer simulation
Koichi Yanagisawa, Tsuyoshi Okubo, Shota Koshikawa +3
Matrix Product States (MPS) provide a powerful framework for simulating quantum circuits. In practical simulations, tensor updates are typically performed in the canonical form (CF…
quant-ph2023
Preconditioning for a Variational Quantum Linear Solver
Aruto Hosaka, Koichi Yanagisawa, Shota Koshikawa +3
We apply preconditioning, which is widely used in classical solvers for linear systems , to the variational quantum linear solver. By utilizing incomplete L…