Quantum Native Search with the Quantum Alternating Operator Ansatz
Authors: Teague Tomesh, Zain H. Saleem, Martin Suchara
Summary: We current a brand new hybrid, native search algorithm for quantum approximate optimization of constrained combinatorial optimization issues. We concentrate on the Most Unbiased Set drawback and display the flexibility of quantum native search to unravel massive drawback situations on quantum gadgets with few qubits. This hybrid algorithm iteratively finds impartial units over fastidiously constructed neighborhoods and combines these options to acquire a world answer. We research the efficiency of this algorithm on 3-regular, Neighborhood, and Erdős-Rényi graphs with as much as 100 nodes.
