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
A Quantum Performance Simulator based on fidelity and fault-path counting
TL;DR: A scheme to simulate the performance of fault tolerant quantum computation by automating the tracking of common fault paths for error propagation through a circuit and quantifying the fidelity of each qubit throughout the computation is presented.
Posted Content
QGo: Scalable Quantum Circuit Optimization Using Automated Synthesis
TL;DR: In this article, a hierarchical block-by-block optimization framework, QGo, is proposed for quantum circuit optimization, which allows an exponential cost optimization to scale to large circuits.
Proceedings ArticleDOI
A novel method to reduce ancilla and garbage bits of reversible quantum multipliers
Zhi Wang,Shuming Chen,Wei Liu +2 more
TL;DR: This paper presents a novel method to reduce garbage outputs and ancilla inputs of reversible quantum multipliers by converts some garbage outputs of the previous calculation to zeros, which are then served as ancillas inputs of the later calculation.
Posted Content
Quantum block lookahead adders and the wait for magic states
TL;DR: The Toffoli count of low depth quantum adders is improved, and how their spacetime cost reacts to having a limited number of magic state factories is analyzed, and a block lookahead adder is presented that parallelizes across blocks of bits of size $b$.
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.