Uncertainty In Quantum Computation

Simple item page
dc.creatorKak, Subhash
dc.date2002-06-02
dc.date.accessioned2026-07-07T06:04:17Z
dc.date.available2026-07-07T06:04:17Z
dc.descriptionWe examine the effect of previous history on starting a computation on a quantum computer. Specifically, we assume that the quantum register has some unknown state on it, and it is required that this state be cleared and replaced by a specific superposition state without any phase uncertainty, as needed by quantum algorithms. We show that, in general, this task is computationally impossible.
dc.description6 pages
dc.identifierhttps://arxiv.org/abs/quant-ph/0206006
dc.identifierhttp://arxiv.org/abs/quant-ph/0206006
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/90244
dc.subjectQuantum Physics
dc.titleUncertainty In Quantum Computation
dc.typetext

Files

Collections

arXiv