2 papers
quant-ph2024
On estimating the entropy of shallow circuit outputs
Alexandru Gheorghiu, Matty J. Hoban
Estimating the entropy of probability distributions and quantum states is a fundamental task in information processing. Here, we examine the hardness of this task for the case of p…
quant-ph2024
Single-Round Proofs of Quantumness from Knowledge Assumptions
Petia Arabadjieva, Alexandru Gheorghiu, Victor Gitton +1
A proof of quantumness is an efficiently verifiable interactive test that an efficient quantum computer can pass, but all efficient classical computers cannot (under some cryptogra…