By Topic

Noise Threshold for Universality of Two-Input Gates

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Unger, F. ; Centrum voor Wiskunde en Inf., Amsterdam

It is known that epsi-noisy gates with two inputs are universal for arbitrary computation (i.e., can compute any function with bounded error), if all gates fail independently with probability epsi and epsi < beta2 = (3 - radic7)/4 ap 8.856%. In this paper, it is shown that this bound is tight for formulas, by proving that gates with two inputs, in which each gate fails with probability at least beta2 cannot be universal. Hence, there is a threshold on the tolerable noise for formulas with two-input gates and it is beta2. It is conjectured that the same threshold also holds for circuits.

Published in:

Information Theory, IEEE Transactions on  (Volume:54 ,  Issue: 8 )