English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Quantum circuits of arithmetic operations such as addition are needed toimplement quantum algorithms in hardware. Quantum circuits based on Clifford+Tgates are used as they can be made tolerant to noise. The tradeoff of gainingfault tolerance from using Clifford+T gates and error correcting codes is thehigh implementation overhead of the T gate. As a result, the T-countperformance measure has become important in quantum circuit design. Due tonoise, the risk for errors in a quantum circuit computation increases as thenumber of gate layers (or depth) in the circuit increases. As a result, lowdepth circuits such as quantum carry lookahead adders (QCLA)s have caught theattention of researchers. This work presents two QCLA designs each optimizedwith emphasis on T-count or qubit cost respectively. In-place and out-of-placeversions of each design are shown. The proposed QCLAs are compared against theexisting works in terms of T-count. The proposed QCLAs for out-of-placeaddition achieve average T gate savings of $54.34 \%$ and $37.21 \%$,respectively. The proposed QCLAs for in-place addition achieve average T gatesavings of $72.11 \%$ and $35.87 \%$

T-count and Qubit Optimized Quantum Circuit Designs of Carry Lookahead Adder