Searcharxiv⌕ Search

arXiv subjects

Qi Zhao

Publications and source records attributed to Qi Zhao.

At least 19 recordsLinked to original sources

Compact Attention: Exploiting Structured Spatio-Temporal Sparsity for Fast Video Generation

The quadratic computational complexity of self-attention mechanisms imposes a critical constraint on transformer-based video generation, particularly for synthesizing ultra-long and high-definition sequences. While most sparse attention techniques employ fixed or heuristic patterns, they often struggle to accommodate the heterogeneous and layer-specific redundancies inherent in video diffusion transformers (VDiTs). We find that different attention heads consistently concentrate most of their attention mass in different coarse query-key regions, a behavior we call functional specialization. Although individual attention values vary with the generated content, these regions remain similar across prompts and random seeds. Leveraging these insights, we introduce Compact Attention, a hardware-aware sparse attention framework for efficient long-video synthesis. We quantify this stability and use it to construct searchable, reusable, head-specific masks. Based on the observation, we propose a deformable dual-window sparse pattern mechanism that flexibly approximates local and axial attention regions within one tile-aligned mask family. To avoid manually choosing a mask for each head, we develop a recall-driven offline auto-search algorithm that identifies high-quality sparse masks while leveraging temporal stability for mask reuse. Extensive evaluations on Wan2.1 (14B) and Hunyuan-Video demonstrate that Compact Attention achieves 2.25x/3.03x attention speedups over FlashAttention-2 and 1.20x/1.74x over FlashAttention-3, respectively, while maintaining visual quality and temporal consistency comparable to full-attention baselines. Project Page: https://yo-ava.github.io/Compact-Attention.github.io/

cs.CV↗

Traveling waves near shear flows for the inhomogeneous Euler equations with non-constant density

We investigate the existence and nonexistence of traveling wave solutions near monotonic shear flows with non-constant background density for the two-dimensional inhomogeneous Euler equations in a finite channel. For any small $τ>0$, first, we construct nontrivial traveling waves with velocity and density in $H^{5/2-τ}$ and $H^{3/2-τ}$, respectively, showing that inviscid damping fails at these regularities. Second, when the distorted Rayleigh operator has no eigenvalues, we prove that such traveling wave solutions cannot exist in higher regularity spaces ($H^{5/2+τ}$ for velocity and $H^{3/2+τ}$ for density).

math.AP↗

DynaSlots: Slot-Centric 3D Dynamics Pretraining for Robot Manipulation

Robot manipulation involves localized changes: picking up a cup moves the cup while leaving the surrounding scene largely unchanged. Yet existing 3D visual pretraining methods, including recent dynamics-aware variants, model state transitions at the scene level, compressing the motion of everything in a scene into a single global latent action. This conflates semantically distinct transitions in scenes with multiple moving parts, obscures dependencies between changing regions, and leaves the learned representation vulnerable to task-irrelevant scene content. We introduce DynaSlots, an action-free, label-free pretraining framework that decomposes each point cloud frame into a small set of temporally consistent slots and models dynamics at this per-slot level rather than the scene level. A temporal slot propagation module promotes consistent slot assignments across frames; an inverse dynamics model then extracts one latent action per slot from feature differences, and a diffusion-based forward dynamics model, paired with a self-supervised interaction head, predicts each slot's future state while learning pairwise proximity-and-motion relations. Experiments on Meta-World, Adroit, and a RealMan RM65-B robot demonstrate that DynaSlots outperforms prior scene-level baselines. It achieves superior success rates in simulation and exhibits strong robustness to scene clutter and unseen objects in real-world manipulation. Code is available at \href{https://zhucezhanghao12345-source.github.io/DynaSlots-Anonymous/}{https://zhucezhanghao12345-source.github.io/DynaSlots-Anonymous/}.

cs.RO↗

CyberCane: a privacy-bounded neuro-symbolic retrieval framework for phishing detection under distribution shift

