Add to ORKGThe study of the quantum query complexity for some graph problems is an interesting area in quantum computing. Only for a few graph problems there are quantum algorithms and lower bounds known. We present some new quantum query and quantum time algorithms and quantum query complexity bounds for the maximal and maximum independent set problem and the graph and subgraph isomorphism problem
We study the complexity of quantum query algorithms that make p queries in parallel in each timestep...
We consider an approach to deciding isomorphism of rigid n-vertex graphs (and related isomorphism pr...
We give a new upper bound on the quantum query complexity of deciding $st$-connectivity on certain c...
Let H be a (non-empty) graph on n vertices, possibly containing isolated vertices. Let f_H(G) = 1 if...
Thesis (Ph.D.)--University of Washington, 2015In this thesis, we study quantum computation and algor...
We prove improved quantum query complexity bounds for some graph problem. Our results are based on a...
The set equality problem is to tell whether two sets $A$ and $B$ are equal or disjoint under the pro...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
Preliminary version in Proc. of the 31st International Colloquium on Automata, Languages and Program...
Let H be a fixed k-vertex graph with m edges and minimum degree d> 0. We use the learning graph f...
In this thesis we present new quantum algorithms for graph and algebra problems. Our quantum algorit...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Physics, 2015.Cataloged from PD...
We study the problem of learning an unknown graph provided via an oracle using a quantum algorithm. ...
We study the complexity of quantum query algorithms that make p queries in parallel in each timestep...
We study the quantum query complexity of minor-closed graph properties, which include such problems ...
We study the complexity of quantum query algorithms that make p queries in parallel in each timestep...
We consider an approach to deciding isomorphism of rigid n-vertex graphs (and related isomorphism pr...
We give a new upper bound on the quantum query complexity of deciding $st$-connectivity on certain c...
Let H be a (non-empty) graph on n vertices, possibly containing isolated vertices. Let f_H(G) = 1 if...
Thesis (Ph.D.)--University of Washington, 2015In this thesis, we study quantum computation and algor...
We prove improved quantum query complexity bounds for some graph problem. Our results are based on a...
The set equality problem is to tell whether two sets $A$ and $B$ are equal or disjoint under the pro...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
Preliminary version in Proc. of the 31st International Colloquium on Automata, Languages and Program...
Let H be a fixed k-vertex graph with m edges and minimum degree d> 0. We use the learning graph f...
In this thesis we present new quantum algorithms for graph and algebra problems. Our quantum algorit...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Physics, 2015.Cataloged from PD...
We study the problem of learning an unknown graph provided via an oracle using a quantum algorithm. ...
We study the complexity of quantum query algorithms that make p queries in parallel in each timestep...
We study the quantum query complexity of minor-closed graph properties, which include such problems ...
We study the complexity of quantum query algorithms that make p queries in parallel in each timestep...
We consider an approach to deciding isomorphism of rigid n-vertex graphs (and related isomorphism pr...
We give a new upper bound on the quantum query complexity of deciding $st$-connectivity on certain c...