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.


Introduction
Quantum control aims to find external actions (i.e., control policies) driving the dynamics of a quantum system such that a chosen target reaches a certain value, typically an extrema. Consider either an open or closed quantum system with the density matrixρ t (u) at time t evolving under the action of some time-dependent control u = u(t). The following two control tasks play a prominent role: i) The problem of maximizing the expectation value of an observableÔ at time T is to find u such that Tr [ρ T (u)Ô] → max. ii) The problem of a target density matrix preparationρ f is to construct u such that ρ T (u)−ρ f 2 → min. Quantum control is of high interest due to fundamental aspects and many existing and prospective applications in quantum technologies including metrology, information processing, and matter manipulation [1][2][3][4][5][6][7][8][9]. Controls can be continuous pulses [3,7], discrete transformations [10][11][12], or combined continuous and discrete transformations, e.g., with instant quantum measurements [13][14][15].
The theory of Diophantine equations appears to be totally unrelated to quantum control. A Diophantine equation, D(x 1 , . . . , x n ) = 0, is a polynomial equation with integer coefficients solved with respect to positive integer unknowns x 1 , . . . , x n . We note that this is a much more generic formulation than it originally appears. For * Electronic address: dbondar@tulane.edu; URL: https://bondar. tulane.edu/ † Electronic address: apechen@gmail.com; URL: www.mathnet.ru/ eng/person17991 example, an exponential Diophantine equation is a Diophantine equation additionally containing at least one term of the form m n , where m and n are nonnegative integers and either both n, m or n alone are unknown. Matiyasevich [16,17] has surprisingly shown that solving an exponential Diophantine equation is reducible to solving the (polynomial) Diophantine equation. Finding a rational solution of a polynomial equation with rational coefficients is also reducible to solving a Diophantine equation. Diophantine equations are among the oldest branches of mathematics still actively studied. They also appear in quantum mechanics in a variety of contexts. For example, when deciding whether a quantum transition can be excited by a laser field consisting of n commensurate frequencies [18]. Utilizing the solutions of the exponential Diophantine Ramanujan-Nagell equation, Pavlyukh and Rau [19] established that only in the case of one and two qubit systems unitary transformations can be visualized as rotations. Kieu (Sec. 4 of [20]) noted that a Diophantine equation has a solution if and only if the HamiltonianĤ = [D(â † 1â 1 , . . . ,â † nân )] 2 for n noninteracting bosons has the zero ground state. Hereâ j andâ † j are the creation and annihilation operators, respectively, for j-th boson.
Diophantine equations are closely related to the theory of computability. A problem is called computable or decidable if in principle there exists an algorithm solving it. For the analysis of computability, the Turing machine [21] is a convenient mathematical model of the intuitive notion of algorithm; thus, the "algorithm" and "computer program" are used as the synonyms to the Turing machine throughout. The link between Diophantine equations and computability is estab-FIG. 1: A physical system for simulating Diophantine equations with n variables. The system is either n trapped ions or an n-mode coherent field. The controlsD † 1 , . . .,D † n independently address each subsystem. For ions, the controls excite transitions between nearest levels, and transfer population of the highest excited state down to the ground state. For coherent states, the control for the i-th mode is the displacement Di by the magnitude one. The Diophantine polynomial is embedded in the observableÔ whose expectation value has to be optimized as the control goal. A highly non-trivial example corresponds already to the simple case of a two-mode coherent , where α, β, and γ are positive integers. The observable is non-linear but physical; its leading term is of the Kerr-type nonlinearity. Maximizing the expectation of this observable is NP-hard, i.e., it is at least as hard as the famous Traveling Salesman Problem. Note that an n = 9 system is sufficient to solve any Diophantine equation.
lished by the Matiyasevich-Robinson-Davis-Putnam theorem, which gaves the negative answer to Hilbert's tenth problem [16,17], meaning that there is no algorithm deciding whether an arbitrary given Diophantine equation is solvable. Furthermore, many open mathematical problems, including the Riemann hypothesis specifying the zeros of the Riemann zeta function, can be reformulated as questions about solvability of specially constructed Diophantine equations [22]. It is noteworthy that the Riemann zeta function emerges in quantum statistical mechanics [23,24], quantum entanglement and coherence [25][26][27][28], random matrix theory [29,30], string theory and related settings [31]. This enables a physical assessment of the Riemann hypothesis. Unfortunately, the required physical systems are not available off-theshelf and need to be finessed, which remains a challenge. Recently a vigorous debate has been initiated by the proposal [32] to reduce the Riemann hypothesis to the quantization of the classical Hamilton 2xp.
Physics is also full of noncomputable problems. The undecidability of the presence of chaos in classical Hamiltonian systems has been established in [33]. The problem whether a boolean combination of subspaces (including negations) is reachable by a quantum automation was proved to be undecidable [34]. The question whether a quantum system is gapless also cannot be decided by an algorithm [35][36][37]. Whether a many-body model is frustration-free is undecidable as well [38]. Smith (Sec. 6 of [39]) identified a striking physical consequence of the Hilbert's tenth problem that ground state energies and half-life times of excited states are, strictly speaking, non-computable for many-body systems. A variety of seemingly simple problems in quantum information theory has been shown not to be decidable [40]. The question whether a sequence of outcomes of some sequential measurement cannot be observed is undecidable in quantum mechanics, whereas it is decidable in classical physics [41]. In this case, the algorithmic undecidability turned out to be the signature of quantumness.
Despite a significant interest to computability of various physical problems, to the best of our knowledge, computability of quantum control has not been systematically studied. The aim of this work is to fill this gap. We establish a connection between optimal quantum control and Diophantine equations and show how the latter emerges in control of various physical systems such as, e.g., a multi-mode coherent field driven by displacement operators of the fixed magnitude (Fig. 1). It is noteworthy that Diophantine equations were mentioned in [40] as a possible tool to analyze computability of quantum information tasks, but it has never been put to use. Furthermore, Theorem 2 in [40] may be interpreted to imply the undecidability of control task (i) for a finite dimensional quantum system even though "quantum control" is never mentioned in the preprint [40]. In this work, we not only prove uncomputability of quantum control by a different method and generalize to infinite dimensional quantum systems, but also show that even approximate quantum control tasks (i.e., for which it is sufficient to find an optimum with a ε-accuracy) remain uncomputable as long as ε is small enough. A general scheme to construct control tasks of various complexity classes is also developed.
In particular, we show that solving a Diophantine equation is equivalent to solving a certain quantum control task, and moreover, any question for which a computer program can give an answer can be stated as a quantum control task. This means that quantum control is Turing complete. In our approach the Diophantine equation is embedded in the target observableÔ whose expectation value has to be optimized as the control goal. This implies uncomputability of quantum control tasks (i) and (ii) introduced at the beginning. From a pragmatic point of view, this results means that there is no algorithm that outputs "true" or "false" whether a control sequence composed from a finite set of available controls exists to maximize either the observable's expectation or state-to-state transfer in an arbitrary generic case. This, however, does not exclude the possibility that some particular classes of control problems can have such an algorithm. The uncomputability motivates use of heuristics, e.g., such as machine learning [42]. Moreover, any control problem can be made algorithmically solvable if we deploy a sufficiently flexible controls.
Our technique based on establishing the equivalence between quantum control problems and Diophantine equations also enables knowledge transfer from the complexity theory for Diophantine equations to quantum control theory. In particular, one can construct control problems belonging to various complexity classes. A highly non-trivial example corresponds already to a seemingly simple case of two-mode coherent field (n = 2) with target observableÔ = −(αâ † 1â † 1 + βâ † 2 − γ)(αâ 1â1 + βâ 2 − γ), where α, β, and γ are positive integers. The controlled evolution is represented by a family of simple bosonic Gaussian channels. (Note that bosonic Gaussian channels play an important role in quantum information science [43].) Maximizing the expectation ofÔ is NPhard, i.e., it is at least as hard as the famous Traveling Salesman Problem.
The rest of the paper is organized as follows: We proceed by giving a precise mathematical formulation of the quantum control problem. Then, we show how for a given quantum control problem to construct a Diophantine equation whose solution yields the optimal control policy. After that we demonstrate the converse: how to simulate a given Diophantine equation using quantum control. Finally, the uncomputability and complexity of the considered quantum control tasks are discussed.
Consider coherent control of an n-dimensional closed quantum system whose dynamics is governed by the Schrödinger equation for the unitary evolution operator HereĤ 0 andV are the free and interaction Hamiltonians and u(t) is a time-dependent control (e.g., a shaped laser pulse). Interaction with several controls can be described similarly. The control u(t) is commonly assumed to belong to some functional space, e.g., to the space A key notion is the controllability of the system. A (closed) quantum system is pure state controllable if any two pure initial |ψ i and final |ψ f states can be connected by some control such that |ψ f =Û u t |ψ i for some t and u. The famous result is that the system is projective state controllable if and only if the Lie algebra Lie −iĤ 0 , −iV , gen-erated by all commutators of operators −iĤ 0 and −iV , is isomorphic to the Lie algebra sp(n/2) or su(n) for even n, or su(n) for odd n.
A typical quantum control goal is to maximize objective JÔ(u) = Ô , which is expectation value of an ob-servableÔ. Without the loss of generality, the maximum value of Ô (i.e., the largest eigenvalue ofÔ) can be assumed to be zero since adding a constant toÔ has no physical consequences. If the system is controllable, then this maximum value is attained by some control. Thus, the problem of existence of a globally optimal control u * , i.e., such that JÔ(u * ) = 0, is reduced to calculation of the rank of the Lie algebra Lie −iĤ 0 , −iV , which can be done algorithmically for all finite-dimensional quantum controlled systems. In particular, this implies that establishing controllability of a quantum system is a computable task.

