dorsal/arxiv
View SchemaUncertainty In Quantum Computation
| Authors | Subhash Kak |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0206006 |
| URL | https://arxiv.org/abs/quant-ph/0206006 |
Abstract
We 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.
{
"annotation_id": "7876cd04-3c7a-401a-b907-e7a7ebf04d0d",
"date_created": "2026-03-02T18:01:52.937000Z",
"date_modified": "2026-03-02T18:01:52.937000Z",
"file_hash": "301503a4c4e9e8d4f9810d7c59ae3f96986747efc2d9792c12e11df4e811b41f",
"private": false,
"record": {
"abstract": "We examine the effect of previous history on starting a computation on a\nquantum computer. Specifically, we assume that the quantum register has some\nunknown state on it, and it is required that this state be cleared and replaced\nby a specific superposition state without any phase uncertainty, as needed by\nquantum algorithms. We show that, in general, this task is computationally\nimpossible.",
"arxiv_id": "quant-ph/0206006",
"authors": [
"Subhash Kak"
],
"categories": [
"quant-ph"
],
"title": "Uncertainty In Quantum Computation",
"url": "https://arxiv.org/abs/quant-ph/0206006"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "46130c24-87f6-4a56-b7ba-33949f575a24",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}