dorsal/arxiv
View SchemaThe Importance of the Algorithmic Information Theory to Construct a Possible Example Where NP#P
| Authors | Rubens Viana Ramos |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0611027 |
| URL | https://arxiv.org/abs/quant-ph/0611027 |
Abstract
In this short communication, it is shown a simple problem using quantum circuits for which the algorithmic information theory guarantee that the minimal length of the algorithm able to solve it grows exponentially with the number of qubits.
{
"annotation_id": "2468a662-6965-4087-a642-70b8299011c2",
"date_created": "2026-03-02T18:02:30.555000Z",
"date_modified": "2026-03-02T18:02:30.555000Z",
"file_hash": "c68c9e78c3aa2fbe5c9568eb29819373d41befe2cd30a3c23de749e06811760d",
"private": false,
"record": {
"abstract": "In this short communication, it is shown a simple problem using quantum\ncircuits for which the algorithmic information theory guarantee that the\nminimal length of the algorithm able to solve it grows exponentially with the\nnumber of qubits.",
"arxiv_id": "quant-ph/0611027",
"authors": [
"Rubens Viana Ramos"
],
"categories": [
"quant-ph"
],
"title": "The Importance of the Algorithmic Information Theory to Construct a Possible Example Where NP#P",
"url": "https://arxiv.org/abs/quant-ph/0611027"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "adfc9a89-1898-4887-8e51-8c2e950bc398",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}