论文标题
量子阵列中可控性的图表测试：确定最小数量外部控件数的系统方法
Graph test of controllability in qubit arrays: A systematic way to determine the minimum number of external controls
论文作者
论文摘要
在量子处理单元上实现任何所需的量子逻辑门的能力等同于量子器的进化操作员可控性。相反，可控性分析可用于最大程度地减少通用量子计算所需的资源，即外部控件和Qubit-Qubit耦合的数量。然而，由动态谎言代数的构建组成的标准可控性分析已经不切实际，对于量子数量相对较少。在这里，我们展示了如何基于哈密顿量的图表来利用替代方法来确定耦合量子位阵列的可控性。我们提供了一个完整的计算框架，并以IBMQ_QUITO架构的启发为五个Qubits的数组示例。我们发现，对于复杂的Qubit-Qubit耦合，可以将控件的数量从5减少到一个，而对于标准Qubit-Qubit耦合的两个。
The ability to implement any desired quantum logic gate on a quantum processing unit is equivalent to evolution-operator controllability of the qubits. Conversely, controllability analysis can be used to minimize the resources, i.e., the number of external controls and qubit-qubit couplings, required for universal quantum computing. Standard controllability analysis, consisting in the construction of the dynamical Lie algebra, is, however, impractical already for a comparatively small number of qubits. Here, we show how to leverage an alternative approach, based on a graph representation of the Hamiltonian, to determine controllability of arrays of coupled qubits. We provide a complete computational framework and exemplify it for arrays of five qubits, inspired by the ibmq_quito architecture. We find that the number of controls can be reduced from five to one for complex qubit-qubit couplings and to two for standard qubit-qubit couplings.