Organizations usually calibrate phishing detectors on public corpora, because privacy rules make their own labeled legitimate mail hard to collect. This practice breaks the false-positive budget of trained detectors: calibrated for a 1% false-positive rate (FPR) on older public mail and deployed on DataPhish 2025, they realize 20.2-22.9% FPR, 9-94 times the budget across three calibration sources. The cause is calibration transfer, not ranking: the classifiers separate the deployment mail well, but their thresholds do not transfer. We introduce CyberCane, a privacy-bounded neuro-symbolic detector that scores email only by similarity to known phishing in a redacted, training-only index, plus deterministic rules, and calibrates verdicts to an explicit FPR budget. Because legitimate mail never enters its score, only its threshold depends on the calibration source. Under the same shift CyberCane realizes 5.4% FPR at 86.4% recall, reducing the overrun 2.7-6.1 times across sources, seeds, a second shift family, and a local embedder. A segment-level variant, scoring an email's most phishing-like part, lowers the realized FPR a further 1.2-2.7 times at equal ranking quality and withstands benign padding. CyberCane screens an email locally in 0.20 s, sending no text out; a 70B zero-shot LLM ranks better at strict FPR but is 14-24 times slower and must receive each email. We also show that LLM rewriting does not evade embedding-based detectors and that a random split of DataPhish 2025 leaks 96% of its test set. All protocols were fixed in advance, and the released splits and code let a deployer measure realized FPR before trusting a budget.

cs.CR↗

Efficient Quantum Algorithm for Mixed-State Quantum Geometry

Mixed-state quantum geometry plays a fundamental role in quantum metrology, multiparameter estimation, and the characterization of quantum many-body systems. Yet, unlike its pure-state counterpart, accessing mixed-state geometry requires solving an ill-conditioned Lyapunov equation for the symmetric logarithmic derivative (SLD), posing a major challenge for resource-efficient quantum computation. Here we address the challenge and develop a novel quantum algorithmic framework for efficiently accessing the quantum Fisher information matrix (QFIM) and quantum geometric tensor (QGT) of mixed states. Our key insight is to uncover a previously unexplored connection between the positive semidefinite structure of density matrices and exponentially convergent Gauss-Laguerre quadrature, enabling an efficient integral-based construction of the SLD. A rigorous complexity analysis further establishes the resource efficiency of our algorithm, demonstrating logarithmic precision dependence and double-logarithmic ancillary-qubit overhead at fixed conditioning. Building on this construction, we achieve near-Heisenberg precision scaling for diagonal QFI estimation without quantum phase estimation and construct unified block encodings of the full QFIM and QGT under a bounded spectral-gap assumption. A complementary regularized algorithm extends efficient diagonal estimation to exponentially small spectral gaps under a bounded-response condition. Our results establish a resource-efficient route to coherent mixed-state quantum geometry, enabling its direct integration into quantum linear-algebra algorithms without classical reconstruction and opening new possibilities for quantum-enhanced multiparameter metrology.

quant-ph↗

Learning to Design Convex Relaxations for Nonconvex Optimization

Convex relaxations make nonconvex optimization tractable by replacing hard nonconvex problems with convex surrogates that give valid bounds. Yet their design is still largely manual: a human expert must decide where to relax, which relaxation to use, and how much formulation growth is worth paying. We show that this design process can be learned. The method proposed in this paper, AutoConvexRelax, represents the symbolic formulation of a nonconvex problem as a tripartite graph linking variables, symbolic terms, and their objective or constraint positions. It then learns a policy that composes symbolic rewrites into problem-specific relaxation trajectories as the formulation evolves. We prove that finite action sequences generated by the learned policy preserve relaxation validity under explicit domain, occurrence-context, and representation-consistency conditions. We further establish computable error bounds for mixed relaxations and sufficient conditions for feasible recovery and global-optimality certification. As a first instantiation, we apply the method to nonconvex quadratic problems and fractional problems. On 241 benchmark quadratic instances, the learned policy strengthens McCormick lower bounds by 13.52%. Its mean lower bound is 3.70% below strengthened semidefinite relaxations on the normalized comparison metric, while it uses substantially smaller formulations. The learned policy retains this trade-off on fractional instances and reaches near-semidefinite bounds on beamforming and sensor-network localization instances. These results suggest that convex relaxation design can move from a fixed handcrafted choice to an automated learning process that adapts to problem structures. Code is available at https://github.com/auto4opt/AutoConvexRelax.

cs.LG↗

Universal entanglement detection with geometrically optimal witnesses

