research
∙
05/21/2023
On the Impossibility of General Parallel Fast-forwarding of Hamiltonian Simulation
Hamiltonian simulation is one of the most important problems in the fiel...
share
research
∙
07/24/2021
On relating one-way classical and quantum communication complexities
Let f: X × Y →{0,1,} be a partial function and μ be a distribution with ...
research
∙
12/09/2020
Constant-round Blind Classical Verification of Quantum Sampling
In a recent breakthrough, Mahadev constructed a classical verification o...
research
∙
11/05/2019
On the Quantum Complexity of Closest Pair and Related Problems
The closest pair problem is a fundamental problem of computational geome...
research
∙
10/14/2019
Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing quantum machine learning
We present an algorithmic framework generalizing quantum-inspired polylo...
research
∙
01/10/2019
Quantum-inspired classical sublinear-time algorithm for solving low-rank semidefinite programming via sampling approaches
Semidefinite programming (SDP) is a central topic in mathematical optimi...
research
∙
11/12/2018
Quantum-inspired sublinear classical algorithms for solving low-rank linear systems
We present classical sublinear-time algorithms for solving low-rank line...
research
∙
10/25/2018