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
Factoring using 2n+2 qubits with Toffoli based modular multiplication
TL;DR: In this article, the authors describe an implementation of Shor's quantum algorithm to factor n-bit integers using only 2n+2 qubits, which achieves the same space and time costs as Takahashi et al., while using a purely classical modular multiplication circuit.
Journal ArticleDOI
Constant-optimized quantum circuits for modular multiplication and exponentiation
Igor L. Markov,Mehdi Saeedi +1 more
TL;DR: In the context of modular exponentiation, this work offers several constant-factor improvements, as well as an improvement by a constant additive term that is significant for few-qubit circuits arising in ongoing laboratory experiments with Shor's algorithm.
Journal ArticleDOI
Extracting Success from IBM’s 20-Qubit Machines Using Error-Aware Compilation
TL;DR: In this paper, the authors focus on the fact that the error rates of individual qubits are not equal, with a goal of maximizing the success probability of real-world subroutines such as an adder circuit.
Journal ArticleDOI
Requirements for fault-tolerant factoring on an atom-optics quantum computer
TL;DR: This work estimates the resources required to execute Shor's factoring algorithm on an atom-optics quantum computer architecture and suggests that once the physical error rate is low enough to allow quantum error correction, optimization to reduce resources and increase performance will come mostly from integrating algorithms and circuits within the error correction environment.
Journal ArticleDOI
Oracles for Gauss's law on digital quantum computers
TL;DR: In this paper, an oracle is constructed that uses local Gauss law constraints to projectively distinguish physical and unphysical wave functions in Abelian lattice gauge theories, which can be used to detect errors that break Gauss's law.
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.