A universal fault-tolerant quantum computer that can efficiently solve problems such as
integer factorization and unstructured database search requires millions of qubits with low …

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

The quantum approximate optimization algorithm (QAOA) is a leading candidate algorithm
for solving optimization problems on quantum computers. However, the potential of QAOA to …

Abstract Machine learning has achieved dramatic success in a broad spectrum of
applications. Its interplay with quantum physics may lead to unprecedented perspectives for …

Combinatorial optimization is anticipated to be one of the primary use cases for quantum
computation in the coming years. The Quantum Approximate Optimization Algorithm and …

Quantum architecture search (QAS) is the process of automating architecture engineering of
quantum circuits. It has been desired to construct a powerful and general QAS platform …

The quantum approximate optimization algorithm (QAOA) is a hybrid variational quantum-
classical algorithm that solves combinatorial optimization problems. While there is evidence …

Quantum computers are next-generation devices that hold promise to perform calculations
beyond the reach of classical computers. A leading method towards achieving this goal is …

The quantum alternating operator ansatz (QAOA) is a prominent example of variational
quantum algorithms. We propose a generalized QAOA called CD-QAOA, which is inspired …

One of the most prominent application areas for quantum computers is solving hard
constraint satisfaction and optimization problems. However, detailed analyses of the …