dorsal/arxiv
View SchemaComputation with Unitaries and One Pure Qubit
| Authors | Dan Shepherd |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0608132 |
| URL | https://arxiv.org/abs/quant-ph/0608132 |
Abstract
We define a semantic complexity class based on the model of quantum computing with just one pure qubit (as introduced by Knill and Laflamme) and discuss its computational power in terms of the problem of estimating the trace of a large unitary matrix. We show that this problem is complete for the complexity class, and derive some further fundamental features of the class. We conclude with a discussion of some associated open conjectures and new oracle separations between classes.
{
"annotation_id": "2e264557-c766-496a-8813-bca0ffeb49b8",
"date_created": "2026-03-02T18:02:31.098000Z",
"date_modified": "2026-03-02T18:02:31.098000Z",
"file_hash": "181a4b845c98a8fa4908e0518b04f1ce6d9f9c67bb9e693e6cc64d7cbe548a79",
"private": false,
"record": {
"abstract": "We define a semantic complexity class based on the model of quantum computing\nwith just one pure qubit (as introduced by Knill and Laflamme) and discuss its\ncomputational power in terms of the problem of estimating the trace of a large\nunitary matrix. We show that this problem is complete for the complexity class,\nand derive some further fundamental features of the class. We conclude with a\ndiscussion of some associated open conjectures and new oracle separations\nbetween classes.",
"arxiv_id": "quant-ph/0608132",
"authors": [
"Dan Shepherd"
],
"categories": [
"quant-ph"
],
"title": "Computation with Unitaries and One Pure Qubit",
"url": "https://arxiv.org/abs/quant-ph/0608132"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "fb99f364-5ded-453e-98c0-11763539a37a",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}