Advancing quantum imaging through learning theory
Bibliographic record
Abstract
We study quantum imaging by applying the resolvable expressive capacity (REC) formalism developed for physical neural networks (PNNs). In this paradigm of quantum learning, the imaging system functions as a physical learning device that maps input parameters to measurable features, while complex practical tasks are handled by training only the output weights, enabled by the systematic identification of well-estimated features (eigentasks) and their corresponding sample thresholds. Using this framework, we analyze both direct imaging and superresolution strategies for compact sources, defined as sources with sizes bounded below the Rayleigh limit. In particular, we introduce the orthogonalized SPADE method-a nontrivial generalization of existing superresolution techniques-that achieves superior performance when multiple compact sources are closely spaced. This method relaxes the earlier superresolution studies' strong assumption that the entire source must lie within the Rayleigh limit, marking an important step toward developing more general and practically applicable approaches. Using the example of face recognition, which involve complex structured sources, we demonstrate the superior performance of our orthogonalized SPADE method and highlight key advantages of the quantum learning approach-its ability to tackle complex imaging tasks and enhance performance by selectively extracting well-estimated features.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.003 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".