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
Error Mitigation in Quantum Computers through Instruction Scheduling
Kaitlin N. Smith,Gokul Subramanian Ravi,Prakash Murali,Jonathan M. Baker,Nathan Earnest,Ali Javadi-Abhari,Frederic T. Chong +6 more
TL;DR: TimeStitch as discussed by the authors leverages the reversible nature of quantum computation to improve the success of quantum circuits on real quantum machines, which can mitigate dephasing, or phase accumulation, that appears as a result of qubit inactivity.
Posted Content
Halving the width of Toffoli based constant modular addition to n+3 qubits.
TL;DR: In this paper, the authors present an arithmetic circuit performing constant modular addition with O(n+3) qubits, which is an improvement by a factor of two compared to the width of the Toffoli-based constant modular adder.
Posted Content
Quantum Arithmetic for Directly Embedded Arrays
Alberto Manzano,Daniele Musso,Álvaro Leitao,Andrés Gómez,Carlos Vázquez,Gustavo Ordóñez,María Rodríguez-Nogueiras +6 more
TL;DR: In this article, a general-purpose framework to design quantum algorithms relying upon an efficient handling of arrays is described, where the cornerstone of the framework is the direct embedding of information into quantum amplitudes, thus avoiding the need to deal with square roots or encode the information in registers.
Multipartite High-dimensional Quantum State Engineering via Discrete Time Quantum Walk
Junhong Nie,Meng Li,Xiaoming Sun +2 more
TL;DR: In this article , the authors propose a solution to solve the problem of the problem: this article ] of "uniformity" and "uncertainty" of the solution.
Journal ArticleDOI
Tackling the Qubit Mapping Problem with Permutation-Aware Synthesis
TL;DR: In this paper , a hierarchical qubit mapping and routing algorithm is proposed, where a circuit is decomposed into blocks that span an identical number of qubits, and each block is optimized and synthesized in isolation.
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.