Search Talks

The counter-intuitive phenomena in quantum mechanics are often based on the counter-factual (or virtual) processes. The famous example is the Hardy paradox, which has been recently solved in two independent experiments. Also, the delayed choice experiment and one of quantum descriptions of the closed time like curves can be also examples of the counter-intuitive phenomena. The counter-factual processes can be characterized by the weak value initiated by Yakir Aharonov and his colleagues. In this talk, I will introduce the weak value from the probability theory and the connection to the counter-factual processes in these examples.

AdS/CFT has proven itself a powerful tool in extending our understanding of strongly coupled quantum theories. While studies of AdS/CFT have predominantly focused on tree level calculations, there has been growing interest in the loop effect recently. We studied the 1-loop correction to the gauge boundary-to-boundary correlator due to its coupling to a complex scalar field. In this talk, I would outline our main results, explain the Cutkosky rule in AdS space, and discuss an extra divergence we found in both real and imaginary part of the loop integral. I would then combine our analysis with the replica trick to demonstrate a possible application where one attempts to calculate the DC conductivity in a condensed matter system with random disorder and discuss the limitation and difficulties of our method in its current form.

I'll describe a connection between uncertainty relations, information locking and low-distortion embeddings of L2 into L1. Exploiting this connection leads to the first explicit construction of entropic uncertainty relations for a number of measurements that is polylogarithmic in the dimension d while achieving an average measurement entropy of (1-e) log d for arbitrarily small e. From there, it is straightforward to obtain the first strong information locking scheme that is efficiently computable using a quantum computer. This locking scheme can be interpreted as a method for encrypting classical messages using a key of size much smaller than the message length. Other applications include efficient encodings for amortized quantum identification over classical channels and new string commitment protocols.