1 citations · 1 across the 1 of their papers we have counts for
4 papers
A Quantum Algorithm for -Transport on Flat Connection Graphs
Stacey Jeffery, Tobias J. Osborne, Galina Pass
We study a generalization of undirected -connectivity to graphs whose edges carry quantum operations. Let be an undirected graph on vertices in which each edge $\…
A Quantum Time-Space Tradeoff for Directed -Connectivity
Stacey Jeffery, Galina Pass
Directed -connectivity (DSTCON) is the problem of deciding if there exists a directed path between a pair of distinguished vertices and in an input directed graph. This…
Multidimensional Quantum Walks, Recursion, and Quantum Divide & Conquer
Stacey Jeffery, Galina Pass
We introduce an object called a \emph{subspace graph} that formalizes the technique of multidimensional quantum walks. Composing subspace graphs allows one to seamlessly combine qu…
(No) Quantum space-time tradeoff for USTCON
Simon Apers, Stacey Jeffery, Galina Pass +1
Undirected -connectivity is important both for its applications in network problems, and for its theoretical connections with logspace complexity. Classically, a long line of w…