Sciweavers

11547 search results - page 32 / 2310
» Quantum computing and communication
Sort
View
146
Voted
COCO
2001
Springer
149views Algorithms» more  COCO 2001»
15 years 8 months ago
Quantum versus Classical Learnability
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
Rocco A. Servedio, Steven J. Gortler
128
Voted
ISAAC
2003
Springer
91views Algorithms» more  ISAAC 2003»
15 years 9 months ago
Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?
This paper introduces quantum “multiple-Merlin”-Arthur proof systems in which Arthur receives multiple quantum proofs that are unentangled with each other. Although classical ...
Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yama...
IAT
2008
IEEE
15 years 10 months ago
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 s...
Matthias Klusch, René Schubotz
150
Voted
GECCO
2004
Springer
120views Optimization» more  GECCO 2004»
15 years 9 months ago
Comparison of Selection Strategies for Evolutionary Quantum Circuit Design
Evolution of quantum circuits faces two major challenges: complex and huge search spaces and the high costs of simulating quantum circuits on conventional computers. In this paper ...
André Leier, Wolfgang Banzhaf
ASIAN
2009
Springer
363views Algorithms» more  ASIAN 2009»
15 years 4 months ago
A Logic for Formal Verification of Quantum Programs
Abstract. This paper provides a Hoare-style logic for quantum computation. While the usual Hoare logic helps us to verify classical deterministic programs, our logic supports quant...
Yoshihiko Kakutani