Wasserstein解的质量与量子近似优化算法:一个投资组合优化案例研究
Wasserstein Solution Quality and the Quantum Approximate Optimization Algorithm: A Portfolio Optimization Case Study
摘要:
金融资产组合的优化是一个关键的工业问题,可以使用适用于量子处理单元(QPU)的算法近似解决。我们使用量子近似优化算法(QAOA)对这种方法的成功进行了基准测试;该算法针对门模型QPU。我们的重点是实现的解决方案的质量确定的归一化和互补Wasserstein距离,$η$,我们提出的方式暴露的QAOA作为一个运输机的概率。使用$η$作为特定于应用的性能基准,我们根据QAOA电路深度$p$对QPU的选择进行测量。在$n = 2$(2个量子位),我们发现大多数系统的峰值溶液质量在$p=5$,而对于$n = 3$,该峰值在捕获离子QPU上的$p=4$。使用更一般的量子交替算子Ansätz在$p=2$的$n = 2$和$3$的变体,也观察到$p$的解质量增加,这在以前没有报道过。在相同的测量中,$η$被观察到在超过从有限数量的射击产生的噪声的水平上是可变的。这表明可变性本身应被视为给定应用程序的QPU性能基准。在研究QAOA的理想执行时,我们发现当投资组合预算$B$接近$n/2$时,$p=1$解决方案质量下降,当投资组合预算接近$B \approx 1$或$n-1$时,$p=1$解决方案质量增加。这种趋势直接对应于二项式系数$nCB$,并与最近报道的可达性缺陷现象有关。导数要求和导数免费的经典优化的基准上实现的$η$超越$p=1$的基础上,发现导数免费的优化通常是更有效的给定的计算资源,问题的大小和电路深度。
英文摘要:
Optimizing of a portfolio of financial assets is a critical industrial problem which can be approximately solved using algorithms suitable for quantum processing units (QPUs). We benchmark the success of this approach using the Quantum Approximate Optimization Algorithm (QAOA); an algorithm targeting gate-model QPUs. Our focus is on the quality of solutions achieved as determined by the Normalized and Complementary Wasserstein Distance, $η$, which we present in a manner to expose the QAOA as a transporter of probability. Using $η$ as an application specific benchmark of performance, we measure it on selection of QPUs as a function of QAOA circuit depth $p$. At $n = 2$ (2 qubits) we find peak solution quality at $p=5$ for most systems and for $n = 3$ this peak is at $p=4$ on a trapped ion QPU. Increasing solution quality with $p$ is also observed using variants of the more general Quantum Alternating Operator Ansätz at $p=2$ for $n = 2$ and $3$ which has not been previously reported. In identical measurements, $η$ is observed to be variable at a level exceeding the noise produced from the finite number of shots. This suggests that variability itself should be regarded as a QPU performance benchmark for given applications. While studying the ideal execution of QAOA, we find that $p=1$ solution quality degrades when the portfolio budget $B$ approaches $n/2$ and increases when $B \approx 1$ or $n-1$. This trend directly corresponds to the binomial coefficient $nCB$ and is connected with the recently reported phenomenon of reachability deficits. Derivative-requiring and derivative-free classical optimizers are benchmarked on the basis of the achieved $η$ beyond $p=1$ to find that derivative-free optimizers are generally more effective for the given computational resources, problem sizes and circuit depths.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。