A Measurement-Based Form of the Out-of-Place Quantum Carry Lookhead Adder

We present the design of aquantum carry-lookahead adder using measurement-based quantum computation.The quantum carry-lookahead adder (QCLA) is faster than aquantum ripple-carry adder; QCLA has logarithmic depth while ripple adders have linear depth. Our design is evaluated in terms of number of time steps, number of measurements, the total number of qubits used and the number of successful clustering operations required. Keyword : Quantum Carry-Lookahead Adder, Cluster-State Computatio

A Measurement-Based Form of the Out-of-Place Quantum Carry Lookhead Adder

We present the design of aquantum carry-lookahead adder using measurement-based quantum computation.The quantum carry-lookahead adder (QCLA) is Faster than aquantum ripple-carry adder; QCLA has logarithmic depth while ripple adders have linear depth. Our design is evaluated in terms of number of time steps, number of measurements, the total number of qubits used and the number of successful clustering operations required

A quantum multiply-accumulator

This paper proposes a quantum multiply-accumulator circuit (QMAC), which can perform the calculation on conventional integers faster than its classical counterpart. Whereas classically applying a multiply–adder (MAC) n times to k bit integers would require O(n log k) parallel steps, the hybrid QMAC needs only O(n+k) steps for the exact result and O(n+log k) steps for an approximate result. The proposed circuit could potentially be embedded in a conventional computer architecture as a quantum device or accelerator, enabling a wide range of applications to execute faster