Answers are grounded in this paper and cite their sources.
The problem of an optimal mapping between Hilbert spaces IN and OUT, based on a series of density matrix mapping measurements ρ⁽ˡ⁾→⁽ˡ⁾, l=1⋯M, is formulated as an optimization problem maximizing the total fidelity $F={{∑}}ₗ₌₁M{{ω}}⁽ˡ⁾F({{}}⁽ˡ⁾,{{∑}}ₛ{B}ₛ{{ρ}}⁽ˡ⁾{B}ₛ^{{}})$ subject to probability preservation constraints on Kraus operators ${B}ₛ$. For $F({},{σ})$ in the form that total fidelity can be represented as a quadratic form with superoperator $F={{∑}}ₛ{}{B}ₛ|S|{B}ₛ{}$ (either exactly or as an approximation) an iterative algorithm is developed. The work introduces two important generalizations of unitary learning: (1) IN/OUT states are represented as density matrices; (2) the mapping itself is formulated as a mixed unitary quantum channel AOUT=∑ₛ|wₛ|²UₛAINUₛ^ (no general quantum channel yet). This marks a crucial advancement from the commonly studied unitary mapping of pure states φₗ=Uψₗ to a quantum channel, which allows us to distinguish probabilistic mixture of states and their superposition. An application of the approach is demonstrated on unitary learning of density matrix mapping ⁽ˡ⁾=Uρ⁽ˡ⁾U^, in this case a quadratic on U fidelity can be constructed by considering √ρ⁽ˡ⁾→√⁽ˡ⁾ mapping, and on a quantum channel, where quadratic on Bₛ fidelity is an approximation---a quantum channel is then obtained as a hierarchy of unitary mappings, a mixed unitary channel. The approach can be applied to studying quantum inverse problems, variational quantum algorithms, quantum tomography, and more. A software product implementing the algorithm is available from the authors.
No takes yet. Share an insight, caveat, or question.
Belov et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: