Login / Signup
Cayley path and quantum computational supremacy: A proof of average-case #P-hardness of Random Circuit Sampling with quantified robustness.
Ramis Movassagh
Published in:
CoRR (2019)
Keyphrases
</>
average case
worst case
worst case analysis
uniform distribution
logic circuits
learning curves
np hard
upper bound
sample size
numerical stability
computational complexity
random sampling
lower bound
vc dimension
training samples
sample complexity bounds
active learning
average case complexity