arXiv subjects

Yang He

Publications and source records attributed to Yang He.

At least 73 records · Page 4Linked to original sources

arXiv2025

Prethermalization by Random Multipolar Driving on a 78-Qubit Superconducting Processor

Time-dependent drives hold the promise of realizing non-equilibrium many-body phenomena that are absent in undriven systems. Yet, drive-induced heating normally destabilizes the systems, which can be parametrically suppressed in the high-frequency regime by using periodic (Floquet) drives. It remains largely unknown to what extent highly controllable quantum simulators can suppress heating in non-periodically driven systems. Using the 78-qubit superconducting quantum processor, Chuang-tzu 2.0, we report the experimental observation of long-lived prethermal phases in many-body systems with tunable heating rates, driven by structured random protocols, characterized by $n$-multipolar temporal correlations. By measuring both the particle imbalance and subsystem entanglement entropy, we monitor the entire heating process over 1,000 driving cycles and observe the existence of the prethermal plateau. The prethermal lifetime is `doubly tunable': one way by driving frequency, the other by multipolar order; it grows algebraically with the frequency with the universal scaling exponent $2n{+}1$. Using quantum state tomography on different subsystems, we demonstrate a non-uniform spatial entanglement distribution and observe a crossover from area-law to volume-law entanglement scaling. With 78 qubits and 137 couplers in a 2D configuration, the entire far-from-equilibrium heating dynamics are beyond the reach of simulation using tensor-network numerical techniques. Our work highlights superconducting quantum processors as a powerful platform for exploring universal scaling laws and non-equilibrium phases of matter in driven systems in regimes where classical simulation faces formidable challenges.

quant-ph↗

arXiv2025

Fabrication and Characterization of Impedance-transformed Josephson Parametric Amplifier

In this paper, we introduce a method of using a double-layer resist lift-off process to prepare the capacitor dielectric layer for fabricating impedance-engineered Josephson parametric amplifiers (IMPAs). Compared with traditional techniques, this method enhances fabrication success rate, accelerates production. The IMPA we made experimentally achieves an instantaneous bandwidth over 950 (600) MHz with a gain exceeding 10 (14) dB, along with saturation input power of -115 dBm and near quantum-limited noise. We demonstrate the negligible backaction from the IMPA on superconducting qubits, resulting in no significant degradation of the relaxation time and coherence time of the qubits. The IMPA improves the signal-to-noise ratio from 1.69 to 14.56 and enables the amplification chain to achieve a high quantum efficiency with $η\approx 0.26$, making it a critical necessity for large-scale quantum computation.

quant-ph↗

arXiv2025

Training-Free Dataset Pruning for Instance Segmentation

Existing dataset pruning techniques primarily focus on classification tasks, limiting their applicability to more complex and practical tasks like instance segmentation. Instance segmentation presents three key challenges: pixel-level annotations, instance area variations, and class imbalances, which significantly complicate dataset pruning efforts. Directly adapting existing classification-based pruning methods proves ineffective due to their reliance on time-consuming model training process. To address this, we propose a novel Training-Free Dataset Pruning (TFDP) method for instance segmentation. Specifically, we leverage shape and class information from image annotations to design a Shape Complexity Score (SCS), refining it into a Scale-Invariant (SI-SCS) and Class-Balanced (CB-SCS) versions to address instance area variations and class imbalances, all without requiring model training. We achieve state-of-the-art results on VOC 2012, Cityscapes, and COCO datasets, generalizing well across CNN and Transformer architectures. Remarkably, our approach accelerates the pruning process by an average of 1349$\times$ on COCO compared to the adapted baselines. Source code is available at: https://github.com/he-y/dataset-pruning-for-instance-segmentation

cs.CV↗

arXiv2025

Spiral resonator referenced on-chip low noise microwave generation

In recent years, miniaturization and integration of photonic microwave oscillators by optical frequency division approach have witnessed rapid progress. In this work, we report on-chip low phase noise photonic microwave generation based on a planar chip design. Dual lasers are co-locked to a silicon nitride spiral resonator and their relative phase noise is measured below the cavity thermal noise limit, resulting in record low on-chip relative optical phase noise. A broadband integrated electro-optic comb up to 3.43 THz (27 nm) bandwidth is utilized to divide down the relative phase noise of the spiral resonator referenced lasers to the microwave domain. All-around record-low phase noise is achieved for planar chip-based photonic microwave oscillators from 10 Hz to 10 kHz offsets. The planar chip design, high technology-readiness level, foundry-ready processing, combined with the exceptional phase noise performance for our work represent a major advance of integrated photonic microwave oscillators.

physics.optics↗

arXiv2025

On-demand shaped photon emission based on a parametrically modulated qubit

In the circuit quantum electrodynamics architectures, to realize a long-range quantum network mediated by flying photon, it is necessary to shape the temporal profile of emitted photons to achieve high transfer efficiency between two quantum nodes. In this work, we demonstrate a new single-rail and dual-rail time-bin shaped photon generator without additional flux-tunable elements, which can act as a quantum interface of a point-to-point quantum network. In our approach, we adopt a qubit-resonator-transmission line configuration, and the effective coupling strength between the qubit and the resonator can be varied by parametrically modulating the qubit frequency. In this way, the coupling is directly proportional to the parametric modulation amplitude and covers a broad tunable range beyond 20 MHz for the sample we used. Additionally, when emitting shaped photons, we find that the spurious frequency shift (-0.4 MHz) due to parametric modulation is small and can be readily calibrated through chirping. We develop an efficient photon field measurement setup based on the data stream processing of GPU. Utilizing this system, we perform photon temporal profile measurement, quantum state tomography of photon field, and quantum process tomography of single-rail quantum state transfer based on a heterodyne measurement scheme. The single-rail encoding state transfer fidelity of shaped photon emission is 90.32%, and that for unshaped photon is 97.20%, respectively. We believe that the fidelity of shaped photon emission is mainly limited by the qubit coherence time. The results demonstrate that our method is hardware efficient, simple to implement, and scalable. It could become a viable tool in a high-quality quantum network utilizing both single-rail and dual-rail time-bin encoding.

quant-ph↗

arXiv2025

Quantum State Transfer via a Multimode Resonator

Large-scale fault-tolerant superconducting quantum computation needs rapid quantum communication to network qubits fabricated on different chips and long-range couplers to implement efficient quantum error-correction codes. Quantum channels used for these purposes are best modeled by multimode resonators, which lie between single-mode cavities and waveguides with a continuum of modes. In this Letter, we propose a non-Markovian formalism for quantum state transfer using coupling strengths comparable to the channel's free spectral range ($g{\sim}\fsr$). Our scheme merges features of both the STIRAP-based methods for single-mode cavities and the pitch-and-catch protocol for long waveguides, integrating their advantage of low loss and high speed. It is immune to thermal channel occupations if using harmonic resonators for the sender and receiver.

quant-ph↗

arXiv2025

Swift Cross-Dataset Pruning: Enhancing Fine-Tuning Efficiency in Natural Language Understanding

Dataset pruning aims to select a subset of a dataset for efficient model training. While data efficiency in natural language processing has primarily focused on within-corpus scenarios during model pre-training, efficient dataset pruning for task-specific fine-tuning across diverse datasets remains challenging due to variability in dataset sizes, data distributions, class imbalance and label spaces. Current cross-dataset pruning techniques for fine-tuning often rely on computationally expensive sample ranking processes, typically requiring full dataset training or reference models. We address this gap by proposing Swift Cross-Dataset Pruning (SCDP). Specifically, our approach uses TF-IDF embeddings with geometric median to rapidly evaluate sample importance. We then apply dataset size-adaptive pruning to ensure diversity: for smaller datasets, we retain samples far from the geometric median, while for larger ones, we employ distance-based stratified pruning. Experimental results on six diverse datasets demonstrate the effectiveness of our method, spanning various tasks and scales while significantly reducing computational resources. Source code is available at: https://github.com/he-y/NLP-Dataset-Pruning

cs.CL↗

arXiv2024

Knowledge as a Breaking of Ergodicity

We construct a thermodynamic potential that can guide training of a generative model defined on a set of binary degrees of freedom. We argue that upon reduction in description, so as to make the generative model computationally-manageable, the potential develops multiple minima. This is mirrored by the emergence of multiple minima in the free energy proper of the generative model itself. The variety of training samples that employ N binary degrees of freedom is ordinarily much lower than the size 2^N of the full phase space. The non-represented configurations, we argue, should be thought of as comprising a high-temperature phase separated by an extensive energy gap from the configurations composing the training set. Thus, training amounts to sampling a free energy surface in the form of a library of distinct bound states, each of which breaks ergodicity. The ergodicity breaking prevents escape into the near continuum of states comprising the high-temperature phase; thus it is necessary for proper functionality. It may however have the side effect of limiting access to patterns that were underrepresented in the training set. At the same time, the ergodicity breaking within the library complicates both learning and retrieval. As a remedy, one may concurrently employ multiple generative models -- up to one model per free energy minimum.

cs.AI↗

arXiv2024

Synthesizing Document Database Queries using Collection Abstractions

Document databases are increasingly popular in various applications, but their queries are challenging to write due to the flexible and complex data model underlying document databases. This paper presents a synthesis technique that aims to generate document database queries from input-output examples automatically. A new domain-specific language is designed to express a representative set of document database queries in an algebraic style. Furthermore, the synthesis technique leverages a novel abstraction of collections for deduction to efficiently prune the search space and quickly generate the target query. An evaluation of 110 benchmarks from various sources shows that the proposed technique can synthesize 108 benchmarks successfully. On average, the synthesizer can generate document database queries from a small number of input-output examples within tens of seconds.

cs.DB↗

arXiv2024

Bayesian Deep Learning Approach for Real-time Lane-based Arrival Curve Reconstruction at Intersection using License Plate Recognition Data

The acquisition of real-time and accurate traffic arrival information is of vital importance for proactive traffic control systems, especially in partially connected vehicle environments. License plate recognition (LPR) data that record both vehicle departures and identities are proven to be desirable in reconstructing lane-based arrival curves in previous works. Existing LPR databased methods are predominantly designed for reconstructing historical arrival curves. For real-time reconstruction of multi-lane urban roads, it is pivotal to determine the lane choice of real-time link-based arrivals, which has not been exploited in previous studies. In this study, we propose a Bayesian deep learning approach for real-time lane-based arrival curve reconstruction, in which the lane choice patterns and uncertainties of link-based arrivals are both characterized. Specifically, the learning process is designed to effectively capture the relationship between partially observed link-based arrivals and lane-based arrivals, which can be physically interpreted as lane choice proportion. Moreover, the lane choice uncertainties are characterized using Bayesian parameter inference techniques, minimizing arrival curve reconstruction uncertainties, especially in low LPR data matching rate conditions. Real-world experiment results conducted in multiple matching rate scenarios demonstrate the superiority and necessity of lane choice modeling in reconstructing arrival curves.

cs.LG↗

arXiv2024

Efficient and Robust Freeway Traffic Speed Estimation under Oblique Grid using Vehicle Trajectory Data

Accurately estimating spatiotemporal traffic states on freeways is a significant challenge due to limited sensor deployment and potential data corruption. In this study, we propose an efficient and robust low-rank model for precise spatiotemporal traffic speed state estimation (TSE) using lowpenetration vehicle trajectory data. Leveraging traffic wave priors, an oblique grid-based matrix is first designed to transform the inherent dependencies of spatiotemporal traffic states into the algebraic low-rankness of a matrix. Then, with the enhanced traffic state low-rankness in the oblique matrix, a low-rank matrix completion method is tailored to explicitly capture spatiotemporal traffic propagation characteristics and precisely reconstruct traffic states. In addition, an anomaly-tolerant module based on a sparse matrix is developed to accommodate corrupted data input and thereby improve the TSE model robustness. Notably, driven by the understanding of traffic waves, the computational complexity of the proposed efficient method is only correlated with the problem size itself, not with dataset size and hyperparameter selection prevalent in existing studies. Extensive experiments demonstrate the effectiveness, robustness, and efficiency of the proposed model. The performance of the proposed method achieves up to a 12% improvement in Root Mean Squared Error (RMSE) in the TSE scenarios and an 18% improvement in RMSE in the robust TSE scenarios, and it runs more than 20 times faster than the state-of-the-art (SOTA) methods.

eess.SY↗

arXiv2024

Are Large-scale Soft Labels Necessary for Large-scale Dataset Distillation?

In ImageNet-condensation, the storage for auxiliary soft labels exceeds that of the condensed dataset by over 30 times. However, are large-scale soft labels necessary for large-scale dataset distillation? In this paper, we first discover that the high within-class similarity in condensed datasets necessitates the use of large-scale soft labels. This high within-class similarity can be attributed to the fact that previous methods use samples from different classes to construct a single batch for batch normalization (BN) matching. To reduce the within-class similarity, we introduce class-wise supervision during the image synthesizing process by batching the samples within classes, instead of across classes. As a result, we can increase within-class diversity and reduce the size of required soft labels. A key benefit of improved image diversity is that soft label compression can be achieved through simple random pruning, eliminating the need for complex rule-based strategies. Experiments validate our discoveries. For example, when condensing ImageNet-1K to 200 images per class, our approach compresses the required soft labels from 113 GB to 2.8 GB (40x compression) with a 2.6% performance gain. Code is available at: https://github.com/he-y/soft-label-pruning-for-dataset-distillation

cs.CV↗

arXiv2024

UTSRMorph: A Unified Transformer and Superresolution Network for Unsupervised Medical Image Registration

Complicated image registration is a key issue in medical image analysis, and deep learning-based methods have achieved better results than traditional methods. The methods include ConvNet-based and Transformer-based methods. Although ConvNets can effectively utilize local information to reduce redundancy via small neighborhood convolution, the limited receptive field results in the inability to capture global dependencies. Transformers can establish long-distance dependencies via a self-attention mechanism; however, the intense calculation of the relationships among all tokens leads to high redundancy. We propose a novel unsupervised image registration method named the unified Transformer and superresolution (UTSRMorph) network, which can enhance feature representation learning in the encoder and generate detailed displacement fields in the decoder to overcome these problems. We first propose a fusion attention block to integrate the advantages of ConvNets and Transformers, which inserts a ConvNet-based channel attention module into a multihead self-attention module. The overlapping attention block, a novel cross-attention method, uses overlapping windows to obtain abundant correlations with match information of a pair of images. Then, the blocks are flexibly stacked into a new powerful encoder. The decoder generation process of a high-resolution deformation displacement field from low-resolution features is considered as a superresolution process. Specifically, the superresolution module was employed to replace interpolation upsampling, which can overcome feature degradation. UTSRMorph was compared to state-of-the-art registration methods in the 3D brain MR (OASIS, IXI) and MR-CT datasets. The qualitative and quantitative results indicate that UTSRMorph achieves relatively better performance. The code and datasets are publicly available at https://github.com/Runshi-Zhang/UTSRMorph.

cs.CV↗

arXiv2024

ProgFed: Effective, Communication, and Computation Efficient Federated Learning by Progressive Training

Federated learning is a powerful distributed learning scheme that allows numerous edge devices to collaboratively train a model without sharing their data. However, training is resource-intensive for edge devices, and limited network bandwidth is often the main bottleneck. Prior work often overcomes the constraints by condensing the models or messages into compact formats, e.g., by gradient compression or distillation. In contrast, we propose ProgFed, the first progressive training framework for efficient and effective federated learning. It inherently reduces computation and two-way communication costs while maintaining the strong performance of the final models. We theoretically prove that ProgFed converges at the same asymptotic rate as standard training on full models. Extensive results on a broad range of architectures, including CNNs (VGG, ResNet, ConvNets) and U-nets, and diverse tasks from simple classification to medical image segmentation show that our highly effective training approach saves up to $20\%$ computation and up to $63\%$ communication costs for converged models. As our approach is also complimentary to prior work on compression, we can achieve a wide range of trade-offs by combining these techniques, showing reduced communication of up to $50\times$ at only $0.1\%$ loss in utility. Code is available at https://github.com/hui-po-wang/ProgFed.

cs.LG↗

arXiv2024

High-precision pulse calibration of tunable couplers for high-fidelity two-qubit gates in superconducting quantum processors

For superconducting quantum processors, stable high-fidelity two-qubit operations depend on precise flux control of the tunable coupler. However, the pulse distortion poses a significant challenge to the control precision. Current calibration methods, which often rely on microwave crosstalk or additional readout resonators for coupler excitation and readout, tend to be cumbersome and inefficient, especially when couplers only have flux control. Here, we introduce and experimentally validate a novel pulse calibration scheme that exploits the strong coupling between qubits and couplers, eliminating the need for extra coupler readout and excitation. Our method directly measures the short-time and long-time step responses of the coupler flux pulse transient, enabling us to apply predistortion to subsequent signals using fast Fourier transformation and deconvolution. This approach not only simplifies the calibration process but also significantly improves the precision and stability of the flux control. We demonstrate the efficacy of our method through the implementation of diabatic CZ and iSWAP gates with fidelities of $99.61\pm0.04\%$ and $99.82\pm0.02\%$, respectively, as well as a series of diabatic CPhase gates with high fidelities characterized by cross-entropy benchmarking. The consistency and robustness of our technique are further validated by the reduction in pulse distortion and phase error observed across multilayer CZ gates. These results underscore the potential of our calibration and predistortion method to enhance the performance of two-qubit gates in superconducting quantum processors.

quant-ph↗

arXiv2024

On the strong Sarkisov program

We showed that the strong Sarkisov Program of dimension $d$ can be derived from termination of specific log flips in dimension $\leq d-1$. As a corollary, we show that the strong Sarkisov Program holds in dimension 4. Additionally, we prove the weak Sarkisov program with decreasing (augmented) Sarkisov degree. Finally, using the theory of syzygies of Mori fibre spaces, we obtain a directed diagram that encodes all the information of the strong Sarkisov Program.

math.AG↗

arXiv2024

Exploring system size dependence of jet modification in heavy-ion collisions

In relativistic heavy-ion collisions, jet quenching in quark-gluon plasma (QGP) has been extensively studied, revealing important insights into the properties of the color deconfined nuclear matter. Over the past decade, there has been a surge of interest in the exploration of QGP droplets in small collision systems like $p$+$p$ or $p$+A collisions driven by the observation of collective flow phenomena. However, the absence of jet quenching, a key QGP signature, in these systems poses a puzzle. Understanding how jet quenching evolves with system size is crucial for uncovering the underlying physics. In this study, we employ the linear Boltzmann transport (LBT) model to investigate jet modification in $^{96}$Ru+$^{96}$Ru, $^{96}$Zr+$^{96}$Zr, and $^{197}$Au+$^{197}$Au collisions at $\sqrt{s_{NN}}=200$ GeV. Our findings highlight the system size sensitivity exhibited by jet nuclear modification factor ($R_\mathrm{AA}$) and jet shape ($ρ$), contrasting to the relatively weak responses of jet mass ($M$), girth ($g$) and momentum dispersion ($p_\mathrm{T}{D}$) to system size variations. These results offer invaluable insights into the system size dependence of the QGP properties and await experimental validation at the Relativistic Heavy-Ion Collider.

nucl-th↗

arXiv2024

Diverse Intra- and Inter-Domain Activity Style Fusion for Cross-Person Generalization in Activity Recognition

Existing domain generalization (DG) methods for cross-person generalization tasks often face challenges in capturing intra- and inter-domain style diversity, resulting in domain gaps with the target domain. In this study, we explore a novel perspective to tackle this problem, a process conceptualized as domain padding. This proposal aims to enrich the domain diversity by synthesizing intra- and inter-domain style data while maintaining robustness to class labels. We instantiate this concept using a conditional diffusion model and introduce a style-fused sampling strategy to enhance data generation diversity. In contrast to traditional condition-guided sampling, our style-fused sampling strategy allows for the flexible use of one or more random styles to guide data synthesis. This feature presents a notable advancement: it allows for the maximum utilization of possible permutations and combinations among existing styles to generate a broad spectrum of new style instances. Empirical evaluations on a broad range of datasets demonstrate that our generated data achieves remarkable diversity within the domain space. Both intra- and inter-domain generated data have proven to be significant and valuable, contributing to varying degrees of performance enhancements. Notably, our approach outperforms state-of-the-art DG methods in all human activity recognition tasks.

cs.LG↗