A sublinear time quantum algorithm for s-t minimum cut on dense simple graphs

10/29/2021
by   Simon Apers, et al.
0

An s-t minimum cut in a graph corresponds to a minimum weight subset of edges whose removal disconnects vertices s and t. Finding such a cut is a classic problem that is dual to that of finding a maximum flow from s to t. In this work we describe a quantum algorithm for the minimum s-t cut problem on undirected graphs. For an undirected graph with n vertices, m edges, and integral edge weights bounded by W, the algorithm computes with high probability the weight of a minimum s-t cut in time O(√(m) n^5/6 W^1/3 + n^5/3 W^2/3), given adjacency list access to G. For simple graphs this bound is always O(n^11/6), even in the dense case when m = Ω(n^2). In contrast, a randomized algorithm must make Ω(m) queries to the adjacency list of a simple graph G even to decide whether s and t are connected.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/17/2020

Query Complexity of Global Minimum Cut

In this work, we resolve the query complexity of global minimum cut prob...
research
11/19/2020

Quantum query complexity of edge connectivity

The edge connectivity of a simple graph is the least number of edges who...
research
07/16/2020

Quantum algorithms for graph problems with cut queries

Let G be an n-vertex graph with m edges. When asked a subset S of vertic...
research
09/03/2020

MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems

Let V be a set of n vertices, M a set of m labels, and let 𝐑 be an m × n...
research
10/29/2020

Recursive Random Contraction Revisited

In this note, we revisit the recursive random contraction algorithm of K...
research
10/27/2022

Discrete Bulk Reconstruction

According to the AdS/CFT correspondence, the geometries of certain space...
research
03/02/2022

Skew-Symmetric Adjacency Matrices for Clustering Directed Graphs

Cut-based directed graph (digraph) clustering often focuses on finding d...

Please sign up or login with your details

Forgot password? Click here to reset