Qubiter算法的改进，用较少的hocTs表示非结构酉矩阵
Qubiter Algorithm Modification, Expressing Unstructured Unitary Matrices with Fewer CNOTs
摘要：
量子编译器是用于将任意酉矩阵分解（“编译”）为初等运算序列（SEO）的软件程序。这篇论文的作者也是一个名为Qubiter的量子编译器的作者。Qubiter使用一种称为余弦-正弦分解（CSD）的矩阵分解，这在计算线性代数领域是众所周知的。测量量子编译器效率的一种方法是测量它用来表示非结构化酉矩阵（没有特殊对称性的酉矩阵）的hocT的数量。此后，我们将此编号称为$ε$。在本文中，我们展示了如何改进Qubiter的$ε$，使其与另一个基于CSD的量子编译算法保持的$ε$的当前世界纪录相匹配。
英文摘要：
A quantum compiler is a software program for decomposing ("compiling") an arbitrary unitary matrix into a sequence of elementary operations (SEO). The author of this paper is also the author of a quantum compiler called Qubiter. Qubiter uses a matrix decomposition called the Cosine-Sine Decomposition (CSD) that is well known in the field of Computational Linear Algebra. One way of measuring the efficiency of a quantum compiler is to measure the number of CNOTs it uses to express an unstructured unitary matrix (a unitary matrix with no special symmetries). We will henceforth refer to this number as $ε$. In this paper, we show how to improve $ε$ for Qubiter so that it matches the current world record for $ε$, which is held by another quantum compiling algorithm based on CSD.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
