Related papers: Expressivity Limits in Quantum Walk-based Optimiza…
We introduce the Constraint-Enhanced Quantum Approximate Optimization Algorithm (CE-QAOA), a shallow, constraint-aware ansatz that operates inside the one-hot product space [n]^m, where m is the number of blocks and each block is…
We study the costs and benefits of different quantum approaches to finding approximate solutions of constrained combinatorial optimization problems with a focus on Maximum Independent Set. In the Lagrange multiplier approach we analyze the…
The Quantum Approximate Optimization Algorithm and its generalization to Quantum Alternating Operator Ansatz (QAOA) is a promising approach for applying quantum computers to challenging problems such as combinatorial optimization and…
Quantum computing exploits basic quantum phenomena such as state superposition and entanglement to perform computations. The Quantum Approximate Optimization Algorithm (QAOA) is arguably one of the leading quantum algorithms that can…
The Quantum Approximate Optimization Algorithm (QAOA) is a hybrid quantum-classical variational algorithm designed to tackle combinatorial optimization problems. Despite its promise for near-term quantum applications, not much is currently…
Many classical optimization problems can be mapped to finding the ground states of diagonal Ising Hamiltonians, for which variational quantum algorithms such as the Quantum Approximate Optimization Algorithm (QAOA) provide heuristic…
The Quantum Approximate Optimization Algorithm (QAOA) is designed to run on a gate model quantum computer and has shallow depth. It takes as input a combinatorial optimization problem and outputs a string that satisfies a high fraction of…
In this work, we review quantum approaches to combinatorial optimization, with the aim of bridging theoretical developments and industrial relevance. We first survey the main families of quantum algorithms, including Quantum Annealing, the…
The Quantum Approximate Optimization Algorithm (QAOA) has emerged as a promising approach for solving NP hard combinatorial optimization problems on noisy intermediate-scale quantum (NISQ) hardware. However, its performance is critically…
Variational quantum algorithms have emerged as a cornerstone of contemporary quantum algorithms research. While they have demonstrated considerable promise in solving problems of practical interest, efficiently determining the minimal…
The Quantum Approximate Optimization Algorithm (QAOA) is a powerful tool in solving various combinatorial problems such as Maximum Satisfiability and Maximum Cut. Hard computational problems, however, require deep circuits that place high…
The Quantum Approximate Optimization Algorithm (QAOA) uses a quantum computer to implement a variational method with $2p$ layers of alternating unitary operators, optimized by a classical computer to minimize a cost function. While rigorous…
The quantum approximate optimization algorithm (QAOA), as a hybrid quantum/classical algorithm, has received much interest recently. QAOA can also be viewed as a variational ansatz for quantum control. However, its direct application to…
The quantum approximate optimization algorithm (QAOA) generates an approximate solution to combinatorial optimization problems using a variational ansatz circuit defined by parameterized layers of quantum evolution. In theory, the…
The encoding of classical to quantum data mapping through trigonometric functions within arithmetic-based quantum computation algorithms leads to the exploitation of multivariate distributions. The studied variational quantum gate learning…
The Quantum Approximate Optimization Algorithm (QAOA) requires considered optimization problems to be translated into a compatible format. A popular transformation step in this pipeline involves the quadratization of higher-order binary…
Continuous-variable (CV) quantum systems offer a natural framework for continuous optimization through their infinite-dimensional Hilbert spaces. In this paper, we propose the Complex Continuous-Variable Quantum Approximate Optimization…
Variational quantum algorithms (VQAs) have demonstrated considerable potential in solving NP-hard combinatorial problems in the contemporary near intermediate-scale quantum (NISQ) era. The quantum approximate optimisation algorithm (QAOA)…
Quadratic unconstrained binary optimization (QUBO) problems are well-studied, not least because they can be approached using contemporary quantum annealing or classical hardware acceleration. However, due to limited precision and hardware…
Quantum technology provides a ground-breaking methodology to tackle challenging computational issues in power systems, especially for Distributed Energy Resources (DERs) dominant cyber-physical systems that have been widely developed to…