.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Computational complexity
Hamiltonian identification
process tomography
quantum system
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
Realization of mutually unbiased bases for a qubit with only one wave plate: theory and experiment.png)
OPTICS EXPRESSOAAI
OPTICS EXPRESSIF3.3
OAAI分享收藏
查看更多内容