Quantum computers are expected to surpass the computational capabilities of classical
computers during this decade and have transformative impact on numerous industry sectors …

Over the past few years, many researchers around the world have been keen to know the
potential and efficiency of quantum computers. The researchers have focused on specific …

Combinatorial optimization on near-term quantum devices is a promising path to
demonstrating quantum advantage. However, the capabilities of these devices are …

The Quantum approximate optimization algorithm (QAOA) is one of the most promising
candidates for achieving quantum advantage through quantum-enhanced combinatorial …

Noisy intermediate-scale quantum (NISQ) devices are restricted by their limited number of
qubits and their short decoherence times. An approach addressing these problems is …

Barren plateaus are a notorious problem in the optimization of variational quantum
algorithms and pose a critical obstacle in the quest for more efficient quantum machine …

Emerging quantum processors provide an opportunity to explore new approaches for
solving traditional problems in the post Moore's law supercomputing era. However, the …

Solving combinatorial optimization problems on current noisy quantum devices is currently
being advocated for (and restricted to) binary polynomial optimization with equality …

A combinatorial optimization problem (COP) is the problem of finding the optimal solution in
a finite set. When the size of the feasible solution set is large, the complexity of the problem …

The advent of cloud quantum computing has led to the rapid development of quantum
algorithms. In particular, it is necessary to study variational quantum-classical hybrid …