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

Bibliographic Details

Published in:	IEEE Access
Main Authors:	Jehn-Ruey Jiang, Chun-Wei Chu
Format:	Article
Language:	English
Published:	IEEE 2023-01-01
Subjects:	Noisy intermediate-scale quantum NP-hard problem quantum annealing quantum computer quadratic unconstrained binary optimization
Online Access:	https://ieeexplore.ieee.org/document/10261200/