arXiv subjects

Shi-Ju Ran

Publications and source records attributed to Shi-Ju Ran.

At least 19 recordsLinked to original sources

arXiv2026

Diagonalizing large-scale quantum many-body Hamiltonians using variational quantum circuit and tensor network

Exact diagonalization (ED) provides complete access to many-body eigenenergies and eigenstates, yet its exponential cost confines it to small systems. We propose tensor network variational diagonalization (TNVD), which encodes the full eigenenergy spectrum in a matrix product state (MPS) while representing the corresponding eigenstates via a finite depth variational quantum circuit (VQC) acting on product states. TNVD thereby reduces diagonalization complexity from exponential to polynomial in system size $N$. For the quantum Ising chain, TNVD accurately reproduces eigenenergies for $N\leq 16$ and, at sizes inaccessible to ED such as $N=100$, directly samples them from a single MPS encoding all $2^N$ levels. A random label control shows that this compact $N$-site representation depends on how the eigenenergies are organized in label space. TNVD further reveals that, at their integrable limits, the random field Ising and XXZ chains show comparable level spacing ratios and mean eigenstate entanglement entropies but markedly different Schmidt spectrum decay. This difference exposes distinct eigenstate entanglement structures that govern their classical simulability and the difficulty of finite depth quantum circuit preparation. Our work establishes TNVD as a scalable full spectrum diagonalization framework and its VQC as a quantum route to volume-law-entangled eigenstates that challenge efficient classical simulation.

quant-ph↗

arXiv2026

LLMs Interpret, Embeddings Organize, Graphs Emerge: Agent-Driven Compilation of Scientific Knowledge

Sustained scientific work requires a knowledge substrate that carries interpretation across tasks and preserves paths to source evidence. We call this process \emph{scientific knowledge compilation} and implement it in ASKS, the \emph{Agent-Driven Scientific Knowledge System}. For each source, an LLM produces a readable Wiki view and machine-facing semantics. Deterministic checks convert the latter into a document-local GraphDelta, and embedding geometry together with explicit graph rules integrates the proposed changes into persistent state. Each ingest is an inspectable state transition over accumulated knowledge, with compiled Wiki and graph views linked to the preserved source record. We examine this process by chronologically compiling 56 published papers from one research program. Branch survival, cross-paper support, lineage, coverage, and churn yield a source-traceable author research portrait centered on tensor-network methods, with branches into quantum many-body research, tensor-network machine learning, and quantum-AI-oriented directions. In this run, higher-level Hub organization remains stable and low-churn. Canonical-node growth is predominantly additive. Graph-level measurements and navigation paths retain links to the source records from which they were compiled.

cs.AI↗

arXiv2026

Interface Capacity and Architectural Replenishment Determine Entanglement-Generation Speed in Quantum Networks

We show that entanglement-generation speed across a fixed network interface is governed by two distinct resources: the entangling capacity of the interface itself and the ability of the surrounding architecture to replenish it with fresh degrees of freedom. For fermionic Gaussian dynamics, we derive the coefficient-sharp bound $\sum_k|\dotθ_k|\leq\frac12\|K_{AB}\|_*$ on the collective speed of the canonical entanglement angles. Explicit Ising-chain rematching trajectories saturate this bound, thereby certifying exact minimum interaction times under the stated control model. Beyond the Gaussian setting, exhaustive optimization of the complete $N=8$ tree--tree family shows that, at fixed interface capacity, first-layer entanglement, connectedness, and edge budget, the saturation depth is exactly classified by rooted architecture. With higher-resolution $x$-only control, variational entanglement-enhancing-field (VEEF) optimization reaches the numerically resolved fast-$X$ optimum in a two-channel benchmark. Across all 21 symmetry-reduced rooted orbits, a pre-specified two-time VEEF growth diagnostic recovers the complete replenishment partition directly from optimized dynamics. Interface capacity therefore sets how much entangling flux is available, whereas architecture determines whether fresh degrees of freedom can continually replenish the interface and sustain repeated use of that capacity.

quant-ph↗

arXiv2026

A Hamiltonian-Inspired Local-Operator Ansatz for Slimming Large Language Models

