Quantum Speedup for Graph Sparsification, Cut Approximation and Laplacian Solving.
Simon ApersRonald de WolfPublished in: CoRR (2019)
Keyphrases
- laplacian matrix
- graph laplacian
- tikhonov regularization
- minimum cut
- normalized cut
- spectral clustering
- random walk
- spectral decomposition
- orders of magnitude
- error bounds
- graph model
- directed graph
- min cut
- weighted graph
- image restoration
- undirected graph
- quantum computation
- least squares
- integrality gap
- vertex set
- closed form
- planar graphs
- series parallel
- maximum flow
- adjacency matrix
- connected components
- spanning tree
- directed acyclic graph
- graph construction
- quantum computing
- quantum inspired
- graph structure
- graph theory