arXiv subjects

Qi Zhao

Publications and source records attributed to Qi Zhao.

At least 91 records · Page 5Linked to original sources

arXiv2025

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

The computational demands of self-attention mechanisms pose a critical challenge for transformer-based video generation, particularly in synthesizing ultra-long sequences. Current approaches, such as factorized attention and fixed sparse patterns, fail to fully exploit the inherent spatio-temporal redundancies in video data. Through systematic analysis of video diffusion transformers (DiT), we uncover a key insight: Attention matrices exhibit structured, yet heterogeneous sparsity patterns, where specialized heads dynamically attend to distinct spatiotemporal regions (e.g., local pattern, cross-shaped pattern, or global pattern). Existing sparse attention methods either impose rigid constraints or introduce significant overhead, limiting their effectiveness. To address this, we propose Compact Attention, a hardware-aware acceleration framework featuring three innovations: 1) Adaptive tiling strategies that approximate diverse spatial interaction patterns via dynamic tile grouping, 2) Temporally varying windows that adjust sparsity levels based on frame proximity, and 3) An automated configuration search algorithm that optimizes sparse patterns while preserving critical attention pathways. Our method achieves 1.6~2.5x acceleration in attention computation on single-GPU setups while maintaining comparable visual quality with full-attention baselines. This work provides a principled approach to unlocking efficient long-form video generation through structured sparsity exploitation. Project Page: https://yo-ava.github.io/Compact-Attention.github.io/

cs.CV↗

arXiv2025

Approximate k-uniform states: definition, construction and applications

$k$-Uniform states are fundamental to quantum information and computing, with applications in multipartite entanglement and quantum error-correcting codes (QECCs). Prior work has primarily focused on constructing exact $k$-uniform states or proving their nonexistence. However, due to inevitable theoretical approximations and experimental imperfections, generating exact $k$-uniform states is neither feasible nor necessary in practice. In this work, we initiate the study of approximate $k$-uniform states, demonstrating that they are locally indistinguishable from their exact counterparts unless massive measurements are performed. We prove that such states can be constructed with high probability from the Haar-random ensemble and, more efficiently, via shallow random quantum circuits. Furthermore, we establish a connection between approximate $k$-uniform states and approximate QECCs, showing that Haar random constructions yield high-performance codes with linear rates, vanishing proximity, and exponentially small failure probability while random circuits can't construct codes with linear code rate in shallow depth. Finally, we investigate the relationship between approximate QECCs and approximate quantum information masking. Our work lays the foundation for the practical application of $k$-uniform states.

quant-ph↗

arXiv2025

Lande g-factor measurements for the 5d6s 3D2 hyperfine levels of 176Lu+

We report measurements of the Lande g-factors for the 5d6s $^3$D$_2$ hyperfine levels of $^{176}$Lu$^+$ to a fractional inaccuracy of $5\times 10^{-7}$. Combining these measurements with theoretical calculations allows us to estimate hyperfine-mediated modifications to the quadrupole moments for each state and infer a value of $δΘ= 1.59(34)\times 10^{-4} \,ea_0^2$ for the residual quadrupole moment of the $^1S_0\leftrightarrow{^3}D_2$ hyperfine-averaged clock transition.

physics.atom-ph↗

arXiv2025

Quantum differential equation solvers: limitations and fast-forwarding

We study the limitations and fast-forwarding of quantum algorithms for linear ordinary differential equation (ODE) systems with a particular focus on non-quantum dynamics, where the coefficient matrix in the ODE is not anti-Hermitian or the ODE is inhomogeneous. On the one hand, for generic linear ODEs, by proving worst-case lower bounds, we show that quantum algorithms suffer from computational overheads due to two types of ``non-quantumness'': real part gap and non-normality of the coefficient matrix. We then show that homogeneous ODEs in the absence of both types of ``non-quantumness'' are equivalent to quantum dynamics, and reach the conclusion that quantum algorithms for quantum dynamics work best. To obtain these lower bounds, we propose a general framework for proving lower bounds on quantum algorithms that are amplifiers, meaning that they amplify the difference between a pair of input quantum states. On the other hand, we show how to fast-forward quantum algorithms for solving special classes of ODEs which leads to improved efficiency. More specifically, we obtain exponential improvements in both $T$ and the spectral norm of the coefficient matrix for inhomogeneous ODEs with efficiently implementable eigensystems, including various spatially discretized linear evolutionary partial differential equations. We give fast-forwarding algorithms that are conceptually different from existing ones in the sense that they neither require time discretization nor solving high-dimensional linear systems.

