𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Simulating Boolean Circuits on a DNA Computer

✍ Scribed by M. Ogihara; A. Ray

Book ID
105745728
Publisher
Springer
Year
1999
Tongue
English
Weight
95 KB
Volume
25
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Simulating fermions on a quantum compute
Simulating fermions on a quantum computer
✍ G. Ortiz; J.E. Gubernatis; E. Knill; R. Laflamme πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 178 KB
Simulating quantum mechanics on a quantu
Simulating quantum mechanics on a quantum computer
✍ Bruce M. Boghosian; Washington Taylor IV πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 864 KB

Algorithms are described for efficiently simulating quantum mechanical systems on quantum computers. A class of algorithms for simulating the Schr6dinger equation for interacting many-body systems are presented in some detail. These algorithms would make it possible to simulate nonrelativistic quant

On the Computation of Boolean Functions
On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-In
✍ GyΓΆrgy TurΓ‘n; Farrokh Vatan πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 741 KB

We consider the complexity of computing Boolean functions by analog circuits of bounded fan-in, i.e., by circuits of gates computing real-valued functions, either exactly or as sign-representation. Sharp upper bounds are obtained for the complexity of the most difficult n-variable function over cert