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
Improving the Efficiency of Quantum Circuits for Information Set Decoding
TL;DR: In this paper , the authors present a complete implementation of a quantum circuit based on the Information Set Decoding (ISD) strategy, the best known one against code-based cryptosystems, providing quantitative measures for the security margin achieved with respect to the quantum-accelerated key recovery on AES, targeting both the current state-of-theart approach and the NIST estimates.
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.