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

arXiv:1909.06118 · Physical Review A

Quasi-inversion of qubit channels

Vahid Karimipour, Fabio Benatti, Roberto Floreanini B

Published Mar 16, 2020• 13 citations
arXivHTMLPDF

Abstract

In general quantum operations, or quantum channels cannot be inverted by physical operations, i.e., by completely positive trace-preserving maps. An arbitrary state passing through a quantum channel loses its fidelity with the input. Given a quantum channel $\mathcal{E}$, we discuss the concept of its quasi-inverse as a completely positive trace-preserving map ${\mathcal{E}}^{qi}$ which when composed with $\mathcal{E}$ increases its average input-output fidelity in an optimal way. The channel ${\mathcal{E}}^{qi}$ comes as close as possible to the inverse of a quantum channel. We give a complete classification of such maps for qubit channels and provide quite a few illustrative examples.

DOI
10.1103/physreva.101.032109

Related papers

Quasi-inverse of qubit channels for mixed states

Muhammad Faizan, Muhammad Faryad

We found the quasi inverse of qubit channels as a unitary map, $\mathcal{E}^i$, by minimizing the average trace distance between the input state to the channel and the output of the quasi inverse channel for arbitrary qubit channel $\mathcal{E}$ and for arbitrary input states. The channel $\mathcal{E}$ was assumed completely positive and trace-preserving. To find the quasi inverse for mixed states, we proposed an alternative definition of the quasi inverse based on the mean square of the trace distance (MSTD) of a channel. The definition based on the trace distance allowed easy generalization of the quasi inverse to mixed input states. The quasi inverse of the Pauli, generalized amplitude damping, mixed unitary, and tetrahedron channels calculated based on the MSTD agreed with the one computed using average fidelity in the special case of input states being pure.

arXiv:2410.02414•Physical Review A•Jun 24, 2025•0 citations

On Quasi-Inversion of Quantum Channels in 2 and in Higher Dimensions

Vahid Karimipour

We review the concept of the quasi-inverse of qubit channels and of higher dimensional channels. Quasi-inverse is a channel which when concatenaded to the original channel, increases its average fidelity in an optimal way. For qubit channels, we fully characterize the quasi-inverse, while for higher dimensional channels, we prove general theorems and provide bounds for the increased average fidelity. Nevertheless, explicit examples are given when exact quasi-inverses can be found.

Open Systems & Information Dynamics•Sep 1, 2022•1 citation

Generalized Inverses of Quantum Channels: a categorical perspective

Robin Cockett, Jean-Simon Pacaud Lemay, Priyaa Varshinee Srinivasan

A quantum channel is defined as being completely positive (CP) and trace preserving (TP). While not every quantum channel is invertible or reversible, every quantum channel admits various kinds of generalized inverses such as the Moore-Penrose inverse and the Drazin inverse. A generalized inverse of a quantum channel may not itself be a quantum channel: it often fails to be CP. However, generalized inverses still play an important role in quantum error mitigation. Here, because it is often desirable for the generalized inverse of a quantum channel to be at least TP, the Drazin inverse, which is TP, is favoured over the Moore-Penrose inverse, which is not in general TP. In this paper, we take a categorical perspective on generalized inverses of quantum channels. This allows us to give a simple proof of the fact that the Drazin inverse of a quantum channel is always TP. It also allows us to show that for unital quantum channels, the Drazin inverse is also unital. We then generalize this result to dagger Drazin inverses, which allows us to show that for unital quantum channels, the Moore-Penrose inverse is both TP and unital as well. This opens the door to new applications of both the Drazin inverse and Moore-Penrose inverse in quantum information theory and, in particular, in quantum error mitigation.

quant-pharXiv:2603.13946•Electronic Proceedings in Theoretical Computer Science•Mar 17, 2026•1 citation

Physics-inspired neural networks as quasi inverse of quantum channels

Sameen Aziz, Muhammad Faryad

Quantum channels are not invertible in general. A quasi-inverse allows for a partial recovery of the input state, but its analytical results are found only in a restricted space of its parameters. This work explores the potential of neural networks to find the quasi-inverse of qubit channels for any values of the channel parameters while keeping the quasi-inverse as a physically realizable quantum operation. We introduce a physics-inspired loss function based on the mean of the square of the modified trace distance (MSMTD). The scaled trace distance is used so that the neural network does not increase the length of the Bloch vector of the quantum states, which ensures that the network behaves as a completely positive and trace-preserving (CPTP) quantum channel. The Kraus operators of the quasi-inverse channel were obtained by performing quantum process tomography on the trained neural network.

arXiv:2506.11716•Jun 13, 2025•1 citation

Extending quantum operations

Teiko Heinosaari, Maria Anastasia Jivulescu, David Reeb +1 more

For a given set of input-output pairs of quantum states or observables, we ask the question whether there exists a physically implementable transformation that maps each of the inputs to the corresponding output. The physical maps on quantum states are trace-preserving completely positive maps, but we also consider variants of these requirements. We generalize the definition of complete positivity to linear maps defined on arbitrary subspaces, then formulate this notion as a semidefinite program, and relate it by duality to approximative extensions of this map. This gives a characterization of the maps which can be approximated arbitrarily well as the restriction of a map that is completely positive on the whole algebra, also yielding the familiar extension theorems on operator spaces. For quantum channel extensions and extensions by probabilistic operations we obtain semidefinite characterizations, and we also elucidate the special case of Abelian inputs or outputs. Finally, revisiting a theorem by Alberti and Uhlmann, we provide simpler and more widely applicable conditions for certain extension problems on qubits, and by using a semidefinite programming formulation we exhibit counterexamples to seemingly reasonable but false generalizations of the Alberti-Uhlmann theorem.

