Sparse Matrix Ordering Method with a Quantum Annealing Approach and its Parameter Tuning

Quantum annealing realizes quantum computers specialized for combinatorial optimization problems (COPs). A COP is formulated as a Hamiltonian, and quantum annealing obtains a solution by finding the ground state of the Hamiltonian. The ease of finding a solution depends on the weights assigned to th...

Full description

Bibliographic Details

Published in:	2021 IEEE 14th International Symposium on Embedded Multicore/Many-core Systems-on-Chip (MCSoC) pp. 258 - 264
Main Authors:	Komiyama, Tomoko, Suzuki, Tomohiro
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.12.2021
Subjects:	Annealing Cost function Costs fill-in Multicore processing parameter tuning Quantum annealing Search problems sparse direct solver Stationary state
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!