Sciweavers

137 search results - page 7 / 28
» Quantum algorithms for some hidden shift problems
Sort
View
STOC
2004
ACM
152views Algorithms» more  STOC 2004»
14 years 8 months ago
Exponential separation of quantum and classical one-way communication complexity
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...
Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis
STOC
2007
ACM
136views Algorithms» more  STOC 2007»
14 years 8 months ago
Exponential separations for one-way quantum communication complexity, with applications to cryptography
We give an exponential separation between one-way quantum and classical communication protocols for two partial Boolean functions, both of which are variants of the Boolean Hidden...
Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, ...
ASIACRYPT
2001
Springer
14 years 4 days ago
The Modular Inversion Hidden Number Problem
We study a class of problems called Modular Inverse Hidden Number Problems (MIHNPs). The basic problem in this class is the following: Given many pairs xi, msbk (α + xi)−1 mod p...
Dan Boneh, Shai Halevi, Nick Howgrave-Graham
GECCO
2007
Springer
179views Optimization» more  GECCO 2007»
14 years 1 months ago
The second harmonic generation case-study as a gateway for es to quantum control problems
The Second Harmonic Generation (SHG), a process that turns out to be a good test case in the physics lab, can also be considered as a fairly simple theoretical test function for g...
Ofer M. Shir, Thomas Bäck
ICASSP
2008
IEEE
14 years 2 months ago
Image inpainting with a wavelet domain Hidden Markov tree model
We present a novel technique for image inpainting, the problem of filling-in missing image parts. Image inpainting is ill-posed and we adopt a probabilistic model-based approach ...
George Papandreou, Petros Maragos, Anil Kokaram