Robustness of optimal quantum annealing protocols

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Funcke, Niklas, Berberich, Julian
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866916395567022080
author Funcke, Niklas
Berberich, Julian
author_facet Funcke, Niklas
Berberich, Julian
contents Noise in quantum computing devices poses a key challenge in their realization. In this paper, we study the robustness of optimal quantum annealing protocols against coherent control errors, which are multiplicative Hamlitonian errors causing detrimental effects on current quantum devices. We show that the norm of the Hamiltonian quantifies the robustness against these errors, motivating the introduction of an additional regularization term in the cost function. We analyze the optimality conditions of the resulting robust quantum optimal control problem based on Pontryagin's maximum principle, showing that robust protocols admit larger smooth annealing sections. This suggests that quantum annealing admits improved robustness in comparison to bang-bang solutions such as the quantum approximate optimization algorithm. Finally, we perform numerical simulations to verify our analytical results and demonstrate the improved robustness of the proposed approach.
format Preprint
id arxiv_https___arxiv_org_abs_2408_06782
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Robustness of optimal quantum annealing protocols
Funcke, Niklas
Berberich, Julian
Quantum Physics
Systems and Control
Optimization and Control
Noise in quantum computing devices poses a key challenge in their realization. In this paper, we study the robustness of optimal quantum annealing protocols against coherent control errors, which are multiplicative Hamlitonian errors causing detrimental effects on current quantum devices. We show that the norm of the Hamiltonian quantifies the robustness against these errors, motivating the introduction of an additional regularization term in the cost function. We analyze the optimality conditions of the resulting robust quantum optimal control problem based on Pontryagin's maximum principle, showing that robust protocols admit larger smooth annealing sections. This suggests that quantum annealing admits improved robustness in comparison to bang-bang solutions such as the quantum approximate optimization algorithm. Finally, we perform numerical simulations to verify our analytical results and demonstrate the improved robustness of the proposed approach.
title Robustness of optimal quantum annealing protocols
topic Quantum Physics
Systems and Control
Optimization and Control
url https://arxiv.org/abs/2408.06782