TY - JOUR
T1 - A Quantum Hamiltonian Identification Algorithm
T2 - Computational Complexity and Error Analysis
AU - Wang, Yuanlong
AU - Dong, Daoyi
AU - Qi, Bo
AU - Zhang, Jun
AU - Petersen, Ian R.
AU - Yonezawa, Hidehiro
N1 - Publisher Copyright:
© 1963-2012 IEEE.
PY - 2018/5
Y1 - 2018/5
N2 - 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.
AB - 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.
KW - Computational complexity
KW - Hamiltonian identification
KW - process tomography
KW - quantum system
UR - http://www.scopus.com/inward/record.url?scp=85028724926&partnerID=8YFLogxK
U2 - 10.1109/TAC.2017.2747507
DO - 10.1109/TAC.2017.2747507
M3 - Article
SN - 0018-9286
VL - 63
SP - 1388
EP - 1403
JO - IEEE Transactions on Automatic Control
JF - IEEE Transactions on Automatic Control
IS - 5
ER -