DOAJ Open Access 2023

Shor's Algorithm Using Efficient Approximate Quantum Fourier Transform

Kento Oonishi Noboru Kunihiro

Abstrak

Shor's algorithm solves the integer factoring and discrete logarithm problems in polynomial time. Therefore, the evaluation of Shor's algorithm is essential for evaluating the security of currently used public-key cryptosystems because the integer factoring and discrete logarithm problems are crucial for the security of these cryptosystems. In this article, a new approximate quantum Fourier transform is proposed, and it is applied to Rines and Chuang's implementation. The proposed implementation requires one-third the number of <inline-formula><tex-math notation="LaTeX">$T$</tex-math></inline-formula> gates of the original. Moreover, it requires one-fourth of the <inline-formula><tex-math notation="LaTeX">$T$</tex-math></inline-formula>-depth of the original. Finally, a <inline-formula><tex-math notation="LaTeX">$T$</tex-math></inline-formula>-scheduling method for running the circuit with the smallest KQ (where K is the number of logical qubits and Q is the circuit depth) is presented.

Topik & Kata Kunci

Atomic physics. Constitution and properties of matter Materials of engineering and construction. Mechanics of materials

Penulis (2)

Kento Oonishi

Noboru Kunihiro

Format Sitasi

APA MLA BibTeX

Oonishi, K., Kunihiro, N. (2023). Shor's Algorithm Using Efficient Approximate Quantum Fourier Transform. https://doi.org/10.1109/TQE.2023.3319044

Akses Cepat

PDF tidak tersedia langsung

Cek di sumber asli →

Lihat di Sumber doi.org/10.1109/TQE.2023.3319044

Informasi Jurnal