从经典存储器向量子寄存器装入N维向量的O（logN）步
Loading N-Dimensional Vector into Quantum Registers from Classical Memory with O(logN) Steps
摘要：
向量是大多数算法输入数据的通用格式。设计幺正操作将向量的所有信息从经典存储器加载到量子CPU的量子寄存器中称为量子加载方案（QLS）。QLS将经典存储器和量子CPU组装成一台完整的计算机，这对进一步的量子计算将是重要的。本文提出了一种基于路径干扰的QLS算法，其时间复杂度为O（logN），而经典的装载算法的时间复杂度为O（N），这是经典计算机的效率瓶颈。
英文摘要：
Vector is the general format of input data of most algorithms. Designing unitary operation to load all information of vector into quantum registers of quantum CPU from classical memory is called quantum loading scheme (QLS). QLS assembles classical memory and quantum CPU as a whole computer, which will be important for further quantum computation. We present a QLS based on path interference with time complexity O(logN), while classical loading scheme has time complexity O(N), that is the efficiency bottleneck of classical computer.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
