2000 character limit reached
Elementary solution to the time-independent quantum navigation problem
Published 23 Sep 2014 in quant-ph, math-ph, and math.MP | (1409.6669v1)
Abstract: A quantum navigation problem concerns the identification of a time-optimal Hamiltonian that realises a required quantum process or task, under the influence of a prevailing `background' Hamiltonian that cannot be manipulated. When the task is to transform one quantum state into another, finding the solution in closed form to the problem is nontrivial even in the case of time-independent Hamiltonians. An elementary solution, based on trigonometric analysis, is found here when the Hilbert space dimension is two. Difficulties arising from generalisations to higher-dimensional systems are discussed.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.