The Quantum Alternating Operator Ansatz (QAOA+) is an extension of the Quantum Approximate Optimization Algorithm (QAOA), where the search space is smaller in solving constrained combinatorial optimization problems. However, QAOA+ requires a trivial feasible solution as the initial state, so it cannot be used for problems that are difficult to find a trivial feasible solution. For simplicity, we call them as Non-Trivial-Feasible-Solution Problems (NTFSP). In this paper, we take the Minimum Exact Cover (MEC) problem as an example, studying how to apply QAOA+ to NTFSP. As we know, exact covering (EC) is the feasible space of MEC problem, which has no trivial solutions. To overcome the above problem, the EC problem is divided into two steps to solve. First, disjoint sets are obtained, which is equivalent to solving independent sets. Second, on this basis, the sets covering all elements (i.e., EC) are solved. In other words, we transform MEC into a multi-objective constrained optimization problem, where feasible space consists of independent sets that are easy to find. Finally, we also verify the feasibility of the algorithm from numerical experiments. Our method provides a feasible way for applying QAOA+ to NTFSP, and is expected to expand its application significantly.
We give quantum algorithms for exponential-time problems on
n vertices or elements, with bounded error, polynomial space and no quantum random access memory. Our results are these. (1) 4-Colouring in quantum time
O(1.3032n), from a polynomial-space branching algorithm with polynomial-space terminal algorithms; with the branching algorithm alone,
O(1.3100n). The previous best bound in this model, to our knowledge, is
O(1.3231n). (2)
k-Colouring below the previous best bound for
k∈{5,7,8,9,10,11} and
13≤k≤18, from
O(1.4518n) for
k=5 to
O(1.9233n) for
k=18. (3) Dominating Set in
O(1.2235n), against the previous
O(2n/2), Independent Dominating Set in
O(1.1583n), and Edge Dominating Set and Minimum Maximal Matching in
O(1.1501n). (4) A quantum form of monotone local search: if the extension problem has a backtracking tree with
ck nodes up to polynomial factors, the problem is solved in quantum time
(2−1/c)n/2 up to polynomial factors. This gives Feedback Vertex Set in
O(1.3081n), Subset and Group Feedback Vertex Set in
O(1.3229n), Cluster Vertex Deletion in
O(1.2033n), 3-Hitting Set in
O(1.2405n), Proper Interval Vertex Deletion in
O(1.3541n), Multicut on Trees in
O(1.1647n) and Min-Ones
d-SAT in
O∗((2−1/d)n/2). (5) Quantum exponential-time approximations below the quantum exact bounds, such as a 1.1-approximation for Vertex Cover in
O(1.0555n) and for Feedback Vertex Set in
O(1.2161n). The colouring exponents for
k≥6 come from an evaluation of a known reduction recursion, computed in floating point with a margin.