Add to ORKGWe show that the quantum query complexity of detecting if an n-vertex graph contains a triangle is O(n9/7). This improves the previous best algorithm of Belovs [2] making O(n35/27) queries. For the problem of determining if an operation ◦ : S × S → S is associative, we give an algorithm makin
We study the following algorithmic problem: given a graph, determine whether it is connected or not....
We study the problem of learning an unknown graph provided via an oracle using a quantum algorithm. ...
We give a new upper bound on the quantum query complexity of deciding $st$-connectivity on certain c...
We show that the quantum query complexity of detecting if an n-vertex graph contains a triangle is O...
Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms1486-1502PAAA
Background. Triangle finding is a graph-theoretic problem whose complexity is deeply connected to th...
We present two new quantum algorithms that either find a triangle (a copy of K3) in an undirected gr...
Abstract. We present two new quantum algorithms that either find a triangle (a copy of K3) in an und...
International audienceWe present new quantum algorithms for Triangle Finding improving its best prev...
We present a new quantum algorithm that either finds a triangle (a copy of $K_{3}$) in an undirected...
Let H be a fixed k-vertex graph with m edges and minimum degree d> 0. We use the learning graph f...
Preliminary version in Proc. of the 31st International Colloquium on Automata, Languages and Program...
We prove improved quantum query complexity bounds for some graph problem. Our results are based on a...
Triangle finding (deciding if a graph contains a triangle or not) is a central problem in quantum qu...
13 pagesThis paper considers the triangle finding problem in the CONGEST model of distributed comput...
We study the following algorithmic problem: given a graph, determine whether it is connected or not....
We study the problem of learning an unknown graph provided via an oracle using a quantum algorithm. ...
We give a new upper bound on the quantum query complexity of deciding $st$-connectivity on certain c...
We show that the quantum query complexity of detecting if an n-vertex graph contains a triangle is O...
Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms1486-1502PAAA
Background. Triangle finding is a graph-theoretic problem whose complexity is deeply connected to th...
We present two new quantum algorithms that either find a triangle (a copy of K3) in an undirected gr...
Abstract. We present two new quantum algorithms that either find a triangle (a copy of K3) in an und...
International audienceWe present new quantum algorithms for Triangle Finding improving its best prev...
We present a new quantum algorithm that either finds a triangle (a copy of $K_{3}$) in an undirected...
Let H be a fixed k-vertex graph with m edges and minimum degree d> 0. We use the learning graph f...
Preliminary version in Proc. of the 31st International Colloquium on Automata, Languages and Program...
We prove improved quantum query complexity bounds for some graph problem. Our results are based on a...
Triangle finding (deciding if a graph contains a triangle or not) is a central problem in quantum qu...
13 pagesThis paper considers the triangle finding problem in the CONGEST model of distributed comput...
We study the following algorithmic problem: given a graph, determine whether it is connected or not....
We study the problem of learning an unknown graph provided via an oracle using a quantum algorithm. ...
We give a new upper bound on the quantum query complexity of deciding $st$-connectivity on certain c...