Random Graphs, Long-Cycles & Local-Algorithms
Speaker: JuspreetTitle: Random Graphs, Long-Cycles & Local-Algorithms
Date: 29 Apr 2021 17:00-18:00 EST
Location: Zoom
Food: Self-prepared
Abstract: Quantum Supremacy aims to, in the near term, establish the computational benefits of quantum computers over classical ones. However, due to physical constraints such as noise (or computational overhead from classical subroutines), circuits from such proposals can’t be deep. One such proposition is the QAOA algorithm. To understand the limitations of shallow-depth QAOA, it seems important to understand the limits of local algorithms on hard problems. We review the existing literature on the limitations of QAOA, introduce some preliminary results of ours about long-cycles contained in the MAX-CUTs of random d-reg graphs, and give a brief overview of an algorithm by Krivelivich to find long-cycles in expanders in general. Ongoing work with A.S. Biswas, C.N. Chou & J. Shi.