arXivDaily arXiv每日学术速递 周一至周五更新
arXiv quant-ph/9804043quant-phcs.CC
收藏

稠密量子编码与单向量子自动机的一个下界

Dense Quantum Coding and a Lower Bound for 1-way Quantum Automata

Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh Vazirani

摘要:

我们考虑的可能性编码m个经典位到少得多的n个量子位,使任意位从原来的m位可以恢复一个很好的概率,我们表明,非平凡的量子编码存在,没有经典的同行。另一方面,我们表明,量子编码不能更简洁相比,经典的编码,我们提供了这样的量子编码的下限。最后,利用这个下界,我们证明了一个指数下界的大小的1路量子有限自动机的线性大小的确定性有限自动机接受的语言的家庭。

英文摘要:

We consider the possibility of encoding m classical bits into much fewer n quantum bits so that an arbitrary bit from the original m bits can be recovered with a good probability, and we show that non-trivial quantum encodings exist that have no classical counterparts. On the other hand, we show that quantum encodings cannot be much more succint as compared to classical encodings, and we provide a lower bound on such quantum encodings. Finally, using this lower bound, we prove an exponential lower bound on the size of 1-way quantum finite automata for a family of languages accepted by linear sized deterministic finite automata.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