A machine that purifies two quantum inputs of different rank with positive probability cannot be a linear positive map, ruling out universal probabilistic purification from finite copies; approximate strategies exhibit a dimension-dependent trade-off between pure-output and append-environment maps.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
The Petz recovery map equals the gradient of the log-likelihood in maximum-likelihood tomography, unifying retrodiction and state reconstruction via a shared iterative procedure.
citing papers explorer
-
Probabilistic and approximate universal quantum purification machines
A machine that purifies two quantum inputs of different rank with positive probability cannot be a linear positive map, ruling out universal probabilistic purification from finite copies; approximate strategies exhibit a dimension-dependent trade-off between pure-output and append-environment maps.
-
Connecting Quantum Tomography and Quantum Retrodiction
The Petz recovery map equals the gradient of the log-likelihood in maximum-likelihood tomography, unifying retrodiction and state reconstruction via a shared iterative procedure.