Masaki Kugaya
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Masaki Kugaya has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Koushi Teramoto
The University of Electro-Communications
1 shared publication - Shuhei Kudo
The University of Electro-Communications
1 shared publication - Yasuhiko Takenaga
The University of Electro-Communications, Japan
1 shared publication - Yusaku Yamamoto
Department of Communication Engineering and Informatics, The University of Electro-Communications, Tokyo, Japan
1 shared publication
Latest Publications
- Open Access
- 18 January 2024
- Published by Association for Computing Machinery (ACM)
- p. 47-54
Approximate Block Diagonalization of Symmetric Matrices Using Quantum Annealing
We consider the problem of transforming a given symmetric matrix into a nearly block diagonal form by permutation of its rows and columns. Such a transformation is useful as preconditioning to accelerate the convergence of an eigenvalue solver, but the problem of finding an optimal permutation that maximizes the Frobenius norms of the diagonal blocks is NP-complete. We formulate this problem as QUBO (Quadratic Unconstrained Binary Optimization) and solve it using D-Wave Advantage quantum annealing machine. Experimental results on small problems show that the true minimum can be obtained with high probability. We also discuss how to improve the mapping of the problem onto the physical qubit network to increase the size of the problems that can be solved.
- 18 January 2024
- Published by Association for Computing Machinery (ACM)
- p. 47-54
Open AccessApproximate Block Diagonalization of Symmetric Matrices Using Quantum Annealing
We consider the problem of transforming a given symmetric matrix into a nearly block diagonal form by permutation of its rows and columns. Such a transformation is useful as preconditioning to accelerate the convergence of an eigenvalue solver, but the problem of finding an optimal permutation that maximizes the Frobenius norms of the diagonal blocks is NP-complete. We formulate this problem as QUBO (Quadratic Unconstrained Binary Optimization) and solve it using D-Wave Advantage quantum annealing machine. Experimental results on small problems show that the true minimum can be obtained with high probability. We also discuss how to improve the mapping of the problem onto the physical qubit network to increase the size of the problems that can be solved.