Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Science China Information Sciences

Improved quantum ripple-carry addition circuit

Feng Wang, Mingxing Luo, Hui-Ran Li, Zhiguo Qu, Xiaojun Wang

Published Feb 19, 2016• 24 citations
Publisher
DOI
10.1007/s11432-015-5411-x

Related papers

Parallel Optimization of a Reversible (Quantum) Ripple-Carry Adder

Michael Kirkedal Thomsen, Holger Bock Axelsen

Lecture notes in computer science•Jan 1, 2008•5 citations

A new quantum ripple-carry addition circuit

Steven A. Cuccaro, Thomas G. Draper, Samuel Kutin +1 more

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.

arXiv:quant-ph/0410184•Oct 22, 2004•344 citations

An Efficient Quantum Addition Circuit

良徳 川田, Yoshinori Kawata, 智 田湯 +2 more

•Mar 1, 2008•0 citations

Quantum adder circuits

Hafiz Md. Hasan Babu

Institute of Physics eBooks•May 1, 2020•0 citations

A linear-size quantum circuit for addition with no ancillary qubits

Yasuhiro Takahashi, Noboru Kunihiro

We construct a quantum circuit for addition of two $n$-bit binary numbers that uses no ancillary qubits. The circuit is based on the ripple-carry approach. The depth and size of the circuit are $O(n)$. This is an affirmative answer to the question of Kutin \cite{Kutin} as to whether a linear-depth quantum circuit for addition can be constructed without ancillary qubits using the ripple-carry approach. We also construct quantum circuits for addition modulo $2^n$, subtraction, and comparison that use no ancillary qubits by modifying the circuit for addition.

Quantum Information and Computation•Sep 1, 2005•64 citations

Below-threshold execution of fault-tolerant ripple-carry addition on a trapped-ion quantum computer

Jacob S. Nelson, Andrew J. Landahl, Andrew D. Baczewski

We deploy a universal fault-tolerant quantum computing (FTQC) architecture based on error-detecting $[\![8,3,2]\!]$ and $[\![4,2,2]\!]$ codes on Quantinuum's Helios-1 trapped-ion quantum computer. We compile and execute ripple-carry adder (RCA) circuits for classical inputs up to five bits on this architecture. Uncomputing a workspace qubit provides an additional ``algorithmic check'' to detect errors. While available at both the physical and logical levels, this check synergizes with our architecture by increasing the effective fault distance of many circuit locations from two to four. Combining this algorithmic check with the error-detecting codes, we observed only a single logical failure in one-bit addition after burst-error filtering, yielding an estimated logical failure rate of $(6.0 \pm 5.9) \times 10^{-5}$. This is well below the $(3.5 \pm 1.3) \times 10^{-3}$ failure probability observed for one-bit addition on the same hardware in unencoded form. Two- and three-bit adders also showed performance improvements, while the longer four- and five-bit adders executed just above threshold.

quant-pharXiv:2610.14202•Oct 13, 2026•0 citations
We construct a quantum circuit for addition of two nnn-bit binary numbers that uses no ancillary qubits. The circuit is based on the ripple-carry approach. The depth and size of the circuit are O(n)O(n)O(n). This is an affirmative answer to the question of Kutin \cite{Kutin} as to whether a linear-depth quantum circuit for addition can be constructed without ancillary qubits using the ripple-carry approach. We also construct quantum circuits for addition modulo 2n2^n2n, subtraction, and comparison that use no ancillary qubits by modifying the circuit for addition.
We deploy a universal fault-tolerant quantum computing (FTQC) architecture based on error-detecting [ ⁣[8,3,2] ⁣][\![8,3,2]\!][[8,3,2]] and [ ⁣[4,2,2] ⁣][\![4,2,2]\!][[4,2,2]] codes on Quantinuum's Helios-1 trapped-ion quantum computer. We compile and execute ripple-carry adder (RCA) circuits for classical inputs up to five bits on this architecture. Uncomputing a workspace qubit provides an additional ``algorithmic check'' to detect errors. While available at both the physical and logical levels, this check synergizes with our architecture by increasing the effective fault distance of many circuit locations from two to four. Combining this algorithmic check with the error-detecting codes, we observed only a single logical failure in one-bit addition after burst-error filtering, yielding an estimated logical failure rate of (6.0±5.9)×10−5(6.0 \pm 5.9) \times 10^{-5}(6.0±5.9)×10−5. This is well below the (3.5±1.3)×10−3(3.5 \pm 1.3) \times 10^{-3}(3.5±1.3)×10−3 failure probability observed for one-bit addition on the same hardware in unencoded form. Two- and three-bit adders also showed performance improvements, while the longer four- and five-bit adders executed just above threshold.