Efficient Construction of a Control Modular Adder on a Carry-Lookahead Adder Using Relative-phase Toffoli Gates

Abstract

Control modular addition is a core arithmetic function, and we must consider the computational cost for actual quantum computers to realize efficient implementation. To achieve a low computational cost in a control modular adder, we focus on minimizing KQ, defined by the product of the number of qubits and the depth of the circuit. In this paper, we construct an efficient control modular adder with small KQ by using relative-phase Toffoli gates in two major types of quantum computers: Fault-Tolerant Quantum Computers (FTQ) on the Logical layer and Noisy Intermediate-Scale Quantum Computers (NISQ). We give a more efficient construction compared to Van Meter and Itoh's, based on a carry-lookahead adder. In FTQ, $T$ gates incur heavy cost due to distillation, which fabricates ancilla for running $T$ gates with high accuracy but consumes a lot of specially prepared ancilla qubits and a lot of time. Thus, we must reduce the number of $T$ gates. We propose a new control modular adder that uses only 20% of the number of $T$ gates of the original. Moreover, when we take distillation into consideration, we find that we minimize ${\text{KQ}}_T$ (the product of the number of qubits and $T$-depth) by running $\Theta \left(n/\sqrt{\log n}\right)$ $T$ gates simultaneously. In NISQ, CNOT gates are the major error source. We propose a new control modular adder that uses only 35% of the number of CNOT gates of the original. Moreover, we show that the ${\text{KQ}}_{\text{CX}}$ (the product of the number of qubits and CNOT-depth) of our circuit is 38% of the original. Thus, we realize an efficient control modular adder, improving prospects for the efficient execution of arithmetic in quantum computers.

References in corpus (10)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Shor's quantum factoring algorithm on a photonic chip
• Experimental demonstration of Shor's algorithm with quantum entanglement
• A new quantum ripple-carry addition circuit
• Demonstration of Shor's quantum factoring algorithm using photonic qubits
• Quantum Circuit Simplification and Level Compaction
• Concrete Categorical Model of a Quantum Circuit Description Language with Measurement
• Fast Quantum Modular Exponentiation
• Fault-tolerant resource estimate for quantum chemical simulations: Case study on Li-ion battery electrolyte molecules
• T-count and Qubit Optimized Quantum Circuit Designs of Carry Lookahead Adder

Cited by in corpus (4)

• Quantum channel decomposition with pre- and post-selection
• Quantum block lookahead adders and the wait for magic states
• Measurement-Driven Adaptive Low-Overhead Implementation of Multi-Controlled Toffoli Gates
• Halving the width of Toffoli based constant modular addition to n+3 qubits