Abstract
A quantum control landscape is defined as the expectation value of a target observable Θ as a function of the control variables. In this work, control landscapes for open quantum systems governed by Kraus map evolution are analyzed. Kraus maps are used as the controls transforming an initial density matrix ρi into a final density matrix to maximize the expectation value of the observable Θ. The absence of suboptimal local maxima for the relevant control landscapes is numerically illustrated. The dependence of the optimization search effort is analyzed in terms of the dimension of the system N, the initial state ρi and the target observable Θ. It is found that if the number of nonzero eigenvalues in ρi remains constant, the search effort does not exhibit any significant dependence on N. If ρi has no zero eigenvalues, then the computational complexity and the required search effort rise with N. The dimension of the top manifold (i.e., the set of Kraus operators that maximizes the objective) is found to positively correlate with the optimization search efficiency. Under the assumption of full controllability, incoherent control modeled by Kraus maps is found to be more efficient in reaching the same value of the objective than coherent control modeled by unitary maps. Numerical simulations are also performed for control landscapes with linear constraints on the available Kraus maps, and suboptimal maxima are not revealed for these landscapes.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Journal of Physics A: Mathematical and Theoretical
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.