论文标题
在IBM量子计算机上实施量子压缩
Implementation of quantum compression on IBM quantum computers
论文作者
论文摘要
量子计算处理器的开发进步带来了充足的机会，可以通过实施实施来测试各种量子算法的性能。在本文中，我们报告了可以有效压缩未知量子信息的量子压缩算法的实现。我们将自己局限于将三个纯码头压缩为两个Qubit，因为即使如此简单的实现的复杂性几乎不在当今的量子处理器的范围内。我们在IBM量子处理器上实现了具有两个不同拓扑布局的算法 - 完全连接的三角处理器和一个部分连接的线路处理器。事实证明，线条处理器的不完整连通性仅对性能的影响最小。另一方面，事实证明，转移，即将电路汇编为量子处理器物理可用的门，对结果至关重要。我们还看到，即使在这种简单的情况下，在边缘甚至超出了当前可用的量子处理器的功能之外，紧随其后的压缩也是立即减压。
Advances in development of quantum computing processors brought ample opportunities to test the performance of various quantum algorithms with practical implementations. In this paper we report on implementations of quantum compression algorithm that can efficiently compress unknown quantum information. We restricted ourselves to compression of three pure qubits into two qubits, as the complexity of even such a simple implementation is barely within the reach of today's quantum processors. We implemented the algorithm on IBM quantum processors with two different topological layouts - a fully connected triangle processor and a partially connected line processor. It turns out that the incomplete connectivity of the line processor affects the performance only minimally. On the other hand, it turns out that the transpilation, i.e. compilation of the circuit into gates physically available to the quantum processor, crucially influences the result. We also have seen that the compression followed by immediate decompression is, even for such a simple case, on the edge or even beyond the capabilities of currently available quantum processors.
