B27
Quantum advantage and classical alternatives
Does a computational advantage persist after preparation, sampling and error correction are counted?

VII.19 / QUANTUM
At what sample size and circuit depth does a quantum learning method recover its computational cost?
Quantum machine learning sits at the intersection of learning tasks and physically realizable quantum computation. A linear-algebra subroutine such as HHL can motivate proposals, but the learning objective and data representation determine whether that subroutine is useful. This topic emphasizes the experiment needed to demonstrate an advantage: a specified task, a fair classical baseline, realistic access assumptions, and resource accounting.
Suppose one method returns a quantum state encoding a solution while another returns all of its numerical entries. Those are different outputs. Restate the task as either estimating one observable or recovering the whole vector, then compare preparation, processing, and readout costs for that same requirement.
Take one published advantage claim and rewrite it as an explicit input/output contract, then identify the benchmark needed to evaluate that contract.
Aram W. Harrow, Avinatan Hassidim, and Seth Lloyd · A quantum linear-systems algorithm with access, conditioning, and output assumptions.
B27
Does a computational advantage persist after preparation, sampling and error correction are counted?