Sciweavers

4895 search results - page 7 / 979
» Functional Quantum Programming
Sort
View
ENTCS
2006
117views more  ENTCS 2006»
13 years 7 months ago
Reasoning About Imperative Quantum Programs
A logic for reasoning about states of basic quantum imperative programs is presented. The models of the logic are ensembles obtained by attaching probabilities to pairs of quantum...
Rohit Chadha, Paulo Mateus, Amílcar Sernada...
GECCO
2005
Springer
131views Optimization» more  GECCO 2005»
14 years 1 months ago
Evolution of a human-competitive quantum fourier transform algorithm using genetic programming
In this paper, we show how genetic programming (GP) can be used to evolve system-size-independent quantum algorithms, and present a human-competitive Quantum Fourier Transform (QF...
Paul Massey, John A. Clark, Susan Stepney
ICALP
2004
Springer
14 years 28 days ago
Quantum Query Complexity of Some Graph Problems
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
Christoph Dürr, Mark Heiligman, Peter H&oslas...
ASPLOS
2006
ACM
14 years 1 months ago
A program transformation and architecture support for quantum uncomputation
  Quantum  computing’s  power  comes  from  new  algorithms  that exploit quantum mechanical phenomena for computation. Quantum algorithms  are  different  from...
Ethan Schuchman, T. N. Vijaykumar
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