带滤波器的模6超密集编码
Hyperdense Coding Modulo 6 with Filter-Machines
摘要:
我们展示了如何使用仍然假设的滤波器机器(这里$o(1)$表示当$n$变为infity时变为0的正量)来编码具有$n^{o(1)}$“波比特”的$n$比特。我们目前的结果--在一个完全不同的计算模型中--显著地改进了Bennet和Wiesner(1992)的量子超密集编码突破,该突破用$\lceil{n/2}\rceil$量子比特编码$n$比特。我们还表明,我们的早期算法(技术。Rep. TR 03 -001,ECCC,参见ftp://ftp.eccc.uni-trier.de/pub/eccc/reports/2003/TR03-001/index.html),其使用$n^{o(1)}$乘法来计算两个$n$位序列模6的点积的表示,并且类似地,用于计算两个$n\times n$矩阵与$n^{2+o(1)}$乘法的乘法的表示的算法可以被转换为利用滤波器机计算精确点积或具有相同乘法次数的精确矩阵积的算法。对于经典计算,计算点积需要$Ω(n)$乘法和最著名的矩阵乘法算法(D。Coppersmith和S. Winograd,通过算术级数的矩阵乘法,J.符号计算,9(3):251- 280,1990)使用$n^{2.376}$乘法。
英文摘要:
We show how one can encode $n$ bits with $n^{o(1)}$ ``wave-bits'' using still hypothetical filter-machines (here $o(1)$ denotes a positive quantity which goes to 0 as $n$ goes to infity). Our present result - in a completely different computational model - significantly improves on the quantum superdense-coding breakthrough of Bennet and Wiesner (1992) which encoded $n$ bits by $\lceil{n/2}\rceil$ quantum-bits. We also show that our earlier algorithm (Tech. Rep. TR03-001, ECCC, See ftp://ftp.eccc.uni-trier.de/pub/eccc/reports/2003/TR03-001/index.html) which used $n^{o(1)}$ muliplication for computing a representation of the dot-product of two $n$-bit sequences modulo 6, and, similarly, an algorithm for computing a representation of the multiplication of two $n\times n$ matrices with $n^{2+o(1)}$ multiplications can be turned to algorithms computing the exact dot-product or the exact matrix-product with the same number of multiplications with filter-machines. With classical computation, computing the dot-product needs $Ω(n)$ multiplications and the best known algorithm for matrix multiplication (D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, J. Symbolic Comput., 9(3):251--280, 1990) uses $n^{2.376}$ multiplications.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。