7 search results - page 1 / 2 » Revisiting a limit on efficient quantum computation |
ACMSE
2006
ACM
13 years 8 months ago
2006
ACM
In this paper, we offer an exposition of a theorem originally due to Adleman, Demarrais and Huang that shows that the quantum complexity class BQP (Bounded-error Quantum Polynomia...
CRYPTO
2010
Springer
13 years 6 months ago
2010
Springer
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditional...
CORR
2002
Springer
13 years 4 months ago
2002
Springer
One of the earliest quantum algorithms was discovered by Bernstein and Vazirani, for a problem called Recursive Fourier Sampling. This paper shows that the Bernstein-Vazirani algo...
HICSS
2003
IEEE
13 years 10 months ago
2003
IEEE
Mobility and the New Global Economy are accompanied by requirements for dynamism and flexibility, with respect to e-commerce, inter-organizational activity, and security. The clas...
CVPR
2010
IEEE
14 years 1 months ago
2010
IEEE
Markov random fields (MRFs) are popular and generic probabilistic models of prior knowledge in low-level vision. Yet their generative properties are rarely examined, while applica...