Dense linear maps carry much of the parameter and computational burden of modern neural networks, yet their dense form leaves the organization of learned couplings implicit. Quantum many-body physics organizes exponentially large operators by writing a global Hamiltonian as a sum of local terms, $\hat H=\sum_k\hat h_k$. Whether the same structural principle can carry learned neural maps is unknown. We introduce Tensor Mixture (MixT), which represents a dense map as a natively executable sum of overlapping local tensor operators without imposing an explicit matrix-rank constraint. The local-term count $N_T$ sets the effective nonlocality and operator complexity, while the number of replaced Transformer blocks $N_B$ extends this structural coordinate across network depth. Tests on Qwen3-8B and LLaMA2-7B reveal a broad recoverable regime followed by an abrupt, model-specific boundary that is remarkably stable against changes in $N_T$. Accuracy and output-distribution statistics reorganize together across the boundary; in LLaMA2-7B, the same depth separates two scaling regimes of inter-layer geometry drift. The directly executed structure also reduces parameters, arithmetic, storage, and memory. These results establish the local-sum structure as a viable organizing principle for learned linear maps at billion-parameter scale and expose a sharp boundary in their tolerance to structural simplification.

cs.CL↗

arXiv2026

Out-of-distribution Neural Inference in Dynamical Ising Models

Neural networks are increasingly used to infer hidden physical structure from dynamical observations, yet it remains unclear whether their out-of-distribution performance reflects transferable physical rule learning. We address this question in a controlled inverse problem: reconstructing interaction graphs of a kinetic Ising model from Glauber magnetization trajectories. Across convolutional, graph, Transformer, and hybrid architectures, we find that data-driven training produces distinct and reproducible statistical strategies under topology and temperature shifts. Edge-population diagnostics reveal that Transformer-based models tend to preserve the link density of the training ensemble, whereas convolutional models can collapse toward sparse- or no-link predictions that appear out-of-distribution stable by exploiting the majority no-link class. Thus, high in-distribution accuracy and apparent out-of-distribution robustness do not necessarily imply a learned dynamics-to-structure rule. Instead, neural reconstruction can be governed by architecture-dependent statistical priors. Our results identify a concrete failure mode of standard data-driven learning in physical inverse problems and motivate rule-guided principles for machine-learning-assisted scientific discovery.

cs.LG↗

arXiv2026

Geometric Prototype Learning in Quantum Hilbert Space with Matrix Product States

Quantum probability provides a novel framework for formulating machine-learning (ML) problems in Hilbert space. We introduce a prototype-based learning scheme where class representatives are encoded as generative matrix product states (MPS). Because these prototypes reside in the same Hilbert space as quantum-encoded data samples, various ML tasks such as classification and clustering can be performed through geometric measures of quantum states. This approach lifts prototype learning from classical feature space to quantum Hilbert space. Benchmarks on Fashion-MNIST and a real-world electrocardiogram dataset demonstrate that our method outperforms classical prototype approaches while remaining competitive with standard black-box neural networks. We also identify an ``attraction'' effect induced by the quantum-probabilistic prototypes and introduce a dimensionality-reduction scheme based on prototype distances. Our results establish quantum states as an explainable framework for prototype learning, opening new directions for designing ML algorithms in quantum Hilbert space.

quant-ph↗

arXiv2026

Confidence Geometry Reveals Trace-Level Correctness in Large Language Model Reasoning

Large language models (LLMs) generate not only reasoning text, but also token-level confidence trajectories that record how uncertainty evolves during inference. Whether these trajectories are relevant to reasoning correctness remains unclear. Here we show that confidence trajectories encode a content-agnostic confidence geometry associated with trace-level final-answer correctness. Using only token-level confidence values, without access to the input question, reasoning text, hidden states, or external verifiers, we find that low-dimensional representations of confidence trajectories separate correct from incorrect reasoning traces. Across GSM8K, MATH, and MMLU, this geometric separation is quantitatively linked to downstream predictability: stronger clustering of correct and incorrect traces, measured by the Davies--Bouldin index, consistently corresponds to higher correctness-discrimination AUC. We further show that correctness-related information is enriched in the tail of reasoning, suggesting that late-stage confidence dynamics carry key correctness signals. We propose NeuralConf, a lightweight estimator that learns from confidence trajectories for correctness evaluation. Under a fixed trace budget, NeuralConf-derived scores improve confidence-weighted answer aggregation over majority voting, tail confidence, and other static baselines. These results reveal that LLMs expose trace-intrinsic statistical signals of correctness through their own confidence dynamics, offering a route to improve inference using information already present within generation.

cs.LG↗

arXiv2026

Statistics-encoded tensor network approach in disordered quantum many-body spin chains

