Sciweavers

1352 search results - page 247 / 271
» Fault-Tolerant Quantum Computation
Sort
View
JCC
2008
131views more  JCC 2008»
13 years 7 months ago
An optimized initialization algorithm to ensure accuracy in quantum Monte Carlo calculations
: Quantum Monte Carlo (QMC) calculations require the generation of random electronic configurations with respect to a desired probability density, usually the square of the magnitu...
Daniel R. Fisher, David R. Kent IV, Michael T. Fel...
COCO
2009
Springer
126views Algorithms» more  COCO 2009»
14 years 2 months ago
New Results in the Simultaneous Message Passing Model via Information Theoretic Techniques
—Consider the following Simultaneous Message Passing (SMP) model for computing a relation f ⊆ X ×Y ×Z. In this model Alice, on input x ∈ X and Bob, on input y ∈ Y, send o...
Rahul Jain, Hartmut Klauck
IPL
2000
77views more  IPL 2000»
13 years 7 months ago
Simplified proof of the Fourier Sampling Theorem
We give a short and simple proof of Hales and Hallgren's Fourier Sampling Theorem ["Quantum Fourier Sampling Simplified", Proceedings of the Thirty-First Annual ACM...
Peter Høyer
TCS
2002
13 years 7 months ago
Complexity measures and decision tree complexity: a survey
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...
Harry Buhrman, Ronald de Wolf
LOGCOM
2010
85views more  LOGCOM 2010»
13 years 6 months ago
The Logic of Quasi-MV Algebras
The algebraic theory of quasi-MV algebras, generalisations of MV algebras arising in quantum computation, is by now rather well-developed. Although it is possible to define sever...
Félix Bou, Francesco Paoli, Antonio Ledda, ...