A review on quantum approximate optimization algorithm and its variants
Abstract The Quantum Approximate Optimization Algorithm (QAOA) is a highly promising
variational quantum algorithm that aims to solve combinatorial optimization problems that …
variational quantum algorithm that aims to solve combinatorial optimization problems that …
Multi-angle quantum approximate optimization algorithm
The quantum approximate optimization algorithm (QAOA) generates an approximate
solution to combinatorial optimization problems using a variational ansatz circuit defined by …
solution to combinatorial optimization problems using a variational ansatz circuit defined by …
[HTML][HTML] Short-depth QAOA circuits and quantum annealing on higher-order ising models
We present a direct comparison between QAOA (Quantum Alternating Operator Ansatz), and
QA (Quantum Annealing) on 127 qubit problem instances. QAOA with p= 1, 2 rounds is …
QA (Quantum Annealing) on 127 qubit problem instances. QAOA with p= 1, 2 rounds is …
[HTML][HTML] Scaling whole-chip QAOA for higher-order Ising spin glass models on heavy-hex graphs
We show that the quantum approximate optimization algorithm (QAOA) for higher-order,
random coefficient, heavy-hex compatible spin glass Ising models has strong parameter …
random coefficient, heavy-hex compatible spin glass Ising models has strong parameter …
Short-depth circuits for Dicke state preparation
We present short-depth quantum circuits to deterministically prepare any Dicke state
\left|D_k^n\right⟩, which is the equal-amplitude superposition of all n-qubit computational …
\left|D_k^n\right⟩, which is the equal-amplitude superposition of all n-qubit computational …
Constrained optimization via quantum zeno dynamics
Constrained optimization problems are ubiquitous in science and industry. Quantum
algorithms have shown promise in solving optimization problems, yet none of the current …
algorithms have shown promise in solving optimization problems, yet none of the current …
A divide-and-conquer approach to Dicke state preparation
We present a divide-and-conquer approach to deterministically prepare Dicke states (ie,
equal-weight superpositions of all-qubit states with Hamming weight) on quantum …
equal-weight superpositions of all-qubit states with Hamming weight) on quantum …
The quantum alternating operator ansatz for satisfiability problems
We comparatively study, through large-scale numerical simulation, the performance across
a large set of Quantum Alternating Operator Ansatz (QAOA) implementations for finding …
a large set of Quantum Alternating Operator Ansatz (QAOA) implementations for finding …
Numerical evidence for exponential speed-up of qaoa over unstructured search for approximate constrained optimization
Despite much recent work, the true promise and limitations of the Quantum Alternating
Operator Ansatz (QAOA)[30] are unclear. A critical question regarding QAOA is to what …
Operator Ansatz (QAOA)[30] are unclear. A critical question regarding QAOA is to what …
Quantum approximate optimization: A computational intelligence perspective
Quantum computing is an emerging field on the multidisciplinary interface between physics,
engineering, and computer science with the potential to make a large impact on …
engineering, and computer science with the potential to make a large impact on …