Constructing optimal entanglement witnesses for arbitrary quantum systems remains a formidable challenge, hindered by the structural complexity of high-dimensional quantum state spaces. In this work, we overcome this barrier by introducing a unified framework for constructing geometrically optimal witnesses capable of identifying arbitrary entanglement structures. By leveraging the geometric properties of a target quantum state relative to a specific entanglement structure in Hilbert-Schmidt space, these witnesses are constructed in an efficient and effective manner. Among all nontrivial witnesses, they provide maximal distinguishability between the target state and the set of states without the desired entanglement structure. As a result, our approach enables the universal detection of bipartite, multipartite, and high-dimensional entanglement. To demonstrate its experimental feasibility, we apply the framework to a four-qubit nuclear spin quantum system. Compared to existing methods, our approach offers enhanced noise robustness, broader detection universality, and improved construction efficiency, providing a powerful and versatile tool for advancing the characterization and understanding of entanglement in quantum systems.

quant-ph↗

Sequence-Structured Decision Learning for Branch-and-Bound in Mixed-Integer Linear Programming

Branch-and-bound (BnB) solves mixed-integer linear programs by constructing and exploring a search tree. Node selection and branching are two recurrent decisions that directly determine the tree. Learning-based approaches typically optimize either decision in isolation and condition on a mostly local view, leaving the coupled evolution of the search tree insufficiently modeled. This paper proposes Seq-BnB, a sequence-structured framework that learns branching and node selection from a shared global representation of the evolving BnB process. Seq-BnB serializes node creations, node updates, node-selection events, and branching events into typed tokens, producing a causal event sequence of the search trajectory. A self-attention encoder summarizes this global search history, a bipartite graph neural network encodes the current LP relaxation, and context-conditioned decision heads score branching variables and open nodes. To reduce distribution shift between expert demonstrations and learned policies, Seq-BnB is trained with DAgger-style data aggregation. On four MILP benchmark families, Seq-BnB consistently processes fewer BnB nodes than heuristic and learning-based baselines, with strong solution times on both standard and larger transfer instances. While this paper evaluates Seq-BnB instantiation for branching and node selection, it accommodates additional solver decisions, such as cut selection, by introducing new action tokens and decision heads.

cs.LG↗

Entanglement detection in dynamical quantum systems

Quantum science and engineering increasingly target the exploitation and control of large-scale dynamical systems. As system size grows, novel phenomena and quantum advantages emerge, but the resulting many-body dynamics become correspondingly harder to monitor and characterize. In particular, the underlying Hamiltonian often lacks symmetries, and the induced many-body dynamics quickly become hard to track. Focusing on one of the most important quantum features---entanglement---we demonstrate that, for a broad class of common Hamiltonian models, one can design effective witnesses that detect both the presence and structure of entanglement over relatively long evolution times. Inspired by stabilizer-based simulation, we track the evolution of generalized stabilizers of the underlying state and use them to construct linear entanglement witnesses. Through numerical experiments on Heisenberg-type Hamiltonians with up to twelve qubits, we show that the required number of measurement settings can be kept at a modest scale as the system size increases, and entanglement detection remains effective over evolution times that significantly exceed those accessible to naive approaches. The corresponding calculations can be carried out largely symbolically. Furthermore, unlike accurate state simulation, the stabilizer-based design of entanglement witnesses can be performed in a much more coarse-grained, digitized manner. We hope these results will stimulate further exploration of the quantum control of large systems.

quant-ph↗

A multimodal large language model for evidence-based autism spectrum disorder screening

The clinical management of autism spectrum disorder (ASD) faces a bottleneck in early screening, mainly because trained specialists are scarce and conventional assessment tools are subjective. Here, we introduce ASDchat, a multimodal large language model designed for evidence-based ASD screening, which takes video, audio, and dialogue as input. ASDchat adopts a dual-branch architecture, where the decision branch generates screening probabilities and the evidence branch generates traceable, timestamped behavioral evidence aligned with the Autism Diagnostic Observation Schedule (ADOS-2). The model was trained and evaluated on a dataset of 1,035 participants from 27 sites in China, which covered typically developing (TD) children, children with ASD, and children with other developmental disorders. For ASD versus TD, ASDchat reached an area under the receiver operating characteristic curve (AUC) of 0.953 $\pm$ 0.021. On 6 held-out sites that were not used for training, the mean AUC was 0.961. Furthermore, unsupervised clustering of the behavioral dimensions split the ASD cases into six subtypes with different phenotypic profiles, and ASDchat suggests an intervention for each subtype. ASDchat provides a feasible path for large-scale, evidence-based ASD screening in clinical practice.

