Near-Term Quantum Algorithms for Optimization

Join Professor Ashley Montanaro for a technical talk exploring the applications of quantum computers in solving complex optimization problems. Delve into recent research findings on the Quantum Approximate Optimization Algorithm (QAOA) and its effectiveness in addressing boolean satisfiability challenges, particularly random k-SAT problems where QAOA shows potential advantages over classical algorithms. Examine the limitations and possibilities of applying QAOA to protein folding problems, drawing from research papers arXiv:2208.06909 and arXiv:2204.01821. Learn from Montanaro's two decades of expertise in quantum computing, including insights from his work as Professor of Quantum Computation at Bristol and co-founder of Phasecraft, a quantum software startup focused on maximizing near-term quantum computer capabilities.