Journal Article10.1088/1751-8113/43/38/382002
Reversible arithmetic logic unit for quantum arithmetic
TL;DR: This communication shows that the realization of an efficient reversible ALU for a programmable computing device is possible and that the V-shape design is a very versatile approach to the design of quantum networks.
read more
Abstract: This communication presents the complete design of a reversible arithmetic logic unit (ALU) that can be part of a programmable reversible computing device such as a quantum computer. The presented ALU is garbage free and uses reversible updates to combine the standard reversible arithmetic and logical operations in one unit. Combined with a suitable control unit, the ALU permits the construction of an r-Turing complete computing device. The garbage-free ALU developed in this communication requires only 6n elementary reversible gates for five basic arithmetic–logical operations on two n-bit operands and does not use ancillae. This remarkable low resource consumption was achieved by generalizing the V-shape design first introduced for quantum ripple-carry adders and nesting multiple V-shapes in a novel integrated design. This communication shows that the realization of an efficient reversible ALU for a programmable computing device is possible and that the V-shape design is a very versatile approach to the design of quantum networks.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Efficient quantum arithmetic operation circuits for quantum image processing
TL;DR: This study proposes the fault-tolerant implementations for TR and Peres gates with optimized T-depth and T-Count and implements cyclic and complete translations of quantum images using quantum arithmetic operations, and the scalar matrix multiplication.
101
Visualization and processing of tensors and higher order descriptors for multi-valued data
Carl-Fredrik Westin,Anna Vilanova,Bernhard Burgeth +2 more
- 01 Jan 2014
TL;DR: In this article, the authors present a broad and vivid view of current work in this emerging field, from applications of the analysis of tensor fields to research on their mathematical and analytical properties.
62
Mach-zehnder interferometer based design of all optical reversible binary adder
Saurabh Kotiyal,Himanshu Thapliyal,Nagarajan Ranganathan +2 more
- 12 Mar 2012
TL;DR: The proposed all optical implementation of an n bit reversible ripple carry adder will be a key component of an all optical reversible ALU that can be applied in a wide variety of optical signal processing applications.
61
Realizing Reversible Computing in QCA Framework Resulting in Efficient Design of Testable ALU
TL;DR: This work targets the design of reversible ALU (arithmetic logic unit) in QCA framework and proposes a new “Reversible QCA” (RQCA), which is established to be more effective than the existing ALU.
58
Ancilla-input and garbage-output optimized design of a reversible quantum integer multiplier
TL;DR: In this paper, the authors proposed a reversible logic based, garbage-free and ancilla qubit optimized design of a quantum integer multiplier, which utilizes a novel add and rotate methodology that is specially suitable for a reversible computing paradigm.
55
References
•Book
Quantum Computation and Quantum Information
Michael A. Nielsen,Isaac L. Chuang +1 more
- 01 Jan 2000
TL;DR: In this article, the quantum Fourier transform and its application in quantum information theory is discussed, and distance measures for quantum information are defined. And quantum error-correction and entropy and information are discussed.
Quantum computation and quantum information
TL;DR: This book inchides well-known classics such as "On the Criteria to be used in Decomposing Systems into Modules," "On a 'Buzzword': Hierarchical Structure," and "Software Aging."
20.4K
Quantum Computation and Quantum Information
Michael A. Nielsen,Isaac L. Chuang +1 more
- 01 Dec 2010
TL;DR: This chapter discusses quantum information theory, public-key cryptography and the RSA cryptosystem, and the proof of Lieb's theorem.
19.6K
Quantum Computation and Quantum Information
TL;DR: This paper introduces the basic concepts of quantum computation and quantum simulation and presents quantum algorithms that are known to be much faster than the available classic algorithms and provides a statistical framework for the analysis of quantum algorithms and quantum Simulation.
Quantum theory, the Church-Turing principle and the universal quantum computer
TL;DR: In this paper, it is argued that underlying the Church-Turing hypothesis there is an implicit physical assertion: every finitely realizable physical system can be perfectly simulated by a universal model computing machine operating by finite means.