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
Dissertation
Towards a formally verified functional quantum programming language
TL;DR: This thesis looks at the development of a framework for a functional quantum programming language, designed following a structural approach as given by a categorical model of quantum computation, first developed in Haskell and then implemented in Agda.
Posted Content
Effects of Interaction Distance on Quantum Addition Circuits
Byung-Soo Choi,Rodney Van Meter +1 more
TL;DR: The theoretical limits of the effect of the quantum interaction distance on the speed of exact quantum addition circuits were investigated in this paper, where the authors exploited graph embedding for quantum circuit analysis.
Journal ArticleDOI
New quantum circuit implementations of SM4 and SM3
Proceedings ArticleDOI
All optical design of hybrid adder circuit using terahertz optical asymmetric demultiplexer
TL;DR: From the experimental verification, it has been seen that the proposed model not only has enhanced the cost of the design but also has reduced overall delay of thedesign.
Proceedings ArticleDOI
Exploiting long-distance interactions and tolerating atom loss in neutral atom quantum architectures
Jonathan M. Baker,Andrew Litteken,Casey Duckering,Henry Hoffmann,Hannes Bernien,Frederic T. Chong +5 more
TL;DR: In this paper, the authors evaluate the advantages and disadvantages of neutral atom (NA) architectures and propose hardware and compiler methods to increase system resilience to atom loss dramatically reducing total computation time by circumventing complete reloads or full recompilation every cycle.
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.