内容: In this survey talk we give an intuitive treatment of the discrete time quantization of classical Markov chains. Grover search and the quantum walk based search algorithms of Ambainis, Szegedy ...
内容: Suppose P, Q are probability distributions on the same sample space. Their relative entropy is defined as S(P||Q) = \sum_i P(i) \log (P(i) / Q(i)). The relative entropy is an important informat...
内容:
内容: Randomization of quantum states is the quantum analogue of the classical one-time pad. We present an improved, efficient construction of an approximately randomizing map that uses O( d /epsilon...
内容: In this talk I will suggest the first near-future application of quantum computing devices, "Algorithmic Cooling". I will explain how simple quantum algorithms, and novel entropy manipulations ...
5月9日晚上,“学在清华真人图书馆”系列讲座在FIT楼二楼多功能厅成功举行,交叉信息院姚期智讲座教授段路明作了题为“量子计算:量子力学的世纪之争到计算科学的新时代”的特邀报告。 本次特邀报告段教授从Einstei...