Verification of boson-sampling

报告人
Dr. Peter Rohde
单位
University of Technology Sydney
时间
2016-08-31 (周三) 11:00
地点
Room 331, Shanghai Branch
摘要

Of central importance in quantum computing is verifying that the computer yielded the correct result. For some problems this is straightforward, such a Shor's algorithm, which is easily verified via multiplication. However, in general, quantum algorithms are not NP, i.e they are not efficiently verifiable. Here I present some recent results on verification of boson-sampling and how they perform.