Skip to content
Preprint

A train--prune--readout--rewrite workflow for interpretable quantum learning

Sep 2026 · 0 citations · 41 references
Physics

TL;DR

An evidence-resolved framework for distinguishing physical grounding, readable computation, faithful symbolic compression and transformation-tested physical structure in constrained complex-valued scientific learning is established.

Abstract

AI for Science aims not only to predict complex physical systems from data, but also to extract mathematical structure and physically testable representations from learned models. Here, a train--prune--readout--rewrite workflow is developed that separates physical-domain grounding from three increasingly stringent analysis claims: algebraically equivalent readout of a trained predictor, compact teacher-faithful symbolic rewriting on the sampled physical domain, and transformation-based tests of learned internal representations. The workflow is implemented with complex-valued Kolmogorov--Arnold networks, whose explicit edge functions enable post-pruning analytic readout of the retained computation. In analytically controlled single-qubit tasks, rewriting recovered the quadratic structure of purity, whereas von Neumann entropy yielded only a domain-bounded symbolic surrogate; physics-aligned variable grouping preserved symbolic fidelity. For two-qubit entanglement-related tasks, shared learning exposed a common internal representation whose physical content was interrogated directly. Local-unitary transformations rejected a direct invariant-coordinate interpretation, while fixed-decoder transfer showed that the shared activation carries Pauli-correlation information in a transformation-consistent form. Task-related invariant spectral features were subsequently recovered through low-order nonlinear readouts. Separate predictive tests retained high accuracy for three-qubit classification and controlled ten-qubit purity regression with over one million complex inputs. These results establish an evidence-resolved framework for distinguishing physical grounding, readable computation, faithful symbolic compression and transformation-tested physical structure in constrained complex-valued scientific learning.

View source

Similar papers

#machine learning Preprint Sep 2026

TetrisCNN for interpretable detection of phases of matter from experimental quantum simulator data

TetrisCNN is introduced, a convolutional architecture with parallel branches of differently shaped filters, reminiscent of Tetris blocks, that learns sparse, interpretable latent representations directly in terms of spin correlators, and opens the way to integrating interpretable neural networks with quantum simulators...

Kacper Cybiński, B. V. Van Zwol, James Enouen et al. · 0 citations
Open access Aug 2026

Physics-Guided Linear Mapper for Quantum Error Mitigation

A novel physics-guided linear mapper for quantum error mitigation that uses seven distinct interpretable features derived from circuit complexity and device calibration data, which reveals that circuit depth and CNOT count dominate error prediction, consistent with decoherence mechanisms.

Tulsi Chaudhari, Krish Bhatia, Shalini Devendrababu et al. · 0 citations
Preprint Sep 2026

Discretization-Aware Fine-Tuning for Quantum Machine Learning with Chemical Foundation Models

This work introduces discretization-aware fine-tuning (DAFT), a method that adapts a pre-trained chemical foundation model to produce representations that remain informative after quantization, and evaluates both quantum and classical models under a controlled setting in which they receive identical discretized bit-str...

Shunji Matsuura, S. Johri · 0 citations
#machine learning Preprint Aug 2026

Task-Resolved Fisher Spectroscopy for Quantum Reservoir Computing

The framework connects benchmark performance to experimentally actionable diagnoses of reservoir encoding, measurement choice, classical representation, and shot allocation and introduces task-resolved Fisher spectroscopy, in which prediction targets define orthonormal score coordinates on the stationary distribution o...

Peng Yang · 0 citations
Preprint Sep 2026

Quantum Representation Learning Beyond Pairwise Fidelity

It is shown that a transition-probability-only learning interface can possess exact continuous blind directions in certain quantum-state families, and multistate relational observables are established as measurable, trainable, and physically consequential signals for quantum representation learning beyond pairwise fide...

Jun-Peng Hou, Chang-Bin Lu · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.