Design of Improved Arithmetic Logic Unit in Quantum-Dot Cellular Automata

The quantum-dot cellular automata (QCA) can be replaced to overcome the limitation of CMOS technology. An arithmetic logic unit (ALU) is a basic structure of any computer devices. In this paper, design of improved single-bit arithmetic logic unit in quantum dot cellular automata is presented. The proposed structure for ALU has AND, OR, XOR and ADD operations. A unique 2:1 multiplexer, an ultra-efficient two-input XOR and a low complexity full adder are used in the proposed structure. Also, an extended design of this structure is provided for two-bit ALU in this paper. The proposed structure of ALU is simulated by QCADesigner and simulation result is evaluated. Evaluation results show that the proposed design has best performance in terms of area, complexity and delay compared to the previous designs.     

Optimization Approaches for Designing Quantum Reversible Arithmetic Logic Unit

Reversible logic is emerging as a promising alternative for applications in low-power design and quantum computation in recent years due to its ability to reduce power dissipation, which is an important research area in low power VLSI and ULSI designs. Many important contributions have been made in the literatures towards the reversible implementations of arithmetic and logical structures; however, there have not been many efforts directed towards efficient approaches for designing reversible Arithmetic Logic Unit (ALU). In this study, three efficient approaches are presented and their implementations in the design of reversible ALUs are demonstrated. Three new designs of reversible one-digit arithmetic logic unit for quantum arithmetic has been presented in this article. This paper provides explicit construction of reversible ALU effecting basic arithmetic operations with respect to the minimization of cost metrics. The architectures of the designs have been proposed in which each block is realized using elementary quantum logic gates. Then, reversible implementations of the proposed designs are analyzed and evaluated. The results demonstrate that the proposed designs are cost-effective compared with the existing counterparts. All the scales are in the NANO-metric area.     

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.     

Multiparty Quantum Secret Sharing Using Quantum Fourier Transform

A （n, n）-threshold scheme of multiparty quantum secret sharing of classical or quantum message is proposed based on the discrete quantum Fourier transform. In our proposed scheme, the secret message, which is encoded by using the forward quantum Fourier transform and decoded by using the reverse, is split and shared in such a way that it can be reconstructed among them only if all the participants work in concert. Fhrthermore, we also discuss how this protocol must be carefully designed for correcting errors and checking eavesdropping or a dishonest participant. Security analysis shows that our scheme is secure. Also, this scheme has an advantage that it is completely compatible with quantum computation and easier to realize in the distributed quantum secure computation.     

Quantum Uncertainties and Holism Seem to Render Irrelevant Qudit-Semantics

We consider a semantics based on the peculiar holistic features of the quantum formalism. Any formula of the language gives rise to a quantum circuit that transforms the density operator associated to the formula into the density operator associated to the atomic subformulas in a reversible way. The procedure goes from the whole to the parts against the compositionality-principle and gives rise to a semantic characterization for a new form of quantum logic that has been called “Łukasiewicz quantum computational logic”. It is interesting to compare the logic based on qubit-semantics with that on qudit-semantics. Having in mind the relationships between classical logic and Łukasiewicz-many valued logics, one could expect that the former is stronger than the fragment of the latter. However, this is not the case. From an intuitive point of view, this can be explained by recalling that the former is a very weak form of logic. Many important logical arguments, which are valid either in Birkhoff and von Neumann’s quantum logic or in classical logic, are generally violated.     

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.     

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.     

Implementation of a Quantum Conditional Phase Gate for the Quantum Fourier Transform in Circuit QED

It is well known that multiple superconducting charge qubits coupled to a transmission line resonator can be controlled to achieve quantum logic gates between two arbitrary qubits. We propose a scheme to realize a quantum conditional phase gate with a geometric property by circuit electrodynamics, and it is applied naturally to reaJize the quantum Fourier transform with high fidelity. It is also demonstrated that the application is feasible and considerable under the present experimental technology.     

Second Quantization Representation of Quantum Logic Gate Transformations

By using the theory of multimode linear transformation in Fock space, we offer an effective method to study the quantum logic gates based on fermion states. The forms of some basic quantum logic operations are also obtained.     

Second Quantization Representation of Quantum Logic Gate Transformations

By using the theory of multimode linear transformation in Fock space, we offer an effective method to study the quantum logic gates based on fermion states. The forms of some basic quantum logic operations are also obtained.     

Quantum Phase Properties of Photon Added and Subtracted Displaced Fock States

Quantum phase properties of photon added and subtracted displaced Fock states (and their limiting cases) are investigated from a number of perspectives, and it is shown that the quantum phase properties are dependent on the quantum state engineering operations performed. Specifically, the analytic expressions for quantum phase distributions and angular Q distribution as well as measures of quantum phase fluctuation and phase dispersion are obtained. The uniform phase distribution of the initial Fock states is observed to be transformed by the unitary operation (i.e., displacement operator) into non‐Gaussian shape, except for the initial vacuum state. It is observed that the phase distribution is symmetric with respect to the phase of the displacement parameter and becomes progressively narrower as its amplitude increases. The non‐unitary (photon addition/subtraction) operations make it even narrower in contrast to the Fock parameter, which leads to broadness. The photon subtraction is observed to be a more powerful quantum state engineering tool in comparison to the photon addition. Further, one of the quantum phase fluctuation parameters is found to reveal the existence of antibunching in both the engineered quantum states under consideration. Finally, the relevance of the engineered quantum states in the quantum phase estimation is also discussed.     

