MATH Seminar
| Title: Quantum Algorithms on Graphs |
|---|
| Seminar: Discrete Mathematics |
| Speaker: Asaf Ferber of University of California, Irvine |
| Contact: Liana Yepremyan, lyeprem@emory.edu |
| Date: 2024-11-07 at 4:00PM |
| Venue: MSC W303 |
| Download Flyer |
| Abstract: In this talk, I will provide a brief introduction to quantum computation and demonstrate its potential for accelerating classical graph algorithms. Specifically, I will present an asymptotically tight result for learning a Hamiltonian cycle using OR queries, as well as a significant polynomial improvement on the best-known quantum algorithm for ($\Delta$+1) -coloring a graph with maximum degree $\Delta$.\\ \\ This work is based on joint research with Liam Hardiman (UCI) and Xiaonan Chen (UCI). |
See All Seminars