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
Journal ArticleDOI
Quantum circuit designs of carry lookahead adder optimized for T-count T-depth and qubits
TL;DR: Two QCLA designs each optimized with emphasis on T-count and T-depth or qubit cost, respectively are presented, each of which achieves T- depth savings ranging from 33.33% to 95.56% compared to existing works.
Posted Content
Fast Black-Box Quantum State Preparation.
TL;DR: This work reduces the required qubit overhead from g to $\log_2(g)$ in the bit precision, and shows how various sets of coefficients can be loaded significantly faster than in $O(\sqrt N)$ rounds of amplitude amplification by bootstrapping the procedure with an optimised initial state.
Posted Content
Credit Risk Analysis using Quantum Computers.
TL;DR: In this article, the authors present and analyze a quantum algorithm to estimate credit risk more efficiently than Monte Carlo simulations can do on classical computers, i.e., the difference between the Value at Risk and the expected value of a given loss distribution.
Adaptive job and resource management for the growing quantum cloud
TL;DR: In this article, the authors proposed an optimized adaptive job scheduling to the quantum cloud taking note of primary characteristics such as queuing times and fidelity trends across machines, as well as other characteristics, such as quality of service guarantees and machine calibration constraints.
Journal ArticleDOI
Design of Efficient Reversible Logic Based Binary and BCD Adder Circuits
TL;DR: In this paper, the authors presented a class of new designs for reversible binary and BCD adder circuits, which are primarily optimized for the number of ancilla inputs and garbage outputs and are designed for possible best values for the quantum cost and delay.
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.