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
An Efficient Methodology for Mapping Quantum Circuits to the IBM QX Architectures
TL;DR: A methodology which addresses the problem of properly mapping quantum functionality to a realization which satisfies all constraints given by the architecture and, at the same time, keeps the overhead in terms of additionally required quantum gates minimal is proposed.
Patent
Hamiltonian simulation in the interaction picture
Guang Hao Low,Nathan Wiebe +1 more
TL;DR: In this article, quantum algorithms are presented for simulating Hamiltonian time-evolution e−i(A+B)t in the interaction picture of quantum mechanics on a quantum computer.
Journal ArticleDOI
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.
Posted Content
Estimating Jones polynomials is a complete problem for one clean qubit
Peter W. Shor,Stephen P. Jordan +1 more
TL;DR: It is shown that evaluating a certain approximation to the Jones polynomial at a fifth root of unity for the trace closure of a braid is a complete problem for the one clean qubit complexity class.
Journal ArticleDOI
Credit Risk Analysis Using Quantum Computers
TL;DR: A quantum algorithm is presented and analyzed to estimate credit risk more efficiently than Monte Carlo simulations can do on classical computers and how this translates into an expected runtime under reasonable assumptions on future fault-tolerant quantum hardware is analyzed.
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.