New Preprint: Quantum Readout Complexity for Normalized Linear Functionals

A new preprint on arXiv explores the quantum readout complexity for normalized linear functionals. The paper studies the complexity of the output-interface problem for specific functionals and identifies a target-dependent susceptibility that governs the number of copies of the solution state needed. This work contributes to the understanding of quantum numerical algorithms and their efficiency. (Note: This is a preliminary finding and has not yet been peer-reviewed.)