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...
Saved in:
| Published in: | 2021 IEEE 14th International Symposium on Embedded Multicore/Many-core Systems-on-Chip (MCSoC) pp. 258 - 264 |
|---|---|
| Main Authors: | , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
IEEE
01.12.2021
|
| Subjects: | |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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 the cost and constraint functions when formulating the problem. In other words, parameter tuning is essential in solving problems with quantum annealing. In the present paper, the problem of searching an ordering that reduces the fill-in for a sparse direct solver is formulated as a Hamiltonian, and quantum annealing finds the solution to this problem. We discuss the necessity and effectiveness of parameter tuning for solving COPs with quantum annealing. The results after weight tuning show that we can improve the rate of an optimal solution obtained by a maximum of 94% for {5\,\times \,5} matrices, 68% for {6\,\times \,6} matrices, and 27% for {7\,\times \,7} matrices. Moreover, it is shown that giving high weights to the constraints we want to satisfy will not provide an optimal solution. |
|---|---|
| DOI: | 10.1109/MCSoC51149.2021.00045 |