arXiv subjects

Jizhe Lai

Publications and source records attributed to Jizhe Lai.

7 recordsLinked to original sources

arXiv2026

Learning Quantum Matter through Attention in Complex Space

Magnetic many-electron wavefunctions require amplitude and phase to be optimized together. Whether a complex internal representation improves this variational search is a practical question for neural wavefunction design. We introduce Complex Psiformer for interacting electrons in a magnetic moiré continuum, combining complex hidden features and Hermitian-magnitude attention with magnetic boundary conditions and fermionic antisymmetry. After the same number of optimization steps, Complex Psiformer reaches lower energies than Real Psiformer in two finite supercells. Both Psiformers also improve on their respective neural Hartree-Fock references. Across five training seeds in the 25-cell system, the mean Complex advantage is 1.458 meV per electron, with a smaller observed spread. A separately trained two-electron Complex state has a smaller energy gap to a finite configuration interaction reference than its Real counterpart. In the Complex states, flux scans show nonmonotonic density correlations and weaker honeycomb mean-density modulation at higher flux, while connected fluctuations persist. Gauge invariant current maps provide a qualitative comparison of local circulation in the optimized states. These benchmarks support the combined architecture as a variational ansatz for studying energies and charge arrangements in finite magnetic systems.

cond-mat.str-el↗

arXiv2026

Algebraic Speedups for Exact Inversion of Hamiltonian Evolutions

Deterministic exact inversion of an arbitrary $d$-dimensional unitary requires {$Θ(d^2)$} coherent forward calls in the worst case. We ask how this cost changes for Hamiltonian evolution $U(x)=\exp(i\sum_j x_jH_j)$ when the generators are known but the parameters are hidden. For one-parameter families with a fixed eigenbasis, we show that additive relations among the distinct eigenvalues determine the optimal query number exactly, and we construct the corresponding inversion protocol. For general families, we prove that repeated symmetry sectors do not affect the exact query complexity and give an automatic construction for combining inverses from inequivalent active sectors. We also give a sufficient phase-alignment condition under which family-specific structure can reduce the query number. These results establish structure-dependent bounds for reversing the unknown dynamics arising in Tavis-Cummings out-of-time-order correlator protocols, collective-spin echo verification, and passive multimode links, without requiring prior knowledge or explicit estimation of the underlying coupling strengths.

quant-ph↗

arXiv2026

Benchmarking Agents for Proving Theorems in Quantum Algorithms and Quantum Information

Formal verification is becoming increasingly practical for quantum computing, yet the ability of AI agents to construct machine-checkable proofs in this domain remains unmeasured. We introduce Lean-QuantumAlg-Bench and Lean-QIT-Bench, two Lean 4 benchmarks containing 36 and 40 theorem-completion tasks for quantum algorithms and quantum information theory, respectively. Every task compiles in a fixed environment and is evaluated by deterministic proof checking and targeted semantic review, with difficulty weights assigned before model execution. We evaluate four models-GPT-5.5, Kimi K3, DeepSeek V4-Pro, and MiniMax M3-within a common theorem-proving framework under two settings: a task-only baseline and library-augmented deduction (LAD), which additionally provides access to a verified domain library. The highest difficulty-weighted scores are 60.4 out of 100 on the quantum-algorithm benchmark and 59.6 out of 100 on the quantum-information benchmark. LAD improves both score and completion rate in all eight model-benchmark comparisons, with gains of up to 15.9 points, providing evidence that verified libraries can strengthen domain-specific proof agents. The results reveal recurring weaknesses of agentic proving in areas such as quantum simulation, quantum learning, quantum information measures, and entanglement theory. Monetary and wall-clock costs per score point also vary substantially across models, highlighting important capability-efficiency trade-offs. We expect these benchmarks to establish a reproducible baseline for developing more capable and reliable proof agents, and to pave the way toward self-evolving AI scientists for advancing quantum information science.

