Quantum Property Learning for NISQ Networks: Universal Quantum Witness Machines
Bibliographic record
Abstract
The learning of fundamental quantum properties—namely coherence, discord, and entanglement—benchmarks the security, computational, and metrological capability of noisy intermediate-scale quantum (NISQ) communication, computing, and sensing networks. The current learning techniques vary widely for these fundamental quantum properties, including standard tomographic procedures that involve exhaustive optimization. Fortunately, the fundamentally distinct quantum properties feature an intricate connection. In this paper, we put forth the concept of universal quantum witness machines (UQWMs) to develop a unified framework for quantum property learning (QPL) of a quantum system. We first formulate the certification and quantification of quantum properties based on quantum witnesses. The witness-based certification method is experimentally accessible and resource-efficient but lacks reliability and generality. To universalize the scope and circumvent the unreliability, we transform the certification task into a classification task by employing UQWMs with classical machine learning to construct quantum property classifiers. This formalism offers a unifying perspective on the certification, quantification, and classification of these enigmatically linked fundamental quantum properties. To demonstrate our UQWM approach, we provide a comparative numerical analysis of quantum property quantification with quantum witnesses and classification performance analysis of quantum property classification with convolutional neural networks, specifically for <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$4 \times 4$ </tex-math></inline-formula> quantum systems.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.002 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".