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:2104.06062 · Journal of Physics A Mathematical and Theoretical

Quasi-inversion of quantum and classical channels in finite dimensions

Fereshte Shahbeigi, Koorosh Sadri, Morteza Moradi, Karol Życzkowski, Vahid Karimipour

Published Jul 13, 2021• 9 citations
arXivHTMLPDF

Abstract

Abstract We introduce the concept of quasi-inverse of quantum and classical channels, prove general properties of these inverses and determine them for a large class of channels acting in an arbitrary finite dimension. Therefore we extend the previous results of Karimipour et al (2020 Phys. Rev. A 101 032109) to arbitrary dimensional channels and to the classical domain. We demonstrate how application of the proposed scheme can increase on the average the fidelity between a given random pure state and its image transformed by the quantum channel followed by its quasi-inversion.

DOI
10.1088/1751-8121/ac13db

Related papers

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

Quasi-inversion of qubit channels

Vahid Karimipour, Fabio Benatti, Roberto Floreanini B

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.

arXiv:1909.06118•Physical Review A•Mar 16, 2020•12 citations

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

Generalized Perfect Codes for Symmetric Classical-Quantum Channels

Andreu Blasco Coll, Gonzalo Vazquez-Vilar, J.R. Fonollosa

We define a new family of codes for symmetric classical-quantum channels and establish their optimality. To this end, we extend the classical notion of generalized perfect and quasi-perfect codes to channels defined over some finite dimensional complex Hilbert output space. The resulting optimality conditions depend on the channel considered and on an auxiliary state defined on the output space of the channel. For certain$N$-qubit classical-quantum channels, we show that codes based on a generalization of Bell states are quasi-perfect and, therefore, they feature the smallest error probability among all codes of the same blocklength and cardinality.

arXiv:2007.07958•IEEE Transactions on Information Theory•Apr 28, 2022•4 citations

Blind Processing Methods for Quantum Channels: Identification, Equalization and Source Separation

Yannick Deville, Alain Deville

System identification, system inversion and its multiple-signal extension to source separation, including non-blind and blind (i.e. unsupervised) configurations, are major topics in classical, i.e. nonquantum, signal processing. Their application fields especially include communications, where they are often referred to as (possibly blind and MIMO) channel identification / estimation and channel equalization. Some of their configurations have also been extended to quantum channels. In this paper, we focus on such channels and on the most challenging configurations, namely blind and multiplequbit ones, hence with main emphasis on source separation. In this framework, two classes of methods were previously proposed for two-qubit configurations and a specific type of channels. We here first define their extensions to any number of qubits and general channels. For that configuration too, we then propose a third class of methods and we analyze its relationships with the previous two. This leads us to provide new general insight into the connections between the unentanglement of a pure quantum state and the statistical independence of associated measurement components.

Machine learning for signal processing ...•Sep 17, 2023•0 citations

Categories of Quantum and Classical Channels (extended abstract)

Bob Coecke, Chris Heunen, Aleks Kissinger

We introduce the CP*-construction on a dagger compact closed category as a generalisation of Selinger's CPM-construction. While the latter takes a dagger compact closed category and forms its category of "abstract matrix algebras" and completely positive maps, the CP*-construction forms its category of "abstract C*-algebras" and completely positive maps. This analogy is justified by the case of finite-dimensional Hilbert spaces, where the CP*-construction yields the category of finite-dimensional C*-algebras and completely positive maps. The CP*-construction fully embeds Selinger's CPM-construction in such a way that the objects in the image of the embedding can be thought of as "purely quantum" state spaces. It also embeds the category of classical stochastic maps, whose image consists of "purely classical" state spaces. By allowing classical and quantum data to coexist, this provides elegant abstract notions of preparation, measurement, and more general quantum channels.

arXiv:1408.0049•Electronic Proceedings in Theoretical Computer Science•Jul 29, 2014•6 citations
Abstract We introduce the concept of quasi-inverse of quantum and classical channels, prove general properties of these inverses and determine them for a large class of channels acting in an arbitrary finite dimension. Therefore we extend the previous results of Karimipour et al (2020 Phys. Rev. A 101 032109) to arbitrary dimensional channels and to the classical domain. We demonstrate how application of the proposed scheme can increase on the average the fidelity between a given random pure state and its image transformed by the quantum channel followed by its quasi-inversion.
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.
We define a new family of codes for symmetric classical-quantum channels and establish their optimality. To this end, we extend the classical notion of generalized perfect and quasi-perfect codes to channels defined over some finite dimensional complex Hilbert output space. The resulting optimality conditions depend on the channel considered and on an auxiliary state defined on the output space of the channel. For certainNNN-qubit classical-quantum channels, we show that codes based on a generalization of Bell states are quasi-perfect and, therefore, they feature the smallest error probability among all codes of the same blocklength and cardinality.
System identification, system inversion and its multiple-signal extension to source separation, including non-blind and blind (i.e. unsupervised) configurations, are major topics in classical, i.e. nonquantum, signal processing. Their application fields especially include communications, where they are often referred to as (possibly blind and MIMO) channel identification / estimation and channel equalization. Some of their configurations have also been extended to quantum channels. In this paper, we focus on such channels and on the most challenging configurations, namely blind and multiplequbit ones, hence with main emphasis on source separation. In this framework, two classes of methods were previously proposed for two-qubit configurations and a specific type of channels. We here first define their extensions to any number of qubits and general channels. For that configuration too, we then propose a third class of methods and we analyze its relationships with the previous two. This leads us to provide new general insight into the connections between the unentanglement of a pure quantum state and the statistical independence of associated measurement components.
We introduce the CP*-construction on a dagger compact closed category as a generalisation of Selinger's CPM-construction. While the latter takes a dagger compact closed category and forms its category of "abstract matrix algebras" and completely positive maps, the CP*-construction forms its category of "abstract C*-algebras" and completely positive maps. This analogy is justified by the case of finite-dimensional Hilbert spaces, where the CP*-construction yields the category of finite-dimensional C*-algebras and completely positive maps. The CP*-construction fully embeds Selinger's CPM-construction in such a way that the objects in the image of the embedding can be thought of as "purely quantum" state spaces. It also embeds the category of classical stochastic maps, whose image consists of "purely classical" state spaces. By allowing classical and quantum data to coexist, this provides elegant abstract notions of preparation, measurement, and more general quantum channels.