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
Posted Content
Improved quantum circuits for elliptic curve discrete logarithms
TL;DR: A full implementation of point addition in the Q# quantum programming language that allows unit tests and automatic quantum resource estimation for all components and presents various trade-offs between different cost metrics including the number of qubits, circuit depth and $T$-gate count.
Book ChapterDOI
White dots do matter: rewriting reversible logic circuits
TL;DR: This paper describes the few basic rules that are needed to perform rewriting directly on reversible logic circuits made from general Toffoli circuits and shows how to use these rules to derive more complex formulas.
Journal ArticleDOI
Quantum image edge extraction based on Laplacian operator and zero-cross method
TL;DR: The circuit complexity analysis demonstrates that the presented quantum image edge algorithm can reach a significant and exponential speedup compared to classical counterparts, which would resolve the real-time problem of image edge extraction in practice image processing.
Proceedings ArticleDOI
CutQC: using small Quantum computers for large Quantum circuit evaluations
TL;DR: CutQC as mentioned in this paper is a scalable hybrid computing approach that combines classical computers and quantum computers to enable evaluation of quantum circuits that cannot be run on either classical or quantum computers alone.
Journal ArticleDOI
T-count optimization and Reed-Muller codes
Matthew Amy,Michele Mosca +1 more
TL;DR: In this paper, the authors studied the relationship between Reed-Muller codes and single-qubit phase gates from the perspective of decoding and showed that the problems are polynomially equivalent in the length of the code.
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.