论文标题
矩阵产品算法的量子验证的实现
An Implementation of the Quantum Verification of Matrix Products Algorithm
论文作者
论文摘要
我们提出了矩阵产品（QVMP）算法的量子验证的空间有效实现，并通过使用两种模拟方法在AER模拟器上运行它来证明其功能：StateVector和Matrix产品状态（MPS）。我们报告电路指标（门计数，Qubit计数，电路深度），转卸时间，仿真时间和Grover Oracle正确性的证明。我们的研究得出的结论是，虽然可以在适度的输入上模拟QVMP，但由于电路深度和Qubit计数约束，它无法在一定程度上扩展到在当前量子硬件上的任何量子优势。此外，仿真方法的选择对降低发展的转移电路的大小有明显的影响。
We present a space-efficient implementation of the quantum verification of matrix products (QVMP) algorithm and demonstrate its functionality by running it on the Aer simulator with two simulation methods: statevector and matrix product state (MPS). We report circuit metrics (gate count, qubit count, circuit depth), transpilation time, simulation time, and a proof of Grover oracle correctness. Our study concludes that while QVMP can be simulated on moderately sized inputs, it cannot scale to a degree where we can observe any quantum advantage on current quantum hardware due to circuit depth and qubit count constraints. Further, the choice of simulation method has a noticeable impact on the size of the transpiled circuit which slows down development.