cs.CV↗

Classical Simulation Healed by Quantum Entanglement

Entanglement is not only the origin of exotic quantum phenomena, but also widely regarded as the fundamental barrier to classical simulation of quantum dynamics. We overturn this intuition: for predicting local observables under Hamiltonian evolution, entanglement in the quantum state actually heals the classical simulation error in the Heisenberg picture. Classical algorithms that propagate observables in the Pauli basis with proper truncation have shown remarkable empirical success in simulating noiseless quantum dynamics, yet all prior rigorous guarantees required noise or randomness---leaving the physically relevant noiseless regime without theoretical foundation. To close this gap, we prove that the truncation error of Low-weight Pauli Dynamics (LPD) admits an average-case bound without assuming randomness, provided the state is sufficiently entangled. Since tensor-network methods efficiently simulate low-entanglement states while LPD thrives precisely in the complementary regime, together they extend rigorous classical simulation to longer times, sharpening the boundary between classically simulable and genuinely quantum dynamics.

quant-ph↗

Quantum state determinability from local marginals is universally robust

A fundamental problem in quantum physics is to establish whether a multiparticle quantum state can be uniquely determined from its local marginals. In theory, this problem has been addressed in the exact case where the marginals are perfectly known. In practice, however, experiments only have access to finite statistics and therefore can only determine the marginals of a quantum state up to an error. In this Letter, we prove that unique determinability universally survives such local imperfections: specifically, for every uniquely determined state, we show that deviations of local marginals propagate to global states strictly bounded by a power law with exponent $α\in(0,1]$. This result induces a classification of multipartite quantum states by their power-law exponents, with linear scaling $α=1$ as the most favorable regime. We derive a necessary and sufficient criterion for linear robustness and translate it into an executable semidefinite programming certification. Applying our theory, we prove that stabilizer states are at least square-root robust and provide a complete robustness classification for the Dicke family. Finally, we exploit these results to construct a scalable two-local genuine multipartite entanglement witness, demonstrating the viability of this framework for broad practical applications.

quant-ph↗

Entanglement-Induced Resilience of Quantum Dynamics

Quantum many-body devices suffer from imperfections that destabilize dynamics and limit scalability. We show that the dynamical growth of entanglement can intrinsically protect generic quantum dynamics against coherent and perturbative noise. Through rigorous theoretical analysis of general quantum dynamics and numerical simulations of spin chains and fermionic lattices, we prove that entanglement-entropy growth confines the influence of local Hamiltonian perturbations, thereby suppressing errors in dynamical errors. The degree of protection correlates quantitatively with the entanglement entropy of subsystems on which the perturbations act, and applies broadly to both analog quantum simulators and real-time control protocols. This entanglement-induced resilience is conceptually distinct from quantum error correction or dynamical decoupling: it passively leverages native many-body correlations without additional qubits, measurements, or control overhead. Our results reveal a generic mechanism linking entanglement growth to dynamical stability and provide practical guidelines for designing noise-resilient quantum devices.

quant-ph↗

Absolute frequency measurement of a $^{176}$Lu$^+\,(^{3}\mathrm{D}_1)$ standard against the NRC-FCs2 fountain with $2.6\times10^{-16}$ uncertainty

We report an improved absolute frequency measurement of the $^{176}$Lu$^+\,(^{3}\mathrm{D}_1)$ optical frequency standard, evaluated via a remote link to the NRC-FCs2 caesium fountain primary frequency standard. Operating a single ion clock with 94.2% uptime over 10 days, and using an ambiguity-resolved precise point positioning (PPP-AR) link over the Global Positioning System, we determine an absolute frequency of $353\,638\,794\,073\,800.332(91)\,$Hz at a fractional uncertainty of $2.6 \times 10^{-16}$. This agrees with our previous result, which underpins the Comité international des poids et mesures recommended frequency value, and reduces the uncertainty by a factor of 3.6.

physics.atom-ph↗

Precision measurement of the $^{176}\mathrm{Lu}^+$ $^3D_1$ microwave clock transitions

