2010
DOI: 10.1103/physreve.82.041112
|View full text |Cite
|
Sign up to set email alerts
|

Noisy random Boolean formulae: A statistical physics perspective

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 … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
14
0

Year Published

2010
2010
2024
2024

Publication Types

Select...
10

Relationship

5
5

Authors

Journals

citations
Cited by 18 publications
(15 citation statements)
references
References 26 publications
1
14
0
Order By: Relevance
“…While in this paper we concentrated on the majority gates, we have looked at other gate types [16], hard noise (fabrication errors) and other properties of noisy circuits [18]. We believe that much can be explored about the properties of noisy circuits using the methodology developed here, for instance, the type of functions generated depending on the gate types and the level of gate noise.…”
Section: Discussionmentioning
confidence: 99%
“…While in this paper we concentrated on the majority gates, we have looked at other gate types [16], hard noise (fabrication errors) and other properties of noisy circuits [18]. We believe that much can be explored about the properties of noisy circuits using the methodology developed here, for instance, the type of functions generated depending on the gate types and the level of gate noise.…”
Section: Discussionmentioning
confidence: 99%
“…Specifically, if a single node has its state flipped, does the effect of this perturbation die out (quiescence), exponentially cascade over time (chaos), or is the system right in between (criticality)? There have been numerous empirical and mathematical observations about the characteristics of critical transition points in classes of Boolean networks [4][5][6][7][8][9][11][12][13][14][15], These results require F to have specific properties: for example, each truth table entry is i.i.d. or that functions are balanced (number of +1 and −1 outcomes is the same) on average.…”
Section: Introductionmentioning
confidence: 99%
“…Then intuitively, both models are in the ordered state. This intuition turns out to be correct for models with non-uniform topologies [19,20], but whether this is true in a more general case is not clear.…”
Section: Modelmentioning
confidence: 99%