Resource analysis of quantum computing with noisy qubits for Shor’s factoring algorithms

Jinyoung Ha, Jonghyun Lee, Jun Heo

Research output: Contribution to journalArticlepeer-review

Abstract

We decompose two implementations of Shor’s algorithm for prime factorization into universal gate units at the logical level and predict the number of physical qubits and execution time when surface codes are used. Logical qubit encoding using a rotated surface code and logical qubits with all-to-all connectivity are assumed. We express the number of physical qubits and execution time in terms of the bit length of the number to be factorized and error rate of the physical quantum gate. We confirm the relationship between the number of qubits and the execution time by analyzing two algorithms using various bit lengths and physical gate error rates.

Original languageEnglish
Article number60
JournalQuantum Information Processing
Volume21
Issue number2
DOIs
Publication statusPublished - 2022 Feb

Keywords

  • Quantum algorithm
  • Quantum computation
  • Quantum error correction
  • Quantum gates
  • Quantum resource analysis

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Statistical and Nonlinear Physics
  • Theoretical Computer Science
  • Signal Processing
  • Modelling and Simulation
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Resource analysis of quantum computing with noisy qubits for Shor’s factoring algorithms'. Together they form a unique fingerprint.

Cite this