Resiliency analysis and improvement of variational quantum factoring in superconducting qubit

Ling Qiu, Mahabubul Alam, Abdullah Ash-Saki, Swaroop Ghosh

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish (US)
Title of host publicationProceedings of the ACM/IEEE International Symposium on Low Power Electronics and Design, ISLPED 2020
PublisherAssociation for Computing Machinery
ISBN (Electronic)9781450370530
DOIs
StatePublished - Aug 10 2020
Event2020 ACM/IEEE International Symposium on Low Power Electronics and Design, ISLPED 2020 - Virtual, Online, United States
Duration: Aug 10 2020Aug 12 2020

Publication series

NameACM International Conference Proceeding Series

Conference

Conference2020 ACM/IEEE International Symposium on Low Power Electronics and Design, ISLPED 2020
CountryUnited States
CityVirtual, Online
Period8/10/208/12/20

All Science Journal Classification (ASJC) codes

  • Human-Computer Interaction
  • Computer Networks and Communications
  • Computer Vision and Pattern Recognition
  • Software

Fingerprint Dive into the research topics of 'Resiliency analysis and improvement of variational quantum factoring in superconducting qubit'. Together they form a unique fingerprint.

Cite this