Explore quantum algorithms for graph sparsification, cut approximation, and Laplacian solving in this 25-minute IEEE conference talk. Delve into the contributions of Simon Apers and Ronald de Wolf as they present their research on quantum speedup for these graph-related problems. Learn about classical sparsification algorithms, quantum spanner algorithms, and quantum sparsification algorithms. Discover the innovative bootstrapping trick and matching quantum lower bound. Gain insights into cut approximation and Laplacian solving techniques, and understand how quantum computing can potentially accelerate these graph algorithms.
Quantum Speedup for Graph Sparsification, Cut Approximation and Laplacian Solving
Overview
Syllabus
Intro
Graph Sparsification
Spectral Sparsification
Our Contribution
Classical Sparsification Algorithm
Quantum Spanner Algorithm
Quantum Sparsification Algorithm
A Bootstrapping Trick
Matching Quantum Lower Bound
Cut Approximation
Laplacian Solving
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
-
High-Precision Estimation of Random Walks in Small Space
-
Near-Linear Size Hypergraph Cut Sparsifiers
-
Cut-Equivalent Trees are Optimal for Min-Cut Queries
-
An Improved Quantum Max Cut Approximation via Maximum Matching
-
Stochastic Weighted Matching - 1-Epsilon Approximation
-
Subexponential LPs Approximate Max-Cut