Digitized Quantum Control
The assumption that controls belong to some infinitedimensional functional space, while convenient mathematically, is not realistic from an engineering perspective. In experiments, one always has a limited finite number of available controls. A typical example is bang-bang control where u(t) admits only two (on/off) values, or a switching control that can take several values. Any continuous control function in experiments is approximated by some, usually small enough, set of values. Thus in laboratory and numerical experiments, both coherent and incoherent types of controls are digitized, which imposes the discretization and boundedness for the accessible values. The number of available controls N is always finite, albeit large. Moreover, the measured or computed values of physical quantities have a finite precision, and thus can be represented as rational numbers. The importance of this fact lead to the development of the p-adic mathematical physics [56,57].
The most general state of a controlled quantum system is represented by a density matrixρ, which is a positive trace one operator in the system Hilbert space H. The transformation of the system's initial density matrix ρ 0 into the final density matrix under the action of the i-th control (i = 1, . . . , N ) most generally can be represented by a Kraus map Φ i , i.e., a completely positive trace preserving transformation [58]. Such maps have a (non-unique) operator-sum representation [59] HereK i,j are (in general non-commuting) operators in H that satisfy the condition jK † i,jK i,j = I to guarantee the trace preservation for the density matrix.
We define the Digitized Quantum Control as a task of finding the control policy p specified by an integer sequence of length P , p = (p 1 , p 2 , . . . , p P ) ∈ AP , which is from some set of accessible policies AP , such that the propagated quantum stateρ(p) = Φ p P · · · Φ p1 [ρ 0 ] yields an extremum for a desired objective function.
In particular, for the problem of preparing a target density matrix, when a quantum system is steered to a desired stateρ f , one seeks the control policy p (if it exists) vanishing the objective function This objective equals to zero if and only ifρ(p) =ρ f .
A special yet equally important instance of the quantum state preparation problem is the problem of maximizing the expectation value of an observableÔ. Without the loss of generality, the maximum value of Ô is set to zero. In this case, the goal is to find a control policy vanishing the objective function A particular case is the problem of steering an initial pure state |ψ i into a final pure state |ψ f . For this problem, O = |ψ f ψ f | is the projector onto the final state and ρ 0 = |ψ i ψ i | is the projector on the initial state, and the objective becomes the transition probability, (3) and (4) are related by the equality , where ρ f 2 is a constant independent of the control policy. In the general case, the problem of minimizing F cannot be reduced to maximizing J, as illustrated by the example of a qubit withρ f = I/2 for which Jρ f (p) = 1/2 is constant for any p, while Fρ f (p) = const + ρ(p) 2 is non-constant. However, in the case of pure initial |ψ i and final |ψ f states and controls restricted to unitary transformations, the problem (3) reduces to (4) withÔ = |ψ f ψ f | − 1. Indeed, according to the Cauchy-Schwarz inequality, for an arbitrary state |φ , Ô = φ|Ô|φ ≤ 0 and the equality Ô = 0 takes place if and only if |φ = |ψ f . The latter guarantees that the desired final state |ψ f is reached once maximization of (4) is converged. Note that problem (4) is a special case of problem (3) since minimizing (4) is equivalent to minimizing (3) withρ f chosen as the projector onto the eigenstate corresponding to the largest eigenvalue ofÔ.
Let us give examples of digitized quantum control. The simplest example is bang-bang control, which is switched on and off at some time instants, or more generally, is switched between two (maximal and minimal) values of its amplitude. In coherent control setting, steering quantum dynamics is achieved by tailoring the time profile of a laser pulse, whose intensity and bandwidth should not exceed engineering capabilities. The temporal form of the laser pulse can have the form u(t) = P j=1 A j χ [tj ,tj+1] (t), where χ [tj ,tj+1] is the characteristic function of the fixed time interval [t j , t j+1 ] and A j is the pulse intensity at the j-th time interval to be chosen among N available pulse intensities. Another example is the field of the form u(t) = P j=1 A j cos ω j t, where ω i are some fixed frequencies and the amplitudes A j are sought controls. In both cases the set AP of all attainable laser pulses has N P elements. In quantum computing, digitized quantum control mimics the problem of building a desired unitary transformation of a multi-qubit state using a finite number of universal quantum gates [60,61], as well as various problems of finite computability [62]. The discrete-time control [10][11][12][13][14] is also a particular type of digitized quantum control.
The digitized quantum control describes a very wide class of quantum control problems and has the following generic properties: (i) The optimization problem (4), in general, cannot be solved by the control policy of a finite length (see Theorem 2 in Methods). This results follows from the fact that there is a continuum of digitized quantum control formulations, while finite-length controls form at most a countable set.
(ii) For any observable and an arbitrary initial state, the relaxed condition JÔ ≈ 0 can be satisfied with any desired error for a control policy of a finite length if the set of controls is rich enough (see Theorem 3 in Methods). For example, one can use the dissipative interaction to cool the quantum system to the ground state, and then rotate this state using a tailored unitary transformation constructed from a set of universal quantum gates to the state with Ô ≈ 0 (i.e., to the eigenstate ofÔ corresponding to the largest eigenvalue).
According to the first property, time-discretization alone makes a quantum control problem ill-posed. For example, for closed systems there is no finite set of elementary unitary transformations that would exactly map a given pure initial state into a given pure target state. However, exact attainability of the target state is not required in practice. It is always sufficient to steer the system into a small neighborhood of the target state. The digitization, combining discretization and a finite precision, makes the problem well posed as per the second property. Theorem 3 shows that for some (specially constructed) set of accessible controls such an approximate attainability is achievable in a finite number of steps. The finiteness, in turn, automatically implies algorithmic solvability since straightforward, albeit time consuming, looping through all the allowed control policies is guaranteed to terminate with uncovering the sought control strategy. The algorithmic solvability for this special control set, however, does not imply computability for any other set. In practical terms, Theorem 3 means that any approximate quantum control task can be made solvable if the set of accessible controls is rich enough.
Reduction of digitized quantum control to a Diophantine equation As discussed above, in laboratory and numerical experiments elements of the matricesK i,k ,ρ 0 ,ρ f andÔ are complex numbers with rational imaginary and real parts. Using this fact, consider the matrix valued polynomials of the positive integer argument î By constructionφ j (i) ≡K i,j for 1 ≤ i ≤ N . For every fixed j, equation (5) Finally, the policy p solves the state preparation problem (3) if and only if it solves the Diophantine equation Both the terms in Eq. (7) are non-negative. The sum equals to zero only if each term vanishes. The first term is zero if and only if the control policy p is optimal, i.e., ρ(p) =ρ f . The last term equals to zero if and only if the control policy p is an accessible control, i.e., its components satisfy p k = p k for some p ∈ AC.
In the similar fashion, the policy p solves the problem of maximizing the expectation value (4) if and only if it solves the Diophantine equation where the reduction of the objective function JÔ to a polynomial with rational coefficients reads Note that there are many other ways to construct polynomials (6) and (9). We now show that the problem of finding a control policy bringing the value of an objective function approximately close to the extremum (with a desired degree of accuracy) is also reducible to solving a Diophantine equation. To present the derivation in a unified fashion, let G(p) denote either J 2 (p) or F(p). By definition G(p) ≥ 0 [i.e., it follows from Eqs. (9) and (6)]. Thus, reaching close to the optimum means that for a given rational ε > 0, G(p) < ε. Using the methods presented in Ch. 1 of Ref. [16], we observe that the inequality is satisfied if and only if there are positive integers a and b such that G(p) + a/b = ε. Lagrange's four-square theorem, stating that a positive integer can be written as the sum of four integer squares, lifts the requirement of the positivity of a and b, leading to the following Diophantine equation with ancillary unknowns a 1 , . . . , a 4 , b 1 , . . . , b 4 : Finally, by constraining control policies to the accessible set AP , we obtain the sought Diophantine equation for the control policy p yielding the optimum within an εaccuracy

