Pith. sign in

REVIEW 7 cited by

A logarithmic-depth quantum carry-lookahead adder

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv quant-ph/0406142 v1 pith:IL456JOJ submitted 2004-06-20 quant-ph

classification quant-ph
keywords adderadditioncarry-lookaheadcircuitmoduloqclaquantumqubits
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We present an efficient addition circuit, borrowing techniques from the classical carry-lookahead arithmetic circuit. Our quantum carry-lookahead (QCLA) adder accepts two n-bit numbers and adds them in O(log n) depth using O(n) ancillary qubits. We present both in-place and out-of-place versions, as well as versions that add modulo 2^n and modulo 2^n - 1. Previously, the linear-depth ripple-carry addition circuit has been the method of choice. Our work reduces the cost of addition dramatically with only a slight increase in the number of required qubits. The QCLA adder can be used within current modular multiplication circuits to reduce substantially the run-time of Shor's algorithm.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 7 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Cultivating logical catalysts for fault-tolerant dyadic phase rotations

    quant-ph 2026-06 unverdicted novelty 7.0 of 10

    A new cultivation protocol prepares reusable logical catalysts as eigenstates of high-period Clifford circuits to implement exact Z^{2^{-b}} phase gates with constant online depth in surface codes.

  2. Explicit Block Encodings of Discrete Laplacians with Mixed Boundary Conditions

    quant-ph 2026-03 unverdicted novelty 7.0 of 10

    A modular block-encoding framework for finite-difference Laplacians supporting arbitrary combinations of Dirichlet, periodic, and Neumann boundary conditions across dimensions.

  3. A Dual Metastable-State Encoding Architecture for Quantum Processing with $^{171}\mathrm{Yb}$ Atom Arrays

    quant-ph 2026-06 conditional novelty 6.0 of 10

    Proposes dual ³P₀/³P₂ metastable encoding in ¹⁷¹Yb atoms to separate storage and fast-operation qubits with coherent shelving for single-species fault-tolerant neutral-atom quantum computing.

  4. Simulating high-accuracy nuclear motion Hamiltonians using discrete variable representation and Walsh-Hadamard QROM on fault-tolerant quantum computers

    quant-ph 2025-10 unverdicted novelty 6.0 of 10

    A quantum algorithm for rovibrational Hamiltonian simulation on fault-tolerant quantum computers using hybrid DVR and Walsh-Hadamard QROM, claiming exponential resource savings over prior quantum and classical methods.

  5. Analog photonic simulator for large-scale transport

    quant-ph 2026-05 unverdicted novelty 5.0 of 10

    Continuous-variable photonic platform with 20,000-mode cluster state simulates advection transport equation, achieving relative errors of 0.8% and 0.92% on first- and second-order moments via homodyne readout.

  6. New Circuit for Quantum Adder by Constant

    quant-ph 2025-01 conditional novelty 5.0 of 10

    An in-place quantum adder-by-constant circuit is constructed with n-3 ancilla qubits and T-count 4n-5, improving on prior adder-based constructions.

  7. Efficient Gaussian State Preparation in Quantum Circuits

    quant-ph 2025-07 unverdicted novelty 4.0 of 10

    A quantum circuit prepares approximate Gaussian states via single-qubit rotations followed by QFT, achieving high fidelity with optional angle pruning for O(n) gate cost.

Pith tools