We coiisider a situation where two parties, Alice and Bob, share a common secret string arid would like to mutually check their knowledge of that string. We describe a simple and e...
: Can Grover’s algorithm speed up search of a physical region—for example a 2-D grid of size √ n × √ n? The problem is that √ n time seems to be needed for each query, j...
Security of quantum key distribution against sophisticated attacks is among the most important issues in quantum information theory. In this work we prove security against a very ...
Eli Biham, Michel Boyer, Gilles Brassard, Jeroen v...
Quantum service selection facilitates matchmaking of Web services and greatly benefits from quantum memory exponential in the number of its qubits as well as from computational s...
Evolution of quantum circuits faces two major challenges: complex and huge search spaces and the high costs of simulating quantum circuits on conventional computers. In this paper ...