Boolean Logic Circuits Research Articles

Q-Map: quantum circuit implementation of boolean functions

Quantum computing has gained attention in recent years due to the significant progress in quantum computing technology. Today many companies like IBM, Google and Microsoft have developed quantum computers and simulators for research and commercial use. The development of quantum techniques and algorithms is essential to exploit the full power of quantum computers. In this paper we propose a simple visual technique (we call Q-Map) for quantum realization of classical Boolean logic circuits. The proposed method utilizes concepts from Boolean algebra to produce a quantum circuit with minimal number of quantum gates.

Cross-coupled 4T2R multi-logic in-memory computing circuit design

Resistive random access memory (RRAM) is viewed as the next-generation memory model, surpassing the constraints of traditional random access memory. Given its non-volatile nature, which lessens static power consumption, RRAM boasts significant computing-in-memory (CIM) potential. We herein present a four-transistor/two-resistor cross-coupling structure based on RRAM. In this structure, two RRAMs are situated in opposite directions, a configuration referred to as reverse coding. This structure provides the flexibility and reconfigurability to adjust the RRAM connections, facilitating various CIM operations in fewer cycles. A full adder design was developed and its feasibility was validated through simulations. Monte Carlo analysis ensures the accuracy of logic operations, even while encountering significant resistance fluctuations. This approach effectively mitigates the resistance crossover observed in existing RRAM CIMs. Compared with previous methodologies, the proposed structure achieves greater robustness with fewer cycle counts and RRAM numbers, The comparison of our approach with state-of-the-art Boolean logic circuits for RRAM architecture shows significant improvement in both delay (1.4–4.1 × ) and the number of RRAM (1.2–6.6 × ).

Completeness of the ZH-calculus

There are various gate sets used for describing quantum computation. A particularly popular one consists of Clifford gates and arbitrary single-qubit phase gates. Computations in this gate set can be elegantly described by the ZX-calculus, a graphical language for a class of string diagrams describing linear maps between qubits. The ZX-calculus has proven useful in a variety of areas of quantum information, but is less suitable for reasoning about operations outside its natural gate set such as multi-linear Boolean operations like the Toffoli gate. In this paper we study the ZH-calculus, an alternative graphical language of string diagrams that does allow straightforward encoding of Toffoli gates and other more complicated Boolean logic circuits. We find a set of simple rewrite rules for this calculus and show it is complete with respect to matrices over Z[12], which correspond to the approximately universal Toffoli+Hadamard gateset. Furthermore, we construct an extended version of the ZH-calculus that is complete with respect to matrices over any ring R where 1+1 is not a zero-divisor.

Visualizing Quantum Circuit Probability: Estimating Quantum State Complexity for Quantum Program Synthesis.

This work applies concepts from algorithmic probability to Boolean and quantum combinatorial logic circuits. The relations among the statistical, algorithmic, computational, and circuit complexities of states are reviewed. Thereafter, the probability of states in the circuit model of computation is defined. Classical and quantum gate sets are compared to select some characteristic sets. The reachability and expressibility in a space-time-bounded setting for these gate sets are enumerated and visualized. These results are studied in terms of computational resources, universality, and quantum behavior. The article suggests how applications like geometric quantum machine learning, novel quantum algorithm synthesis, and quantum artificial general intelligence can benefit by studying circuit probabilities.

A SmNiO3 memristor with artificial synapse function properties and the implementation of Boolean logic circuits.

Recently, with the improvement of the requirements for fast and efficient data processing in the era of artificial intelligence, new forms of computing have come into being. Developing memristor devices that can simulate the brain's computing neutral network is particularly important for applications in the field of artificial intelligence. However, there are still some challenges in their biological function simulation and related circuit design. In this work, a memristor based on perovskite rare earth nickelates (RNiO3) is presented with excellent electrical performance, including three orders of magnitude higher current switching ratio and good repeatability, and can achieve bidirectional conductance regulation like weight modulation in bio-synapse. Furthermore, the synaptic like characteristics of the device have been mimicked successfully, such as excitatory postsynaptic current (EPSC), paired pulse facilitation (PPF), classical double pulse spike time-dependent plasticity (classical pair-STDP), triplet spike time-dependent plasticity (triplet-STDP), short-term plasticity (STP), long-term plasticity (LTP), the refractory period phenomenon and learning and forgetting rules. In particular, two synaptic devices and a leaky integrate-and-fire (LIF) neuron device are used to achieve a logic gate circuit to realize "AND", "OR", and "NOT" functions. The device paves the way for the application of high-density circuits in artificial intelligence.

Computational Methods for the Design of Recombinase Logic Circuits with Adaptable Circuit Specifications.

