7 problems

Let $n$ binary spins be arranged on a ring, with the objective of maximizing the number of neighboring pairs pointing in opposite directions. For even $n$, let $r_p^*$ denote the l…

Consider Binary Paint Shop Problem instances encoded as Ising models, and let $\Delta_C$ be the number of paint swaps. Let XQAOA$_1$ denote the level-1 XQAOA ansatz, with its param…

Let $\textbf{LB}_{\kappa}(\theta)$ and $\textbf{LB}'_{\kappa}(\theta)$ be the stated inner-minimization problems, with variables $\mathbf r$, $\mathbf s$, $r_1$, $r_6$, $s$, $t$,…

Gradient-based QAOA saddle-point conjecture. Gradient-based optimization of QAOA often gets trapped by saddle points of the QAOA loss-function landscape.

A $2$-regular graph is a graph in which every vertex has degree $2$, and standard QAOA at depth $p$ is evaluated by its expected approximation ratio for the Max-Cut objective. QAOA…

Consider the quantum approximate optimization method applied to sufficiently large instances, together with distant and unrelated shadow defects that can affect the efficacy of low…

Consider low-depth quantum approximate optimization algorithms (QAOA) applied to random problem instances, and the phenomenon described in the surrounding text, in which distant en…