arXiv Open Access 2020

Resiliency Analysis and Improvement of Variational Quantum Factoring in Superconducting Qubit

Ling Qiu Mahabubul Alam Abdullah Ash-Saki Swaroop Ghosh

Lihat Sumber

Abstrak

Variational algorithm using Quantum Approximate Optimization Algorithm (QAOA) can solve the prime factorization problem in near-term noisy quantum computers. Conventional Variational Quantum Factoring (VQF) requires a large number of 2-qubit gates (especially for factoring a large number) resulting in deep circuits. The output quality of the deep quantum circuit is degraded due to errors limiting the computational power of quantum computing. In this paper, we explore various transformations to optimize the QAOA circuit for integer factorization. We propose two criteria to select the optimal quantum circuit that can improve the noise resiliency of VQF.

Topik & Kata Kunci

cs.ET

Penulis (4)

Ling Qiu

Mahabubul Alam

Abdullah Ash-Saki

Swaroop Ghosh

Format Sitasi

APA MLA BibTeX

Qiu, L., Alam, M., Ash-Saki, A., Ghosh, S. (2020). Resiliency Analysis and Improvement of Variational Quantum Factoring in Superconducting Qubit. https://arxiv.org/abs/2004.12447

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2020
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