Partial Compilation of Variational Algorithms for Noisy Intermediate-Scale Quantum Machines
Partial Compilation of Variational Algorithms for Noisy Intermediate-Scale Quantum Machines
复制标题
DOI：
10.1145/3352460.3358313
复制
发表时间：
2019-09
期刊：
影响因子：
--
通讯作者：
P. Gokhale;Yongshan Ding;T. Propson;Christopher Winkler;N. Leung;Yunong Shi;D. Schuster;H. Hoffmann;F. Chong
中科院分区：
文献类型：
--
作者：
P. Gokhale;Yongshan Ding;T. Propson;Christopher Winkler;N. Leung;Yunong Shi;D. Schuster;H. Hoffmann;F. Chong
量子计算在现实的风口浪尖上，当前正在开发和测试中嘈杂的中间尺度量子（NISQ）机器。这些机器的一些最有希望的算法是使用经典优化以及量子硬件来评估每个候选解决方案的质量的变异算法。最近的工作使用梯度下降脉冲工程（葡萄）将量子程序转换为高度优化的机器控制脉冲，从而大大减少了程序的执行时间。这是至关重要的，因为量子机在失败之前几乎不能支持短程序的执行。然而，葡萄患有高汇编延迟，由于汇编与计算交织在一起，因此在变化算法中站不住脚。我们提出了两种部分编译的策略，利用了变化电路的结构，以预编译特定门块的最佳脉冲。我们的结果表明，在典型基准中的1.5倍-3X范围内，脉冲加速度的显着速度仅为葡萄的汇编潜伏期的一小部分。
Quantum computing is on the cusp of reality with Noisy Intermediate-Scale Quantum (NISQ) machines currently under development and testing. Some of the most promising algorithms for these machines are variational algorithms that employ classical optimization coupled with quantum hardware to evaluate the quality of each candidate solution. Recent work used GRadient Descent Pulse Engineering (GRAPE) to translate quantum programs into highly optimized machine control pulses, resulting in a significant reduction in the execution time of programs. This is critical, as quantum machines can barely support the execution of short programs before failing. However, GRAPE suffers from high compilation latency, which is untenable in variational algorithms since compilation is interleaved with computation. We propose two strategies for partial compilation, exploiting the structure of variational circuits to pre-compile optimal pulses for specific blocks of gates. Our results indicate significant pulse speedups ranging from 1.5x-3x in typical benchmarks, with only a small fraction of the compilation latency of GRAPE.