-
05-07
2008
A substate theorem in classical and quantum information theory with some applica
内容： 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...
-
04-23
2008
Quantum walk based search algorithms
内容： 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 ...
-
05-29
2007
Quantum communication complexity of block-composed functions
内容： A central open problem in communication complexity is whether or not quantum protocols can be exponentially more efficient than classical ones for computing a total Boolean function in the stan...
-
03-14
2007
Post Quantum Signatures
内容： IT security relies on the existence of efficient and secure digital signature schemes. Important applications of digital signatures are the authentication of web sites and software downloads. H...
-
03-21
2006
Search via Quantum Walks
内容： 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...
-
09-06
2005
From Quantum Computers to Identification of Molecules
内容： 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 ...