A Measurement-Based Form of the Out-of-Place Quantum Carry-Lookahead Adder
Agung Trisetyarso, Rodney Van Meter, Kohei M. Itoh
TL;DR
This paper introduces a measurement-based quantum carry-lookahead adder that significantly improves speed over ripple-carry adders by achieving logarithmic depth, optimizing quantum addition operations.
Contribution
It presents a novel measurement-based quantum carry-lookahead adder design with faster logarithmic depth compared to traditional ripple-carry adders.
Findings
QCLA has logarithmic depth, faster than ripple adders
Design reduces total number of qubits and time steps
Evaluation shows improved quantum addition performance
Abstract
We present the design of a quantum carry-lookahead adder using measurement-based quantum computation. The quantum carry-lookahead adder (QCLA) is faster than a quantum ripple-carry adder; QCLA has logarithmic depth while ripple adders have linear depth. Our design is evaluated in terms of number of time steps and the total number of qubits used.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum and electron transport phenomena