arXiv:1205.0641•Journal of Mathematical Physics•Oct 1, 2012•45 citations

Invertible quantum operations and perfect encryption of quantum states

Ashwin Nayak, P. Sen

In this note, we characterize the form of an invertible quantum operation, i.e., a completely positive trace preserving linear transformation (a CPTP map) whose inverse is also a CPTP map. The precise form of such maps becomes important in contexts such as self-testing and encryption. We show that these maps correspond to applying a unitary transformation to the state along with an ancilla initialized to a fixed state, which may be mixed. The characterization of invertible quantum operations implies that one-way schemes for encrypting quantum states using a classical key may be slightly more general than the "private quantum channels'' studied by Ambainis, Mosca, Tapp and de Wolf {AmbainisMTW00}. Nonetheless, we show that their results, most notably a lower bound of 2n bits of key to encrypt n quantum bits, extend in a straightforward manner to the general case.

arXiv:quant-ph/0605041•Quantum Information and Computation•Jan 1, 2007•75 citations
In general quantum operations, or quantum channels cannot be inverted by physical operations, i.e., by completely positive trace-preserving maps. An arbitrary state passing through a quantum channel loses its fidelity with the input. Given a quantum channel E\mathcal{E}E, we discuss the concept of its quasi-inverse as a completely positive trace-preserving map Eqi{\mathcal{E}}^{qi}Eqi which when composed with E\mathcal{E}E increases its average input-output fidelity in an optimal way. The channel Eqi{\mathcal{E}}^{qi}Eqi comes as close as possible to the inverse of a quantum channel. We give a complete classification of such maps for qubit channels and provide quite a few illustrative examples.
We found the quasi inverse of qubit channels as a unitary map, Ei\mathcal{E}^iEi, by minimizing the average trace distance between the input state to the channel and the output of the quasi inverse channel for arbitrary qubit channel E\mathcal{E}E and for arbitrary input states. The channel E\mathcal{E}E was assumed completely positive and trace-preserving. To find the quasi inverse for mixed states, we proposed an alternative definition of the quasi inverse based on the mean square of the trace distance (MSTD) of a channel. The definition based on the trace distance allowed easy generalization of the quasi inverse to mixed input states. The quasi inverse of the Pauli, generalized amplitude damping, mixed unitary, and tetrahedron channels calculated based on the MSTD agreed with the one computed using average fidelity in the special case of input states being pure.
A quantum channel is defined as being completely positive (CP) and trace preserving (TP). While not every quantum channel is invertible or reversible, every quantum channel admits various kinds of generalized inverses such as the Moore-Penrose inverse and the Drazin inverse. A generalized inverse of a quantum channel may not itself be a quantum channel: it often fails to be CP. However, generalized inverses still play an important role in quantum error mitigation. Here, because it is often desirable for the generalized inverse of a quantum channel to be at least TP, the Drazin inverse, which is TP, is favoured over the Moore-Penrose inverse, which is not in general TP. In this paper, we take a categorical perspective on generalized inverses of quantum channels. This allows us to give a simple proof of the fact that the Drazin inverse of a quantum channel is always TP. It also allows us to show that for unital quantum channels, the Drazin inverse is also unital. We then generalize this result to dagger Drazin inverses, which allows us to show that for unital quantum channels, the Moore-Penrose inverse is both TP and unital as well. This opens the door to new applications of both the Drazin inverse and Moore-Penrose inverse in quantum information theory and, in particular, in quantum error mitigation.
Quantum channels are not invertible in general. A quasi-inverse allows for a partial recovery of the input state, but its analytical results are found only in a restricted space of its parameters. This work explores the potential of neural networks to find the quasi-inverse of qubit channels for any values of the channel parameters while keeping the quasi-inverse as a physically realizable quantum operation. We introduce a physics-inspired loss function based on the mean of the square of the modified trace distance (MSMTD). The scaled trace distance is used so that the neural network does not increase the length of the Bloch vector of the quantum states, which ensures that the network behaves as a completely positive and trace-preserving (CPTP) quantum channel. The Kraus operators of the quasi-inverse channel were obtained by performing quantum process tomography on the trained neural network.
For a given set of input-output pairs of quantum states or observables, we ask the question whether there exists a physically implementable transformation that maps each of the inputs to the corresponding output. The physical maps on quantum states are trace-preserving completely positive maps, but we also consider variants of these requirements. We generalize the definition of complete positivity to linear maps defined on arbitrary subspaces, then formulate this notion as a semidefinite program, and relate it by duality to approximative extensions of this map. This gives a characterization of the maps which can be approximated arbitrarily well as the restriction of a map that is completely positive on the whole algebra, also yielding the familiar extension theorems on operator spaces. For quantum channel extensions and extensions by probabilistic operations we obtain semidefinite characterizations, and we also elucidate the special case of Abelian inputs or outputs. Finally, revisiting a theorem by Alberti and Uhlmann, we provide simpler and more widely applicable conditions for certain extension problems on qubits, and by using a semidefinite programming formulation we exhibit counterexamples to seemingly reasonable but false generalizations of the Alberti-Uhlmann theorem.
In this note, we characterize the form of an invertible quantum operation, i.e., a completely positive trace preserving linear transformation (a CPTP map) whose inverse is also a CPTP map. The precise form of such maps becomes important in contexts such as self-testing and encryption. We show that these maps correspond to applying a unitary transformation to the state along with an ancilla initialized to a fixed state, which may be mixed. The characterization of invertible quantum operations implies that one-way schemes for encrypting quantum states using a classical key may be slightly more general than the "private quantum channels'' studied by Ambainis, Mosca, Tapp and de Wolf {AmbainisMTW00}. Nonetheless, we show that their results, most notably a lower bound of 2n bits of key to encrypt n quantum bits, extend in a straightforward manner to the general case.