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
T-Count Optimization and Reed–Muller Codes
Matthew Amy,Michele Mosca +1 more
TL;DR: An algorithm for the optimization of inline-formula-count in quantum circuits based on Reed–Muller decoders is derived, along with a new upper bound on the number of gates required to implement an implementation of single-qubit phase gates.
Journal ArticleDOI
Optimized reversible binary-coded decimal adders
TL;DR: The optimized 1-decimal BCD full-adder, a 13x13 reversible logic circuit, is faster, and has lower circuit cost and less garbage bits, showing that special-purpose design pays off in reversible logic design by drastically reducing the number of garbage bits.
Proceedings ArticleDOI
Fast equivalence-checking for quantum circuits
Shigeru Yamashita,Igor L. Markov +1 more
TL;DR: This work develops several verification techniques for reversible circuits which arise as runtime bottlenecks of key quantum algorithms, and extends existing quantum verification tools using SAT-solvers.
Journal ArticleDOI
Fast quantum modular exponentiation architecture for Shor's factoring algorithm
TL;DR: A novel and efficient, in terms of circuit depth, design for Shor's quantum factorization algorithm, which effectively utilizes a diverse set of adders based on the Quantum Fourier transform Draper's adders to build more complex arithmetic blocks: quantum multiplier/accumulators by constants and quantum dividers by constants.
Book ChapterDOI
Mapping of Subtractor and Adder-Subtractor Circuits on Reversible Quantum Gates
TL;DR: Three different design methodologies are proposed for the design of reversible ripple borrow subtractor that vary in terms of optimization of metrics such as ancilla inputs, garbage outputs, quantum cost and delay and a new synthesis framework for automatic generation of reversible arithmetic circuits is presented.
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.