Sciweavers

5215 search results - page 10 / 1043
» Quantum clustering algorithms
Sort
View
ENTCS
2006
117views more  ENTCS 2006»
13 years 9 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...
COCO
2000
Springer
161views Algorithms» more  COCO 2000»
14 years 2 months ago
Characterization of Non-Deterministic Quantum Query and Quantum Communication Complexity
It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal ...
Ronald de Wolf
COCO
2001
Springer
154views Algorithms» more  COCO 2001»
14 years 2 months ago
Quantum Algorithms for Element Distinctness
We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard...
Harry Buhrman, Christoph Dürr, Mark Heiligman...
ISVLSI
2007
IEEE
107views VLSI» more  ISVLSI 2007»
14 years 4 months ago
A Quantum Algorithm for Finding Minimum Exclusive-Or Expressions
This paper presents a quantum algorithm for finding minimal ESCT (Exclusive-or Sum of Complex Terms) or ESOP (Exclusiveor Sum Of Products) expressions for any arbitrary incomplet...
Marinos Sampson, Dimitrios Voudouris, George K. Pa...
CDES
2008
130views Hardware» more  CDES 2008»
13 years 11 months ago
A Quantum Algorithm for Finding Minimum Exclusive-Or Expressions for Multi-Output Incompletely Specified Boolean Functions
This paper presents a quantum algorithm for finding minimal ESCT (Exclusive-or Sum of Complex Terms) or ESOP (Exclusive-or Sum Of Products) expressions for any arbitrary multi-outp...
Marinos Sampson, Dimitrios Voudouris, George K. Pa...