Quantum Fourier Transform-Based Arithmetic Logic Unit on a Quantum Processor

This study proposes and construct a primitive quantum arithmetic logic unit (qALU) based on the quantum Fourier transform (QFT). The qALU is capable of performing arithmetic ADD (addition) and logic NAND gate operations. It designs a scalable quantum circuit and presents the circuits for driving ADD and NAND operations on two-input and four-input quantum channels, respectively. By comparing the required number of quantum gates for serial and parallel architectures in executing arithmetic addition, it evaluates the performance. It also execute the proposed quantum Fourier transform-based qALU design on real quantum processor hardware provided by IBM. The results demonstrate that the proposed circuit can perform arithmetic and logic operations with a high success rate. Furthermore, it discusses in detail the potential implementations of the qALU circuit in the field of computer science, highlighting the possibility of constructing a soft-core processor on a quantum processing unit.     

Modified signed-digit addition by using binary logic operations and its optoelectronic implementation

In this work, a three-step modified signed-digit (MSD) addition by using binary logic operations is proposed. Each input digit is encoded with two binary bits. Through binary logic operations, all of the weight and transfer digits and the final sum digits represented with the same encoding scheme will be generated. The operations can be performed at each digit position in parallel. In our suggested optical arithmetic and logic unit (ALU), a single electron trapping (ET) device is employed to serve as the binary logic device. This technique based on ET logic possesses the advantage of high signal-to-noise ratio (SNR). The optoelectronic system can be constructed in a simple, compact and general-purpose form.     

All-optical reconfigurable logic operations with the help of terahertz optical asymmetric demultiplexer

An all-optical reconfigurable logic operation essentially constitutes a key technology for avoiding complex and speed limited optoelectronics conversions and performing various processing tasks. All-optical reconfigurable logic operations with the help of terahertz optical asymmetric demultiplexer (TOAD) is proposed and described. The paper describes the all-optical reconfigurable logic operations using a set of all-optical multiplexer and optical switches. We have tried to exploit the advantages of TOAD-based switch to design an integrated all-optical circuit which can perform the different logic operations AND, XOR, NOR and NOT. Numerical simulation confirming described methods is given in this paper.     

Shannon Logic Based Novel QCA Full Adder Design with Energy Dissipation Analysis

Quantum-dot Cellular Automata (QCA) is an emerging nanotechnology to replace VLSI-CMOS digital circuits. Due to its attractive features such as low power consumption, ultra-high speed switching, high device density, several digital arithmetic circuits have been proposed. Adder circuit is the most prominent component used for arithmetic operations. All other arithmetic operation can be successively performed using adder circuits. This paper presents Shannon logic based QCA efficient full adder circuit for arithmetic operations. Shannon logic expression with control variables helps the designer to reduce hardware cost; using with minimum foot prints of the chip size. The mathematical models of the proposed adder are verified with the theoretical values. In addition, the energy dissipation losses of the proposed adder are carried out. The energy dissipation calculation is evaluated under the three separate tunneling energy levels, at temperature T = 2K.The proposed adder dissipates less power. QCAPro tool is used for estimating the energy dissipation. In this paper we proposed novel Shannon based adder for arithmetic calculations. This adder has been verified in different aspects like using Boolean algebra besides it power analysis has been calculated. In addition 1-bit full adder has been enhanced to propose 2-bit and 4-bit adder circuits.     

The Necessary and Sufficient Conditions for a Universal Conservation of a State of a Unitary Quantum Circuit

By A. Peres and A. Stern‘s opinions a computational process evolves along a cyclic logic orbit defined by a computation. A. Stern thought that if we could design such a circuit, its operations can be extended to including nonconservative behavior associated with the external perturbations or internal quantum errors. A. Peres did not discuss how to make φM-1 ＝φo. A. Stern proposed only a necessary condition for a conservation of a state of a quantum circuit.In this paper we present a necessary and sufficient condition for a universal conservation of a state of a quantum circuit.We also find all operators which can allow the conservation.     

Simplification of Space-Variant Parallel Logic Operations Using the Temporal Method