Simulation of a Diophantine equation with digitized quantum control
Here we show how to simulate the problem of finding positive integer solutions of a Diophantine equation D(x 1 , . . . , x n ) = 0 with digitized quantum control. Let us introduce X-dimensional vectors |e k containing 1 in the k-th position and zeros elsewhere, the matrix H = diag (1, 2, . . . , X) and the unitary X × X shift ma-trixΣ obeyingΣ|e k = |e k+1 , where |e X+1 = |e 1 is assumed. Define also for l = 1, . . . , n Since all matricesĤ l commute by construction, the eigenvalues and eigenvectors of the matrixD = D(Ĥ 1 , . . . ,Ĥ n ) are given by where 1 ≤ x l ≤ X. This relation allows to formulate the equivalence between Diophantine equations and quantum control: The motivation for this construction is as follows (see also Fig. 1): The vector |e k encodes integer k asĤ|e k = k|e k ; similarly, vector |e x1 , . . . , e xn encodes an integer tuple (x 1 , . . . , x n ). The initial density matrixρ 0 represents the n-tuple (1, . . . , 1). The action of each Φ l onto a density matrix encoding a tuple (x 1 , . . . , x n ) is equivalent to the operation x l → x l + 1 of incrementing the tuple's l-th component. To scan all the values of x l from 1 to X, Φ l needs to sequentially act X times ontoρ 0 . Thus, the length of the policy should be at least nX to scan through all possible combinations of the n variables. The trivial identity transformation Φ 0 (not modifying the density matrix) is employed due to the following reason: Assume the value of the l -th component of the solution of the Diophantine equation is L < X, then Φ l should be used only L times followed by (X − L) applications of Φ 0 .
The construction above employs only unitary operations. However, the described method can be adopted to use the amplitude damping Kraus maps [59]. Consider the Kraus  The two presented constructions have a drawback that they involve the upper bound X for a sought solution.
The displacement operatorD l acts on l-th mode aŝ D l | . . . , α l , . . . = | . . . , α l + 1, . . . and describes the increase of the laser intensity by the magnitude one for the l-th mode without altering the phase. Thus, the maximum of the objective function, JÔ = 0, is reached only by the coherent state |x 1 , . . . , x n such that D(x 1 , . . . , x n ) = 0. Unlike number states, which are difficult to create experimentally, this reduction uses only easily available coherent states describing laser radiation. The presented formulation is open to a number of generalizations.
Solving a Diophantine equation can also be reduced to solving an optimization problem with an ε-accuracy for a sufficiently small ε. This readily follows from the above constructions. Chosen controls and initial quantum state ensure that Ô takes only non-positive integer values during optimization. Thus, for any 0 < ε < 1, finding a control policy that −ε ≤ Ô ≤ 0 (i.e., optimal with an εaccuracy) is equivalent to reaching the maximum Ô = 0. This conclusion holds for ε < 1 which is relatively small in comparison with typical values of the objective (i.e., values of the Diophantine polynomial evaluated at integer arguments). If the allowed error is large enough then a separate analysis is needed, which is beyond the scope of this work.
The found equivalence of Diophantine equations and digitized quantum control employs commuting Kraus maps. They can be viewed as a faithful matrix formulation of the special Turing machine that was constructed in section 5.4 of [16]. This Turing machine for any given Diophantine equation loops through all the tuples of positive integers and halts when a solution is found. The formulation obtained in the present work is not necessarily optimal, e.g., in the number of used Kraus maps. Constructing more compact representations relying on non-commutative operators and using quantum interferences should be a subject of future work. Furthermore, the presented reduction transfers the complexity of a Diophantine equation into the observable while keeping controls simple. Different constructions that distribute the complexity between the control and observable should be investigated.
By including additional unknowns any Diophantine equation can be transformed to the equivalent forth order equation [16]. The number of unknowns can be decreased down to 9 by increasing the degree of the Diophantine polynomial [63]. These observations imply that for digitized quantum control with multimode coherent states, it is always sufficient to use no more than 9 modes by utilizing a higher order polynomial observable; whereas, the order of nonlinearities can be decreased to 4 by increasing the number of modes.

