Quantum algorithms which accept hot qubit inputs
| dc.creator | Zhou, Xinlan | |
| dc.creator | Leung, Debbie W. | |
| dc.creator | Chuang, Isaac L. | |
| dc.date | 1999-06-29 | |
| dc.date.accessioned | 2026-07-07T06:16:43Z | |
| dc.date.available | 2026-07-07T06:16:43Z | |
| dc.description | Realistic physical implementations of quantum computers can entail tradeoffs which depart from the ideal model of quantum computation. Although these tradeoffs have allowed successful demonstration of certain quantum algorithms, a crucial question is whether they fundamentally limit the computational capacity of such machines. We study the limitations of a quantum computation model in which only ensemble averages of measurement observables are accessible. Furthermore, we stipulate that input qubits may only be prepared in highly random, ``hot'' mixed states. In general, these limitations are believed to dramatically detract from the computational power of the system. However, we construct a class of algorithms for this limited model, which, surprisingly, are polynomially equivalent to the ideal case. This class includes the well known Deutsch-Jozsa algorithm. | |
| dc.description | 4 pages, revtex, submitted June 29, 1999 | |
| dc.identifier | https://arxiv.org/abs/quant-ph/9906112 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/9906112 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/94150 | |
| dc.subject | Quantum Physics | |
| dc.title | Quantum algorithms which accept hot qubit inputs | |
| dc.type | text |