Quantum Speedup for Graph Sparsification, Cut Approximation and Laplacian Solving

Quantum Speedup for Graph Sparsification, Cut Approximation and Laplacian Solving

IEEE FOCS: Foundations of Computer Science via YouTube Direct link

Intro

1 of 11

1 of 11

Intro

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Quantum Speedup for Graph Sparsification, Cut Approximation and Laplacian Solving

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Intro
  2. 2 Graph Sparsification
  3. 3 Spectral Sparsification
  4. 4 Our Contribution
  5. 5 Classical Sparsification Algorithm
  6. 6 Quantum Spanner Algorithm
  7. 7 Quantum Sparsification Algorithm
  8. 8 A Bootstrapping Trick
  9. 9 Matching Quantum Lower Bound
  10. 10 Cut Approximation
  11. 11 Laplacian Solving

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.