作为量子计算的Schumacher量子数据压缩
Schumacher's quantum data compression as a quantum computation
摘要：
给出了一种实现量子比特Schumacher无噪声压缩的显式算法。该算法是基于一个组合表达式的一个特定的双射之间的二进制字符串。该算法遵循可逆规划的规则，用高级伪代码语言表示。它使用$O(n^3)$两位和三位原始可逆操作来实现，其中$n$是要压缩的量子位串的长度。此外，该算法利用$O(n)$辅助量子位;然而，开发了基于Bennett提出的节省空间的技术，该技术将该工作空间减少到$O(\sqrt{n})$，同时将运行时间增加不到两倍。
英文摘要：
An explicit algorithm for performing Schumacher's noiseless compression of quantum bits is given. This algorithm is based on a combinatorial expression for a particular bijection among binary strings. The algorithm, which adheres to the rules of reversible programming, is expressed in a high-level pseudocode language. It is implemented using $O(n^3)$ two- and three-bit primitive reversible operations, where $n$ is the length of the qubit strings to be compressed. Also, the algorithm makes use of $O(n)$ auxiliary qubits; however, space-saving techniques based on those proposed by Bennett are developed which reduce this workspace to $O(\sqrt{n})$ while increasing the running time by less than a factor of two.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
