An Approximate Algorithm for Quantum Hamiltonian Identification with Complexity Analysis
Identification of the Hamiltonian is vital for characterizing the dynamical evolution of a quantum system. The dimension of a multi-qubit system increases exponentially with the qubit number, which usually leads to daunting computational complexity for general Hamiltonian identification algorithms. In this paper, we design an efficient quantum Hamiltonian identification method based on periodical sampling. The computational complexity is O(M2 + MN2), where M is the number of unknown parameters...[Show more]
|Collections||ANU Research Publications|
|Access Rights:||Open Access|
|01_Wang_An_Approximate_Algorithm_for_2017.pdf||363.5 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.