Iso-array rewriting P systems with context-free iso-array rules

A new computing model called P system is a highly distributed and parallel theoretical model, which is proposed in the area of membrane computing. Ceterchi et al. initially proposed array rewriting P systems by extending the notion of string rewriting P systems to arrays (2003). A theoretical model for picture generation using context-free iso-array grammar rules and puzzle iso-array grammar rules are introduced by Kalyani et al. (2004, 2006). Also iso-array rewriting P systems for iso-picture languages have been studied by Annadurai et al. (2008). In this paper we consider the context-free iso-array rules and context-free puzzle iso-array rules in iso-array rewriting P systems and examine the generative powers of these P systems

Adjunct hexagonal array token Petri nets and hexagonal picture languages

Adjunct Hexagonal Array Token Petri Net Structures (AHPN) are re- cently introduced hexagonal picture generating devices which extended the Hexag- onal Array Token Petri Net Structures . In this paper we consider AHPN model along with a control feature called inhibitor arcs and compare it with some ex- pressive hexagonal picture generating and recognizing models with respect to the generating power

Controlled rotation mechanism of DNA strand exchange by the Hin serine recombinase.

DNA strand exchange by serine recombinases has been proposed to occur by a large-scale rotation of halves of the recombinase tetramer. Here we provide the first direct physical evidence for the subunit rotation mechanism for the Hin serine invertase. Single-DNA looping assays using an activated mutant (Hin-H107Y) reveal specific synapses between two hix sites. Two-DNA "braiding" experiments, where separate DNA molecules carrying a single hix are interwound, show that Hin-H107Y cleaves both hix sites and mediates multi-step rotational relaxation of the interwinding. The variable numbers of rotations in the DNA braid experiments are in accord with data from bulk experiments that follow DNA topological changes accompanying recombination by the hyperactive enzyme. The relatively slow Hin rotation rates, combined with pauses, indicate considerable rotary friction between synapsed subunit pairs. A rotational pausing mechanism intrinsic to serine recombinases is likely to be crucial for DNA ligation and for preventing deleterious DNA rearrangements

Error suppression via complementary gauge choices in Reed-Muller codes

Concatenation of two quantum error correcting codes with complementary sets of transversal gates can provide a means towards universal fault-tolerant computation. We first show that it is generally preferable to choose the inner code with the higher pseudo-threshold in order to achieve lower logical failure rates. We then explore the threshold properties of a wide range of concatenation schemes. Notably, we demonstrate that the concatenation of complementary sets of Reed-Muller codes can increase the code capacity threshold under depolarizing noise when compared to extensions of previously proposed concatenation models. We also analyze the properties of logical errors under circuit level noise, showing that smaller codes perform better for all sampled physical error rates. Our work provides new insights into the performance of universal concatenated quantum codes for both code capacity and circuit level noise.Comment: 11 pages + 4 appendices, 6 figures. In v2, Fig.1 was added to conform to journal specification

Cluster-based architecture for fault-tolerant quantum computation

We present a detailed description of an architecture for fault-tolerant quantum computation, which is based on the cluster model of encoded qubits. In this cluster-based architecture, concatenated computation is implemented in a quite different way from the usual circuit-based architecture where physical gates are recursively replaced by logical gates with error-correction gadgets. Instead, some relevant cluster states, say fundamental clusters, are recursively constructed through verification and postselection in advance for the higher-level one-way computation, which namely provides error-precorrection of gate operations. A suitable code such as the Steane seven-qubit code is adopted for transversal operations. This concatenated construction of verified fundamental clusters has a simple transversal structure of logical errors, and achieves a high noise threshold ~ 3 % for computation by using appropriate verification procedures. Since the postselection is localized within each fundamental cluster with the help of deterministic bare controlled-Z gates without verification, divergence of resources is restrained, which reconciles postselection with scalability.Comment: 16 pages, 34 figure