Depth Optimization of FLT-Based Quantum Inversion Circuit
- 문서 유형
- 연구출판물 · 학술지 논문
- 등재
- SCIEScopus
- 저널 순위
- JCR Q2Scopus Q1
- 저널
- IEEE ACCESS11 · pp.54910 · 2023
- 피인용
- Web of Science 6Scopus 6
- FWCI (Scopus)
- 0.43
- JCR IF
- JCR 2022 3.9
- ISSN
- 2169-3536
저자
- 라라사티 하라스타 타티마제1저자Pusan Natl Univ, Sch Comp Sci & Engn, Pusan 609735, South Korea
- 데디 셉토노 차투르Pusan Natl Univ, IoT Res Ctr, Pusan 609735, South Korea
- 와다니 리니 위스누Pusan Natl Univ, Sch Comp Sci & Engn, Pusan 609735, South Korea
- 박종욱Pusan Natl Univ, Sch Comp Sci & Engn, Pusan 609735, South Korea
- 김호원교신저자Pusan Natl Univ, Sch Comp Sci & Engn, Pusan 609735, South Korea
초록
Works on quantum computing and cryptanalysis have increased significantly in the past few years. Various constructions of quantum arithmetic circuits as one of the primary elements in the field have also been proposed. However, there have only been a few studies on finite field inversion despite its essential use in realizing quantum algorithms, such as in Shor’s algorithm for Elliptic Curve Discrete Logarithm Problem (ECDLP). In this study, we propose to reduce the depth of the existing quantum Fermat’s Little Theorem (FLT)-based inversion circuit for the binary finite field. In particular, we propose to follow a complete waterfall approach to translate the Itoh-Tsujii’s variant of FLT to the corresponding quantum circuit and remove the inverse squaring operations employed in the previous work by Banegas et al., lowering the number of CNOT gates (i.e., CNOT count) as well as slightly reducing the <italic>T</italic> depth, which contributes to a reduced overall depth and gate count. Furthermore, we concretely verify our method and compare it with the previous work in Qiskit, a quantum computer simulation environment, by constructing both our method and the previous work from scratch and performing the resource analysis. Additionally, we propose employing the relative-phase Toffoli gate by Gidney as opposed to the standard Toffoli implementation, which yields a significantly lower <italic>T</italic> depth while further reducing the overall depth. Our approach can serve as an alternative for a time-efficient implementation.
키워드
binary fielddepthinversionoptimizationquantum circuitquantum cryptanalysissimulationDISCRETE LOGARITHMSMULTIPLICATIONIMPLEMENTATIONCOMPUTATIONALGORITHMSHARDWARENETWORKSFIELDS
식별자
- Scopus EID
- 2-s2.0-85161042850
- WoS UID
- 001005682600001



로그인
연구물 목록으로