Hamiltonian simulation is one of the most important problems in the fiel...
We present two protocols for classical verification of quantum depth. Ou...
From the minimal assumption of post-quantum semi-honest oblivious transf...
In this work, we initiate the study of the Minimum Circuit Size Problem
...
We investigate the existence of constant-round post-quantum black-box
ze...
In a recent seminal work, Bitansky and Shmueli (STOC '20) gave the first...
In this paper, we extend the protocol of classical verification of quant...
The closest pair problem is a fundamental problem of computational geome...
We present an algorithmic framework generalizing quantum-inspired
polylo...
Near-term quantum computers are likely to have small depths due to short...
Semidefinite programming (SDP) is a central topic in mathematical
optimi...
We present classical sublinear-time algorithms for solving low-rank line...
A fundamental pursuit in complexity theory concerns reducing worst-case
...