The aim of this paper is to provide a short introduction to modern issues in the control of infinite dimensional closed quantum systems, driven by the bilinear Schrödinger equation. The first part is a quick presentation of some of the numerous recent developments in the fields. This short summary is intended to demonstrate the variety of tools and approaches used by various teams in the last decade. In a second part, we present four examples of bilinear closed quantum systems. These examples were extensively studied and may be used as a convenient and efficient test bench for new conjectures. Finally, we list some open questions, both of theoretical and practical interest.
The aim of this paper is to provide a short introduction to modern issues in the control of infinite dimensional closed quantum systems, driven by the bilinear Schrödinger equation. The first part is a quick presentation of some of the numerous recent developments in the fields. This short summary is intended to demonstrate the variety of tools and approaches used by various teams in the last decade. In a second part, we present four examples of bilinear closed quantum systems. These examples were extensively studied and may be used as a convenient and efficient test bench for new conjectures. Finally, we list some open questions, both of theoretical and practical interest.
The subject of controlling quantum systems is not new, but concepts that have been introduced in the last decade and a half, especially that of coherent feedback, suggest new questions that broaden and deepen the field. Here we provide a concise overview and definition of quantum feedback control, both coherent and measurement-based, and discuss its relationship to "standard" time-dependent control; there is a sense in which the latter subsumes the rest. There are many open questions within quantum control and its subfields, and we highlight and discuss some of them here. These questions are of theoretical as well as practical interest: the answers will help to determine the relative power of the different methods of control, and the limits to our ability to control quantum systems imposed by available resources.
Quantum phenomena of interest in connection with applications to computation and communication often involve generating specific transfers between eigenstates, and their linear superpositions. For some quantum systems, such as spin systems, the quantum evolution equation (the Schrödinger equation) is finite-dimensional and old results on controllability of systems defined on on Lie groups and quotient spaces provide most of what is needed insofar as controllability of non-dissipative systems is concerned. However, in an infinite-dimensional setting, controlling the evolution of quantum systems often presents difficulties, both conceptual and technical. In this paper we present a systematic approach to a class of such problems for which it is possible to avoid some of the technical issues. In particular, we analyze controllability for infinite-dimensional bilinear systems under assumptions that make controllability possible using trajectories lying in a nested family of pre-defined subspaces. This result, which we call the Finite Controllability Theorem, provides a set of sufficient conditions for controllability in an infinite-dimensional setting. We consider specific physical systems that are of interest for quantum computing, and provide insights into the types of quantum operations (gates) that may be developed.
Quantum computing comes with the potential to push computational boundaries in various domains including, e.g., cryptography, simulation, optimization, and machine learning. Exploiting the principles of quantum mechanics, new algorithms can be developed with capabilities that are unprecedented by classical computers. However, the experimental realization of quantum devices is an active field of research with enormous open challenges, including robustness against noise and scalabilty. While systems and control theory plays a crucial role in tackling these challenges, the principles of quantum physics lead to a (perceived) high entry barrier for entering the field of quantum computing. This tutorial paper aims at lowering the barrier by introducing basic concepts required to understand and solve research problems in quantum systems. First, we introduce fundamentals of quantum algorithms, ranging from basic ingredients such as qubits and quantum logic gates to prominent examples and more advanced concepts, e.g., variational quantum algorithms. Next, we formalize some engineering questions for building quantum devices in the real world, which requires the careful manipulation of microscopic quantities obeying quantum effects. To this end for N-level systems, we introduce basic concepts of (bilinear) quantum systems and control theory including controllability, observability, and optimal control in a unified frame. Finally, we address the problem of noise in real-world quantum systems via robust quantum control, which relies on a set-membership uncertainty description frequently employed in control. A key goal of this tutorial paper is to demystify engineering aspects of quantum computing by emphasizing that its mathematical description mainly involves linear algebra (for quantum algorithms) and the handling of bilinear control systems (for quantum systems and control theory) but does not require too much detailed knowledge of quantum physics.
In the framework of bilinear control of the Schrödinger equation with bounded control operators, it has been proved that the reachable set has a dense complemement in S∩H2. Hence, in this setting, exact quantum control in infinite dimensions is not possible. On the other hand it is known that there is a simple choice of operators which, when applied to an arbitrary state, generate dense orbits in Hilbert space. Compatibility of these two results is established in this paper and, in particular, it is proved that the closure of the reachable set of bilinear control by bounded operators is dense in S∩H2. The requirements for controllability in infinite dimensions are also related to the properties of the infinite dimensional unitary group.
Over the last two decades the field of quantum simulations has experienced incredible \ngrowth, which, coupled with progress in the development of controllable quantum \nplatforms, has recently begun to allow for the realisation of quantum simulations of a \nplethora of quantum phenomena in a variety of controllable quantum platforms. Within \nthe context of these developments, we investigate within this thesis methods for the \nquantum simulation of open quantum systems. \nMore specically, in the first part of the thesis we consider the simulation of Markovian \nopen quantum systems, and begin by leveraging previously constructed universal \nsets of single-qubit Markovian processes, as well as techniques from Hamiltonian simulation, \nfor the construction of an efficient algorithm for the digital quantum simulation \nof arbitrary single-qubit Markovian open quantum systems. The algorithm we provide, \nwhich requires only a single ancillary qubit, scales slightly superlinearly with respect \nto time, which given a recently proven no fast-forwarding theorem for Markovian dynamics, \nis therefore close to optimal. Building on these results, we then proceed to \nexplicitly construct a universal set of Markovian processes for quantum systems of any \ndimension. Specifically, we prove that any Markovian open quantum system, described \nby a one-parameter semigroup of quantum channels, can be simulated through coherent \noperations and sequential simulations of processes from the universal set. Under the assumption \nthat these universal Markovian processes can be efficiently implemented, this \nallows us to propose an efficient algorithm for a wide class of Markovian open quantum \nsystems, while simultaneously providing a tool for combining and exploiting existing \nsimulation methods. \nIn the second part of this thesis we then consider the simulation of many-body non- \nMarkovian open quantum systems. In particular, we develop an algorithmic procedure \nfor the quantum simulation of system propagators which are not completely positive \nmaps, which allows us to provide an explicit algorithm for the digital quantum simulation \nof many-body locally-indivisible non-Markovian open quantum systems described by \ntime-dependent master equations. Finally we construct generalised Suzuki-Lie-Trotter \ntheorems which allow us to analyse the efficiency of our method, which is expected to \nbe experimentally achievable for a variety of interesting cases.