A time-domain encoding method (temporal method) for space-variant parallel logic operations, which can execute different operations in parallel, is proposed. The temporal method is based on temporal encoding of two input patterns, temporal gating of the coded pattern, and decoding by temporal addition of the gated patterns. The first feature of the proposed method is that parallel logic operations can be performed without complex pattern transformations. The second feature is that the logical output can be directly fed to succeeding systems without specific decoding. Therefore, the logic operation system can be constructed using conventional optics and existing spatial light modulators. In order to confirm these features, an optoelectronic experimental system is constructed and space-variant parallel logic operations are performed.     

Coupling induced logical stochastic resonance

In this work we will demonstrate the following result: when we have two coupled bistable sub-systems, each driven separately by an external logic input signal, the coupled system yields outputs that can be mapped to specific logic gate operations in a robust manner, in an optimal window of noise. So, though the individual systems receive only one logic input each, due to the interplay of coupling, nonlinearity and noise, they cooperatively respond to give a logic output that is a function of both inputs. Thus the emergent collective response of the system, due to the inherent coupling, in the presence of a noise floor, maps consistently to that of logic outputs of the two inputs, a phenomenon we term coupling induced Logical Stochastic Resonance. Lastly, we demonstrate our idea in proof of principle circuit experiments.     

Ternary Galois field arithmetic operations with optical nonlinear material (OPNLM) switch

Ternary Galois field (GF3) arithmetic can take an important and significant role in future information processing with multi-valued logic (MVL). An all optical circuit for two arithmetical operations (addition and multiplication) in ternary Galois field with OPNLM switch is proposed and discussed. The different states of polarization of light are taken as different logic states. An outline of Ternary Galois field sum of product (TGFSOP) is also discussed. Mathematical simulation has confirmed the result.     

Photonic crystal-based all-optical arithmetic circuits without SOA-based switches

Various proposed optical computing devices involve nonlinear optical operation and use semiconductor optical amplifier (SOA)-based switches as fundamental elements for logic operations. Due to the nonlinear operation, these devices suffer from high power that causes problems in very large-scale optical integration. In this paper, a method is proposed to implement arithmetic operations using a photonic crystal (PhC) cell and eliminate the SOA-based switches altogether. The proposed method is employed on designing an all-optical full adder/subtractor circuit that requires only beam combiners and photonic crystal NOT gates.     

Optoelectronic logic operations by triangular-barrier optoelectronic switch

Optoelectronic logic operations were successfully demonstrated by triangular-barrier optoelectronic switch (TOPS). TOPS has not only differential gain, bistable and latch characteristics simply by changing the bias voltages, but also high sensitivity and high gain. We first confirmed AND and OR operations using a single TOPS, and also realized NOT, NAND, NOR and XOR operations using dual TOPS without any optical or electrical reset signals. These logic operations by dual TOPS can be attained in the same electrical circuit configuration.     

The Necessary and Sufficient Conditions for a Universal Conservation of a State of a Unitary Quantum Circuit

By A. Peres and A. Stern's opinions a computational process evolves along a cyclic logic orbit defined by the sequence ψ₀→ψ₁→ … →ψ_M-1→ψ₀. It begins from a start position and returns to the same position after a computation. A. Stern thought that if we could design such a circuit, its operations can be extended to including nonconservative behavior associated with the external perturbations or internal quantum errors. A. Peres did not discuss how to make φ_M-1=φ₀. A. Stern proposed only a necessary condition for a conservation of a state of a quantum circuit. In this paper we present a necessary and sufficient condition for a universal conservation of a state of a quantum circuit. We also find all operators which can allow the conservation.     

Physical Limitations on Fundamental Efficiency of SET-Based Brownian Circuits

Brownian circuits are based on a novel computing approach that exploits quantum fluctuations to increase the efficiency of information processing in nanoelectronic paradigms. This emerging architecture is based on Brownian cellular automata, where signals propagate randomly, driven by local transition rules, and can be made to be computationally universal. The design aims to efficiently and reliably perform primitive logic operations in the presence of noise and fluctuations; therefore, a Single Electron Transistor (SET) device is proposed to be the most appropriate technology-base to realize these circuits, as it supports the representation of signals that are token-based and subject to fluctuations due to the underlying tunneling mechanism of electric charge. In this paper, we study the physical limitations on the energy efficiency of the Single-Electron Transistor (SET)-based Brownian circuit elements proposed by Peper et al. using SIMON 2.0 simulations. We also present a novel two-bit sort circuit designed using Brownian circuit primitives, and illustrate how circuit parameters and temperature affect the fundamental energy-efficiency limitations of SET-based realizations. The fundamental lower bounds are obtained using a physical-information-theoretic approach under idealized conditions and are compared against SIMON 2.0 simulations. Our results illustrate the advantages of Brownian circuits and the physical limitations imposed on their SET-realizations.     

