
On the Impossibility of PostQuantum BlackBox ZeroKnowledge in Constant Rounds
We investigate the existence of constantround postquantum blackbox ze...
read it

Constantround Blind Classical Verification of Quantum Sampling
In a recent breakthrough, Mahadev constructed a classical verification o...
read it

A BlackBox Approach to PostQuantum ZeroKnowledge in Constant Rounds
In a recent seminal work, Bitansky and Shmueli (STOC '20) gave the first...
read it

On the CompressedOracle Technique, and PostQuantum Security of Proofs of Sequential Work
We revisit the socalled compressed oracle technique, introduced by Zhan...
read it

On the Hardness of Massively Parallel Computation
We investigate whether there are inherent limits of parallelization in t...
read it

Tight Quantum TimeSpace Tradeoffs for Function Inversion
In function inversion, we are given a function f: [N] ↦ [N], and want to...
read it

Classical Verification of Quantum Computations with Efficient Verifier
In this paper, we extend the protocol of classical verification of quant...
read it

Lower Bounds for Function Inversion with Quantum Advice
Function inversion is that given a random function f: [M] → [N], we want...
read it

On the Need for Large Quantum Depth
Nearterm quantum computers are likely to have small depths due to short...
read it

On the Sample Complexity of PAC Learning Quantum Process
We generalize the PAC (probably approximately correct) learning model to...
read it

On the Algorithmic Power of Spiking Neural Networks
Spiking Neural Networks (SNN) are mathematical models in neuroscience to...
read it

Generalized Quantum Shannon Impossibility for Quantum Encryption
The famous Shannon impossibility result says that any encryption scheme ...
read it
KaiMin Chung
is this you? claim profile