In the eld of quantum information science, one can design a series of quantum logic operations known as a circuit. Circuits are the basis for quantum computations in quantum computing. As circuits will most likely be designed from a logical standpoint, there could exist mathematical redundancies which will lead to a larger circuit than necessary. These redundancies are computationally expensive...

Background and Objectives: Recently, photonic crystals have been considered as the basic structures for the realization of various optical devices for high speed optical communication. Methods: In this research, two dimensional photonic crystals are used for designing all optical logic gates. A photonic crystal structure with a triangular lattice is proposed for making NAND, XNOR, and OR optica...

A numerical set-expression is a term specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. If these operations are confined to the usual Boolean operations together with the result of lifting addition to the level of sets, we speak of additive circuits. If they are confined to the usual Boolean operations together with the result of lifting ...

A previous hierarchical fault tracing method for combinational circuits which requires only CAD layout data in the CAD-linked electron beam test system is expanded as applicable to sequential circuits. The characteristics in the method remains unchanged that allows us to trace a fault hierarchically from the top level cell to the lowest primitive cell and from the primitive cell to the transist...

Introduction Memory-based activities within a brain depend on neurons being able to generate arbitrary Boolean logic. A single neuron may be modeled as follows: Inputs may be assumed to be excitatory and inhibitory positive ions, commonly termed neurotransmitters, usually coupled to receivers located along dendrites; outputs are excitatory or inhibitory neurotransmitter ions from the tips of an...

We present a systematic procedure for the synthesis and minimisation of digital circuits using propositional satisfiability. We encode the truth table into a canonical sum of at most k different minterms, which is then passed to one randomised search procedure that minimises k. The solution for a minimal k is the satisfiable representation of the resulting circuit. We show how to use an interes...

Due to shrinking feature sizes and decreasing supply voltages in current technology scaling trends, the reliability of circuit would be affected by radiation induced particle hits. Nowadays soft errors are main factor in reliability degradation of logic circuits, which have been a great concern in memories also. Here, we present a systematic and integrated methodology for circuit robustness to ...

‘‘Qubit routing” refers to the task of modifying quantum circuits so that they satisfy connectivity constraints a target computer. This involves inserting SWAP gates into circuit logical only ever occur between adjacent physical qubits. The goal is minimise depth added by gates. In this article, we propose qubit routing procedure uses modified version deep Q-learning paradigm. system able outpe...

The fundamental logical element of a quantum-dot cellular automata (QCA) circuit is majority voter gate (MV). The efficiency of a QCA circuit is depends on the efficiency of the MV. This paper presents an efficient single layer five-input majority voter gate (MV5). The structure of proposed MV5 is very simple and easy to implement in any logical circuit. This proposed MV5 reduce number of cells...

A new method is introduced for the synthesis for logical initializability of synchronous state machines. The goal is to synthesize a gate-level implementation that is initializable when simulated by a 3-valued (0,1,X) simulator. The method builds on an existing approach of Cheng and Agrawal, which uses constrained state assignment to translate functional initializability into logical initializa...