<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet href="client.xsl" type="text/xsl"?>
<article article-type="other">
<front>
<journal-meta>
<journal-id/>
<issn/>
<banner>
<!--<href>banner.jpg</href>-->
<size width="100%"/>
</banner>
</journal-meta>
<article-meta>
<title-group>
<article-title>Programming and Simulation of Quantum Search Agents</article-title>
</title-group>

<author><a href="mailto:klusch@dfki.de"><name>Matthias Klusch</name></a></author>
<aff>German Research Center for Artificial Intelligence <br/>Multiagent System Group Saarbr&#252;cken, Germany</aff>

<author><a href="mailto:schubotz@gmx.de"><name>Ren&#233; Schubotz</name></a></author>
<aff>Saarland University Computer Science Department Saarbr&#252;cken<br/> Germany</aff>


</article-meta></front>
<body>
<abstract>
<title>ABSTRACT</title>
<p>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.
For a comprehensive and in-depth introduction to quantum
computation (QC) we refer the interested reader to [10]. An
extended version of this work can be found at [6].</p>
</abstract>
<fpdf>
<href>pdflogo.jpg</href>
<hpdf>AAMAS07_0028_6dae935193ee99dbd2b917f882efb940</hpdf>
</fpdf>
</body>
</article>
