Blümel Reinhold, Grzesiak Nikodem, Nguyen Nhung H, Green Alaina M, Li Ming, Maksymov Andrii, Linke Norbert M, Nam Yunseong
Wesleyan University, Middletown, Connecticut 06459, USA.
IonQ, College Park, Maryland 20740, USA.
Phys Rev Lett. 2021 Jun 4;126(22):220503. doi: 10.1103/PhysRevLett.126.220503.
In order to scale up quantum processors and achieve a quantum advantage, it is crucial to economize on the power requirement of two-qubit gates, make them robust to drift in experimental parameters, and shorten the gate times. Applicable to all quantum computer architectures whose two-qubit gates rely on phase-space closure, we present here a new gate-optimizing principle according to which negligible amounts of gate fidelity are traded for substantial savings in power, which, in turn, can be traded for substantial increases in gate speed and/or qubit connectivity. As a concrete example, we illustrate the method by constructing optimal pulses for entangling gates on a pair of ions within a trapped-ion chain, one of the leading quantum computing architectures. Our method is direct, noniterative, and linear, and, in some parameter regimes, constructs gate-steering pulses requiring up to an order of magnitude less power than the standard method. Additionally, our method provides increased robustness to mode drift. We verify the new trade-off principle experimentally on our trapped-ion quantum computer.
为了扩大量子处理器的规模并实现量子优势,节约双比特门的功耗、使其对实验参数的漂移具有鲁棒性并缩短门操作时间至关重要。适用于所有双比特门依赖相空间闭合的量子计算机架构,我们在此提出一种新的门优化原理,根据该原理,以可忽略的门保真度损失换取大幅的功耗节省,而功耗节省又可转而换取门速度和/或量子比特连通性的大幅提升。作为一个具体例子,我们通过为俘获离子链中的一对离子上的纠缠门构造最优脉冲来说明该方法,俘获离子链是领先的量子计算架构之一。我们的方法直接、非迭代且线性,并且在某些参数范围内,构造的门控脉冲所需功耗比标准方法低一个数量级。此外,我们的方法对模式漂移具有更高的鲁棒性。我们在我们的俘获离子量子计算机上通过实验验证了这种新的权衡原理。