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...

Celý popis

Podrobná bibliografia

Vydané v:	2021 IEEE 14th International Symposium on Embedded Multicore/Many-core Systems-on-Chip (MCSoC) s. 258 - 264
Hlavní autori:	Komiyama, Tomoko, Suzuki, Tomohiro
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.12.2021
Predmet:	Annealing Cost function Costs fill-in Multicore processing parameter tuning Quantum annealing Search problems sparse direct solver Stationary state
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!