Partially Unitary Learning
Not on the map. Why?
Abstract (arXiv)
The problem of an optimal mapping between Hilbert spaces IN of left|psirightrangle and OUT of left|φrightrangle based on a set of wavefunction measurements (within a phase) psil → φl, l=1dots M, is formulated as an optimization problem maximizing the total fidelity suml=1M ω(l) left|langleφl|U|psilrangleright|2 subject to probability preservation constraints on U (partial unitarity). The constructed operator U can be considered as an IN to OUT quantum channel; it is a partially unitary rectangular matrix (an isometry) of dimension dim(OUT) × dim(IN) transforming operators as AOUT=U AIN Udagger. An iterative algorithm for finding the global maximum of this optimization problem is developed, and its application to a number of problems is demonstrated. A software product implementing the algorithm is available from the authors.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 1 of its 18 references that are in the map. First posted on arXiv 16 May 2024.
Builds on
1 of 18 references.
References · 1
- 2020Variational Quantum Algorithmscited by 692
Built on by
Citing papers per year: 2025: 2; 2026: 1.
3 papers.
- 2026Semidefinite Programming for Quantum Channel Learning18 Jan 2026
- 2025Operator Learning for Schr"odinger Equation: Unitarity, Error Bounds, and Time Generalization23 May 2025
- 2025Superstate Quantum Mechanics25 Jan 2025