-
05-07
2008
A substate theorem in classical and quantum information theory with some applica
Abstract: 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 info...
-
04-23
2008
Quantum walk based search algorithms
Abstract: 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, Szeg...
-
05-29
2007
Quantum communication complexity of block-composed functions
Abstract: 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 ...
-
03-14
2007
Post Quantum Signatures
Abstract: 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 download...
-
03-21
2006
Search via Quantum Walks
Abstract: 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 /eps...
-
09-06
2005
From Quantum Computers to Identification of Molecules
Abstract: 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 manipulati...