Open AccessPosted Content
A new quantum ripple-carry addition circuit
TL;DR: 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.
read more
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
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
•Proceedings Article
Quantum differential and linear cryptanalysis
Gaëtan Leurent,Marc Kaplan,Anthony Leverrier,María Naya-Plasencia +3 more
- 06 Mar 2017
113
ScaffCC: Scalable compilation and analysis of quantum programs
Ali Javadi-Abhari,Shruti Patil,Daniel Kudrow,Jeff Heckey,Alexey Lvov,Frederic T. Chong,Margaret Martonosi +6 more
- 01 Jun 2015
TL;DR: ScaffCC as mentioned in this paper is a scalable compilation and analysis framework based on LLVM which can be used for compiling quantum computing applications at the logical level, and integrates a reversible-logic synthesis tool in the compiler to facilitate coding of quantum circuits.
104
Solving Gauss's law on digital quantum computers with loop-string-hadron digitization
Indrakshi Raychowdhury,Jesse R. Stryker +1 more
- 09 Jul 2020
TL;DR: In this paper, the qubit digitization of a loop-string-hadron formulation of SU(2) lattice gauge theories coupled to staggered fermions is described.
104
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.
103
Quantum risk analysis
Stefan Woerner,Daniel J. Egger +1 more
TL;DR: A quantum algorithm that analyzes risk more efficiently than Monte Carlo simulations traditionally used on classical computers is presented and a near quadratic speed-up compared to Monte Carlo methods is provided.
References
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.
911
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.