A Quantum Hamiltonian Identification Algorithm: Computational Complexity and Error Analysis
From MaRDI portal
Abstract: Quantum Hamiltonian identification 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) quantum Hamiltonian identification algorithm is developed within the framework of quantum process tomography. In the identification method, different probe states are inputted 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/N^(1/2))$ 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.
Recommendations
- Hamiltonian identification for quantum systems: well-posedness and numerical approaches
- Quantum Hamiltonian Identifiability via a Similarity Transformation Approach and Beyond
- Hamiltonian identification for quantum systems via quantum ensemble classification
- An optimal quantum algorithm for the oracle identification problem
- On the efficiency of quantum algorithms for Hamiltonian simulation
- Observer-based Hamiltonian identification for quantum systems
- Hamiltonian‐based error computations
- A Quantum Algorithm for Finding a Hamilton Circuit
- Quantum algorithms for Hamiltonian simulation
- Quantum Hamiltonian Complexity
Cited in
(12)- Quantum gate identification: error analysis, numerical results and optical experiment
- Optimal and two-step adaptive quantum detector tomography
- Quantum tomography by regularized linear regressions
- On the capability of a class of quantum sensors
- Analysis of a greedy reconstruction algorithm
- Quantum Hamiltonian Identifiability via a Similarity Transformation Approach and Beyond
- Weak-force sensing in optomechanical systems with Kalman filtering
- Exploiting the higher-order statistics of random-coefficient pure states for quantum information processing
- On the regularization and optimization in quantum detector tomography
- Quantum state tomography from observable time traces in closed quantum systems
- Review of qubit-based quantum sensing
- Information-geometric quantum process tomography in unital open single-qubit dynamics
This page was built for publication: A Quantum Hamiltonian Identification Algorithm: Computational Complexity and Error Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5375221)
