scispace - formally typeset
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

Self-Inverse Functions and Palindromic Circuits.

TL;DR: The subclass of reversible functions that are self-inverse and relate them to reversible circuits that are equal to their reverse circuit, which are called palindromic circuits are investigated.
Posted Content

Development of SyReC based expandable reversible logic circuits

TL;DR: The aim is to emphasize use of the proposed approach is designing customized circuits by employing a hierarchal approach to develop a complete reversible circuit entirely from its SyReC code as a software tool.
Proceedings ArticleDOI

Memory-Equipped Quantum Architectures: The Power of Random Access

TL;DR: A complete compilation framework with heuristics to optimize for the load-store execution model of MEQC, and an exploration of different architectural choices, such as transmon-transmon connectivity and cavity size, and their effect on the performance of the proposed architecture.
Journal ArticleDOI

Hardware-Conscious Optimization of the Quantum Toffoli Gate

TL;DR: This paper reviews and expands both analytical and numerical methodology for optimizing quantum circuits at this abstraction level and uses these methods to produce optimized implementations of the Toffoli gate, a fundamental building block of several quantum algorithms with near-term applications in quantum compilation and machine learning.
Journal ArticleDOI

A Modular Framework for Generic Quantum Algorithms

TL;DR: A general-purpose framework to design quantum algorithms relies on a basic data structure called quantum matrix and a modular structure based on three quasi-independent modules, which include a loading module, a tool-kit of basic quantum arithmetic operations and a read-out module.
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.