A Quantum Hamiltonian Identification Algorithm: Computational Complexity and Error Analysis

Yuanlong Wang, Daoyi Dong, Bo Qi*, Jun Zhang, Ian R. Petersen, Hidehiro Yonezawa

*Corresponding author for this work

    Research output: Contribution to journalArticlepeer-review

    84 Citations (Scopus)

    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.

    Original languageEnglish
    Pages (from-to)1388-1403
    Number of pages16
    JournalIEEE Transactions on Automatic Control
    Volume63
    Issue number5
    DOIs
    Publication statusPublished - May 2018

    Fingerprint

    Dive into the research topics of 'A Quantum Hamiltonian Identification Algorithm: Computational Complexity and Error Analysis'. Together they form a unique fingerprint.

    Cite this