Quantum Lower Bounds by Entropy Numbers

Simple item page
dc.creatorHeinrich, Stefan
dc.date2006-11-30
dc.date.accessioned2026-07-07T07:34:17Z
dc.date.available2026-07-07T07:34:17Z
dc.descriptionWe 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.
dc.descriptionSubmitted to J. Complexity
dc.identifierhttps://arxiv.org/abs/quant-ph/0611294
dc.identifierhttp://arxiv.org/abs/quant-ph/0611294
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/119758
dc.subjectQuantum Physics
dc.titleQuantum Lower Bounds by Entropy Numbers
dc.typetext

Files

Collections

arXiv