دسته بندی:

محاسبات کوانتومی - Quantum-Computing

---

سال انتشار:

2022

---

عنوان انگلیسی مقاله:

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

---

ترجمه فارسی عنوان مقاله:

ساخت کارآمد یک جمع کننده ماژولار کنترلی بر روی جمع کننده Carry-Lookahead با استفاده از گیت های توفولی فاز نسبی

---

منبع:

ieee - ieee Transactions on Quantum Engineering;2022;3; ;10:1109/TQE:2021:3136195

---

نویسنده:

KENTO OONISHI1,2 , TOMOKI TANAKA3,4, SHUMPEI UNO4,5, TAKAHIKO SATOH4,6 , RODNEY VAN METER4,7 (Senior Member, IEEE), AND NOBORU KUNIHIRO

---

چکیده انگلیسی:

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 (where K is the number of logical qubits required by the algorithm, and Q is the elementary gate step), defined by the product of the number of qubits and the depth of the circuit. In this article, 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 with 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 especially 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 KQT (the product of the number of qubits and T-depth) by running (n/√log n) 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 cnotgates of the original. Moreover, we show that the KQCX (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.
INDEX TERMS: Carry-lookahead adder | control modular adder | fault-tolerant quantum computers (FTQ) | noisy intermediate-scale quantum computers (NISQ) | Shor’s algorithm.

---

---

قیمت: رایگان

---

توضیحات اضافی:

---

---

---