Open AccessPosted Content
A new quantum ripple-carry addition circuit
TLDR
In this paper, a linear-depth ripple-carry quantum addition circuit with only a single ancillary qubit has been proposed, which has lower depth and fewer gates than previous ripple carry adders.Abstract:
We present a new linear-depth ripple-carry quantum addition circuit. Previous addition circuits required linearly many ancillary qubits; our new adder uses only a single ancillary qubit. Also, our circuit has lower depth and fewer gates than previous ripple-carry adders.read more
Citations
More filters
Journal ArticleDOI
Reversible logic based multiplication computing unit using binary tree data structure
TL;DR: A binary tree-based design methodology for an $$N \times N$$N×N reversible multiplier performs the addition of partial products in parallel using the reversible ripple adders with zero ancilla bit and zero garbage bit, thereby, minimizing the number of anCilla and garbage bits used in the design.
Book ChapterDOI
Estimating Quantum Speedups for Lattice Sieves
TL;DR: In this article, the authors provide a heuristic, nonasymptotic, analysis of the cost of several algorithms for near-neighbor search on high dimensional spheres, which are key components of lattice sieves.
Journal ArticleDOI
Quantum Fourier transform in computational basis
TL;DR: In this paper, a new quantum scheme to encode Fourier coefficients in the computational basis was proposed, with fidelity of 1 − ε and digit accuracy of 1/∈ for each Fourier coefficient.
Posted Content
Reversible Fault-Tolerant Logic
TL;DR: This paper provides efficient fault-tolerant circuits when restricted to both 2D and 1D and compute bounds on the entropy (and hence, heat) generated by the FT circuits and provides quantitative estimates on how large can the authors make their circuits before they lose any advantage over irreversible computing.
Journal ArticleDOI
A review on reversible quantum adders
TL;DR: This work analyzes the reversible adders in the state-of-the-art for quantum computing, classifying them according to their type, and comparing each other using referenced and validated metrics that allow highlighting the strengths and weaknesses of each adder.
References
More filters
Journal ArticleDOI
Quantum networks for elementary arithmetic operations.
TL;DR: This work provides an explicit construction of quantum networks effecting basic arithmetic operations: from addition to modular exponentiation, and shows that the auxiliary memory required to perform this operation in a reversible way grows linearly with the size of the number to be factorized.
Journal ArticleDOI
A logarithmic-depth quantum carry-lookahead adder
TL;DR: This work reduces the cost of addition dramatically with only a slight increase in the number of required qubits, and can be used within current modularmultiplication circuits to reduce substantially the run-time of Shor's algorithm.
Posted Content
Addition on a Quantum Computer
TL;DR: A new method for computing sums on a quantum computer is introduced that uses the quantum Fourier transform and reduces the number of qubits necessary for addition by removing the need for temporary carry bits.