quant-ph↗

arXiv2025

ViTaL: A Multimodality Dataset and Benchmark for Multi-pathological Ovarian Tumor Recognition

Ovarian tumor, as a common gynecological disease, can rapidly deteriorate into serious health crises when undetected early, thus posing significant threats to the health of women. Deep neural networks have the potential to identify ovarian tumors, thereby reducing mortality rates, but limited public datasets hinder its progress. To address this gap, we introduce a vital ovarian tumor pathological recognition dataset called \textbf{ViTaL} that contains \textbf{V}isual, \textbf{T}abular and \textbf{L}inguistic modality data of 496 patients across six pathological categories. The ViTaL dataset comprises three subsets corresponding to different patient data modalities: visual data from 2216 two-dimensional ultrasound images, tabular data from medical examinations of 496 patients, and linguistic data from ultrasound reports of 496 patients. It is insufficient to merely distinguish between benign and malignant ovarian tumors in clinical practice. To enable multi-pathology classification of ovarian tumor, we propose a ViTaL-Net based on the Triplet Hierarchical Offset Attention Mechanism (THOAM) to minimize the loss incurred during feature fusion of multi-modal data. This mechanism could effectively enhance the relevance and complementarity between information from different modalities. ViTaL-Net serves as a benchmark for the task of multi-pathology, multi-modality classification of ovarian tumors. In our comprehensive experiments, the proposed method exhibited satisfactory performance, achieving accuracies exceeding 90\% on the two most common pathological types of ovarian tumor and an overall performance of 85\%. Our dataset and code are available at https://github.com/GGbond-study/vitalnet.

eess.IV↗

arXiv2025

QC-OT: Optimal Transport with Quasiconformal Mapping

The optimal transport (OT) map offers the most economical way to transfer one probability measure distribution to another. Classical OT theory does not involve a discussion of preserving topological connections and orientations in transmission results and processes. Existing numerical and geometric methods for computing OT seldom pays specific attention on this aspect. Especially, when dealing with the triangular mesh data, the known semi-discrete geometric OT (sd-OT) method employs critical operation of Delaunay triangulation (DT) to adapt topology to ensure the convexity of the energy function and the existence of the solution. This change in topology hampers the applicability of OT in modeling non-flip physical deformations in real-world tasks such as shape registration and editing problems in computer vision and medical imaging fields. This work introduces the topology structure-preserving optimal transport (QC-OT) map for the triangular mesh input. The computational strategy focuses on the two components: relaxing DT and convexity check in sd-OT and integrating quasiconformal (QC) correction. Here, quasiconformal mapping is employed to correct the regions unexpected distortions, and guarantee the topological preserving property of the transport. Furthermore, the spatial-temporal topology-preserving OT map is presented based t-OT to study the dynamics of the transportation. Multiple experiments have validated the efficiency and effectiveness of the proposed method and demonstrated its potential in the applications of mesh parameterization and image editing.

math.GN↗

arXiv2025

Trotterization, Operator Scrambling, and Entanglement

Operator scrambling, which governs the spread of quantum information in many-body systems, is a central concept in both condensed matter and high-energy physics. Accurately capturing the emergent properties of these systems remains a formidable challenge for classical computation, while quantum simulators have emerged as a powerful tool to address this complexity. In this work, we reveal a fundamental connection between operator scrambling and the reliability of quantum simulations. We show that the Trotter error in simulating operator dynamics is bounded by the degree of operator scrambling, providing the most refined analysis of Trotter errors in operator dynamics so far. Furthermore, we investigate the entanglement properties of the evolved states, revealing that sufficient entanglement can lead to error scaling governed by the normalized Frobenius norms of both the observables of interest and the error operator, thereby enhancing simulation robustness and efficiency compared to previous works. We also show that even in regimes where the system's entanglement remains low, operator-induced entanglement can still emerge and suppress simulation errors. Our results unveil a comprehensive relationship between Trotterization, operator scrambling, and entanglement, offering new perspectives for optimizing quantum simulations.

