Sciweavers

342 search results - page 6 / 69
» Quantum Algorithms
Sort
View
COCO
2005
Springer
141views Algorithms» more  COCO 2005»
14 years 1 months ago
Upper Bounds for Quantum Interactive Proofs with Competing Provers
Refereed games are interactive proof systems with two competing provers: one that tries to convince the verifier to accept and another that tries to convince the verifier to rej...
Gus Gutoski
ALGORITHMICA
2002
121views more  ALGORITHMICA 2002»
13 years 7 months ago
Sharp Quantum versus Classical Query Complexity Separations
We obtain the strongest separation between quantum and classical query complexity known to date--specifically, we define a black-box problem that requires exponentially many querie...
J. Niel de Beaudrap, Richard Cleve, John Watrous
DAC
2004
ACM
14 years 8 months ago
Quantum logic synthesis by symbolic reachability analysis
Reversible quantum logic plays an important role in quantum computing. In this paper, we propose an approach to optimally synthesize quantum circuits by symbolic reachability anal...
William N. N. Hung, Xiaoyu Song, Guowu Yang, Jin Y...
CEC
2003
IEEE
14 years 23 days ago
Exploring the search space of quantum programs
Here we present a first study of search spaces and fitness landscapes in the context of the evolution of quantum programs. We consider small instances of the Deutsch-Jozsa proble...
André Leier, Wolfgang Banzhaf
STOC
2006
ACM
76views Algorithms» more  STOC 2006»
14 years 7 months ago
A polynomial quantum algorithm for approximating the Jones polynomial
Dorit Aharonov, Vaughan Jones, Zeph Landau