解耦方案与正交阵列的等价性
Equivalence of Decoupling Schemes and Orthogonal Arrays
AI总结:
本文研究了多部分哈密顿量中关闭无用相互作用的问题,证明了基于正交阵列和 Hadamard 矩阵的两种解耦方案等价,并揭示了正交阵列与等距时隙解耦方案的等价刻画,同时提出可从经典纠错码构建高维量子系统的解耦方案。
摘要:
我们考虑在给定的多部分哈密顿量中关闭 unwanted 相互作用的问题。这在量子信息处理中被称为一个重要的原语,文献中已提出多种方案来实现此任务。M. Stollsteimer 和 G. Mahler 引入了一种为成对相互作用量子比特系统构建解耦方案的方法,该方法基于正交阵列。D. Leung 提出了另一种基于在逐点乘法下封闭的 Hadamard 矩阵三元组的方法。在本文中,我们证明这两种方法会导出同一类解耦方案。此外,我们通过证明正交阵列等价于允许细分为等距时隙的解耦方案,建立了正交阵列的一个刻画。进一步地,我们证明针对具有 t-local Hamiltonians 的高维量子系统网络的解耦方案,可以从经典纠错码中构建。
英文摘要:
We consider the problem of switching off unwanted interactions in a given multi-partite Hamiltonian. This is known to be an important primitive in quantum information processing and several schemes have been presented in the literature to achieve this task. A method to construct decoupling schemes for quantum systems of pairwise interacting qubits was introduced by M. Stollsteimer and G. Mahler and is based on orthogonal arrays. Another approach based on triples of Hadamard matrices that are closed under pointwise multiplication was proposed by D. Leung. In this paper, we show that both methods lead to the same class of decoupling schemes. Moreover, we establish a characterization of orthogonal arrays by showing that they are equivalent to decoupling schemes which allow a refinement into equidistant time-slots. Furthermore, we show that decoupling schemes for networks of higher-dimensional quantum systems with t-local Hamiltonians can be constructed from classical error-correcting codes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。