Abstract The Quantum Approximate Optimization Algorithm (QAOA) is a highly promising
variational quantum algorithm that aims to solve combinatorial optimization problems that …

Quantum computing (QC) has the potential to be the next abstruse technology, with a wide
range of possible applications and ramifications for organizations and markets. QC provides …

Quantum Computing is drawing a significant attention from the current scientific community.
The potential advantages offered by this revolutionary paradigm has led to an upsurge of …

Immersive and mission-critical data-driven applications, such as virtual or augmented reality,
tactile Internet, industrial automation, and autonomous mobility, are creating unprecedented …

Quantum variational optimization has been posed as an alternative to solve optimization
problems faster and at a larger scale than what classical methods allow. In this paper we …

The traveling salesman problem (TSP) is one of the most often-used NP-hard problems in
computer science to study the effectiveness of computing models and hardware platforms. In …

Combinatorial optimization is a challenging problem applicable in a wide range of fields
from logistics to finance. Recently, quantum computing has been used to attempt to solve …

Quantum Approximate Optimization Algorithm (QAOA) is one of the leading candidates for
demonstrating the quantum advantage using near-term quantum computers. Unfortunately …

Route planning of consumer electronics supply chains, especially collision-avoidance, is a
frequently encountered problem in artificial intelligence applications. This paper explores …

Mobile edge computing is a promising paradigm that provides edge users with dependable
computing services. However, due to the dynamic nature of mobile users and the limited …