Three-input TOFFOLI gates are heavily used when performing classical logic operations on quantum data, e.g., in reversible arithmetic circuits. However, in physical implementations TOFFOLI gates are decomposed into six CNOT gates and several one-qubit gates. Though this decomposition has been known for at least 10 years, we provide here the first demonstration of its CNOT-optimality. We first p...

We show that a set of gates that consists of all one-bit quantum gates (U(2)) and the two-bit exclusive-or gate (that maps Boolean values (x, y) to (x, x⊕y)) is universal in the sense that all unitary operations on arbitrarily many bits n (U(2n)) can be expressed as compositions of these gates. We investigate the number of the above gates required to implement other gates, such as generalized D...

The intrinsic idea of superdense coding is to find as many gates as possible such that they can be perfectly discriminated. In this paper, we consider a new scheme of discrimination of quantum gates, called ancillaassisted discrimination, in which a set of quantum gates on a d−dimensional system are perfectly discriminated with assistance from an r−dimensional ancilla system. The main contribut...

Clustered voltage scaling is a power reducing method which does not affect the overall system performance. The main idea is to run gates on a non-critical path by a low-voltage supply. Since low-voltage gates are not able to drive high-voltage gates, level-converters are needed. In order to reduce the number of level-converters, which may cancel out the power savings, they are arranged in a clu...

the new circuit consists of a subexponential number of circuits, each of which is of subex-ponential size, the new circuit is also of subexponential size. The depth of the new circuit family is the same as fC n g but the top layer of MOD p gates has been \absorbed" into the symmetric gate computing B and been replaced by a layer of AND gates of small fan-in. Now, by an appeal to Lemma 9, the ci...

We present a new algorithm for classical simulation of quantum circuits over the Clifford+T gate set. The runtime of the algorithm is polynomial in the number of qubits and the number of Clifford gates in the circuit but exponential in the number of T gates. The exponential scaling is sufficiently mild that the algorithm can be used in practice to simulate medium-sized quantum circuits dominate...

This paper is a continuation of the study of NeuralLike Networks (NLNs) for computation of MultipleValued Logic (MVL) functions. NLN is defined as a feedforward network with no learning. In contrast to classical neural network with Threshold Gates (TGs), the proposed NLN is built of so-called Neuron-Like Gates (NLGs). It was shown in our previous study that NLG is modelled by a Linear Arithmeti...

This article summarizes two experiments utilizing building blocks to find analog electronic circuits on a CMOS Field Programmable Transistor Array (FPTA). The FPTA features 256 programmable transistors whose channel geometry and routing can be configured to form a large variety of transistor level analog circuits. The transistor cells are either of type PMOS or NMOS and are arranged in a checke...

A Quantum Cellular Automaton (QCA) is a nanotechnology which is an attractive alternative for transistor based technologies in the near future. A new seven input majority gate in quantum dot cellular automata is proposed in this paper. The basic elements in QCA are majority and inverter gates, therefore using a majority gate with more inputs in QCA circuit will cause reduction in cell count, la...