dorsal/arxiv
View SchemaQuantum Lower Bounds by Entropy Numbers
| Authors | Stefan Heinrich |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0611294 |
| URL | https://arxiv.org/abs/quant-ph/0611294 |
Abstract
We use entropy numbers in combination with the polynomial method to derive a new general lower bound for the n-th minimal error in the quantum setting of information-based complexity. As an application, we improve some lower bounds on quantum approximation of embeddings between finite dimensional L_p spaces and of Sobolev embeddings.
{
"annotation_id": "06eb299a-5ca0-4de1-9f21-613bd43e8db0",
"date_created": "2026-03-02T18:02:34.489000Z",
"date_modified": "2026-03-02T18:02:34.489000Z",
"file_hash": "e54e2930c586cf4eba29efcdb354f566d9a2655737d7167c3c2d50ce41ed637c",
"private": false,
"record": {
"abstract": "We use entropy numbers in combination with the polynomial method to derive a\nnew general lower bound for the n-th minimal error in the quantum setting of\ninformation-based complexity. As an application, we improve some lower bounds\non quantum approximation of embeddings between finite dimensional L_p spaces\nand of Sobolev embeddings.",
"arxiv_id": "quant-ph/0611294",
"authors": [
"Stefan Heinrich"
],
"categories": [
"quant-ph"
],
"title": "Quantum Lower Bounds by Entropy Numbers",
"url": "https://arxiv.org/abs/quant-ph/0611294"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "1e7b836b-c575-40a1-bd1d-529b246d36c0",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}