Classifying and Benchmarking Quantum Annealing Algorithms Based on Quadratic Unconstrained Binary Optimization for Solving NP-Hard Problems

Quantum annealing has the potential to outperform classical transistor-based computer technologies in tackling intricate combinatorial optimization problems. However, ongoing scientific debates cast doubts on whether quantum annealing devices (or quantum annealers) can genuinely provide better probl...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE access Ročník 11; s. 104165 - 104178
Hlavní autori:	Jiang, Jehn-Ruey, Chu, Chun-Wei
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Piscataway IEEE 2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Algorithms Annealing Benchmark testing Benchmarks Classification Combinatorial analysis Graph coloring Job shop scheduling Linear programming Noisy intermediate-scale quantum NP-hard problem Optimization Problem solving Quadratic programming quadratic unconstrained binary optimization Quantum annealing quantum computer Quantum computing Questions
ISSN:	2169-3536, 2169-3536
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!