Sciweavers

10666 search results - page 10 / 2134
» Quantum programming languages
Sort
View
DAGSTUHL
2006
13 years 9 months ago
Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries
Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical "black box" function drawn from some set of such bl...
Howard Barnum
CEC
2003
IEEE
14 years 25 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
28
Voted
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
DAGSTUHL
2007
13 years 9 months ago
Classical Simulation Complexity of Quantum Branching Programs
We present classical simulation techniques for measure once quantum branching programs. For bounded error syntactic quantum branching program of width w that computes a function w...
Farid M. Ablayev
IJCNN
2008
IEEE
14 years 1 months ago
A quantum calculus formulation of dynamic programming and ordered derivatives
— Much recent research activity has focused on the theory and application of quantum calculus. This branch of mathematics continues to find new and useful applications and there ...
John Seiffertt, Donald C. Wunsch