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

Full description

Saved in:

Bibliographic Details
Published in:	IEEE access Vol. 11; pp. 104165 - 104178
Main Authors:	Jiang, Jehn-Ruey, Chu, Chun-Wei
Format:	Journal Article
Language:	English
Published:	Piscataway IEEE 2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!