论文标题
与最近邻居联轴器的Qubit阵列中有效的哈密顿编程
Efficient Hamiltonian programming in qubit arrays with nearest-neighbour couplings
论文作者
论文摘要
我们考虑使用局部非门的序列，在计算基础上始终在计算基础上有选择性地控制耦合的问题。这种方法在NMR实施中是众所周知的，但是先前的方法并不能有效地扩展到一般完全相互连接的哈密顿量，在这种方法中，找到时间优化的解决方案的复杂性使它们只能实用多达几十吨。鉴于尖端量子处理器的量子数数量的迅速增长，因此研究了该控制方案对具有现实限制连接性的大规模系统的适用性。在这里，我们提出了一个有效的方案，可以找到近时间最佳的解决方案，该解决方案可以应用于任何数量的Qubits局部连接的工程量子阵列，表明在此类系统中实用量子计算的潜力。
We consider the problem of selectively controlling couplings in a practical quantum processor with always-on interactions that are diagonal in the computational basis, using sequences of local NOT gates. This methodology is well-known in NMR implementations, but previous approaches do not scale efficiently for the general fully-connected Hamiltonian, where the complexity of finding time-optimal solutions makes them only practical up to a few tens of qubits. Given the rapid growth in the number of qubits in cutting-edge quantum processors, it is of interest to investigate the applicability of this control scheme to much larger scale systems with realistic restrictions on connectivity. Here we present an efficient scheme to find near time-optimal solutions that can be applied to engineered qubit arrays with local connectivity for any number of qubits, indicating the potential for practical quantum computing in such systems.
