Sciweavers

206 search results - page 29 / 42
» On the Complexity of Quantum ACC
Sort
View
CEC
2008
IEEE
14 years 2 months ago
On the evolution of laser pulses under a dynamic Quantum Control environment
Abstract— This paper introduces the optimization of a Quantum Control application, the so-called molecular alignment problem, subject to a dynamic environment. Given the relative...
Ofer M. Shir, Thomas Bäck, Herschel Rabitz, M...
FOCS
2008
IEEE
14 years 2 months ago
The Bayesian Learner is Optimal for Noisy Binary Search (and Pretty Good for Quantum as Well)
We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: • Each comparison is erroneous with independent probability 1 − p. ...
Michael Ben-Or, Avinatan Hassidim
FCS
2006
13 years 9 months ago
Quantum Oblivious Transfer Based on POVM Measurements
- Oblivious transfer OT is an important primitive in cryptography. In chosen one-out-of-two OT, Alice offers two bits, one of which Bob can choose to read, not learning any informa...
Wei Yang, Liusheng Huang, Yonglong Luo, Mingjun Xi...
EUROCRYPT
2011
Springer
12 years 11 months ago
Concurrent Composition in the Bounded Quantum Storage Model
We define the BQS-UC model, a variant of the UC model, that deals with protocols in the bounded quantum storage model. We present a statistically secure commitment protocol in th...
Dominique Unruh
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
14 years 5 months ago
BQP and the Polynomial Hierarchy
The relationship between BQP and PH has been an open problem since the earliest days of quantum computing. We present evidence that quantum computers can solve problems outside th...
Scott Aaronson