Remarks on the nature of quantum computation

Simple item page
dc.creatorAlicki, Robert
dc.date2003-06-16
dc.date.accessioned2026-07-07T06:07:08Z
dc.date.available2026-07-07T06:07:08Z
dc.descriptionTwo models of computer, a quantum and a classical "chemical machine" designed to compute the relevant part of Shor's factoring algorithm are discussed. The comparison shows that the basic quantum features believed to be responsible for the exponential speed-up of quantum computations possess their classical counterparts for the hybrid digital-analog computer. It is argued that the measurement errors which cannot be fully corrected make the computation not efficient for both models.
dc.description8 pages
dc.identifierhttps://arxiv.org/abs/quant-ph/0306103
dc.identifierhttp://arxiv.org/abs/quant-ph/0306103
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/91182
dc.subjectQuantum Physics
dc.titleRemarks on the nature of quantum computation
dc.typetext

Files

Collections

arXiv