量子算法的函数表示的有效构造
Efficient Construction of Functional Representations for Quantum Algorithms
摘要：
由于量子硬件实现的重大进展，设计相应算法的有效方法和工具变得越来越重要。这些工具中的许多依赖于某些构建块甚至整个量子算法的函数表示，然而，这些算法固有地表现出指数复杂性。虽然已经提出了几种替代表示来应对这种复杂性，这些表示的建设仍然是一个瓶颈。在这项工作中，我们提出了有效构建量子功能表示的解决方案，其基础是在尽可能小的中间表示上进行尽可能多的操作-使用决策图作为代表性的功能描述。实验评估表明，应用这些解决方案可以构建所需的表示几个因素比国家的最先进的方法。此外，如果重复结构（经常出现在量子算法中）被明确利用，指数改进是可能的-允许在几秒钟内构建某些算法的功能，而现有技术无法在一整天内构建它。
英文摘要：
Due to the significant progress made in the implementation of quantum hardware, efficient methods and tools to design corresponding algorithms become increasingly important. Many of these tools rely on functional representations of certain building blocks or even entire quantum algorithms which, however, inherently exhibit an exponential complexity. Although several alternative representations have been proposed to cope with this complexity, the construction of those representations remains a bottleneck. In this work, we propose solutions for efficiently constructing representations of quantum functionality based on the idea of conducting as many operations as possible on as small as possible intermediate representations -- using Decision Diagrams as a representative functional description. Experimental evaluations show that applying these solutions allows to construct the desired representations several factors faster than with state-of-the-art methods. Moreover, if repeating structures (which frequently occur in quantum algorithms) are explicitly exploited, exponential improvements are possible -- allowing to construct the functionality of certain algorithms within seconds, whereas the state of the art fails to construct it in an entire day.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
