.png){kind=icon}
.png){kind=icon}
Return
A Quantum Hamiltonian Identification Algorithm: Computational Complexity and Error Analysis
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2017.2747507.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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(d(3)/root 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.
Keywords:
Computational complexity
Hamiltonian identification
process tomography
quantum system
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W
Organization
View more organizations