Verification of boson-sampling

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.