quant-ph↗

arXiv2025

Vision as a Dialect: Unifying Visual Understanding and Generation via Text-Aligned Representations

This paper presents a multimodal framework that attempts to unify visual understanding and generation within a shared discrete semantic representation. At its core is the Text-Aligned Tokenizer (TA-Tok), which converts images into discrete tokens using a text-aligned codebook projected from a large language model's (LLM) vocabulary. By integrating vision and text into a unified space with an expanded vocabulary, our multimodal LLM, Tar, enables cross-modal input and output through a shared interface, without the need for modality-specific designs. Additionally, we propose scale-adaptive encoding and decoding to balance efficiency and visual detail, along with a generative de-tokenizer to produce high-fidelity visual outputs. To address diverse decoding needs, we utilize two complementary de-tokenizers: a fast autoregressive model and a diffusion-based model. To enhance modality fusion, we investigate advanced pre-training tasks, demonstrating improvements in both visual understanding and generation. Experiments across benchmarks show that Tar matches or surpasses existing multimodal LLM methods, achieving faster convergence and greater training efficiency. Code, models, and data are available at https://tar.csuhan.com

cs.CV↗

arXiv2025

QPO: Query-dependent Prompt Optimization via Multi-Loop Offline Reinforcement Learning

Prompt engineering has demonstrated remarkable success in enhancing the performance of large language models (LLMs) across diverse tasks. However, most existing prompt optimization methods only focus on the task-level performance, overlooking the importance of query-preferred prompts, which leads to suboptimal performances. Additionally, these methods rely heavily on frequent interactions with LLMs to obtain feedback for guiding the optimization process, incurring substantial redundant interaction costs. In this paper, we introduce Query-dependent Prompt Optimization (QPO), which leverages multi-loop offline reinforcement learning to iteratively fine-tune a small pretrained language model to generate optimal prompts tailored to the input queries, thus significantly improving the prompting effect on the large target LLM. We derive insights from offline prompting demonstration data, which already exists in large quantities as a by-product of benchmarking diverse prompts on open-sourced tasks, thereby circumventing the expenses of online interactions. Furthermore, we continuously augment the offline dataset with the generated prompts in each loop, as the prompts from the fine-tuned model are supposed to outperform the source prompts in the original dataset. These iterative loops bootstrap the model towards generating optimal prompts. Experiments on various LLM scales and diverse NLP and math tasks demonstrate the efficacy and cost-efficiency of our method in both zero-shot and few-shot scenarios.

cs.AI↗

arXiv2025

Mastering Massive Multi-Task Reinforcement Learning via Mixture-of-Expert Decision Transformer

Despite recent advancements in offline multi-task reinforcement learning (MTRL) have harnessed the powerful capabilities of the Transformer architecture, most approaches focus on a limited number of tasks, with scaling to extremely massive tasks remaining a formidable challenge. In this paper, we first revisit the key impact of task numbers on current MTRL method, and further reveal that naively expanding the parameters proves insufficient to counteract the performance degradation as the number of tasks escalates. Building upon these insights, we propose M3DT, a novel mixture-of-experts (MoE) framework that tackles task scalability by further unlocking the model's parameter scalability. Specifically, we enhance both the architecture and the optimization of the agent, where we strengthen the Decision Transformer (DT) backbone with MoE to reduce task load on parameter subsets, and introduce a three-stage training mechanism to facilitate efficient training with optimal performance. Experimental results show that, by increasing the number of experts, M3DT not only consistently enhances its performance as model expansion on the fixed task numbers, but also exhibits remarkable task scalability, successfully extending to 160 tasks with superior performance.

cs.LG↗

arXiv2025

Super-additivity of quantum capacity in simple channels