We report precision measurement of the unperturbed ${^{3}}D_1$ microwave transition frequencies in $^{176}\mathrm{Lu}^+$ to a fractional uncertainty of $4\times10^{-14}$. We find the $|F,m_F\rangle=|8,0\rangle$ to $|7,0\rangle$ hyperfine transition frequency to be $10\,491\,519\,945.228\,82(38)\,$Hz and the $|7,0\rangle$ to $|6,0\rangle$ transition frequency to be $11\,290\,004\,289.881\,61(36)\,$ Hz. At this precision we are able to observe the hyperfine-mediated effects in the ratio of the quadrupole shifts, from which we can directly infer the residual quadrupole moment after $^3D_1$ hyperfine averaging. We find a residual quadrupole moment of ${-2.48(23)\times10^{-4}}\,e a_0^2$, consistent with a previous assessment using a different and less direct method. With the unperturbed microwave frequencies accurately known, the residual quadrupole shift for a $^{176}\mathrm{Lu}^+$ ($^3D_1$) optical frequency standard can henceforth be readily evaluated to $<10^{-20}$ uncertainty by routine ${^{3}}{D}_1$ microwave spectroscopy.

physics.atom-ph↗

Evaluating Beyond the Screen: Collective Assessment of AI-Generated Business Plans with Resource-Constrained Entrepreneurs

Entrepreneurs increasingly use end-user generative AI technologies such as ChatGPT for high-stakes documents like loan applications and business plans, where AI-generated errors---a wrong price, a fabricated product---can affect loan or funding outcomes. Current approaches to supporting evaluation of AI-generated text assume a single user assessing output alone, on screen. This can be especially demanding for resource-constrained entrepreneurs, whose digital and AI skills vary widely. In this early-stage work, we explore how evaluation might instead be organized in a group setting and completed as a collective activity. We extended BizChat, an AI-powered business-planning tool, with an evaluation module that links each generated claim to the entrepreneur's original input. We partner with community organizations in Maryland---embedding BizChat within various entrepreneurship programs---where workshop attendees (N=14) evaluated their plans through think-pair-share discussion. Early findings suggest interface scaffolds like claim-to-input links primed attendees with concrete, personal evaluations, which the group setting then extended beyond the screen: attendees requested printed copies, used rubrics to compare across plans, and drew on peers' knowledge to verify what they could not easily judge alone.

cs.HC↗

Distributed Quantum Simulation

Quantum simulation is a promising pathway toward practical quantum advantage by simulating large-scale quantum systems. In this work, we propose communication-efficient distributed quantum simulation protocols by exploring three quantum simulation algorithms, including the product formula, the truncated Taylor series, and quantum signal processing over a quantum network. Crucially, our protocols significantly reduce the local hardware requirements of individual quantum processing units while ensuring the overall gate complexity does not exceed that of standard monolithic architectures. Our protocols are further shown to be optimal by deriving a lower bound on the quantum communication complexity for distributed quantum simulations with respect to evolution time and the number of distributed quantum processing units. Additionally, our distributed techniques go beyond quantum simulation and are applied to distributed versions of Grover's algorithm and quantum phase estimation. Our work not only paves the way for achieving a practical quantum advantage by scalable quantum simulation but also enlightens the design of more general distributed architectures across various physical systems for quantum computation.

quant-ph↗

Environmental records unlock universal quantum computation from thermal decoherence

At a fixed thermal exposure, the same stabilizer processor can be classically simulable or quantum universal, depending on which environmental records its controller retains. We give an exact computational classification of energy-counting thermal-idle instruments in a quantum processor with ideal stabilizer control and independent local Markov baths. The relaxation time $T_1$, homogeneous coherence time $T_2$, and equilibrium excited-state population $p_e$ determine an exact computational boundary at $(1-p_e)T_2/T_1=1$. If every location lies at or below it, branchwise nonnegative stabilizer decompositions give an explicit efficient classical sampler for the adaptive circuit and its full time-resolved exchange record. Above it at a single repeatedly accessible location, a suitable idle duration and no-exchange conditioning supply distillable ancillas and enable universal quantum computation with polynomial overhead. At finite temperature on the resource side, erasing the record at a sufficiently long, unsplit exposure makes the averaged channel stabilizer measure-and-prepare, and even a terminal parity check then yields only simulable branches. Yet at that same exposure, retaining only the bit recording whether any exchange occurred still heralds distillable ancillas, because a thermal round trip restores the parity after its first exchange has already removed the coherence.

quant-ph↗