Quantum Speedup for Graph Sparsification, Cut Approximation and Laplacian Solving.
Simon ApersRonald de WolfPublished in: FOCS (2020)
Keyphrases
- laplacian matrix
- graph laplacian
- minimum cut
- planar graphs
- graph representation
- random walk
- graph model
- graph theory
- tikhonov regularization
- quantum computation
- bipartite graph
- error bounds
- combinatorial optimization
- maximum flow
- closed form
- integrality gap
- structured data
- spectral clustering
- graph structure
- graph matching
- graph construction
- random graphs
- connected components
- sparse representation
- vertex set
- graphical models
- quantum computing
- weighted graph