4 problems
Matching
Conjecture: For every quantum polynomial-time sampler and every classical string that outputs with probability , there is a quantum program for of length at…
Given a finite energy bound , does there exist a prepare-and-measure semi-device-independent protocol such that the observed data certify strictly positive extractable ra…
For every publicly computable function used in the Yamakawa–Zhandry quantum random-oracle certifiable-randomness protocol, every quantum prover that succeeds in the protocol mu…
Let a strong coin-flipping protocol based on bit-commitment be any protocol in the family formally defined in Section, and let its bias be the maximum excess of either party's chea…