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 …

Abstract The Asymmetric Traveling Salesman Problem (ATSP), as a branch of the traveling
salesman problem, aims to find a group of circuits when a salesman travels all cities at the …

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 …

In this paper, we propose a quantum computing oriented benchmark for combinatorial
optimization. This benchmark, coined as QOPTLib, is composed of 40 instances equally …

Despite being considered as the next frontier in computation, Quantum Computing is still in
an early stage of development. Indeed, current commercial quantum computers suffer from …

In the noisy intermediate-scale quantum technological setting, the computational steps in a
quantum computer are realized via unitary gates. Gate-model quantum computer …

A scalable model for a distributed quantum computation is a challenging problem due to the
complexity of the problem space provided by the diversity of possible quantum systems, from …

In near-term quantum computers, the computations are realized via unitary operators. The
optimization problem fed into the quantum computer sets an objective function that is to be …

The quantum Internet enables networking based on the fundamentals of quantum
mechanics. Here, we define methods and procedures of resource prioritization and resource …

The application of quantum computing to combinatorial optimization problems is attracting
increasing research interest, resulting in diverse approaches and research streams. This …