A Quantum Hamiltonian Identification Algorithm: Computational Complexity and Error Analysis
From MaRDI portal
Publication:5375221
DOI10.1109/TAC.2017.2747507zbMath1395.81092DBLPjournals/tac/WangDQZPY18arXiv1610.08841OpenAlexW3105642582WikidataQ62592966 ScholiaQ62592966MaRDI QIDQ5375221
Jun Zhang, Hidehiro Yonezawa, Yuanlong Wang, Bo Qi, Ian R. Petersen, Dao-Yi Dong
Publication date: 14 September 2018
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.08841
Related Items (8)
Optimal and two-step adaptive quantum detector tomography ⋮ Quantum tomography by regularized linear regressions ⋮ On the capability of a class of quantum sensors ⋮ Exploiting the higher-order statistics of random-coefficient pure states for quantum information processing ⋮ On the regularization and optimization in quantum detector tomography ⋮ Quantum gate identification: error analysis, numerical results and optical experiment ⋮ Analysis of a Greedy Reconstruction Algorithm ⋮ Weak-force sensing in optomechanical systems with Kalman filtering
This page was built for publication: A Quantum Hamiltonian Identification Algorithm: Computational Complexity and Error Analysis
