4084 search results - page 129 / 817 » The Method of Quantum Clustering |
183
click to vote
STACS
2007
Springer
16 years 16 days ago
2007
Springer
We exactly determine the formula size of the parity function. If n = 2 + k, where 0 ≤ k < 2 , then the formula size of parity on n bits is 2 (2 + 3k) = n2 + k2 − k2 . Khrap...
173
click to vote
IMA
2003
Springer
15 years 11 months ago
2003
Springer
In extension of the bit commitment task and following work initiated by Crépeau and Kilian, we introduce and solve the problem of characterising the optimal rate at which a discr...
154
click to vote
EJC
2010
15 years 6 months ago
2010
Mutually unbiased bases (MUBs) in complex vector spaces play several important roles in quantum information theory. At present, even the most elementary questions concerning the m...
175
click to vote
COMPUTING
2006
15 years 6 months ago
2006
Sparse grid methods represent a powerful and efficient technique for the representation and approximation of functions and particularly the solutions of partial differential equat...
150
click to vote
CPHYSICS
2006
15 years 6 months ago
2006
A new method of evaluating transition matrix elements between wave functions associated with orthogonal polynomials is proposed. The technique relies on purely algebraic manipulat...