TY - JOUR
T1 - Optimizing mixed quantum channels via projected gradient dynamics
AU - Lin, Matthew M.
AU - Lu, Bing Ze
N1 - Publisher Copyright:
© The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.
PY - 2025/12
Y1 - 2025/12
N2 - Designing a mixed quantum channel is challenging due to the complexity of the transformations and the probabilistic mixtures of more straightforward channels involved. Fully characterizing a quantum channel generally requires preparing a complete set of input states, such as a basis for the state space, and measuring the corresponding output states. In this work, we begin by investigating a single input–output pair using projected gradient dynamics. This approach applies optimization flows constrained to the Stiefel manifold and the probabilistic simplex to identify the original quantum channel. The convergence of the flow is guaranteed by its relationship to the Zariski topology. We present numerical investigations of models adapted to various scenarios, including those with multiple input–output pairs, highlighting the flexibility and efficiency of our proposed method.
AB - Designing a mixed quantum channel is challenging due to the complexity of the transformations and the probabilistic mixtures of more straightforward channels involved. Fully characterizing a quantum channel generally requires preparing a complete set of input states, such as a basis for the state space, and measuring the corresponding output states. In this work, we begin by investigating a single input–output pair using projected gradient dynamics. This approach applies optimization flows constrained to the Stiefel manifold and the probabilistic simplex to identify the original quantum channel. The convergence of the flow is guaranteed by its relationship to the Zariski topology. We present numerical investigations of models adapted to various scenarios, including those with multiple input–output pairs, highlighting the flexibility and efficiency of our proposed method.
UR - https://www.scopus.com/pages/publications/105022691406
UR - https://www.scopus.com/pages/publications/105022691406#tab=citedBy
U2 - 10.1007/s11128-025-04995-0
DO - 10.1007/s11128-025-04995-0
M3 - Article
AN - SCOPUS:105022691406
SN - 1570-0755
VL - 24
JO - Quantum Information Processing
JF - Quantum Information Processing
IS - 12
M1 - 380
ER -