DNA Computing and Molecular Programming

Fluorophores have been employed extensively in DNA nanotechnology, principally in donor-acceptor combinations, enabling Föster resonant energy transfer (FRET) to be used for applications, such as monitoring hybridization reactions and monitoring DNA nanomachine functions. FRET is an energy non-conserving process in which a bundle of energy, referred to as a Frenkel exciton, is transferred from the donor fluorophore to the acceptor. The characteristic length scale at which FRET sets in is called the Föster radius and is typically about 5 nm. If the donor and accepter are brought to within less than 2 nm of each other, the energy transfer can occur in an energy conserving manner referred to as coherent FRET. A Frenkel exciton, undergoing coherent FRET exchange among a cluster of chromophores, spreads out over the cluster in a wave-like manner, referred to as a quantum walk. Frenkel excitons also exhibit particle-like aspects and are best viewed as fully quantum mechanical entities. One manifestation of particle-like behavior is that, when two excitons encounter each other, they can experience a two-body interaction that gives rise to quantum mechanical phase shifts. In order for this to happen the chromophores must possess a permanent electric dipole moment and this requires the chromophores to be asymmetric. These two properties of Frenkel excitons – their wave-like behavior and their two-body interaction – are sufficient to enable universal quantum computation. I will describe how these two features can be exploited to implement a complete set of quantum gates for universal quantum computation. Quantum computing, regardless of its embodiment, is a race against decoherence, the process by which the wave-like behavior is destroyed. Chromophores, residing in buffer and attached to DNA, are in an environment highly susceptable to this process. It remains to be seen whether the decoherence rate can be reduced enough to enable Frenkel excitons to perform universal quantum computation by undergoing a many-body quantum walk over a network of chromophores attached to a DNA scaffold. From One, Many: Programmably Reconfigurable, Multiscale Materials Built with DNA

[1]  Michael J. Fischer,et al.  Computation in networks of passively mobile finite-state sensors , 2004, PODC '04.

[2]  S. Shen-Orr,et al.  Network motifs: simple building blocks of complex networks. , 2002, Science.

[3]  D. Gillespie Exact Stochastic Simulation of Coupled Chemical Reactions , 1977 .

[4]  Erik Winfree,et al.  On the computational power of DNA annealing and ligation , 1995, DNA Based Computers.

[5]  Dan Alistarh,et al.  Time-Space Trade-offs in Population Protocols , 2016, SODA.

[6]  Harry M. T. Choi,et al.  Programming biomolecular self-assembly pathways , 2008, Nature.

[7]  James L. Peterson,et al.  Petri Nets , 1977, CSUR.

[8]  Rahul Sarpeshkar,et al.  Synthetic analog computation in living cells , 2013, Nature.

[9]  S. Ginsburg,et al.  Semigroups, Presburger formulas, and languages. , 1966 .

[10]  Jens Sparsø,et al.  Principles of Asynchronous Circuit Design , 2001 .

[11]  David Eisenstat,et al.  Stably computable predicates are semilinear , 2006, PODC '06.

[12]  Ezra Miller Theory and applications of lattice point methods for binomial ideals , 2010, ArXiv.

[13]  David Eisenstat,et al.  Fast computation by population protocols with a leader , 2006, Distributed Computing.

[14]  Luca Cardelli Two-domain DNA strand displacement , 2013, Math. Struct. Comput. Sci..

[15]  Ehud Shapiro,et al.  Bringing DNA computers to life , 2006 .

[16]  David Soloveichik,et al.  Stable Leader Election in Population Protocols Requires Linear Time , 2015, DISC.

[17]  J. Gunawardena,et al.  Unlimited multistability in multisite phosphorylation systems , 2009, Nature.

[18]  K Oishi,et al.  Biomolecular implementation of linear I/O systems. , 2011, IET systems biology.

[19]  John Doyle,et al.  Rules of engagement , 2007, Nature.

[20]  Peter A. J. Hilbers,et al.  Computing Algebraic Functions with Biochemical Reaction Networks , 2009, Artificial Life.

[21]  M. Feinberg,et al.  Structural Sources of Robustness in Biochemical Reaction Networks , 2010, Science.

[22]  Edward F. Moore,et al.  Gedanken-Experiments on Sequential Machines , 1956 .

[23]  Marc D. Riedel,et al.  Rate-Independent Constructs for Chemical Computation , 2011, PloS one.

[24]  E. Shapiro,et al.  An autonomous molecular computer for logical control of gene expression , 2004, Nature.

