Quantum Lower Bounds by Entropy Numbers
量子物理
2007-05-23 v1
摘要
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.
引用
@article{arxiv.quant-ph/0611294,
title = {Quantum Lower Bounds by Entropy Numbers},
author = {Stefan Heinrich},
journal= {arXiv preprint arXiv:quant-ph/0611294},
year = {2007}
}
备注
Submitted to J. Complexity