Computing with noise: phase transitions in Boolean formulas

Mozeika, Alexander; Saad, David and Raymond, Jack (2009). Computing with noise: phase transitions in Boolean formulas. Physical Review Letters, 103 (24), p. 248701.

Abstract

Computing circuits composed of noisy logical gates and their ability to represent arbitrary Boolean functions with a given level of error are investigated within a statistical mechanics setting. Existing bounds on their performance are straightforwardly retrieved, generalized, and identified as the corresponding typical-case phase transitions. Results on error rates, function depth, and sensitivity, and their dependence on the gate-type and noise model used are also obtained.

Divisions: ASTON EPrints organisational structure > Schools_of_Study > Engineering & Applied Science > Mathematics (EAS)
ASTON EPrints organisational structure > Schools_of_Study > Engineering & Applied Science
Related URLs:
Additional Information: © 2009 The American Physical Society
Uncontrolled Keywords: Computing circuits,noisy logical gates,Boolean functions,given level of error,statistical mechanics,Physics and Astronomy(all)
Published Date: 2009-12-11

Download

[img]

Export / Share Citation


Statistics

Additional statistics for this record