A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Finding maximum flows in undirected graphs seems easier than bipartite matching
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Beyond the flow decomposition barrier
Journal of the ACM (JACM)
Flows in Undirected Unit Capacity Networks
SIAM Journal on Discrete Mathematics
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
Journal of the ACM (JACM)
Quantum computation and quantum information
Quantum computation and quantum information
Network flow and generalized path compression
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Maximum Matchings via Gaussian Elimination
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
On the power of Ambainis lower bounds
Theoretical Computer Science
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
The quantum query complexity of the determinant
Information Processing Letters
The quantum complexity of group testing
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Exact quantum lower bound for grover's problem
Quantum Information & Computation
A panoply of quantum algorithms
Quantum Information & Computation
The quantum query complexity of algebraic properties
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
We present quantum algorithms for some graph problems: finding a maximal bipartite matching in time $O(n\sqrt{m}logn)$, finding a maximal non-bipartite matching in time $O(n^2(\sqrt{m/n}+log n)log n)$, and finding a maximal flow in an integer network in time $O(min(n^{7/6} \sqrt{m} \cdot U^{1/3},\sqrt{nU}m)log n)$, where n is the number of vertices, m is the number of edges, and U ≤ n1/4 is an upper bound on the capacity of an edge.