Programming and simulation of quantum search agents

The extension of classical agents by the ability to perform quantum computation and communication provides an efficient and secure solution to applications such as information search and service matchmaking. In this paper, we propose a hybrid architecture for quantum computational agents, and demonstrate its principles by means of a simple type-I quantum search agent based on quantum pattern matching. Finally, we present preliminary results of the comparative evaluation of its implementation using different quantum programming languages and simulators.