How to Verify that a Small Device is Quantum, Unconditionally? (以英文演講)
- 講者Tamer Mour 博士 (博科尼大學)
邀請人：鐘楷閔 - 時間2025-10-14 (Tue.) 14:30 ~ 16:30
- 地點資訊所新館101演講廳
摘要
Arguably the most important goal in quantum computation is to demonstrate quantum advantage, namely a task that is feasible for quantum computers but not for classical ones.
Quantum advantage is practically demonstrated by a proof of quantumness (PoQ): a protocol where a quantum prover proves its quantumness to a classical verifier.
Known PoQs either cannot be verified efficiently or are far from being practical for experiment. Additionally, they all rely on conjectures (from complexity theory or cryptography).
In the talk, I will present two PoQs that are feasible for small-space quantum provers, but require any classical device large memory to succeed. Our PoQs are unconditional and do not rely on conjectures. The first is an exceptionally simple fine-grained PoQ, providing an approach for potential experiment. The second PoQ exhibits an exponential gap between the memory of the honest quantum prover and that of a successful classical cheater.
Quantum advantage is practically demonstrated by a proof of quantumness (PoQ): a protocol where a quantum prover proves its quantumness to a classical verifier.
Known PoQs either cannot be verified efficiently or are far from being practical for experiment. Additionally, they all rely on conjectures (from complexity theory or cryptography).
In the talk, I will present two PoQs that are feasible for small-space quantum provers, but require any classical device large memory to succeed. Our PoQs are unconditional and do not rely on conjectures. The first is an exceptionally simple fine-grained PoQ, providing an approach for potential experiment. The second PoQ exhibits an exponential gap between the memory of the honest quantum prover and that of a successful classical cheater.