A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Quantum computation and quantum information
Quantum computation and quantum information
Information Processing Letters
Towards a quantum programming language
Mathematical Structures in Computer Science
Agents And Computational Autonomy: Potential, Risks, And Solutions (Lecture Notes in Computer Science)
Gate-level simulation of quantum circuits
ASP-DAC '03 Proceedings of the 2003 Asia and South Pacific Design Automation Conference
Programming and simulation of quantum search agents
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Programming and simulation of quantum search agents
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
| Hi-index | 0.00 |
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].