The super-additivity of quantum channel capacity is an important feature of quantum information theory different from classical theory, which has been attracting attention. Recently a special channel called ``platypus channel'' exhibits super-additive quantum capacity when combined with qudit erasure channels. Here we consider the ``generalized platypus channel'', prove that it has computable channel capacities, such as both private and classical capacity equal to $1$, and in particular, the generalized platypus channel still displays the super-additivity of quantum capacity when combined with qudit erasure channels and multilevel amplitude damping channels respectively.

quant-ph↗

arXiv2025

Absolute frequency measurement of a Lu$^+$ $(^{3}\rm D_1)$ optical frequency standard via link to international atomic time

We report on an absolute frequency measurement of the ${\rm Lu}^{+}\,(^{3}\rm D_1)$ standard frequency which is defined as the hyperfine-average of $^{1}\rm S_0$ to $^{3}\rm D_1$ optical clock transitions in $^{176}{\rm Lu}^{+}$. The measurement result of $353\,638\,794\,073\,800.35(33)$Hz with a fractional uncertainty of $9.2 \times 10^{-16}$ was obtained by operating a single-ion $^{176}{\rm Lu}^{+}$ frequency standard intermittently over 3 months with a total uptime of 162 hours. Traceability to the International System of Units (SI) is realized by remote link to International Atomic Time. This is the first reported absolute frequency value for a ${\rm Lu}^{+}\,(^{3}\rm D_1)$ optical frequency standard.

physics.atom-ph↗

arXiv2025

Theoretical Study of Charge Transport Properties of Curved PAH Organic Semiconductors

Curved polycyclic aromatic hydrocarbons (PAHs) exhibit distinctive geometric and electronic structures, rendering them highly promising in addressing issues of solubility and air stability, which are faced for large linear arene $π$-conjugated organic semiconductors. In this study, a series of surface-curved PAHs and the heteroatom doped derivatives are selected and designed, and the relationship between electronic structure and charge transport properties of these molecules is investigated by using density functional theory (DFT). And the effects of sulfur/oxygen, nitrogen and boron doping on the charge transport performance of curved PAH semiconductors are explored. The results show that curved PAHs exhibit improved solubility and stability, with the degree of molecular curvature significantly affecting the material's transport properties.

physics.chem-ph↗

arXiv2025

Theoretical study on charge transfer properties of triphenylamino-ethynyl Polycyclic Aromatic Hydrocarbon derivatives

This study systematically investigates the regulation mechanisms of backbone topology (tri-/tetracyclic arenes), substitution positions, and functional groups on charge transport properties through molecular design of triphenylamine-ethynylene fused acene derivatives. By integrating Marcus charge transfer theory with kinetic Monte Carlo simulations, we demonstrate that sulfur-doped tricyclic arene backbones (benzodithiophene and anthracene) effectively suppress high-frequency vibrational modes reducing reorganization energy to 146.1 meV. Concurrent optimization of intermolecular $π$-$π$ slippage enhances 2D hole mobility. Notably, asymmetric charge transport pathways in 2,7-disubstituted pyrene(27DTEP) decrease transfer integrals by 34%, while 1,6-substitution (16DTEP)reconstructs HOMO orbital distribution and induces rotational stacking, boosting transfer integrals by 28% and improving mobility isotropy. We further propose a "backbone-functional group synergy" strategy, revealing that concentrated orbital localization on the backbone amplifies transfer integral gains, outweighing the 38% increase in reorganization energy and significantly enhancing mobility. These findings establish a theoretical framework and quantitative model for the rational design of high-mobility organic ultraviolet photodetectors.

physics.chem-ph↗

arXiv2025

KnowPath: Knowledge-enhanced Reasoning via LLM-generated Inference Paths over Knowledge Graphs

Large language models (LLMs) have demonstrated remarkable capabilities in various complex tasks, yet they still suffer from hallucinations. By incorporating and exploring external knowledge, such as knowledge graphs(KGs), LLM's ability to provide factual answers has been enhanced. This approach carries significant practical implications. However, existing methods suffer from three key limitations: insufficient mining of LLMs' internal knowledge, constrained generation of interpretable reasoning paths, and unclear fusion of internal and external knowledge. Therefore, we propose KnowPath, a knowledge-enhanced large model framework driven by the collaboration of internal and external knowledge. It relies on the internal knowledge of the LLM to guide the exploration of interpretable directed subgraphs in external knowledge graphs, better integrating the two knowledge sources for more accurate reasoning. Extensive experiments on multiple real-world datasets demonstrate the effectiveness of KnowPath. Our code and data are available at https://github.com/tize-72/KnowPath.

