Abstract
Properties of computing Boolean circuits composed of noisy logical gates are studied using the statistical physics methodology. A formula-growth model that gives rise to random Boolean functions is mapped onto a spin system, which facilitates the study of their typical behavior in the presence of noise. Bounds on their performance, derived in the information theory literature for specific gates, are straightforwardly retrieved, generalized and identified as the corresponding macroscopic phase transitions. The framework is employed for deriving results on error-rates at various function-depths and function sensitivity, and their dependence on the gate-type and noise model used. These are difficult to obtain via the traditional methods used in this field.
Original language | English |
---|---|
Article number | 041112 |
Journal | Physical Review E |
Volume | 82 |
Issue number | 041112 |
DOIs | |
Publication status | Published - 14 Oct 2010 |
Bibliographical note
© American Physical SocietyKeywords
- computing Boolean circuits
- noisy logical gates