A new quantum ripple-carry addition circuit
Steven A. Cuccaro, Thomas G. Draper, Samuel A. Kutin, and David Petrie, Moulton
TL;DR
This paper introduces a novel quantum ripple-carry adder that significantly reduces the number of ancillary qubits, depth, and gate count compared to previous designs, enhancing efficiency in quantum addition.
Contribution
The paper presents a linear-depth quantum ripple-carry adder that uses only one ancillary qubit, improving over prior designs with more qubits and higher depth.
Findings
Uses only one ancillary qubit
Achieves lower circuit depth
Reduces gate count compared to previous 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum and electron transport phenomena · Quantum Information and Cryptography