research
∙
07/22/2022
Matching Triangles and Triangle Collection: Hardness based on a Weak Quantum Conjecture
Classically, for many computational problems one can conclude time lower...
share
research
∙
03/10/2022
Memory Compression with Quantum Random-Access Gates
In the classical RAM, we have the following useful property. If we have ...
research
∙
03/06/2022
Improved Quantum Query Upper Bounds Based on Classical Decision Trees
Given a classical query algorithm as a decision tree, when does there ex...
research
∙
06/03/2021
Limits of quantum speed-ups for computational geometry and other problems: Fine-grained complexity via quantum walks
Many computational problems are subject to a quantum speed-up: one might...
research
∙
11/13/2019
