3328 search results - page 22 / 666 » Topological Quantum Computation |
107
Voted
FOCS
1998
IEEE
15 years 6 months ago
1998
IEEE
Sampling is an important primitive in probabilistic and quantum algorithms. In the spirit of communication complexity, given a function f : X
108
Voted
FOCS
1997
IEEE
15 years 6 months ago
1997
IEEE
In this paper, we introduce 1-way and 2-way quantum nite state automata (1qfa's and 2qfa's), which are the quantum analogues of deterministic, nondeterministic and proba...
122
Voted
ISCA
2005
IEEE
15 years 7 months ago
2005
IEEE
: The theoretical study of quantum computation has yielded efficient algorithms for some traditionally hard problems. Correspondingly, experimental work on the underlying physical...
126
click to vote
COCO
2001
Springer
15 years 6 months ago
2001
Springer
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...
105
click to vote
ISAAC
2003
Springer
15 years 7 months ago
2003
Springer
This paper introduces quantum “multiple-Merlin”-Arthur proof systems in which Arthur receives multiple quantum proofs that are unentangled with each other. Although classical ...