Effects of Imperfect Gate Operations in Shor's Prime Factorization Algorithm

Simple item page
dc.creatorGuo, Hao
dc.creatorLong, Gui-Lu
dc.creatorSun, Yang
dc.date2000-12-18
dc.date.accessioned2026-07-07T06:01:22Z
dc.date.available2026-07-07T06:01:22Z
dc.descriptionThe effects of imperfect gate operations in implementation of Shor's prime factorization algorithm are investigated. The gate imperfections may be classified into three categories: the systematic error, the random error, and the one with combined errors. It is found that Shor's algorithm is robust against the systematic errors but is vulnerable to the random errors. Error threshold is given to the algorithm for a given number $N$ to be factorized.
dc.description5 pages 4 figures
dc.identifierhttps://arxiv.org/abs/quant-ph/0012088
dc.identifierhttp://arxiv.org/abs/quant-ph/0012088
dc.identifierJ. Chin. Chem. Soc. 48 (2001) 449-54
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/89238
dc.subjectQuantum Physics
dc.titleEffects of Imperfect Gate Operations in Shor's Prime Factorization Algorithm
dc.typetext

Files

Collections

arXiv