Synthetic biology aims at engineering new biological systems and functions that can be used to provide new technological solutions to worldwide challenges. Detection and processing of multiple signals are crucial for many synthetic biology applications. A variety of logic circuits operating in living cells have been implemented. One particular class of logic circuits uses site-specific recombinases mediating specific DNA inversion or excision. Recombinase logic offers many interesting features, including single-layer architectures, memory, low metabolic footprint, and portability in many species. Here, we present two automated design strategies for both Boolean and history-dependent recombinase-based logic circuits. One approach is based on the distribution of computation within multicellular consortia, and the other is a single-cell design. Both are complementary and adapted for non-expert users via a web design interface, called CALIN and RECOMBINATOR, for multicellular and single-cell design strategies, respectively. In this book chapter, we are guiding the reader step by step through recombinase logic circuit design, from selecting the design strategy fitting to their final system of interest to obtaining the final design using one of our design web interfaces.

Design of basic logic gates using optical threshold logic

Threshold Logic Gate (TLG) is a potential alternative of Boolean Logic circuit. It is one of the fundamental components of neural network. An Optical Threshold Logic Gate (OTLG) has been designed in this paper, using a reflector telescopic system and a resonant Fabry-Perot cavity. Threshold logic gate consists of a weighted summing unit followed by a comparator. In the proposed OTLG, the weight of the input signal is varied using a polarizer-analyser combination. The threshold value, which is the reference of the comparator, is applied into the Fabry–Perot cavity with the help of a Beam splitter . AND, OR and NOT gates are implemented by setting the threshold values of the proposed OTLG.The system has been modelled analytically and studied using MATLAB and FINESSE. The simulation results for OTLG based Basic Gates are presented here.

Scan and Unlock: A Programmable DNA Molecular Automaton for Cell-Selective Activation of Ligand-Based Signaling.

Selective modulation of ligand-receptor interaction is essential in targeted therapy. In this study, we design an intelligent "scan and unlock" DNA automaton (SUDA) system to equip a native protein-ligand with cell-identity recognition and receptor-mediated signaling in a cell-type-specific manner. Using embedded DNA-based chemical reaction networks (CRNs) on the cell surface, SUDA scans and evaluates molecular profiles of cell-surface proteins via Boolean logic circuits. Therefore, it achieves cell-specific signal modulation by quickly unlocking the protein-ligand in proximity to the target cell-surface to activate its cognate receptor. As a proof of concept, we non-genetically engineered hepatic growth factor (HGF) with distinct logic SUDAs to elicit target cell-specific HGF signaling and wound healing behaviors in multiple heterogeneous cell types. Furthermore, the versatility of the SUDA strategy was shown by engineering tumor necrotic factor-α (TNFα) to induce programmed cell death of target cell subpopulations through cell-specific modulation of TNFR1 signaling.

Scan and Unlock: A Programmable DNA Molecular Automaton for Cell‐Selective Activation of Ligand‐Based Signaling

AbstractSelective modulation of ligand–receptor interaction is essential in targeted therapy. In this study, we design an intelligent “scan and unlock” DNA automaton (SUDA) system to equip a native protein‐ligand with cell‐identity recognition and receptor‐mediated signaling in a cell‐type‐specific manner. Using embedded DNA‐based chemical reaction networks (CRNs) on the cell surface, SUDA scans and evaluates molecular profiles of cell‐surface proteins via Boolean logic circuits. Therefore, it achieves cell‐specific signal modulation by quickly unlocking the protein‐ligand in proximity to the target cell‐surface to activate its cognate receptor. As a proof of concept, we non‐genetically engineered hepatic growth factor (HGF) with distinct logic SUDAs to elicit target cell‐specific HGF signaling and wound healing behaviors in multiple heterogeneous cell types. Furthermore, the versatility of the SUDA strategy was shown by engineering tumor necrotic factor‐α (TNFα) to induce programmed cell death of target cell subpopulations through cell‐specific modulation of TNFR1 signaling.

Contextual dependencies expand the re-usability of genetic inverters

The implementation of Boolean logic circuits in cells have become a very active field within synthetic biology. Although these are mostly focussed on the genetic components alone, the context in which the circuit performs is crucial for its outcome. We characterise 20 genetic NOT logic gates in up to 7 bacterial-based contexts each, to generate 135 different functions. The contexts we focus on are combinations of four plasmid backbones and three hosts, two Escherichia coli and one Pseudomonas putida strains. Each gate shows seven different dynamic behaviours, depending on the context. That is, gates can be fine-tuned by changing only contextual parameters, thus improving the compatibility between gates. Finally, we analyse portability by measuring, scoring, and comparing gate performance across contexts. Rather than being a limitation, we argue that the effect of the genetic background on synthetic constructs expands functionality, and advocate for considering context as a fundamental design parameter.

