Sciweavers

1352 search results - page 235 / 271
» Fault-Tolerant Quantum Computation
Sort
View
FOCS
2000
IEEE
14 years 4 days ago
Fast parallel circuits for the quantum Fourier transform
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...
Richard Cleve, John Watrous
IPPS
2010
IEEE
13 years 5 months ago
Enhancing adaptive middleware for quantum chemistry applications with a database framework
Quantum chemistry applications such as the General Atomic and Molecular Electronic Structure System (GAMESS) that can execute on a complex peta-scale parallel computing environment...
Lakshminarasimhan Seshagiri, Meng-Shiou Wu, Masha ...
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
LSSC
2001
Springer
14 years 5 days ago
Statistical Algorithms for Simulation of Electron Quantum Kinetics in Semiconductors - Part I
Abstract. In this work we solve the Barker-Ferry equation which accounts for the quantum character of the electron-phonon interaction in semiconductors in the framework of the Mont...
Todor V. Gurov, Paula A. Whitlock
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