[25]  A. Rinaldo,et al.  MAXIMUM LIKELIHOOD ESTIMATION IN LOG-LINEAR , 2012 .

[26]  Eduardo D. Sontag Structure and stability of certain chemical networks and applications to the kinetic proofreading model of T-cell receptor signal transduction , 2001, IEEE Trans. Autom. Control..

[27]  Monir Hajiaghayi,et al.  Leaderless deterministic chemical reaction networks , 2013, Natural Computing.

[28]  Ezra Miller,et al.  A Geometric Approach to the Global Attractor Conjecture , 2013, SIAM J. Appl. Dyn. Syst..

[29]  N. Seeman,et al.  Design and self-assembly of two-dimensional DNA crystals , 1998, Nature.

[30]  Erik Winfree,et al.  Integrating DNA strand-displacement circuitry with DNA tile self-assembly , 2013, Nature Communications.

[31]  Katherine C. Chen,et al.  Sniffers, buzzers, toggles and blinkers: dynamics of regulatory and signaling pathways in the cell. , 2003, Current opinion in cell biology.

[32]  Eduardo Sontag,et al.  A Petri net approach to the study of persistence in chemical reaction networks. , 2006, Mathematical biosciences.

[33]  L. Dickson Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors , 1913 .

[34]  Seung Woo Shin,et al.  Compiling and Verifying DNA-Based Chemical Reaction Network Implementations , 2012 .

[35]  Lulu Qian,et al.  Efficient Turing-Universal Computation with DNA Polymers , 2010, DNA.

[36]  P. Yin,et al.  Complex shapes self-assembled from single-stranded DNA tiles , 2012, Nature.

[37]  Ryan P. Adams,et al.  Message Passing Inference with Chemical Reaction Networks , 2013, NIPS.

[38]  Manoj Gopalkrishnan Catalysis in Reaction Networks , 2011, Bulletin of mathematical biology.

[39]  Luca Cardelli Strand Algebras for DNA Computing , 2009, DNA.

[40]  Rupak Majumdar,et al.  Verification of population protocols , 2016, Acta Informatica.

[41]  John E. Hopcroft,et al.  On the Reachability Problem for 5-Dimensional Vector Addition Systems , 1976, Theor. Comput. Sci..

[42]  Matthew Cook,et al.  Computation with finite stochastic chemical reaction networks , 2008, Natural Computing.

[43]  David Soloveichik,et al.  Probability 1 Computation with Chemical Reaction Networks , 2014, DNA.

[44]  Richard M. Karp,et al.  Parallel Program Schemata , 1969, J. Comput. Syst. Sci..

[45]  Lulu Qian,et al.  Supporting Online Material Materials and Methods Figs. S1 to S6 Tables S1 to S4 References and Notes Scaling up Digital Circuit Computation with Dna Strand Displacement Cascades , 2022 .

[46]  Erik Winfree,et al.  Universal computation via self-assembly of DNA: Some theory and experiments , 1996, DNA Based Computers.

[47]  Dan Alistarh,et al.  Polylogarithmic-Time Leader Election in Population Protocols , 2015, ICALP.

[48]  D. Y. Zhang,et al.  Engineering Entropy-Driven Reactions and Networks Catalyzed by DNA , 2007, Science.

[49]  Robert Brijder,et al.  Output Stability and Semilinear Sets in Chemical Reaction Networks and Deciders , 2014, DNA.

[50]  Lulu Qian,et al.  A Simple DNA Gate Motif for Synthesizing Large-Scale Circuits , 2008, DNA.

[51]  Erik Winfree,et al.  DNA as a universal substrate for chemical kinetics , 2009, Proceedings of the National Academy of Sciences.

[52]  Alicia Dickenstein,et al.  Toric dynamical systems , 2007, J. Symb. Comput..

[53]  Ho-Lin Chen,et al.  Deterministic Function Computation with Chemical Reaction Networks , 2012, DNA.

[54]  George H. Mealy,et al.  A method for synthesizing sequential circuits , 1955 .

[55]  David Eisenstat,et al.  The computational power of population protocols , 2006, Distributed Computing.

[56]  Gunnar Fløystad,et al.  Combinatorial aspects of commutative algebra and algebraic geometry : the Abel symposium 2009 , 2011 .

[57]  V. Kulkarni,et al.  Computational design of nucleic acid feedback control circuits. , 2014, ACS synthetic biology.