On the expressibility of stochastic switching circuits
- Creators
- Zhou, Hongchao
-
Bruck, Jehoshua
Abstract
Stochastic switching circuits are relay circuits that consist of stochastic switches (that we call pswitches). We study the expressive power of these circuits; in particular, we address the following basic question: given an arbitrary integer q, and a pswitch set {1/q, 2/q, ..., q-1/q}, can we realize any rational probability with denominator q^n (for arbitrary n) by a simple series-parallel stochastic switching circuit? In this paper, we generalized previous results and prove that when q is a multiple of 2 or 3 the answer is positive. We also show that when q is a prime number the answer is negative. In addition, we prove that any desired probability can be approximated well by a linear in n size circuit, with error less than q^(-n).
Additional Information
© 2009 IEEE. This work was supported in part by the NSF Expeditions in Computing Program under grant CCF-0832824. The authors would like to thank Dan Wilhelm for discussions and assistance.Attached Files
Published - Zhou2009p110962009_Ieee_International_Symposium_On_Information_Theory_Vols_1-_4.pdf
Files
Name | Size | Download all |
---|---|---|
md5:45c4dd5f4b6f1f1e4aa4d9c3c3e69d39
|
1.1 MB | Preview Download |
Additional details
- Eprint ID
- 19449
- Resolver ID
- CaltechAUTHORS:20100816-150432698
- NSF Expeditions in Computing Program
- CCF-0832824
- Created
-
2010-08-16Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field
- Other Numbering System Name
- INSPEC Accession Number
- Other Numbering System Identifier
- 10841930