arXiv:2611.01993
Seeing Why: Exact Evidence Maps for Quantum and Optical Image Classifiers
Teerawat Tongloy, Rangsan Jomtarak
Abstract
When an image classifier decides, we can usually only estimate why. For quantum and all-optical classifiers that act linearly on amplitude-encoded pictures up to the measurement, with no trained classical network before or after them, each class's Born probability above its no-information share, $P_g - b_g$, splits exactly into contributions of the encoded amplitudes, shown as Born evidence maps (BEM) over the picture. The split itself follows from known results on quadratic forms: with the transmitted light held fixed, it is what Integrated Gradients from a zero baseline and the Shapley value give. What we add is a way to measure it on the hardware that classifies, from class probabilities on a quantum chip or from camera frames on a lens bench, with no gradient circuit and no light sent backwards; a $g\times g$ map takes $1 + 2g^2$ runs. Deleting the 5% of pixels with the highest evidence drops accuracy from 73% to 9%, as occlusion does with 1,024 extra runs per picture, whereas gradient saliency removes much less. The classifiers share one architecture, a Fourier-plane mask followed by a brickwall circuit on qubits or by phase plates on a lens bench, read by a fixed Born headroom readout with no trained parameter; centring each picture on its own mean lets dark features count as much as bright ones. In simulation, four phase plates at a single wavelength reach 72.3% on Caltech-10 colour photographs. On IBM's ibm_kingston, with the mask applied before approximate loading, 300 test pictures were classified at 37.7% against 10% by chance (56.3% in exact simulation), and $2\times2$ maps of ten correctly classified pictures, one per class chosen by a stated rule, measured on the chip, agreed with the exact ones ($r = 0.77$). The maps also revealed a shortcut in the data; as the trim that removed it was chosen on test pictures, the Caltech-10 results are exploratory.
AI Summary
Based on v1The paper asks whether quantum and optical image classifiers that are linear in encoded amplitudes until measurement admit exact, hardware-measurable input attributions. It defines Born evidence maps $e_g(x)=a_x\operatorname{Re}[A^\dagger(\Pi_g-b_gI)Aa]_x/Z$, satisfying $\sum_x e_g(x)=P_g-b_g$, where $Z=\|Aa\|^2$ and $b_g$ is a fixed class-share reference. These equal zero-baseline Integrated Gradients and Shapley attributions of the quadratic numerator with transmission held fixed—not attributions through the raw-pixel encoder or final nonlinear readout. A polarization identity estimates block evidence from whole-input, block-only and complement measurements. The classifiers combine per-image mean-centred amplitude encoding, a learned Fourier mask, qubit circuits or optical phase plates, and a fixed-temperature headroom readout. Four simulated phase plates achieve $72.3\pm0.7\%$ on Caltech-10, $96.8\%$ on MNIST and $47.9\%$ on colour CIFAR-10. In a single-seed, 300-image deletion test, removing the highest-evidence 5% of pixels reduces optical accuracy from 73.0% to 8.7%, comparable to occlusion. On IBM hardware, 300 Caltech-10 images yield 37.7% accuracy versus 56.3% ideally and 41.3% with approximate loading alone. Hardware $2\times2$ maps for ten selected, correctly classified images correlate with ideal maps at $r=0.77$. Limitations include classical mask preprocessing and approximate loading on the chip, simulation-only optical validation, unstable single-pixel maps across seeds, and classification accuracy below electronic CNNs. Caltech-10 preprocessing used test-set explanations, leaving no untouched holdout. No quantum or interference advantage is claimed.
An AI assistant (Claude, Anthropic) was used throughout this work: to write and run simulation and analysis code, to prepare and check the hardware jobs, to draw the figures, and to draft and revise the text.
Error found: The abstract's unqualified reference to class probabilities obscures that Born evidence maps decompose the Born group mass P_g-b_g, not the classifier's reported softmax probability hat p_g. For lossy optical classifiers, b_g=|S_g|/N is generally only a fixed anchor rather than the actual conditional class mass of a maximally mixed, no-information input.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 30 pages, 13 figures, 14 tables. Code, trained models and the IBM job records: https://github.com/stein-research/seeing-why (archived: doi:10.5281/zenodo.23906357). v2: abstract and introduction clarified (known identity vs. new measurement; Caltech-10 results marked exploratory), corresponding author, authors' ORCIDs, Zenodo DOI, clearer Figs. 9 and 12; results unchanged