Back to Search Start Over

A Quantum Hamiltonian Identification Algorithm: Computational Complexity and Error Analysis.

Authors :
Wang, Yuanlong
Dong, Daoyi
Qi, Bo
Zhang, Jun
Petersen, Ian R.
Yonezawa, Hidehiro
Source :
IEEE Transactions on Automatic Control. May2018, Vol. 63 Issue 5, p1388-1403. 16p.
Publication Year :
2018

Abstract

Quantum Hamiltonian identification (QHI) is important for characterizing the dynamics of quantum systems, calibrating quantum devices, and achieving precise quantum control. In this paper, an effective two-step optimization (TSO) QHI algorithm is developed within the framework of quantum process tomography. In the identification method, different probe states are input into quantum systems and the output states are estimated using the quantum state tomography protocol via linear regression estimation. The time-independent system Hamiltonian is reconstructed based on the experimental data for the output states. The Hamiltonian identification method has computational complexity $O(d^6)$ , where $d$ is the dimension of the system Hamiltonian. An error upper bound $O(\frac{d^3}{\sqrt{N}})$ is also established, where $N$ is the resource number for the tomography of each output state, and several numerical examples demonstrate the effectiveness of the proposed TSO Hamiltonian identification method. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
00189286
Volume :
63
Issue :
5
Database :
Academic Search Index
Journal :
IEEE Transactions on Automatic Control
Publication Type :
Periodical
Accession number :
130091919
Full Text :
https://doi.org/10.1109/TAC.2017.2747507