Qubit Semantics and Quantum Trees

In the qubit semantics the meaning of any sentence α is represented by a quregister: a unit vector of the n–fold tensor product ⊗ⁿ ℂ², where n depends on the number of occurrences of atomic sentences in α (see Cattaneo et al.). The logic characterized by this semantics, called quantum computational logic (QCL), is unsharp, because the noncontradiction principle is violated. We show that QCL does not admit any logical truth. In this framework, any sentence α gives rise to a quantum tree, consisting of a sequence of unitary operators. The quantum tree of α can be regarded as a quantum circuit that transforms the quregister associated to the occurrences of atomic subformulas of α into the quregister associated to α.     

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.     

Quantum Computational Logic

A quantum computational logic is constructed by employing density operators on spaces of qubits and quantum gates represented by unitary operators. It is shown that this quantum computational logic is isomorphic to the basic sequential effect algebra [0, 1].     

All-optical Serial Data Transfer between Registers using optical non-linear materials

The inherent parallelism of optical signal is an advantageous feature for high-speed computations and other digital logic operations. Different techniques have been proposed for performing arithmetic, algebraic and logic operations using light as the information-carrier. Here we propose a new method for Serial Data Transfer between Registers using optical non-linear material. This system is all-optical in nature. Optical NAND gate and NOT gate are the basic building blocks of this system.     

Quantum computation with two-dimensional graphene quantum dots

We study an array of graphene nano sheets that form a two-dimensional S=1/2 Kagome spin lattice used for quantum computation. The edge states of the graphene nano sheets are used to form quantum dots to confine electrons and perform the computation. We propose two schemes of bang-bang control to combat decoherence and realize gate operations on this array of quantum dots. It is shown that both schemes contain a great amount of information for quantum computation. The corresponding gate operations are also proposed.     

量子计算与量子模拟

量子计算和量子模拟在过去的几年里发展迅速,今后涉及多量子比特的量子计算和量子模拟将是一个发展的重点.本文回顾了该领域的主要进展,包括量子多体模拟、量子计算、量子计算模拟器、量子计算云平台、量子软件等内容,其中量子多体模拟又涵盖量子多体动力学、时间晶体及多体局域化、量子统计和量子化学等的模拟.这些研究方向的回顾是基于对现阶段量子计算和量子模拟研究特点的考虑,即量子比特数处于中等规模而量子操控精度还不具有大规模逻辑门实现的能力,研究处于基础科研和实用化的过渡阶段,因此综述的内容主要还是希望管窥今后的发展.     

利用W态进行单个粒子的受控远程传输的量子逻辑网络图

以一般形式的三粒子的W态作为量子通道来实现未知单粒子的概率的受控远程传输。该计划的特征是两者之间远程传输的实现依赖于第三者（Charlie）的同意与否，她可以作为一个控制者参与量子远程传输的整个过程。另外，通过基本的逻辑操作，我们组建了有效的量子逻辑网络图来实现该新计划。     

A Spatial Domain Quantum Watermarking Scheme

This paper presents a spatial domain quantum watermarking scheme. For a quantum watermarking scheme, a feasible quantum circuit is a key to achieve it. This paper gives a feasible quantum circuit for the presented scheme. In order to give the quantum circuit, a new quantum multi-control rotation gate, which can be achieved with quantum basic gates, is designed. With this quantum circuit, our scheme can arbitrarily control the embedding position of watermark images on carrier images with the aid of auxiliary qubits. Besides reversely acting the given quantum circuit, the paper gives another watermark extracting algorithm based on quantum measurements. Moreover, this paper also gives a new quantum image scrambling method and its quantum circuit. Differ from other quantum watermarking schemes, all given quantum circuits can be implemented with basic quantum gates. Moreover, the scheme is a spatial domain watermarking scheme, and is not based on any transform algorithm on quantum images. Meanwhile, it can make sure the watermark be secure even though the watermark has been found. With the given quantum circuit, this paper implements simulation experiments for the presented scheme. The experimental result shows that the scheme does well in the visual quality and the embedding capacity.     

Grammar Theory Based on Quantum Logic

Motivated by Ying' work on automata theory based on quantum logic (Ying, M. S. (2000). International Journal of Therotical Physics, 39(4): 985–996; 39(11): 2545–2557) and inspired by the close relationship between the automata theory and the theory of formal grammars, we have established a basic framework of grammar theory on quantum logic and shown that the set of l-valued quantum regular languages generated by l-valued quantum regular grammars coincides with the set of l-valued quantum languages recognized by l-valued quantum automata.