arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2407.08423quant-ph
收藏

通过黎曼优化寻找量子码

Finding Quantum Codes via Riemannian Optimization

Miguel Casanova, Kentaro Ohki, Francesco Ticozzi

AI总结:

本文提出在复值 Stiefel 流形上用黎曼梯度优化寻找量子可纠正子空间码,并在多种噪声信道与 IBM 硬件上验证其高保真、低计算成本且码更简单。

摘要:

我们提出了一种新颖的优化方案,旨在为已知量子噪声信道寻找最优可纠正子空间码。对于每个候选子空间码,我们首先关联一个通用恢复映射,就好像该码是完全可纠正的一样,并致力于最大化一个性能泛函,该泛函结合了修正后的信道保真度与一个可调正则项,后者用于促进更简单的码。通过这种选择,优化仅在码集合上进行,而不在恢复算子集合上进行。固定维数的码集合被参数化为一个复值 Stiefel 流形:由此产生的非凸优化问题随后通过基于梯度的局部算法求解。当无法找到完全可纠正的码时,会对恢复 Kraus 映射运行第二个优化例程,该映射也通过 Stinespring 表示在适当的 Stiefel 流形中参数化。为测试该方法,我们在不同场景中寻找可纠正码并与现有码进行比较:三个遭受比特翻转错误(单比特和相关错误)的量子比特、四个经历局部振幅阻尼的量子比特,以及五个遭受局部去极化信道的量子比特。针对前述示例,以及作用于由 1/2 自旋浴诱导的 7/2 自旋上的纯非马尔可夫退相噪声,还有 IBM 的 ibm_kyoto 量子计算机前三个量子比特的噪声,我们都找到了并测试了近似码。保真度结果与现有迭代优化算法具有竞争力;相对于这些算法,我们保持了显著的计算优势,同时获得了更简单的码。

英文摘要:

We propose a novel optimization scheme designed to find optimally correctable subspace codes for a known quantum noise channel. To each candidate subspace code we first associate a universal recovery map, as if the code was perfectly correctable, and aim to maximize a performance functional that combines a modified channel fidelity with a tuneable regularization term that promotes simpler codes. With this choice optimization is performed only over the set of codes, and not over the set of recovery operators. The set of codes of fixed dimension is parametrized as a complex-valued Stiefel manifold: the resulting non-convex optimization problem is then solved by gradient-based local algorithms. When perfectly correctable codes cannot be found, a second optimization routine is run on the recovery Kraus map, also parametrized in a suitable Stiefel manifold via Stinespring representation. To test the approach, correctable codes are sought in different scenarios and compared to existing ones: three qubits subjected to bit-flip errors (single and correlated), four qubits undergoing local amplitude damping and five qubits subjected to local depolarizing channels. Approximate codes are found and tested for the previous examples as well pure non-Markovian dephasing noise acting on a $7/2$ spin, induced by a $1/2$ spin bath, and the noise of the first three qubits of IBM's \texttt{ibm\_kyoto} quantum computer. The fidelity results are competitive with existing iterative optimization algorithms, with respect to which we maintain a strong computational advantage, while obtaining simpler codes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