dorsal/arxiv
View SchemaQuantum algorithms which accept hot qubit inputs
| Authors | Xinlan Zhou, Debbie W. Leung, Isaac L. Chuang |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/9906112 |
| URL | https://arxiv.org/abs/quant-ph/9906112 |
Abstract
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.
{
"annotation_id": "d6c0ac5e-e498-4541-8008-30faccdf9fce",
"date_created": "2026-03-02T18:02:48.370000Z",
"date_modified": "2026-03-02T18:02:48.370000Z",
"file_hash": "2587977336d5a24c563f320d800e05b5f528ba3787fcb04f8e04a557ed9070d4",
"private": false,
"record": {
"abstract": "Realistic physical implementations of quantum computers can entail tradeoffs\nwhich depart from the ideal model of quantum computation. Although these\ntradeoffs have allowed successful demonstration of certain quantum algorithms,\na crucial question is whether they fundamentally limit the computational\ncapacity of such machines. We study the limitations of a quantum computation\nmodel in which only ensemble averages of measurement observables are\naccessible. Furthermore, we stipulate that input qubits may only be prepared in\nhighly random, ``hot\u0027\u0027 mixed states. In general, these limitations are believed\nto dramatically detract from the computational power of the system. However, we\nconstruct a class of algorithms for this limited model, which, surprisingly,\nare polynomially equivalent to the ideal case. This class includes the well\nknown Deutsch-Jozsa algorithm.",
"arxiv_id": "quant-ph/9906112",
"authors": [
"Xinlan Zhou",
"Debbie W. Leung",
"Isaac L. Chuang"
],
"categories": [
"quant-ph"
],
"title": "Quantum algorithms which accept hot qubit inputs",
"url": "https://arxiv.org/abs/quant-ph/9906112"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "baa918fb-aeb0-43a7-bd22-3a37acbd2555",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}