REVIEW 10 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
Signed reviews
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.
Forward citations
Cited by 10 Pith papers
-
Cultivating logical catalysts for fault-tolerant dyadic phase rotations
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.
-
Explicit Block Encodings of Discrete Laplacians with Mixed Boundary Conditions
A modular block-encoding framework for finite-difference Laplacians supporting arbitrary combinations of Dirichlet, periodic, and Neumann boundary conditions across dimensions.
-
A Dual Metastable-State Encoding Architecture for Quantum Processing with $^{171}\mathrm{Yb}$ Atom Arrays
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.
-
Simulating high-accuracy nuclear motion Hamiltonians using discrete variable representation and Walsh-Hadamard QROM on fault-tolerant quantum computers
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.
-
Analog photonic simulator for large-scale transport
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.
-
Autocallable Options Pricing with Integration-Based Exponential Amplitude Loading
Autocallable option pricing on quantum computers can use partial exponential amplitude loading to cut the payoff component's T-depth by roughly 50x versus the authors' earlier integration method, while simulator exper...
-
Residue Number System (RNS) based Distributed Quantum Multiplication
A residue-number-system design for distributed quantum multiplication reports up to 46% lower Toffoli depth and 34-86% fewer T gates, but the gains rely on per-device maxima and on sharing inputs across quantum machines.
-
Quantum oracles for the finite element method
Quantum oracles for finite element matrices can be built from fixed-point adders, multipliers, polynomial evaluation, and Newton-Raphson square roots with polylogarithmic cost in matrix size.
-
New Circuit for Quantum Adder by Constant
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.
-
Efficient Gaussian State Preparation in Quantum Circuits
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.
Discussion (0). Continue with ORCID to comment.