Authors introduce an iterative algorithm for solving discrete optimization problems which bear similarities with divide-and-conquer methods, as well as iterative/recursive RQAOA.
The quantum algorithm reduces to a classical greedy algorithm in the presence of strong noise.
Authors find that this quantum algorithm systematically outperforms its classical greedy counterpart, signaling a quantum enhancement.
Authors introduce an iterative algorithm for solving discrete optimization problems which bear similarities with divide-and-conquer methods, as well as iterative/recursive RQAOA. The quantum algorithm reduces to a classical greedy algorithm in the presence of strong noise. Authors find that this quantum algorithm systematically outperforms its classical greedy counterpart, signaling a quantum enhancement.
PUBLICATION: https://www.science.org/doi/epdf/10.1126/sciadv.adi0487
P.S.: Stuart Hadfield is also a co-author (the person behind QAOAnsatz - a framework on which the Qrisp QAOA module is based on)
This issue was migrated from the internal development server after the 0.4 update and transition to open development