A data-driven gradient algorithm for high-precision quantum control
A data-driven gradient algorithm for high-precision quantum control
In the quest to achieve scalable quantum information processing technologies, gradient-based optimal control algorithms (e.g., GRAPE) are broadly used for implementing high-precision quantum gates, but their performance is often hindered by deterministic or random errors in the system model and the control electronics. In this paper, we show that GRAPE can be taught to be more effective by jointly learning from the design model and the experimental data obtained from process tomography. The resulting data-driven gradient optimization algorithm (d-GRAPE) can in principle correct all deterministic gate errors, with a mild efficiency loss. The d-GRAPE algorithm may become more powerful with broadband controls that involve a large number of control parameters, while other algorithms usually slow down due to the increased size of the search space. These advantages are demonstrated by simulating the implementation of a two-qubit CNOT gate.
Wu, R.-B.
a900d38c-7ebc-4b4b-96e7-3d2a54205bbb
Chu, B.
555a86a5-0198-4242-8525-3492349d4f0f
Owens, D.H.
db24b8ef-282b-47c0-9cd2-75e91d312ad7
Rabitz, H.
3e81aa62-a017-448f-a82a-8cf03df52899
5 December 2017
Wu, R.-B.
a900d38c-7ebc-4b4b-96e7-3d2a54205bbb
Chu, B.
555a86a5-0198-4242-8525-3492349d4f0f
Owens, D.H.
db24b8ef-282b-47c0-9cd2-75e91d312ad7
Rabitz, H.
3e81aa62-a017-448f-a82a-8cf03df52899
[Unknown type: UNSPECIFIED]
Abstract
In the quest to achieve scalable quantum information processing technologies, gradient-based optimal control algorithms (e.g., GRAPE) are broadly used for implementing high-precision quantum gates, but their performance is often hindered by deterministic or random errors in the system model and the control electronics. In this paper, we show that GRAPE can be taught to be more effective by jointly learning from the design model and the experimental data obtained from process tomography. The resulting data-driven gradient optimization algorithm (d-GRAPE) can in principle correct all deterministic gate errors, with a mild efficiency loss. The d-GRAPE algorithm may become more powerful with broadband controls that involve a large number of control parameters, while other algorithms usually slow down due to the increased size of the search space. These advantages are demonstrated by simulating the implementation of a two-qubit CNOT gate.
This record has no associated files available for download.
More information
Published date: 5 December 2017
Identifiers
Local EPrints ID: 472677
URI: http://eprints.soton.ac.uk/id/eprint/472677
PURE UUID: 6428b9c4-779a-4f21-9ef6-e96ff8935089
Catalogue record
Date deposited: 14 Dec 2022 17:31
Last modified: 17 Mar 2024 03:28
Export record
Altmetrics
Contributors
Author:
R.-B. Wu
Author:
B. Chu
Author:
D.H. Owens
Author:
H. Rabitz
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics