Add to ORKGAn important family of span programs, st-connectivity span programs, have been used to design quantum algorithms in various contexts, including a number of graph problems and formula evaluation problems. The complexity of the resulting algorithms depends on the largest positive witnes
We study the problem of learning an unknown graph provided via an oracle using a quantum algorithm. ...
We present a quantum algorithm for sampling an edge on a path between two nodes s and t in an undire...
We present a quantum algorithm for sampling an edge on a path between two nodes s and t in an undire...
An important family of span programs, st-connectivity span programs, have been used to design quantu...
An important family of span programs, st-connectivity span programs, have been used to design quantu...
We present quantum algorithms for various problems related to graph connectivity. We give simple and...
We give a new upper bound on the quantum query complexity of deciding $st$-connectivity on certain c...
Over the last decade, a large number of quantum algorithms have been discovered that outperform thei...
Span programs are a model of computation that have been used to design quantum algorithms, mainly in...
Span programs are a model of computation that have been used to design quantum algorithms, mainly in...
We study the following algorithmic problem: given a graph, determine whether it is connected or not....
Span program is a linear-algebraic model of computation originally proposed for studying the complex...
While quantum computers hold the promise of significant computational speedups, the limited size of ...
While quantum computers hold the promise of significant computational speedups, the limited size of ...
Let G be an n-vertex graph with m edges. When asked a subset S of vertices, a cut query on G returns...
We study the problem of learning an unknown graph provided via an oracle using a quantum algorithm. ...
We present a quantum algorithm for sampling an edge on a path between two nodes s and t in an undire...
We present a quantum algorithm for sampling an edge on a path between two nodes s and t in an undire...
An important family of span programs, st-connectivity span programs, have been used to design quantu...
An important family of span programs, st-connectivity span programs, have been used to design quantu...
We present quantum algorithms for various problems related to graph connectivity. We give simple and...
We give a new upper bound on the quantum query complexity of deciding $st$-connectivity on certain c...
Over the last decade, a large number of quantum algorithms have been discovered that outperform thei...
Span programs are a model of computation that have been used to design quantum algorithms, mainly in...
Span programs are a model of computation that have been used to design quantum algorithms, mainly in...
We study the following algorithmic problem: given a graph, determine whether it is connected or not....
Span program is a linear-algebraic model of computation originally proposed for studying the complex...
While quantum computers hold the promise of significant computational speedups, the limited size of ...
While quantum computers hold the promise of significant computational speedups, the limited size of ...
Let G be an n-vertex graph with m edges. When asked a subset S of vertices, a cut query on G returns...
We study the problem of learning an unknown graph provided via an oracle using a quantum algorithm. ...
We present a quantum algorithm for sampling an edge on a path between two nodes s and t in an undire...
We present a quantum algorithm for sampling an edge on a path between two nodes s and t in an undire...