Correction: Morzhin, O.V.; Pechen, A.N. Control of the von Neumann Entropy for an Open Two-Qubit System Using Coherent and Incoherent Drives. Entropy 2024, 26, 36.

In the published article [...].

Control of the von Neumann Entropy for an Open Two-Qubit System Using Coherent and Incoherent Drives.

This article is devoted to developing an approach for manipulating the von Neumann entropy S(ρ(t)) of an open two-qubit system with coherent control and incoherent control inducing time-dependent decoherence rates. The following goals are considered: (a) minimizing or maximizing the final entropy S(ρ(T)); (b) steering S(ρ(T)) to a given target value; (c) steering S(ρ(T)) to a target value and satisfying the pointwise state constraint S(ρ(t))≤S¯ for a given S¯; (d) keeping S(ρ(t)) constant at a given time interval. Under the Markovian dynamics determined by a Gorini-Kossakowski-Sudarshan-Lindblad type master equation, which contains coherent and incoherent controls, one- and two-step gradient projection methods and genetic algorithm have been adapted, taking into account the specifics of the objective functionals. The corresponding numerical results are provided and discussed.

Uncomputability and complexity of quantum control.

In laboratory and numerical experiments, physical quantities are known with a finite precision and described by rational numbers. Based on this, we deduce that quantum control problems both for open and closed systems are in general not algorithmically solvable, i.e., there is no algorithm that can decide whether dynamics of an arbitrary quantum system can be manipulated by accessible external interactions (coherent or dissipative) such that a chosen target reaches a desired value. This conclusion holds even for the relaxed requirement of the target only approximately attaining the desired value. These findings do not preclude an algorithmic solvability for a particular class of quantum control problems. Moreover, any quantum control problem can be made algorithmically solvable if the set of accessible interactions (i.e., controls) is rich enough. To arrive at these results, we develop a technique based on establishing the equivalence between quantum control problems and Diophantine equations, which are polynomial equations with integer coefficients and integer unknowns. In addition to proving uncomputability, this technique allows to construct quantum control problems belonging to different complexity classes. In particular, an example of the control problem involving a two-mode coherent field is shown to be NP-hard, contradicting a widely held believe that two-body problems are easy.

Are there traps in quantum control landscapes?

There has been great interest in recent years in quantum control landscapes. Given an objective J that depends on a control field ε the dynamical landscape is defined by the properties of the Hessian δ²J/δε² at the critical points δJ/δε=0. We show that contrary to recent claims in the literature the dynamical control landscape can exhibit trapping behavior due to the existence of special critical points and illustrate this finding with an example of a 3-level Λ system. This observation can have profound implications for both theoretical and experimental quantum control studies.