Programming and simulation of quantum search agents

Key idea of this work is to appropriately extend one prominent generic agent architecture, namely InteRRap [8], to the case of a quantum pattern matching (QPM) based type-I quantum search agent (QSA) that is supposed to run on a hybrid quantum computer, and to show it’s feasibility by instantiating the respective QuantumInteRRap architecture.

• Type: Conference
• Year: 2007
• Where: ATAL
• Authors: Matthias Klusch, René Schubotz
• Keywords: ATAL 2007, Generic Agent Architecture, Hybrid Quantum Computer, Quantum Search Agent