<p>We report an algorithm that is able to tailor qubit interactions for individual variational quantum algorithm problems. The algorithm leverages the unique ability of a neutral atom tweezer platform to realize arbitrary qubit position configurations. These configurations determine the degree of entanglement available to a variational quantum algorithm via the interatomic interactions. Good configurations will accelerate pulse optimization convergence and help mitigate barren plateaus. As gradient-based approaches are ineffective for position optimization due to the divergent <i>R</i><sup>−6</sup> nature of Rydberg interactions, we opt to use a <i>consensus-based</i> algorithm. By sampling configuration space instead of using gradient information, the consensus-based algorithm is able to successfully optimize the positions, yielding adapted variational quantum algorithm ansatzes that lead to both faster convergence and lower errors. We show that these optimized configurations generally result in large improvements in the system’s ability to solve ground state minimization problems for both random Hamiltonians and small molecules.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Consensus-based qubit configuration optimization for variational algorithms on neutral atom quantum systems

  • Robert J. P. T. de Keijzer,
  • Luke Y. Visser,
  • Oliver Tse,
  • Servaas J. J. M. F. Kokkelmans

摘要

We report an algorithm that is able to tailor qubit interactions for individual variational quantum algorithm problems. The algorithm leverages the unique ability of a neutral atom tweezer platform to realize arbitrary qubit position configurations. These configurations determine the degree of entanglement available to a variational quantum algorithm via the interatomic interactions. Good configurations will accelerate pulse optimization convergence and help mitigate barren plateaus. As gradient-based approaches are ineffective for position optimization due to the divergent R−6 nature of Rydberg interactions, we opt to use a consensus-based algorithm. By sampling configuration space instead of using gradient information, the consensus-based algorithm is able to successfully optimize the positions, yielding adapted variational quantum algorithm ansatzes that lead to both faster convergence and lower errors. We show that these optimized configurations generally result in large improvements in the system’s ability to solve ground state minimization problems for both random Hamiltonians and small molecules.