Uncomputability and complexity of digitized quantum control
The Matiyasevich-Robinson-Davis-Putnam theorem [16,17] uncovers an equivalence between sets of solutions of Diophantine equations and sets of outputs of computer programs, which are allowed to run forever. The reduction of a computer program to the corresponding Diophantine equation is constructive. The Matiyasevich-Robinson-Davis-Putnam theorem leads to the negative resolution of Hilbert's tenth problem [16,17], meaning that the solvability of an arbitrary Diophantine equation is not decidable.
The negative resolution of Hilbert's tenth problem also implies the uncomputability of digitized quantum control. Moreover, digitized quantum control with an εaccuracy for small enough ε are also uncomputable.
Thus, the problem of maximizing an expectation value (4) is undecidable and so is the problem of quantum state preparation (3) since the former is a special case of the latter. This means that there is no algorithm deciding on the existence or non-existence of an optimal control solution for an arbitrary digitized quantum control problem. This finding does not preclude an algorithmic solution for a particular digitized quantum control problem. It is noteworthy that tracking the time-evolution of an observable [64,65] is a manifestly algorithmically solvable quantum control problem, which nevertheless cannot be reduced to either objective function (3) or (4).
The established equivalence between digitized quantum control and Diophantine equations can be used to synthesize quantum control problems belonging to a certain computational complexity class. For example, finding an optimal control policy to reach Ô = 0 witĥ is NP-hard. This is a consequence of the fact that it is an NPcomplete problem to decide the solvability of the Diophantine equation αx 2 1 + βx 2 = γ with respect to x 1 and x 2 [66]. Therefore, this digitized quantum control problem is at least as hard as the celebrated Traveling Salesman Problem. Note that the leading nonlinearity in O is of the Kerr type (see, e.g., [67,68]), which makes this proposal of experimental interest.
On the contrary, our technique can also be used to construct simple quantum control problems. For example, finding an optimal control policy to reach Ô = 0 2â2 − 1) is easy because x 1 = 1, x 2 = 0 is the only solution of the Pell's Diophantine equation x 2 1 − n 2 x 2 2 = 1 in non-negative integers.
It is worth comparing our findings with the theory of quantum control landscapes [69], which studies the objective, e.g., JÔ(u), as a functional of the control u = u(t), which is an arbitrary time dependent function not restricted to integer sequences. If the objective has only global maxima (i.e., local maxima are absent), then a gradient algorithm converges to an optimal control. In this work, we consider a different situation when there is a finite number of basic elementary controls that can be applied multiple times and in an arbitrary time order. This is the case of digitized quantum control, for which no algorithm can find a solution in the general case. In Ref. [70], it has been shown how the control landscape of digitized quantum control problems can be mapped to a classical Ising model, which among other things reveals that the connection between easy and hard control tasks is akin to a phase transition.
Our reduction of Diophantine equations to quantum control problems allows to formulate various mathematical conjectures as, perhaps extremely complex, quantum control tasks, thereby in principle providing a route for experimental assessment for the unsolved conjectures. As an example, consider the Riemann hypothesis. Matiyasevich wrote the explicit form of the Diophantine equation with the property that it has infinitely many solutions if the hypothesis is false and has no solution if the hypothesis is true [22]. Using our approach the Riemann hypothesis can be reformulates as some quantum control problem albeit extremely complex. Moreover, quantum control can be applied to evaluate any mathematical expression formed from arithmetic (+, ×, −, =) and logical (>, "and", "or") operations, existential quantifiers (e.g., ∃x -there exists x), and bounded universal quantifiers (e.g., ∀x < M -for all x less than M ). A constructive proof that such expressions are equivalent to solving Diophantine equations can be found in chapters 1 and 6 of [16].