Simulating the dynamics of quantum many-body systems with disorder is a fundamental challenge. In this work, we propose a general approach -- the statistics-encoded tensor network (SeTN) -- to study such systems. By encoding disorder into an auxiliary layer and averaging separately, SeTN restores translational invariance, enabling a well-defined transfer matrix formulation. We derive a universal criterion, $n \gg α^2 t^2$, linking discretization $n$, disorder strength $α$, and evolution duration $t$. This sets the resolution required for faithful disorder averaging and shows that encoding is most efficient in the weak-disorder, typically chaotic regime. Applied to the disordered transverse-field Ising model, SeTN shows that the spectral form factor is governed by the leading transfer-matrix eigenvalue, in contrast to the kicked Ising model. SeTN thus provides a novel framework for probing the disorder-driven dynamical phenomena in many-body quantum systems.

quant-ph↗

arXiv2026

Matrix-product entanglement characterizing the optimality of state-preparation quantum circuits

Multipartite entanglement offers a powerful framework for understanding the complex collective phenomena in quantum many-body systems that are often beyond the description of conventional bipartite entanglement measures. Here, we propose a class of multipartite entanglement measures that incorporate the matrix product state (MPS) representation, enabling the characterization of the optimality of quantum circuits for state preparation. These measures are defined as the minimal distances from a target state to the manifolds of MPSs with specified virtual bond dimensions $χ$, and thus are dubbed as $χ$-specified matrix product entanglement ($χ$-MPE). We demonstrate superlinear, linear, and sublinear scaling behaviors of $χ$-MPE with respect to the negative logarithmic fidelity $F$ in state preparation, which correspond to excessive, optimal, and insufficient circuit depth $D$ for preparing $χ$-virtual-dimensional MPSs, respectively. Specifically, a linearly-growing $χ$-MPE with $F$ suggests $\mathcal{H}_χ \simeq \mathcal{H}_{D}$, where $\mathcal{H}_χ$ denotes the manifold of the $χ$-virtual-dimensional MPSs and $\mathcal{H}_{D}$ denotes that of the states accessible by the $D$-layer circuits. We provide an exact proof that $\mathcal{H}_{χ=2} \equiv \mathcal{H}_{D=1}$. Our results establish tensor networks as a powerful and general tool for developing parametrized measures of multipartite entanglement. The matrix product form adopted in $χ$-MPE can be readily extended to other tensor network ansätze, whose scaling behaviors are expected to assess the optimality of quantum circuit in preparing the corresponding tensor network states.

quant-ph↗

arXiv2025

Eigenstate Thermalization and its breakdown in Quantum Spin Chains with Inhomogeneous Interactions

The eigenstate thermalization hypothesis (ETH) is a successful theory that establishes the criteria for ergodicity and thermalization in isolated quantum many-body systems. In this work, we investigate the thermalization properties of spin-$ 1/2 $ XXZ chain with linearly-inhomogeneous interactions. We demonstrate that introduction of the inhomogeneous interactions leads to an onset of quantum chaos and thermalization, which, however, becomes inhibited for sufficiently strong inhomogeneity. To exhibit ETH, and to display its breakdown upon varying the strength of interactions, we probe statistics of energy levels and properties of matrix elements of local observables in eigenstates of the inhomogeneous XXZ spin chain. Moreover, we investigate the dynamics of the entanglement entropy and the survival probability which further evidence the thermalization and its breakdown in the considered model. We outline a way to experimentally realize the XXZ chain with linearly-inhomogeneous interactions in systems of ultracold atoms. Our results highlight a mechanism of emergence of ETH due to insertion of inhomogeneities in an otherwise integrable system and illustrate the arrest of quantum dynamics in presence of strong interactions.

quant-ph↗

arXiv2025

Entanglement scaling and criticality of infinite-size quantum many-body systems in continuous space addressed by a tensor network approach

Simulating strongly-correlated quantum systems in continuous space belongs to the most challenging and long-concerned issues in quantum physics. This work investigates the quantum entanglement and criticality of the ground-state wave-functions of infinitely-many coupled quantum oscillators (iCQOs). The essential task involves solving a set of partial differential equations (Schrödinger equations in the canonical quantization picture) with infinitely-many variables, which currently lacks valid methods. By extending the imaginary-time evolution algorithm with translationally-invariant functional tensor network, we simulate the ground state of iCQOs with the presence of two- and three-body couplings. We determine the range of coupling strengths where there exists a real ground-state energy (dubbed as physical region). With two-body couplings, we reveal the logarithmic scaling law of entanglement entropy (EE) and the polynomial scaling law of correlation length against the virtual bond dimension $χ$ at the dividing point of physical and non-physical regions. These two scaling behaviors are signatures of criticality, according to the previous results in quantum lattice models, but were not reported in continuous-space quantum systems. The scaling coefficients result in a central charge $c=1$, indicating the presence of free boson conformal field theory (CFT). We further show that the presence of three-body couplings, for which there are no analytical or numerical results, breaks down the CFT description at the dividing point. Our work reveals the scaling behaviors of EE in continuous-space quantum many-body systems. These results provide strong numerical evidence supporting the efficiency of TN in representing continuous-space quantum wave-functions in the thermodynamic limit and offer an efficient approach to studying entanglement properties and criticality in continuous space.

