M. Szegedy

activity

20032007

most citedOn the Quantum Query Complexity of Detecting Triangles in Graphs

23 citations · 38 across the 5 of their papers we have counts for

collaborators

Showing 2003 · quant-phShow all

2 papers · 2 filters

quant-ph2003★ 23 cited

On the Quantum Query Complexity of Detecting Triangles in Graphs

Mario Szegedy

We show that in the quantum query model the complexity of detecting a triangle in an undirected graph on $n$ nodes can be done using $O (n^{1 + \frac{3}{7}} lo g^{2} n)$ quantum queries.…

quant-ph2003★ 13 cited

Quantum Algorithms for the Triangle Problem

Frederic Magniez, Miklos Santha, Mario Szegedy

We present two new quantum algorithms that either find a triangle (a copy of $K_{3}$ ) in an undirected graph $G$ on $n$ nodes, or reject if $G$ is triangle free. The first algorith…