T-count and Qubit Optimized Quantum Circuit Designs of Carry Lookahead Adder
arXiv:2004.01826
Abstract
Quantum circuits of arithmetic operations such as addition are needed to implement quantum algorithms in hardware. Quantum circuits based on Clifford+T gates are used as they can be made tolerant to noise. The tradeoff of gaining fault tolerance from using Clifford+T gates and error correcting codes is the high implementation overhead of the T gate. As a result, the T-count performance measure has become important in quantum circuit design. Due to noise, the risk for errors in a quantum circuit computation increases as the number of gate layers (or depth) in the circuit increases. As a result, low depth circuits such as quantum carry lookahead adders (QCLA)s have caught the attention of researchers. This work presents two QCLA designs each optimized with emphasis on T-count or qubit cost respectively. In-place and out-of-place versions of each design are shown. The proposed QCLAs are compared against the existing works in terms of T-count. The proposed QCLAs for out-of-place addition achieve average T gate savings of and , respectively. The proposed QCLAs for in-place addition achieve average T gate savings of and
arXiv comment11 pages, 8 figures, 4 tables
References in corpus (13)
- Surface codes: Towards practical large-scale quantum computation
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
- Methodology for quantum logic gate constructions
- A new quantum ripple-carry addition circuit
- Halving the cost of quantum addition
- Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning
- Quantum circuits of T-depth one
- Novel constructions for the fault-tolerant Toffoli gate
- Fault-Tolerant High Level Quantum Circuits: Form, Compilation and Description
- Requirements for fault-tolerant factoring on an atom-optics quantum computer
- Quantum computation of discrete logarithms in semigroups
- Quantum Plain and Carry Look-Ahead Adders