SearcharxivSearch

arXiv subjects

Siran Zhang

Publications and source records attributed to Siran Zhang.

3 recordsLinked to original sources

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

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.

quant-ph

Resource-efficient quantum approximate optimization algorithm via Bayesian optimization and maximum-probability evaluation

The quantum approximate optimization algorithm (QAOA) is a leading variational approach to combinatorial optimization, but its practical performance depends strongly on objective design, parameter search, and shot allocation. We present a resource-efficient QAOA framework that uses the cut value of the most probable measured bitstring as the optimization objective, combines it with Bayesian optimization, and adaptively allocates shots using dual criteria based on mode confidence and normalized cut-value variance. Numerical experiments on 3-regular MaxCut show that, for both unweighted and weighted instances, the proposed scheme achieves discrete-solution quality comparable to that of the conventional expectation-based objective while typically requiring fewer total shots to reach the same final mode accuracy. These results indicate that reorganizing QAOA around the maximum-probability bitstring provides an effective route to improving practical performance under limited measurement budgets.

quant-ph

MAGI-1: Autoregressive Video Generation at Scale

We present MAGI-1, a world model that generates videos by autoregressively predicting a sequence of video chunks, defined as fixed-length segments of consecutive frames. Trained to denoise per-chunk noise that increases monotonically over time, MAGI-1 enables causal temporal modeling and naturally supports streaming generation. It achieves strong performance on image-to-video (I2V) tasks conditioned on text instructions, providing high temporal consistency and scalability, which are made possible by several algorithmic innovations and a dedicated infrastructure stack. MAGI-1 facilitates controllable generation via chunk-wise prompting and supports real-time, memory-efficient deployment by maintaining constant peak inference cost, regardless of video length. The largest variant of MAGI-1 comprises 24 billion parameters and supports context lengths of up to 4 million tokens, demonstrating the scalability and robustness of our approach. The code and models are available at https://github.com/SandAI-org/MAGI-1 and https://github.com/SandAI-org/MagiAttention. The product can be accessed at https://sand.ai.

cs.CV