Neuromorphic-based Boolean and reversible logic circuits from organic electrochemical transistors

Abstract

Programming and simulating chemical reaction networks on a surface.

Models of well-mixed chemical reaction networks (CRNs) have provided a solid foundation for the study of programmable molecular systems, but the importance of spatial organization in such systems has increasingly been recognized. In this paper, we explore an alternative chemical computing model introduced by Qian & Winfree in 2014, the surface CRN, which uses molecules attached to a surface such that each molecule only interacts with its immediate neighbours. Expanding on the constructions in that work, we first demonstrate that surface CRNs can emulate asynchronous and synchronous deterministic cellular automata and implement continuously active Boolean logic circuits. We introduce three new techniques for enforcing synchronization within local regions, each with a different trade-off in spatial and chemical complexity. We also demonstrate that surface CRNs can manufacture complex spatial patterns from simple initial conditions and implement interesting swarm robotic behaviours using simple local rules. Throughout all example constructions of surface CRNs, we highlight the trade-off between the ability to precisely place molecules and the ability to precisely control molecular interactions. Finally, we provide a Python simulator for surface CRNs with an easy-to-use web interface, so that readers may follow along with our examples or create their own surface CRN designs.

Development of a Boolean logic simulator based on Quine McClusky algorithm

This paper presents the development of an educational simulation tool for solving Boolean logic equations using Quine McCluskey’s algorithm. Unity3D development environment was used to provide an interface for the design of the software front end. A custom built version of Javascript was used to write the back end code that drives the algorithm. Based on the output parameters decided on by the user for either sum of product (SOP) or product of sum (POS) approaches, the software provides an interactive user interface displaying: (i) the truth table with a maximum of six inputs (ii) the Karnaugh Map as well as the generated corresponding simplified logic equation and (iii) the generated logic circuit diagram. The results of the simplified Boolean expressions and logic circuits generated by the developed tool were compared with manually calculated solutions and available html and console based implementations and were found to be accurate. Keywords : Boolean Logic Simulator, Logic Circuit, Quine McClusky Algorithm, Karnaugh Map, Digital Electronics.

Toward Practical-Scale Quantum Annealing Machine for Prime Factoring

We propose a prime factorizer operated in a framework of quantum annealing (QA). The idea is inverse operation of a multiplier implemented with QA-based Boolean logic circuits. We designed the QA machine on an application-specific-annealing-computing architecture which efficiently increases available hardware budgets at the cost of restricted functionality. The invertible operation of QA logic gates consisting of superconducting flux qubits was confirmed by circuit simulation with classical noise sources. The circuits were implemented and fabricated by using superconducting integrated circuit technologies with Nb/AlOx/Nb Josephson junctions. We also propose a 2.5Dimensional packaging scheme of a qubit-chip/interpose /package-substrate structure for realizing practically large-scale QA systems.

Electronic Devices and Circuits Based on Wafer‐Scale Polycrystalline Monolayer MoS2 by Chemical Vapor Deposition

Abstract2D layered materials such as graphene and transition‐metal dichalcogenides (TMDCs) have emerged as promising candidates for next‐generation nanoelectronic applications due to their atomically thin thicknesses and unique electronic properties. Among TMDCs, molybdenum disulfide (MoS2) has been extensively investigated as a channel material for field‐effect transistor (FET) and circuit realization. However, to date most reported works have been limited to exfoliated MoS2 nanosheets primarily due to the difficulty in synthesizing large‐area and high‐quality MoS2 thin film. A demonstration of wafer‐scale monolayer MoS2 synthesis is reported by chemical vapor deposition (CVD), enabling transistors, memristive memories, and integrated circuits to be realized simultaneously. Specifically, building on top‐gated FETs with a high‐κ gate dielectric (HfO2), Boolean logic circuits including inverters and NAND gates are successfully demonstrated using direct‐coupled FET logic technology, with typical inverters exhibiting a high voltage gain of 16, a large total noise margin of 0.72 VDD at VDD = 3 V, and perfect logic‐level matching. Additionally, resistive switching is demonstrated in a MoS2‐based memristor, indicating that they have great potential for the development of resistive random‐access memory. By virtue of scalable CVD growth capability, the way toward practical and large‐scale electronic applications of MoS2 is indicated.

Polarized displacement by transcription activator-like effectors for regulatory circuits.

