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.
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.
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, we discuss the concept of its quasi-inverse as a completely positive trace-preserving map Eqi which when composed with E increases its average input-output fidelity in an optimal way. The channel 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.
Quantum control has been a cornerstone of quantum information science, driving major advances in quantum computing, quantum communication, and quantum sensing. Over the years, it has enabled the implementation of arbitrary completely positive and trace-preserving (CPTP) maps; an important next step is to extend control to Hermitian-preserving and trace-preserving (HPTP) maps, which underpin applications such as entanglement detection, quantum error mitigation, quantum simulation, and quantum machine learning. Here we present an efficient and fully constructive method for implementing arbitrary HPTP maps. Unlike existing methods that decompose an HPTP map into multiple CPTP maps or approximate it using bipartite Hamiltonians with large Hilbert spaces, our approach compiles a target HPTP map into a single executable CPTP map whose Kraus rank is guaranteed to be no larger than the intrinsic rank of the target HPTP map plus one, followed by simple classical post-processing. Numerical results for inverse noise channels used in quantum error mitigation, including bosonic photon loss, confirm substantial reductions in resources and highlight scalability in higher-dimensional settings. Together with our numerical benchmarks, these results validate the efficiency and versatility of the proposed framework, opening a route to broader quantum-information applications enabled by HPTP processing.
This work constitutes the systematic and rigorous extension of the entire framework of Meta Operational Mathematics to the domain of quantum operations and their compositional inverses.Quantum mechanics, as the fundamental theory of nature at the microscopic scale, provides a uniquely rich testing ground for the meta-operational philosophy: operations that act upon quantum states—such as completely positive trace-preserving (CPTP) maps, quantum measurements, quantum instruments, and unitary evolutions—can themselves be operated upon, composed, iterated, added, multiplied, differentiated, exponentiated, logarithmized, and subjected to algebraic,analytic, and geometric transformations.We establish a complete four-level hierarchical framework tailored specifically to quantum theory: Level 0 consists of density matrices (quantum states) as elements of the base space F =Tsa(H); Level 1 consists of quantum operations as smooth mappings on F; Level 2 consists of quantum meta-operations as smooth mappings on quantum operations; and Level 3 consists of meta-meta-operations acting upon meta-operations. Within this framework, every fundamental operation of quantum mechanics is canonically lifted to a meta-operation, and the interactions among these meta-operations—through composition, pointwise addition, pointwise multiplication, differentiation, quantum randomization, exponentiation, and logarithm—generate the entire quantum operad QOp in its bornological closure.A fundamental distinction from the hyperbolic, elliptic, Gamma, Beta, Zeta, and probabilistic cases is rigorously established. In quantum theory, the base space F = Tsa(H) is not a subset of the complex plane but a non-commutative Banach space of trace-class self-adjoint operators.The compositional inverse of a quantum channel is not merely a formal inverse but the quantum error correction recovery map, which embodies the fundamental duality between CPTP maps and their Stinespring dilations. The complementary channel operation—corresponding to the environmental output of a Stinespring dilation—satisfies a twisted antipode axiom in the Hopf operad structure, reflecting the irreversible accumulation of information leaked to the environment. The completely positive constraint endows the quantum operad with a non-trivial boundary structure absent in all other cases.The eight fundamental meta-operations generating the entire quantum operad are: composition, pointwise addition, pointwise multiplication, differentiation, quantum randomization, the identity operation, the quantum channel evaluation operation, and the quantum measurement operation. Their irreducibility is proved through a careful analysis of the dependence structure of each generator on the remaining seven, using the Stinespring dilation theorem, the uniqueness of Kraus representations, and the Choi-Jamiołkowski isomorphism for complete positivity. The three essential features of quantum theory—positivity and complete positivity, complementarity and uncertainty relations, and entanglement and inseparability—are systematically elevated to the meta-operational level as algebraic axioms, analytic tools, and geometric objects, constructing a self-contained Quantum Meta-Operational Mathematics. All conjectures and open problems originally stated within this research program have either been resolved as theorems within the body of this work or are precisely formulated as remaining open problems with partial progress rigorously indicated.
In quantum technologies, quantum channels are essential for transmitting quantum states. Quantum channels usually introduce noise, thereby reducing the information in a state. These are mathematically described by completely positive trace-preserving linear maps that represent the generic evolution of quantum systems and are also special cases of Hermitian-preserving trace-preserving (HPTP) linear maps. Concatenating a quantum channel with another quantum channel makes it noisier and degrades its information and resource preservability. In this work, we demonstrate a physically meaningful way to compare a pair of quantum channels using Hermitian-preserving trace-preserving linear maps. Precisely, given a pair of quantum channels Λ1,Λ2 and an arbitrary unknown input state, we show that the output state of the quantum channel Λ2 from the pair can be uniquely identified from the output statistics of the other channel Λ1 from the pair, using some POVM, iff Λ2 can be obtained from Λ1 by concatenating it with a Hermitian-preserving trace-preserving linear map that is not necessarily positive. In such cases, Λ2 may not always be obtained from Λ1 through post-processing. The relation between these channels is a preorder, and we study its characterization in this work. In other words, we provide an operational interpretation of this preorder induced by HPTP linear maps in a communication scenario. Furthermore, we characterize the difficulty of implementing Λ2 given that Λ1 has already been implemented via a quantifier, namely, physical implementability. We also illustrate the implications of our results for the incompatibility of quantum devices through an example. In short, we provide valuable insights about the relevance of Hermitian-preserving trace-preserving linear maps in physically motivated settings.
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.