cs.AI↗

arXiv2025

Quantum Hamiltonian Certification

We formalize and study the Hamiltonian certification problem. Given access to $e^{-\mathrm{i} Ht}$ for an unknown Hamiltonian $H$, the goal of the problem is to determine whether $H$ is $\varepsilon_1$-close to or $\varepsilon_2$-far from a target Hamiltonian $H_0$. While Hamiltonian learning methods have been extensively studied, they often require restrictive assumptions and suffer from inefficiencies when adapted for certification tasks. This work introduces a direct and efficient framework for Hamiltonian certification. Our approach achieves \textit{optimal} total evolution time $Θ((\varepsilon_2-\varepsilon_1)^{-1})$ for certification under the normalized Frobenius norm, without prior structural assumptions. This approach also extends to certify Hamiltonians with respect to all Pauli norms and normalized Schatten $p$-norms for $1\leq p\leq2$ in the one-sided error setting ($\varepsilon_1=0$). Notably, the result in Pauli $1$-norm suggests a quadratic advantage of our approach over all possible Hamiltonian learning approaches. We also establish matching lower bounds to show the optimality of our approach across all the above norms. We complement our result by showing that the certification problem with respect to normalized Schatten $\infty$-norm is $\mathsf{coQMA}$-hard, and therefore unlikely to have efficient solutions. This hardness result provides strong evidence that our focus on the above metrics is not merely a technical choice but a requirement for efficient certification. To enhance practical applicability, we develop an ancilla-free certification method that maintains the inverse precision scaling while eliminating the need for auxiliary qubits, making our approach immediately accessible for near-term quantum devices with limited resources.

quant-ph↗

arXiv2025

Seaweed-7B: Cost-Effective Training of Video Generation Foundation Model

This technical report presents a cost-efficient strategy for training a video generation foundation model. We present a mid-sized research model with approximately 7 billion parameters (7B) called Seaweed-7B trained from scratch using 665,000 H100 GPU hours. Despite being trained with moderate computational resources, Seaweed-7B demonstrates highly competitive performance compared to contemporary video generation models of much larger size. Design choices are especially crucial in a resource-constrained setting. This technical report highlights the key design decisions that enhance the performance of the medium-sized diffusion model. Empirically, we make two observations: (1) Seaweed-7B achieves performance comparable to, or even surpasses, larger models trained on substantially greater GPU resources, and (2) our model, which exhibits strong generalization ability, can be effectively adapted across a wide range of downstream applications either by lightweight fine-tuning or continue training. See the project page at https://seaweed.video/

cs.CV↗

arXiv2025

AutoOpt: A General Framework for Automatically Designing Metaheuristic Optimization Algorithms with Diverse Structures

Metaheuristics are widely recognized gradient-free solvers to hard problems that do not meet the rigorous mathematical assumptions of conventional solvers. The automated design of metaheuristic algorithms provides an attractive path to relieve manual design effort and gain enhanced performance beyond human-made algorithms. However, the specific algorithm prototype and linear algorithm representation in the current automated design pipeline restrict the design within a fixed algorithm structure, which hinders discovering novelties and diversity across the metaheuristic family. To address this challenge, this paper proposes a general framework, AutoOpt, for automatically designing metaheuristic algorithms with diverse structures. AutoOpt contains three innovations: (i) A general algorithm prototype dedicated to covering the metaheuristic family as widely as possible. It promotes high-quality automated design on different problems by fully discovering potentials and novelties across the family. (ii) A directed acyclic graph algorithm representation to fit the proposed prototype. Its flexibility and evolvability enable discovering various algorithm structures in a single run of design, thus boosting the possibility of finding high-performance algorithms. (iii) A graph representation embedding method offering an alternative compact form of the graph to be manipulated, which ensures AutoOpt's generality. Experiments on numeral functions and real applications validate AutoOpt's efficiency and practicability.

cs.NE↗