quant-ph↗

arXiv2025

Compressing Neural Networks Using Tensor Networks with Exponentially Fewer Variational Parameters

Neural network (NN) designed for challenging machine learning tasks is in general a highly nonlinear mapping that contains massive variational parameters. High complexity of NN, if unbounded or unconstrained, might unpredictably cause severe issues including \R{overfitting}, loss of generalization power, and unbearable cost of hardware. In this work, we propose a general compression scheme that significantly reduces the variational parameters of NN's, despite of their specific types (linear, convolutional, \textit{etc}), by encoding them to deep \R{automatically differentiable} tensor network (ADTN) that contains exponentially-fewer free parameters. Superior compression performance of our scheme is demonstrated on several widely-recognized NN's (FC-2, LeNet-5, AlextNet, ZFNet and VGG-16) and datasets (MNIST, CIFAR-10 and CIFAR-100). For instance, we compress two linear layers in VGG-16 with approximately $10^{7}$ parameters to two ADTN's with just 424 parameters, improving the testing accuracy on CIFAR-10 from $90.17\%$ to $91.74\%$. We argue that the deep structure of ADTN is an essential reason for the remarkable compression performance of ADTN, compared to existing compression schemes that are mainly based on tensor decompositions/factorization and shallow tensor networks. Our work suggests deep TN as an exceptionally efficient mathematical structure for representing the variational parameters of NN's, which exhibits superior compressibility over the commonly-used matrices and multi-way arrays.

cs.LG↗

arXiv2024

Universal scaling laws in quantum-probabilistic machine learning by tensor network towards interpreting representation and generalization powers

Interpreting the representation and generalization powers has been a long-standing issue in the field of machine learning (ML) and artificial intelligence. This work contributes to uncovering the emergence of universal scaling laws in quantum-probabilistic ML. We take the generative tensor network (GTN) in the form of a matrix product state as an example and show that with an untrained GTN (such as a random TN state), the negative logarithmic likelihood (NLL) $L$ generally increases linearly with the number of features $M$, i.e., $L \simeq k M + const$. This is a consequence of the so-called ``catastrophe of orthogonality,'' which states that quantum many-body states tend to become exponentially orthogonal to each other as $M$ increases. We reveal that while gaining information through training, the linear scaling law is suppressed by a negative quadratic correction, leading to $L \simeq βM - αM^2 + const$. The scaling coefficients exhibit logarithmic relationships with the number of training samples and the number of quantum channels $χ$. The emergence of the quadratic correction term in NLL for the testing (training) set can be regarded as evidence of the generalization (representation) power of GTN. Over-parameterization can be identified by the deviation in the values of $α$ between training and testing sets while increasing $χ$. We further investigate how orthogonality in the quantum feature map relates to the satisfaction of quantum probabilistic interpretation, as well as to the representation and generalization powers of GTN. The unveiling of universal scaling laws in quantum-probabilistic ML would be a valuable step toward establishing a white-box ML scheme interpreted within the quantum probabilistic framework.

quant-ph↗

arXiv2024

Persistent Ballistic Entanglement Spreading with Optimal Control in Quantum Spin Chains

