Experimentally, secure quantum key distribution has been tested, using polarization or
phase of photons, for distance of 150 (200) km using standard optical fibres and for the …

The main purpose of this paper is to examine some (potential) applications of quantum
computation in AI and to review the interplay between quantum theory and AI. For the …

To study quantum computation, it might be helpful to generalize structures from language
and automata theory to the quantum case. To that end, we propose quantum versions of …

Over the past 27 years, quantum computing has seen a huge rise in interest from both
academia and industry. At the current rate, quantum computers are growing in size rapidly …

Quantum computers promise dramatic advantages in processing speed over currently
available computer systems. Quantum computing offers great promise in a wide variety of …

We consider the possibility of encoding m classical bits into many fewer n quantum bits
(qubits) so that an arbitrary bit from the original m bits can be recovered with good …

We study 1-way quantum finite automata (QFAs). First, we compare them with their classical
counterparts. We show that, if an automaton is required to give the correct answer with a …

Consider the finite regular language L/sub n/={w0| w/spl isin/{0, 1}*,| w|/spl les/n}. A.
Ambainis et al.(1999) showed that while this language is accepted by a deterministic finite …

Communication complexity has become a central completity model. In that model, we count
the amount of communication bits needed between two parties in order to solve certain …

We consider the possibility of encoding m classical bits into much fewer n quantum bits so
that an arbitrary bit from the original m bits can be recovered with a good probability, and we …