可编程光学并行模糊逻辑门

提出了可级联的光学并行模糊逻辑门系统，十六种模糊逻辑运算可通过编程偏振半波片的状态而得到实现，语言中给出了实验结果。     

An all-optical matrix multiplication scheme with non-linear material based switching system

Optics is a potential candidate in information, data, and image processing. In all-optical data and information processing, optics has been used as information carrying signal because of its inherent advantages of parallelism. Several optical methods are proposed in support of the above processing. In many algebraic,arithmetic, and image processing schemes fundamental logic and memory operations are conducted exploring all-optical devices. In this communication we report an all-optical matrix multiplication operation with non-linear material based switching circuit.     

Quantum Circuit Realization of Morphological Gradient for Quantum Grayscale Image

In this paper, based on the principle of classical morphology operations, the flat grayscale dilation and erosion operations are proposed for NEQR quantum image model. Furthermore, through combining these two morphology operations, we further realize the morphological gradient operation. As the basis of designing of grayscale morphology operations, a series of quantum circuit designs arepresented, which includes special add one operation UA₁(n) and special subtract one operation US₁(n) both for an n-length qubits sequence, quantum unitary operation U_C, parallel subtractor (PS) module, quantum comparator output the large QCOL and quantum comparator output the small QCOS modules. When designsthe concrete quantum circuit, a sequence of UA₁(n) and US₁(n) modules are used to obtain the quantum image sets based on the shape of specific structuring element. Then, the searching for maximaor minima in a certain space is involved, which can be solved by cascading a series of QCOL and QCOS modules in certain order. Finally, the PS module can be used to calculate the difference of the maxima and minima for producing the morphological gradient. The circuit’s complexity analysis illustrate that our scheme is very lower to the classical morphology operations.

     

Fast image-processing technique in phase-shifting holographic interferometry

A fast image-processing method in phase shifting holographic interferometry is proposed, in which the complicated phase calculation is completed with a logic circuit and look-up table. An electronic circuit was designed for the purpose. With these techniques, the processing time can be greatly reduced.     

用单块电子俘获器件实现可编程二值光学逻辑处理

用单块电子俘获器件,以一种新方法一时域编码方法,实现了所有16种布尔逻辑运算.根据电子俘获材料的存贮和可擦除特性,按特定顺序进行一系列单元操作,可测到每种布尔逻辑函数,同一般光学逻辑处理器相比,这种处理器具有新的自由度一时域自由度,文末给出了实验结果.     

Entanglement is not necessary for perfect discrimination between unitary operations

We show that a unitary operation (quantum circuit) secretly chosen from a finite set of unitary operations can be determined with certainty by sequentially applying only a finite amount of runs of the unknown circuit. No entanglement or joint quantum operations are required in our scheme. We further show that our scheme is optimal in the sense that the number of the runs is minimal when discriminating only two unitary operations.     

Deduction, Ordering, and Operations in Quantum Logic

We show that in quantum logic of closed subspaces of Hilbert space one cannot substitute quantum operations for classical (standard Hilbert space) ones and treat them as primitive operations. We consider two possible ways of such a substitution and arrive at operation algebras that are not lattices what proves the claim. We devise algorithms and programs which write down any two-variable expression in an orthomodular lattice by means of classical and quantum operations in an identical form. Our results show that lattice structure and classical operations uniquely determine quantum logic underlying Hilbert space. As a consequence of our result, recent proposals for a deduction theorem with quantum operations in an orthomodular lattice as well as a, substitution of quantum operations for the usual standard Hilbert space ones in quantum logic prove to be misleading. Quantum computer quantum logic is also discussed.