We review the basic theory of quantum channels and develop a strategy for simulating them on digital quantum computers, drawing upon the Choi-Kraus operator-sum representation and Stinespring dilation to provide a unified approach for various applications. We discuss three types of applications, offering explicit examples for each: the preparation of mixed states, measurements described by positive operator-valued measures (POVMs), and the simulation of the evolution of Markovian quantum systems. We recover fundamental concepts from quantum theory, such as the purification of a mixed state and the Naimark dilation associated with a POVM. Regarding the simulation of the evolution of a Markovian quantum system, we introduce an operator, termed the residual operator, to construct, from the system's Liouvillian, a quantum channel that serves as a first-order approximation of the quantum dynamical semigroup. This allows the simulation of quantum dynamics to be performed in a manner analogous to the Euler method for ordinary differential equations, avoiding Trotterization. We prove all the theoretical results mentioned, with the exception of the fundamental Choi-Kraus theorem concerning the operator-sum representation of quantum channels, for which we provide the appropriate references. The explicit simulations discussed were implemented using the AerSimulator from IBM's Qiskit SDK, with the corresponding code available on GitHub.
We review the basic theory of quantum channels and develop a strategy for simulating them on digital quantum computers, drawing upon the Choi-Kraus operator-sum representation and Stinespring dilation to provide a unified approach for various applications. We discuss three types of applications, offering explicit examples for each: the preparation of mixed states, measurements described by positive operator-valued measures (POVMs), and the simulation of the evolution of Markovian quantum systems. We recover fundamental concepts from quantum theory, such as the purification of a mixed state and the Naimark dilation associated with a POVM. Regarding the simulation of the evolution of a Markovian quantum system, we introduce an operator, termed the residual operator, to construct, from the system's Liouvillian, a quantum channel that serves as a first-order approximation of the quantum dynamical semigroup. This allows the simulation of quantum dynamics to be performed in a manner analogous to the Euler method for ordinary differential equations, avoiding Trotterization. We prove all the theoretical results mentioned, with the exception of the fundamental Choi-Kraus theorem concerning the operator-sum representation of quantum channels, for which we provide the appropriate references. The explicit simulations discussed were implemented using the AerSimulator from IBM's Qiskit SDK, with the corresponding code available on GitHub.
This work presents a new protocol for simulating quantum systems based on quantum state preparation, with various applications such as the simulation of quantum channels and the implementation of general measurements. In general, these applications are modeled by quantum operations and involve completely positive trace-preserving (CPTP) maps. These maps correspond to sets of operators known as Kraus operators, when applied to the simulation of quantum channels, and general measurement operators, when applied to the implementation of non-selective measurements. In the literature, especially when the experimental platform is circuit-based quantum computing, these operators are employed to adjust the parameters of unitary matrices, which are the ones that actually operate in the experiment. To do this, it is necessary to solve a system of nonlinear equations numerically. The new protocol avoids these complications by applying the operators directly over the analytical description of the quantum systems to be simulated. Through the use of isometries and purifications, it models the quantum operations of interest to the experimentalist, whether they are quantum channels or general measurements, enabling the use of software libraries for symbolic algebra to perform exact and automated manipulation of the state vector, with complex amplitudes, to be prepared for simulation. The algebraic manipulation of the state vector provides greater flexibility in experimental planning, as it can be used on any quantum simulation platform. More specifically, it is not restricted to circuit-based quantum computing. Finally, the use of the new protocol is illustrated in the simulation of one-qubit channels, qudits, Lorentz transformations, mixed-state simulations, POVM implementation, and the certification of quantum contextuality via POVMs.
Abstract In this chapter we visit the ‘church of the larger Hilbert space’: we take a closer look at the relationship of pure and mixed quantum states via purification, and discuss a similar connection between completely positive and trace-preserving (CPTP) maps and unitary dynamics on a larger Hilbert space. We show that such CPTP maps, which represent quantum channels, are equivalent to operations admitting a Kraus decomposition, as well as to unitary dynamics on a larger Hilbert space with factoring initial condition, the famous Stinespring dilation of quantum operations. In this context we introduce the Choi-Jamiołkowski isomorphism, which expresses a duality between maps between two Hilbert spaces and states on tensor products of these Hilbert spaces, and we review several important examples of quantum channels such as the dephasing channel, amplitude-damping channel, and depolarizing channel. Finally, we examine operations that are not possible in quantum theory, focusing on the no-cloning theorem.
To “process” the quantum information of a typical quantum system, one has to perform many different processing steps such as free time evolution, controlled time evolution, preparations and measurements. This chapter aims at providing a unified framework for describing all these different operations. The basic idea is to interpret each processing step as a channel, which transforms the system's initial state into the output state the system attains, after completion of the processing. Each channel can be described by a positive and trace-preserving linear map. The chapter also provides some typical examples of channels. It then discusses a relation between completely positive (cp) maps and states of bipartite systems first discovered by M. D. Choi and A. Jamiolkowski, which is very useful in establishing several fundamental properties of cp-maps. The Stinespring dilation theorem is the central structure theorem about cp-maps.
Quantum simulation, which is generically the task to employ quantum computers to simulate quantum physical models, has been one of the most significant motivations of quantum computing. Quantum dynamics, unitary or nonunitary Markovian dynamics driven by local interactions, has been proved to be efficiently simulatable on quantum computers. Extending the underlying models from unitary to nonunitary evolution, and from continuous-time to discrete-time evolution is essential not only for quantum simulation of more general processes, e.g., dissipative processes with evident non-Markovian effects, but also for developing alternative quantum computing models and algorithms. In this thesis, we explore quantum simulation problems mainly from the following three themes. First, we extend quantum simulation framework of Hamiltonian-driven evolution to quantum simulation of quantum channels, combined with the scheme of algorithmic simulation that accepts a promised simulation accuracy, hence algorithmic quantum channel simulation. Our simulation scheme contains a classical preprocessing part, i.e. a classical algorithm for quantum-circuit design, and a quantum part that is the execution of a quantum circuit for the quantum channel simulator. Second, we employ simulation algorithms for arbitrary quantum channels beyond the dilation method. We explore channel decomposition in terms of convex combination of smaller channels, known as generalized extreme channels, which is known as a nontrivial open problem. To attack this problem, we develop an optimization algorithm for approximate decomposition into a convex sum of generalized extreme channels. We provide an ansatz that proves to be able to yield arbitrary generalized extreme channels and allows a precise quantum circuit description. Furthermore, our numerical simulation has demonstrated the validity of our optimization algorithm for low-dimensional quantum channels. Third, by considering quantum simulation problems beyond the rough distinction between digital and analog simulations, and beyond the quantum-state generation problem, we define uniform, strong, and weak quantum simulations from the point view of operator topology. Besides strong simulation of quantum channels, we define a general weak quantum simulation problem, which simulates observable effects instead of the effects on state generation. Also we study the channel simulation problem in the quantum query model, and provide the query complexity by employing uniform quantum simulation method.
In the study of open quantum systems, one commonly describes the evolution of a system of interest through reduced dynamics, obtained by treating the environment indirectly rather than as a part of the full model. This thesis presents an expository account of an alternative, dilation-based viewpoint in the finite-dimensional setting, where a family of reduced dynamics is represented through unitary evolution on a larger system consisting of the original system together with an ancillary environment. After reviewing the reduced-dynamics perspective and the language of quantum channels, we formulate finite-dimensional quantum dynamics as channel-valued dynamical curves and use this framework to discuss Stinespring dilations of such curves. We then present exact dilation results for analytic dynamical curves, explain the singular behavior that can arise at t=0, and describe approximation results showing that Lipschitz-continuous dynamical curves admit approximate finite-dimensional Stinespring dilations. The thesis therefore provides a mathematically focused introduction to dilation-based modeling of quantum dynamics and argues that a change of perspective can lead to new ways of formulating problems in the theory of open quantum systems.
Designing quantum algorithms for simulating quantum systems has seen enormous progress, yet few studies have been done to develop quantum algorithms for open quantum dynamics despite its importance in modeling the system-environment interaction found in most realistic physical models. In this work we propose and demonstrate a general quantum algorithm to evolve open quantum dynamics on quantum computing devices. The Kraus operators governing the time evolution can be converted into unitary matrices with minimal dilation guaranteed by the Sz.-Nagy theorem. This allows the evolution of the initial state through unitary quantum gates, while using significantly less resource than required by the conventional Stinespring dilation. We demonstrate the algorithm on an amplitude damping channel using the IBM Qiskit quantum simulator and the IBM Q 5 Tenerife quantum device. The proposed algorithm does not require particular models of dynamics or decomposition of the quantum channel, and thus can be easily generalized to other open quantum dynamical models.