4 papers · 1 filter
An Improved Quantum Algorithm for 3-Tuple Lattice Sieving
Lynn Engelberts, Yanlin Chen, Amin Shiraz Gilani +3
The assumed hardness of the Shortest Vector Problem in high-dimensional lattices is one of the cornerstones of post-quantum cryptography. The fastest known heuristic attacks on SVP…
Loop Composition in Quantum Algorithms
Stacey Jeffery, Manideep Mamindlapally, Alex Baudoin Nguetsa Tankeu
The quantum circuit model essentially treats every quantum algorithm as a straight-line program. While this view is universal, recent work has shown that it is inconvenient for usi…
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…