Discussion
Computability of quantum control problems has been analyzed. A realistic situation, when a number of controls is finite, has been considered. We have shown that within this setting solving quantum control problems is equivalent to solving Diophantine equations. As a consequence, quantum control is Turing complete. The established equivalence is a new technique for quantum technology that, e.g., allows to construct quantum problems belonging to a specific complexity class. Examples of a multimode coherent field control are explicitly constructed. The negative answer to the Hilbert's tenth problem implies that there is no algorithm deciding whether there is a control policy connecting two quantum states represented by arbitrary pure or mixed density matrices, i.e., the most general fixed-time quantum state-to-state control problem is not algorithmically solvable. This result applies to the problems of finding exact as well approximate solutions for sufficiently small errors. Our method opens up an opportunity to recast many open mathematical problems, including the Riemann hypothesis, as quantum control tasks. The uncovered non-algorithmic nature makes quantum control a fruitful research area.

Methods
We shall prove two theorems elucidating properties of digitized quantum control. Theorem 2. There are digitized quantum control problems for which the condition JÔ(p) = J 0 for some J 0 such that O min ≤ J 0 ≤ O max (O min and O max are minimal and maximal eigenvalues ofÔ) is never satisfied by any control policy of finite length.
Proof. Consider a specific class of digitized quantum control problems with Kraus maps Φ i being unitary rotations, Φ i [ρ] =V iρV † i ,V iV † i =Î, and the initial density matrixρ 0 = |ψ ψ| corresponding to a pure state. In this case, the negation of the theorem statement implies that for everyÔ and |ψ there exists a policy p of a finite length P such that JÔ(p) = J 0 , where JÔ(p) = ψ| The latter establishes a correspondence between an arbitrary unitary matrix and a finite integer sequence p. Thus we reached the contradiction that the set of all unitary matrices is countable.
Theorem 3. For an n-dimensional quantum system, there exists a finite set of Kraus map controls such that for anyρ 0 ,Ô, J 0 (O min ≤ J 0 ≤ O max ), and an arbitrary > 0, there is a control policy of a finite length satisfying |JÔ − J 0 | < .
Proof. Let |ψ be any pure state of the quantum system. Then there exists a universally optimal Kraus map [71] Φψ such that Φψ(ρ) = |ψ ψ | for any density matrixρ. Kraus operators for this universally optimal Kraus map have the formK i = |ψ χ i |, where {|χ i } n i=1 is an orthonormal basis in the system Hilbert space.
Consider the (finite) setK = {Φψ} ∪ K of Kraus maps, where one map is non-unitary and all other are unitary. Then the constructed set satisfies the statement of the theorem. Indeed, let |ψ be the vector constructed in the proof of Theorem 2. LetÛ be a unitary operator such thatÛ |ψ = |ψ , andŜ =Ŝ k · · ·Ŝ 1 be its / Ôapproximation by elements of U. Then for the finite composition Φ = Φ k . . . Φ 1 Φψ we have |JÔ − J 0 | < .
We remark that, by construction, there are infinitely many setsK satisfying the theorem. Indeed, the map Φψ can be chosen for any vector |ψ and moreover, there exist infinitely many sets of unitary operators U.