3 citations · 4 across the 5 of their papers we have counts for
5 papers
Mechanism of Efficacy in QAOA for Random k-SAT: From Adiabatic Manifold to Sublinear Parameter Optimization
Mingyou Wu, Hanwu Chen
The Quantum Approximate Optimization Algorithm (QAOA) is a leading candidate for demonstrating quantum advantage on near-term devices, yet the physical origins of its efficacy rema…
Local Quantum Search Algorithm for Random -SAT with Clauses
Mingyou Wu
The random k-SAT instances undergo a "phase transition" from being generally satisfiable to unsatisfiable as the clause number m passes a critical threshold, . This causes a…
Adiabatic-Passage-Based Parameter Setting for Quantum Approximate Optimization Algorithm
Mingyou Wu, Hanwu Chen
The Quantum Approximate Optimization Algorithm (QAOA) exhibits significant potential for tackling combinatorial optimization problems. Despite its promise for near-term quantum dev…
Enhanced Framework of Quantum Approximate Optimization Algorithm and Its Parameter Setting Strategy
Mingyou Wu, Zhihao Liu, Hanwu Chen
An enhanced framework of quantum approximate optimization algorithm (QAOA) is introduced and the parameter setting strategies are analyzed. The enhanced QAOA is as effective as the…
Algorithm for Finding the Maximum Clique Based on Continuous Time Quantum Walk
Xi Li, Mingyou Wu, Hanwu Chen
In this work, we consider the application of continuous time quantum walking(CTQW) to the Maximum Clique(MC) Problem. Performing CTQW on graphs will generate distinct periodic prob…