Enhancing Quantum Circuit Simulations through Structured Tensor Algebra Optimization

在当今快速变化的世界中，量子计算是一个游戏规则改变者，为各个领域的复杂问题提供解决方案。它为创新和科学进步打开了新的大门，从增强数据安全到推进药物发现和提高计算效率。与此同时，经典计算机上的量子模拟可以作为量子思想的测试实验室，确保它们正确工作，并帮助学习量子科学。这些工具将两个不同的世界连接起来，使学习、发现和创新变得更加容易。在量子模拟技术的范围内，包括数字量子模拟、变分量子算法、量子近似优化算法（QAOA）、量子退火和矩阵乘积态，后者似乎是一个值得注意的选择。它们有效地表示量子态，特别是在处理高度复杂的系统时。其紧凑的结构提供了高效的存储和操作，使其成为非常有前途的选择。然而，在为不同的模拟优化张量网络结构时会出现挑战，因为找到完美的配置可能是一项计算密集型任务。该项目解决了这些挑战，并提高了量子模拟中矩阵乘积态的效率。我们的目标是开发能够自动识别和利用不同量子任务的最佳张量网络结构的技术。通过这种方式，我们可以最大限度地提高矩阵乘积状态的效率，而无需处理与手动优化相关的复杂性，如现有量子模拟器中所见。这种方法有可能成为量子模拟技术的突破性进展，使我们能够更轻松快速地解决更广泛的复杂问题。从Ghorbani等人在结构化张量代数方面的开创性工作中获得灵感，如他们的论文“编译结构化张量代数”中所描述的，我们计划使用一个名为“StructTensor”的符号计算框架。这种创新方法将帮助我们捕获量子计算中的结构、稀疏性和冗余性，从而实现高效的模拟。通过严格的数学基础，我们将证明我们的符号结构计算和相关优化的合理性。我们预计这种方法将在各种量子计算工作负载中优于现有框架，最终加速量子电路模拟并推进量子计算领域。

In today's rapidly changing world, quantum computation is a game-changer, offering solutions to complex problems in various fields. It opens new doors to innovation and scientific progress, from enhancing data security to advancing drug discovery and improving computational efficiency. In parallel, quantum simulation on classical computers serves as a test lab for quantum ideas, ensuring they work correctly and aiding in learning about quantum science. These tools bridge two different worlds, making it easier to learn, discover, and innovate.Among the range of quantum simulation techniques, which include digital quantum simulations, variational quantum algorithms, quantum approximate optimization algorithms (QAOA), quantum annealing, and matrix product states, the latter appears as a notable option. They efficiently represent quantum states, particularly when dealing with highly complex systems. Their compact structure offers efficient storage and manipulation, making them a highly promising choice. However, challenges arise when optimizing the tensor network structure for different simulations, as finding the perfect configuration can be a computationally intensive task.This project addresses these challenges and boosts the efficiency of matrix product states in quantum simulations. We aim to develop techniques that can automatically identify and utilize optimal tensor network structures for different quantum tasks. This way, we can maximize the efficiency of matrix product states without dealing with the complexities often associated with manual optimization, as seen in existing quantum simulators. This approach has the potential to be a groundbreaking advancement in quantum simulation techniques, enabling us to tackle a wider range of complex problems more easily and quickly.Taking inspiration from the pioneering work by Ghorbani et al. on structured tensor algebra, as described in their paper "Compiling Structured Tensor Algebra," we plan to employ a symbolic computation framework called "StructTensor". This innovative approach will help us capture the structure, sparsity, and redundancy within quantum computations, leading to highly efficient simulations.Through a rigorous mathematical foundation, we will demonstrate the soundness of our symbolic structure computation and associated optimizations. We anticipate that this approach will outperform existing frameworks in various quantum computation workloads, ultimately accelerating quantum circuit simulations and advancing the field of quantum computing.