Search Talks

We give a new theoretical solution to a leading-edge experimental challenge, namely to the verification of quantum computations in the regime of high computational complexity. Our results are given in the language of quantum interactive proof systems. Specifically, we show that any language in BQP has a quantum interactive proof system with a polynomial-time classical verifier (who can also prepare random single-qubit pure states), and a quantum polynomial-time prover. Here, soundness is unconditional---i.e it holds even for computationally unbounded provers. Compared to prior work achieving similar results, our technique does not require the encoding of the input or of the computation; instead, we rely on encryption of the input (together with a method to perform computations on encrypted inputs), and show that the random choice between three types of input (defining a "computational run", versus two types of "test runs") suffice. As a proof technique, we use a reduction to an entanglement-based protocol; this enables a relatively simple analysis for a situation that has previously remained ambiguous in the literature.

Almost fifteen years after LIGO started listening to the cosmos, and 100 years after Einstein discovered general relativity, gravitational waves have been detected by ground-based interferometers, opening a new window on the universe. In this talk I will address some of the most exciting areas of research advanced LIGO will allow us to explore in the coming years. Detection and characterization of gravitational wave transients will be discussed, as well as their impact on astrophysics.

I will discuss the recent LHC excess in the di-photon distribution at an invariant mass of 750 GeV.  Various explanations in terms of weakly coupled and strongly coupled physics will be presented. Possible connection with Dark Matter will also be discussed.