Quantum Service Selection

Quantum service selection facilitates matchmaking of Web services and greatly benefits from quantum memory exponential in the number of its qubits as well as from computational speedup by an order of magnitude. Key idea of this work is the combination of Trugenberger’s algorithms for associative quantum memories and the relaxation of semantic matchmaking to syntactical matchmaking within a graph space equipped with Hamming distance as its metric.

• Type: Conference
• Year: 2008
• Where: IAT
• Authors: Matthias Klusch, René Schubotz
• Keywords: Associative Quantum Memories, IAT 2008, Intelligent Agent, Selection Facilitates Matchmaking, Syntactical Matchmaking