1.2k citations · 2.5k across the 41 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
quant-ph2019
Quantum Speedup for Graph Sparsification, Cut Approximation and Laplacian Solving
Simon Apers, Ronald de Wolf
Graph sparsification underlies a large number of algorithms, ranging from approximation algorithms for cut problems to solvers for linear systems in the graph Laplacian. In its str…
quant-ph2019★ 34 cited
Quantum Computing: Lecture Notes
Ronald de Wolf
This is a set of lecture notes suitable for a Master's course on quantum computation and information from the perspective of theoretical computer science. The first version was wri…