pith. sign in

arxiv: 0901.3903 · v2 · submitted 2009-01-25 · 🪐 quant-ph · gr-qc

Resources for Measurement-Based Quantum Carry-Lookahead Adder

classification 🪐 quant-ph gr-qc
keywords quantumadderqclacarry-lookaheaddepthfastermagnitudemeasurement-based
0
0 comments X
read the original abstract

We present the design of a quantum carry-lookahead adder using measurement-based quantum computation. QCLA utilizes MBQC`s ability to transfer quantum states in unit time to accelerate addition. The quantum carry-lookahead adder (QCLA) is faster than a quantum ripple-carry adder; QCLA has logarithmic depth while ripple adders have linear depth. QCLA is an order of magnitude faster than a ripple-carry adder when adding registers longer than 100 qubits but requires a cluster state that is an order of magnitude larger. Hand optimization results in a $\approx$ 26% reduction in spatial resources for the circuit.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.