Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Oxford University Press eBooks

Quantum maps

Riccardo Manenti, Mário Motta

Published Aug 25, 2023• 0 citations
Publisher

Abstract

Abstract This chapter is devoted to the discussion of quantum maps. We present three equivalent definitions of a quantum map and important examples, including the depolarizing channel, amplitude damping, and dephasing. We briefly describe the inversion recovery and the Ramsey experiment, two experimental techniques designed to measure the relaxation and coherence time of a qubit. We present the Kraus representation of a quantum map, and we show that quantum maps arise when the dynamics of an additional system are averaged out, a result known as Stinespring’s dilation theorem. Lastly, we present the Choi-Jamiolkowki isomorphism

DOI
10.1093/oso/9780198787488.003.0007

Related papers

Channels and Maps

Michael Keyl, Reinhard F. Werner

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.

Wiley eBooks•Apr 18, 2016•1 citation

Channels and Maps

Michael Keyl, Reinhard F. Werner

This chapter contains sections titled: Introduction Completely Positive Maps The Jamiolkowski Isomorphism The Stinespring Dilation Theorem Classical Systems as a Special Case Examples

Wiley eBooks•Nov 6, 2006•7 citations

Inverting non-bijective maps through recovering channels

Lea Luise Madureira Lautenbacher

In this dissertation we are interested in the dynamics of open quantum systems in the context of quantum information. First, we investigate the dynamics of one qubit at the regime where an inverse evolution is not well defined. This limit is widely used and explored in this work, called as the limit of non-bijectivity. We demonstrate how to compute a completely positive inverse evolution, based on the theory of recovery maps, here to be the Petz recovery map. The analyzed evolutions are the typical decoherence processes: dephasing, depolarizing and amplitude damping channels in the regime of non-bijectivity. To measure how efficient the Petz can be recovering a random quantum state, we use the fidelity function as the figure of merit. Also, we quantify how non-invertible a dynamics is compared to another. As an application for this formalism, in the second part of this work we show how we can explore recovery maps in the context of non-Markovian evolutions, in order to minimize memory effects. We demonstrate that recovering maps can be useful under certain constraints to simulate a non-Markovian evolution by an “almost” Markovian one. We demonstrate that there exists a strong dependence between the success of this strategy and the initial correlations between system and environment.

•Mar 29, 2021•0 citations

Quantum Simulation of Quantum Channels and Applications

Lúcio Souza Fassarella

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.

arXiv:2611.12784•Nov 9, 2026•0 citations

Decoherence models and their effects on quantum maps and algorithms

Mario Leandro Aolita, Marcos Saraceno

In this work we study several models of decoherence and how different quantum maps and algorithms react when perturbed by them. Following closely Ref. [1], generalizations of the three paradigmatic one single qubit quantum channels (these are the depolarizing channel, the phase damping channel and the amplitude damping channel) for the case of an arbitrarily-sized finite-dimensional Hilbert space are presented, as well as other types of noise in phase space. More specifically, Grover's search algorithm's response to decoherence is analyzed; together with those of a family of quantum versions of chaotic and regular classical maps (the baker's map and the cat maps). A relationship between how sensitive to decoherence a quantum map is and the degree of complexity in the dynamics of its associated classical counterpart is observed; resulting in a clear tendency to react the more decoherently the more complex the associated classical dynamics is.

arXiv:quant-ph/0504211•Apr 27, 2005•1 citation

Approximating invertible maps by recovery channels: Optimality and an application to non-Markovian dynamics

Lea Lautenbacher, Fernando de Melo, Nadja K. Bernardes

We investigate the problem of reversing quantum dynamics, specifically via optimal Petz recovery maps. We focus on typical decoherence channels, such as dephasing, depolarizing, and amplitude damping. We illustrate how well a physically implementable recovery map simulates an inverse evolution. We extend this idea to explore the use of recovery maps as an approximation of inverse maps, and apply it in the context of non-Markovian dynamics. We show how this strategy attenuates non-Markovian effects, such as the backflow of information.

arXiv:2111.02975•Physical Review A•Apr 13, 2022•17 citations
Abstract This chapter is devoted to the discussion of quantum maps. We present three equivalent definitions of a quantum map and important examples, including the depolarizing channel, amplitude damping, and dephasing. We briefly describe the inversion recovery and the Ramsey experiment, two experimental techniques designed to measure the relaxation and coherence time of a qubit. We present the Kraus representation of a quantum map, and we show that quantum maps arise when the dynamics of an additional system are averaged out, a result known as Stinespring’s dilation theorem. Lastly, we present the Choi-Jamiolkowki isomorphism
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.
In this dissertation we are interested in the dynamics of open quantum systems in the context of quantum information. First, we investigate the dynamics of one qubit at the regime where an inverse evolution is not well defined. This limit is widely used and explored in this work, called as the limit of non-bijectivity. We demonstrate how to compute a completely positive inverse evolution, based on the theory of recovery maps, here to be the Petz recovery map. The analyzed evolutions are the typical decoherence processes: dephasing, depolarizing and amplitude damping channels in the regime of non-bijectivity. To measure how efficient the Petz can be recovering a random quantum state, we use the fidelity function as the figure of merit. Also, we quantify how non-invertible a dynamics is compared to another. As an application for this formalism, in the second part of this work we show how we can explore recovery maps in the context of non-Markovian evolutions, in order to minimize memory effects. We demonstrate that recovering maps can be useful under certain constraints to simulate a non-Markovian evolution by an “almost” Markovian one. We demonstrate that there exists a strong dependence between the success of this strategy and the initial correlations between system and environment.
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.
In this work we study several models of decoherence and how different quantum maps and algorithms react when perturbed by them. Following closely Ref. [1], generalizations of the three paradigmatic one single qubit quantum channels (these are the depolarizing channel, the phase damping channel and the amplitude damping channel) for the case of an arbitrarily-sized finite-dimensional Hilbert space are presented, as well as other types of noise in phase space. More specifically, Grover's search algorithm's response to decoherence is analyzed; together with those of a family of quantum versions of chaotic and regular classical maps (the baker's map and the cat maps). A relationship between how sensitive to decoherence a quantum map is and the degree of complexity in the dynamics of its associated classical counterpart is observed; resulting in a clear tendency to react the more decoherently the more complex the associated classical dynamics is.
We investigate the problem of reversing quantum dynamics, specifically via optimal Petz recovery maps. We focus on typical decoherence channels, such as dephasing, depolarizing, and amplitude damping. We illustrate how well a physically implementable recovery map simulates an inverse evolution. We extend this idea to explore the use of recovery maps as an approximation of inverse maps, and apply it in the context of non-Markovian dynamics. We show how this strategy attenuates non-Markovian effects, such as the backflow of information.