Entanglement propagation provides a key routine to understand quantum many-body dynamics in and out of equilibrium. The entanglement entropy (EE) usually approaches to a sub-saturation known as the Page value $\tilde{S}_{P} =\tilde{S} - dS$ (with $\tilde{S}$ the maximum of EE and $dS$ the Page correction) in, e.g., the random unitary evolutions. The ballistic spreading of EE usually appears in the early time and will be deviated far before the Page value is reached. In this work, we uncover that the magnetic field that maximizes the EE robustly induces persistent ballistic spreading of entanglement in quantum spin chains. The linear growth of EE is demonstrated to persist till the maximal $\tilde{S}$ (along with a flat entanglement spectrum) is reached. The robustness of ballistic spreading and the enhancement of EE under such an optimal control are demonstrated, considering particularly perturbing the initial state by random pure states (RPS's). These are argued as the results from the endomorphism of the time evolution under such an entanglement-enhancing optimal control for the RPS's.

quant-ph↗

arXiv2024

Universal replication of chaotic characteristics by classical and quantum machine learning

Replicating chaotic characteristics of non-linear dynamics by machine learning (ML) has recently drawn wide attentions. In this work, we propose that a ML model, trained to predict the state one-step-ahead from several latest historic states, can accurately replicate the bifurcation diagram and the Lyapunov exponents of discrete dynamic systems. The characteristics for different values of the hyper-parameters are captured universally by a single ML model, while the previous works considered training the ML model independently by fixing the hyper-parameters to be specific values. Our benchmarks on the one- and two-dimensional Logistic maps show that variational quantum circuit can reproduce the long-term characteristics with higher accuracy than the long short-term memory (a well-recognized classical ML model). Our work reveals an essential difference between the ML for the chaotic characteristics and that for standard tasks, from the perspective of the relation between performance and model complexity. Our results suggest that quantum circuit model exhibits potential advantages on mitigating over-fitting, achieving higher accuracy and stability.

quant-ph↗

arXiv2023

Tensor networks for interpretable and efficient quantum-inspired machine learning

It is a critical challenge to simultaneously gain high interpretability and efficiency with the current schemes of deep machine learning (ML). Tensor network (TN), which is a well-established mathematical tool originating from quantum mechanics, has shown its unique advantages on developing efficient ``white-box'' ML schemes. Here, we give a brief review on the inspiring progresses made in TN-based ML. On one hand, interpretability of TN ML is accommodated with the solid theoretical foundation based on quantum information and many-body physics. On the other hand, high efficiency can be rendered from the powerful TN representations and the advanced computational techniques developed in quantum many-body physics. With the fast development on quantum computers, TN is expected to conceive novel schemes runnable on quantum hardware, heading towards the ``quantum artificial intelligence'' in the forthcoming future.

quant-ph↗

arXiv2023

Boundary-induced singularity in strongly-correlated quantum systems at finite temperature

Exploring the bulk-boundary correspondences and the boundary-induced phenomena in the strongly-correlated quantum systems belongs to the most fundamental topics of condensed matter physics. In this work, we study the bulk-boundary competition in a simulative Hamiltonian, with which the thermodynamic properties of the infinite-size translationally-invariant system can be optimally mimicked. The simulative Hamiltonian is constructed by introducing local interactions on the boundaries, coined as the entanglement-bath Hamiltonian (EBH) that is analogous to the heat bath. The terms within the EBH are variationally determined by a thermal tensor network method, with coefficients varying with the temperature of the infinite-size system. By treating the temperature as an adjustable hyper-parameter of the EBH, we identify a discontinuity point of the coefficients, dubbed as the ``boundary quench point'' (BQP), whose physical implication is to distinguish the point, below which the thermal fluctuations from the boundaries to the bulk become insignificant. Fruitful phenomena are revealed when considering the simulative Hamiltonian, with the EBH featuring its own hyper-parameter, under the canonical ensembles at different temperatures. Specifically, a discontinuity in bulk entropy at the BQP is observed. The exotic entropic distribution, the relations between the symmetries of Hamiltonian and BQP, and the impacts from the entanglement-bath dimension are also explored. Our results show that such a singularity differs from those in the conventional thermodynamic phase transition points that normally fall into the Landau-Ginzburg paradigm. Our work provides the opportunities on exploring the exotic phenomena induced by the competition between the bulk and boundaries.

quant-ph↗

arXiv2023

Tensor Network Efficiently Representing Schmidt Decomposition of Quantum Many-Body States

Efficient methods to access the entanglement of a quantum many-body state, where the complexity generally scales exponentially with the system size $N$, have long a concern. Here we propose the Schmidt tensor network state (Schmidt TNS) that efficiently represents the Schmidt decomposition of finite- and even infinite-size quantum states with nontrivial bipartition boundary. The key idea is to represent the Schmidt coefficients (i.e., entanglement spectrum) and transformations in the decomposition to tensor networks (TNs) with linearly-scaled complexity versus $N$. Specifically, the transformations are written as the TNs formed by local unitary tensors, and the Schmidt coefficients are encoded in a positive-definite matrix product state (MPS). Translational invariance can be imposed on the TNs and MPS for the infinite-size cases. The validity of Schmidt TNS is demonstrated by simulating the ground state of the quasi-one-dimensional spin model with geometrical frustration. Our results show that the MPS encoding the Schmidt coefficients is weakly entangled even when the entanglement entropy of the decomposed state is strong. This justifies the efficiency of using MPS to encode the Schmidt coefficients, and promises an exponential speedup on the full-state sampling tasks.

quant-ph↗