The interplay between DNA-binding proteins plays an important role in transcriptional regulation and could increase the precision and complexity of designed regulatory circuits. Here we show that a transcription activator-like effector (TALE) can displace another TALE protein from DNA in a highly polarized manner, displacing only the 3'- but not 5'-bound overlapping or adjacent TALE. We propose that the polarized displacement by TALEs is based on its multipartite nature of binding to DNA. The polarized TALE displacement provides strategies for the specific regulation of gene expression, for construction of all two-input Boolean genetic logic circuits based on the robust propagation of the displacement across multiple neighboring sites, for displacement of zinc finger-based transcription factors and for suppression of Cas9-gRNA-mediated genome cleavage, enriching the synthetic biology toolbox and contributing to the understanding of the underlying principles of the facilitated displacement.

Magneto-Controlled Biocatalytic Cascades with Logically Processed Input Signals - Substrate Channeling versus Free Diffusion.

Magnetic nanoparticles (MNPs) functionalized with various enzymes (amyloglucosidase, glucose oxidase and horseradish peroxidase) were used to perform biocatalytic cascades in two different states, solute suspension or aggregated, produced in the absence or presence of an external magnetic field. The biocatalytic reactions proceeded through bulk solution diffusion of intermediate substrates or substrate channeling, when the systems were dispersed or aggregated, respectively. The both pathways have shown very similar kinetics, unless the intermediate substrate was consumed by an additional biocatalytic process called "filter" for brevity. In the presence of the "filter" process, the diffusional process in the bulk solution was significantly inhibited, while the process based on the substrate channeling was still active. The systems were switched reversibly between the inhibited dispersed state and the active aggregated state by removing and applying the external magnetic field, respectively. The signal-controlled biocatalytic cascades were considered as Boolean logic circuits with the inputs consisting of biomolecules and the magnetic field on-off.

A Mapping Methodology of Boolean Logic Circuits on Memristor Crossbar

Alternatives to CMOS logic circuit implementations are under research for future scaled electronics. Memristor crossbar-based logic circuit is one of the promising candidates to at least partially replace CMOS technology, which is facing many challenges such as reduced scalability, reliability, and performance gain. Memristor crossbar offers many advantages including scalability, high integration density, nonvolatility, etc. The state-of-the-art for memristor crossbar logic circuit design can only implement simple and small circuits. This paper proposes a mapping methodology of large Boolean logic circuits on memristor crossbar. Appropriate place-and-route schemes, to efficiently map the circuits on the crossbar, as well as several optimization schemes are also proposed. To illustrate the potential of the methodology, a multibit adder and other nine more complex benchmarks are studied; the delay, area and power consumption induced by both crossbar and its CMOS control part are evaluated.

A Soft-5/6 Modulation Code With Iterative ITI Subtraction Scheme in Multireader TDMR Systems

The huge growth of the consumer electronic industry is driving the need for achieving ultrahigh areal storage densities. 2-D magnetic recording is a promising high-density storage technology where the shingled writing technique is employed for increasing the track per inch (TPI) and achieving higher areal densities. Nevertheless, high TPI causes a reader to cover higher number of tracks, which leads to the intertrack interference (ITI); hence the system performance is severely deteriorated. Therefore, we first propose the soft-5/6 modulation code together with iterative ITI subtraction scheme. Here, the soft information encoding and decoding schemes operate based on Boolean logic circuit for using in the iterative system. Furthermore, we also propose to move the upper and lower readers closer to the center reader to avoid the ITI effect from their outer tracks, which will then be performed together with ITI subtraction scheme. Moreover, this proposed reading technique is also applied together with the soft-4/5 modulation code. The simulation results show that the proposed systems are superior to the conventional system, especially at high user density.

Renewable DNA Hairpin-Based Logic Circuits

Developing intelligent molecular systems for the desired functions is a significant current research topic in the field of nanoscience. Several materials have been explored to construct interesting systems, such as molecular motors, molecular walkers, and Boolean logic circuits. Deoxyribonucleic acid (DNA) is one of the most widely used materials as the Watson-Crick base pairing makes it a versatile substrate. A significant achievement in DNA nanoscience has been the construction of large-scale logic circuits. However, most of the prior works have focused on developing the single-use DNA logic circuits. These single-use circuits can perform robust computations. However, the computing material, such as gate strands, cannot be reused to achieve the same (or a different) computation again. Such reusable behavior is essential for applications, such as feedback and sequential logic computation. In this paper, we propose a novel design strategy for building renewable DNA logic circuits. First, we propose a renewable DNA hairpin-based motif and, then, use this motif to implement a Boolean logic gate. Such renewable circuits make the overall sample preparation convenient and straightforward. We believe that our work will serve as a seed for the development of renewable intelligent molecular systems.