quant-ph↗

arXiv2026

Quantum Imaginary-Time Evolution with Polynomial Resources in Evolution Time

Imaginary-time evolution is fundamental for analyzing quantum many-body systems, with applications spanning quantum chemistry, condensed matter physics, and quantum field theory, yet classical simulation requires exponentially growing resources in both system size and evolution time. While quantum approaches reduce the system-size scaling, existing methods rely on heuristic techniques with measurement precision or success probability that deteriorates as evolution time increases. We present a quantum algorithm that prepares normalized imaginary-time evolved states using an adaptive normalization factor to maintain a stable success probability over long imaginary-time intervals. Our algorithm approximates the target state with error polynomially small in the inverse imaginary time using a polynomial number of elementary quantum gates and a single ancilla qubit, with success probability close to one. When the initial state has reasonable overlap with the ground state, this algorithm also achieves polynomial query complexity in the system size. To our knowledge, this is the first quantum algorithm for imaginary-time evolution with provably polynomial resource scaling in evolution time. Numerical experiments validate our theoretical analysis for evolution time up to 50, demonstrating the algorithm's effectiveness for long-time evolution. Building on this technique, we further develop imaginary-time-evolution-based algorithms for ground-state-related problems and for simulating open quantum systems. These algorithms can reduce circuit depth in certain regimes compared with existing methods, at the expense of higher total query complexity, advancing the practical feasibility of quantum simulation on early fault-tolerant devices.

quant-ph↗

arXiv2026

Thermal-Drift Sampling: Generating Thermal Ensembles for Learning Many-Body Systems

Thermal equilibrium states of many-body Hamiltonians are essential for probing quantum chaos, finite-temperature phases of matter, and training quantum machine learning models, yet generating large collections of such states across different Hamiltonians remains costly with existing methods. We introduce a powerful operation, the quantum thermal-drift channel, to construct a measurement-controlled sampling algorithm that autonomously generates thermal states together with their system Hamiltonians as labels for general physical models. We prove that our algorithm is efficient: the total gate count scales polynomially with system size and quadratically with inverse temperature, providing the first polynomial resource bound for random thermal state generation. We characterize the distribution of sampled Hamiltonians as a normal distribution reweighted by partition functions, which quantifies a trade-off between sampling accuracy and effective label range. Level-spacing statistics computed from sampled thermal states of a 2D transverse-field Ising model show a crossover to Wigner-Dyson universality, confirming that the sampler captures nontrivial chaotic correlations. Finally, a variational quantum classifier trained on the generated dataset achieves near-optimal accuracy in predicting Hamiltonian properties of unseen states. These results establish a scalable, quantum-native route for thermodynamic simulation and labeled quantum data generation in many-body systems.

quant-ph↗

arXiv2024

Probing the Quantum and Classical Boundary: A Tabletop Experiment Using Quantum Optics

In this work, we propose a simple but effective experiment for probing the boundary in which a wave-function collapses. Using a quantum optics system interacting with a photomultiplier tube (PMT), one is able to determine the number of electrons needed to interfere with the "which-path" information to cause the collapse of a quantum state.

quant-ph↗

arXiv2023

A model local interpretation routine for deep learning based radio galaxy classification

Radio galaxy morphological classification is one of the critical steps when producing source catalogues for large-scale radio continuum surveys. While many recent studies attempted to classify source radio morphology from survey image data using deep learning algorithms (i.e., Convolutional Neural Networks), they concentrated on model robustness most time. It is unclear whether a model similarly makes predictions as radio astronomers did. In this work, we used Local Interpretable Model-agnostic Explanation (LIME), an state-of-the-art eXplainable Artificial Intelligence (XAI) technique to explain model prediction behaviour and thus examine the hypothesis in a proof-of-concept manner. In what follows, we describe how \textbf{LIME} generally works and early results about how it helped explain predictions of a radio galaxy classification model using this technique.

astro-ph.IM↗