...
首页> 外文期刊>Physical Review, A >Optimal control of superconducting gmon qubits using Pontryagin's minimum principle: Preparing a maximally entangled state with singular bang-bang protocols
【24h】

Optimal control of superconducting gmon qubits using Pontryagin's minimum principle: Preparing a maximally entangled state with singular bang-bang protocols

机译:使用Pontryagin最低原理的超导GMON Qubits的最佳控制:用奇异的爆炸协议准备最大纠缠的状态

获取原文
获取原文并翻译 | 示例
           

摘要

We apply the theory of optimal control to the dynamics of two “gmon” qubits, with the goal of preparing a desired entangled ground state from an initial unentangled one. Given an initial state, a target state, and a Hamiltonian with a set of permissible controls, can we reach the target state with coherent quantum evolution, and, in that case, what is theminimum time required? The adiabatic theorem provides a far from optimal solution in the presence of a spectral gap. Optimal control yields the fastest possible way of reaching the target state and helps identify unreachable states. In the context of a simple quantum system, we provide examples of both reachable and unreachable target ground states, and show that the unreachability is due to a symmetry.We find the optimal protocol in the reachable case using three different approaches: (i) a brute-force numerical minimization, (ii) an efficient numerical minimization using the bang-bang ansatz expected from the Pontryagin minimum principle, and (iii) direct solution of the Pontryagin boundary value problem, which yields an analytical understanding of the numerically obtained optimal protocols. Interestingly, our system provides an example of singular control, where the Pontryagin theorem does not guarantee bang-bang protocols. Nevertheless, all three approaches give the same bang-bang protocol.
机译:我们将最佳控制理论应用于两个“GMON”QUBITS的动态,目标是从初始未受突出的突出的地面准备所需的缠结地位。鉴于初始状态,目标状态和带有一组允许控制的Hamiltonian,我们是否可以通过相干量子演变到达目标状态,并且在这种情况下,需要最大时间的时间?绝热定理在存在光谱间隙存在下提供了远离最佳解决方案。最佳控制产生了达到目标状态的最快方法,并有助于识别无法到达状态。在简单量子系统的上下文中,我们提供了可达和无法访问的目标地面态的示例,并表明不相容性是由于对称性的。我们使用三种不同的方法在可达案例中找到最佳协议:(i)a Brute-Force数值最小化,(ii)使用Pontryagin最低原理的Bang-Bang Ansatz的有效数值最小化,(iii)直接解决Pontryagin边值问题的直接解,这产生了对数值获得的最佳方案的分析理解。有趣的是,我们的系统提供了一个单数控制的例子,其中Pontryagin定理不保证Bang-Bang协议。尽管如此,所有三种方法都提供了相同的Bang-Bang议定书。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号