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
Proceedings ArticleDOI
Quantum Circuit Optimization and Transpilation via Parameterized Circuit Instantiation
Ed Younis,Costin Iancu +1 more
TL;DR: This work describes algorithms to apply instantiation during two common compilation steps: circuit optimization and gate-set transpilation and shows how instantiation can be incorporated into a compiler work to improve circuit quality and enhance portability, all while maintaining a reasonably low compile time overhead.
Posted Content
Approximate encoded permutations and piecewise quantum adders
TL;DR: It is shown that the coset representation of modular integers (Zalka 2006) is an approximate encoded modular addition, and that it can be used in combination with oblivious carry runways, which use piecewise addition circuits to perform approximate encoded additions.
Journal ArticleDOI
Quantum search for scaled hash function preimages
Sergi Ramos-Calderer,Emanuele Bellini,José I. Latorre,José I. Latorre,Marc Manzano,Victor Mateu +5 more
TL;DR: The detailed construction of the quantum oracle shows that the presence of AND gates, OR gates, shifts of bits and the reuse of the initial state along the computation require extra quantum resources as compared with other hash functions based on modular additions, XOR gates and rotations.
Patent
Verified compilation of reversible circuits
TL;DR: In this article, the authors present an example reversible circuit compilers as well as tools and techniques for verifying the correctness of the compilers, which is an important issue in quantum computing.
Journal ArticleDOI
Quantum Simulation Logic, Oracles, and the Quantum Advantage
Niklas Johansson,Jan-Åke Larsson +1 more
TL;DR: In this article, the authors investigated the role of oracle for the advantage of quantum algorithms and showed that for some specific algorithms, such as the Deutsch-Jozsa and Simon's algorithms, there simply is no advantage in terms of query complexity.
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.