Researcher profile

Song Yu

Song Yu contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
11works
0followers
4topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

11 published item(s)

preprint2026arXiv

EP-GRPO: Entropy-Progress Aligned Group Relative Policy Optimization with Implicit Process Guidance

Reinforcement learning with verifiable rewards (RLVR), particularly Group Relative Policy Optimization (GRPO), has advanced LLM reasoning. However, GRPO suffers from three credit assignment failures: uniform token-level granularity that ignores heterogeneous informational value, uniform polarity that penalizes correct steps and rewards incorrect ones, and zero-variance collapse that erases outcome-driven gradients. We systematically quantify these failures, revealing highly non-uniform token informativeness, widespread step-level polarity misalignment, and substantial training waste. To address these limitations, we propose Entropy-Progress Aligned GRPO (EP-GRPO), a framework that mines the model's intrinsic information flow for dense, self-supervised guidance. EP-GRPO integrates entropy-gated modulation to prioritize high entropy decision pivots, implicit process signals from policy divergence anchored to outcome advantages for directional token-level feedback without external reward models, and cumulative entropy mapping that enables progress-aligned advantage normalization, naturally maintaining gradient flow under zero reward variance. Extensive experiments on mathematical reasoning benchmarks demonstrate that EP-GRPO achieves superior accuracy and efficiency compared to GRPO and its variants. The code will be available.

preprint2022arXiv

Secure two-way fiber-optic time transfer against sub-ns asymmetric delay attack

Two-way fiber-optic time transfer is a promising precise time synchronization technique with sub-nanosecond accuracy. However, asymmetric delay attack is a serious threat which cannot be prevent by any encryption method. In this paper, a dynamic model based scheme is proposed to defense the sub-nanosecond asymmetric delay attack. A threshold is set according to the estimated time difference by a two-state clock model where the fixed frequency difference is excluded from the time difference to detect the asymmetric delay attack which is smaller than the time difference induced by the fixed frequency difference. Theoretical simulation and experimental demonstration are implemented to prove the feasibility of the scheme. A two-way fiber-optic time transfer system with time stability with 24.5ps, 3.98ps, and 2.95ps at 1s, 10s, and 100s averaging time is shown under sub-ns asymmetric time delay attack experimentally. The proposed method provides a promising secure sub-ns precise time synchronization technique against asymmetric delay attack.

preprint2020arXiv

A modified practical homodyne detector model for continuous-variable quantum key distribution: detailed security analysis and improvement by the phase-sensitive amplifier

The practical homodyne detector model of continuous-variable quantum key distribution models the inherent imperfections of the practical homodyne detector, namely the limited detection efficiency and the electronic noise, into trusted loss. However, the conventional practical homodyne detector model is valid only when both the imperfections of the practical homodyne detector are calibrated. In this paper, we show a modified practical homodyne detector model that can model the imperfections separately. The phase-sensitive amplifier is further applied to compensate the imperfections of the practical homodyne detector. The feasibility of the modified practical homodyne detector model with the phase-sensitive amplifier is proved and the security analysis is provided in detail. Simulation results reveal that the phase-sensitive amplifier can be used to improve the performance of the modified practical homodyne detector model, and when the gain is infinitely high, the limited detection efficiency can be fully compensated.

preprint2020arXiv

Bias-free source-independent quantum random number generator

A bias-free source-independent quantum random number generator scheme based on the measurement of vacuum fluctuation is proposed to realize the effective elimination of system bias and common mode noise introduced by the local oscillator. Optimal parameter settings are derived to avoid the system recording two canonically conjugate quadratures simultaneously in each measurement. In particular, it provides a new approach to investigate the performance difference between measuring two quadratures of equal and unequal intensity. It is experimentally demonstrated that the system supports 4.2 Gbps bias-free source-independent random number generation, where its common mode rejection ratio reaches 61.17 dB. Furthermore, the scheme offers an all-optical method facilitating the integration of source-independent quantum random number generators into compact chips.

preprint2020arXiv

Continuous-variable source-device-independent quantum key distribution against general attacks

The continuous-variable quantum key distribution with entanglement in the middle, a semi-device-independent protocol, places the source at the untrusted third party between Alice and Bob, and thus has the advantage of high levels of security with the purpose of eliminating the assumptions about the source device. However, previous works considered the collective-attack analysis, which inevitably assumes that the states of the source has an identical and independently distributed (i.i.d) structure, and limits the application of the protocol. To solve this problem, we modify the original protocol by exploiting an energy test to monitor the potential high energy attacks an adversary may use. Our analysis removes the assumptions of the light source and the modified protocol can therefore be called source-device-independent protocol. Moreover, we analyze the security of the continuous-variable source-device-independent quantum key distribution protocol with a homodyne-homodyne structure against general coherent attacks by adapting a state-independent entropic uncertainty relation. The simulation results indicate that, in the universal composable security framework, the protocol can still achieve high key rates against coherent attacks under the condition of achievable block lengths.

preprint2020arXiv

Finite-size analysis of continuous variable source-independent quantum random number generation

We study the impact of finite-size effect on continuous variable source-independent quantum random number generation. The central-limit theorem and maximum likelihood estimation theorem are used to derive the formula which could output the statistical fluctuations and determine upper bound of parameters of practical quantum random number generation. With these results, we can see the check data length and confidence probability has intense relevance to the final randomness, which can be adjusted according to the demand in implementation. Besides, other key parameters, such as sampling range size and sampling resolution, have also been considered in detail. It is found that the distribution of quantified output related with sampling range size has significant effects on the loss of final randomness due to finite-size effect. The overall results indicate that the finite-size effect should be taken into consideration for implementing the continuous variable source-independent quantum random number generation in practical.

preprint2020arXiv

Long-Distance Continuous-Variable Quantum Key Distribution over 202.81 km of Fiber

Quantum key distribution provides secure keys resistant to code-breaking quantum computers. The continuous-variable version of quantum key distribution offers the advantages of higher secret key rates in metropolitan areas, as well as the use of standard telecom components that can operate at room temperature. However, the transmission distance of these systems (compared with discrete-variable systems) are currently limited and considered unsuitable for long-distance distribution. Herein, we report the experimental results of long distance continuous-variable quantum key distribution over 202.81 km of ultralow-loss optical fiber by suitably controlling the excess noise and employing highly efficient reconciliation procedures. This record-breaking implementation of the continuous-variable quantum key distribution doubles the previous distance record and shows the road for long-distance and large-scale secure quantum key distribution using room-temperature standard telecom components.

preprint2020arXiv

One-Time Shot-Noise Unit Calibration Method for Continuous-Variable Quantum Key Distribution

The shot-noise unit in continuous-variable quantum key distribution plays an important and fundamental role in experimental implementation as it is used as a normalization parameter that contribute to perform security analysis and distill the key information. However, the traditional calibration procedure and detector model can not cover all system noise in practical application, which will result in some loopholes and influence the practical security. What's more, the traditional procedure is also rather complicated and has difficulty in compatible with automatic operating system. In this paper we propose a calibration model based on the proposed trusted detector model, which could naturally close the loopholes in practical application. It can help identify the shot-noise unit in only one step, which can not only effectively simplify the evaluation process but also reduce the statistical fluctuation, while two steps are needed in traditional method. We prove its feasibility and derive the complete version of the corresponding entanglement-based model. Detailed security analysis against arbitrary collective attacks and numerous simulation results in both the asymptotic limit regime and the finite-size regime are provided. A proof-of-principle experiment has been implemented and the results indicate that the one-time-calibration model can be employed as a powerful substitution to calibrate the shot-noise unit. Our method paves the way for the deployment of continuous-variable quantum key distribution with real time calibration and automatic operation.

preprint2020arXiv

Practical security analysis of a continuous-variable quantum random number generator with a noisy local oscillator

A quantum random-number generator (QRNG) can theoretically generate unpredictable random numbers with perfect devices and is an ideal and secure source of random numbers for cryptography. However, the practical implementations always contain imperfections, which will greatly influence the randomness of the final output and even open loopholes to eavesdroppers. Recently, Thewes et al. experimentally demonstrated a continuous-variable eavesdropping attack, based on heterodyne detection, on a trusted continuous-variable QRNG in Phys. Rev. A 100, 052318 (2019), yet like in many other practical continuous-variable QRNG studies, they always supposed the local oscillator was stable and ignored its fluctuation which might lead to security threats such as wavelength attack. In this work, based on the theory of the conditional min-entropy, imperfections of the practical security of continuous-variable QRNGs are systematically analyzed, especially the local oscillator fluctuation under imbalanced homodyne detection. Experiments of a practical QRNG based on vacuum fluctuation are demonstrated to show the influence of local oscillator fluctuation on the total measurement noise variances and the practical conditional min-entropy with beam splitters of different transmittances. Moreover, a local oscillator monitoring method is proposed for the practical continuous-variable QRNG, which can be used to calibrate the practical conditional min-entropy.

preprint2020arXiv

Short-term Load Forecasting with Dense Average Network

As an important part of the power system, power load forecasting directly affects the national economy. The data shows that improving the load forecasting accuracy by 0.01% can save millions of dollars for the power industry. Therefore, improving the accuracy of power load forecasting has always been the pursuing goals for a power system. Based on this goal, this paper proposes a novel connection, the dense average connection, in which the outputs of all preceding layers are averaged as the input of the next layer in a feed-forward fashion. Based on dense average connection , we construct the dense average network for power load forecasting. The predictions of the proposed model for two public datasets are better than those of existing methods. On this basis, we use the ensemble method to further improve the accuracy of the model. To verify the reliability of the model predictions, the robustness is analyzed and verified by adding input disturbances. The experimental results show that the proposed model is effective and robust for power load forecasting.

preprint2018arXiv

Avoiding Brooms, Forks, and Butterflies in the Linear Lattices

Let $n$ be a positive integer, $q$ a power of a prime, and $\mathcal{L}_n(q)$ the poset of subspaces of an $n$-dimensional vector space over a field with $q$ elements. This poset is a normalized matching poset and the set of subspaces of dimension $\left\lfloor n/2 \right\rfloor$ or those of dimension $\left\lceil n/2 \right\rceil$ are the only maximum-sized anti-chains in this poset. Strengthening this well-known and celebrated result, we show that, except in the case of $\mathcal{L}_3(2)$, these same collections of subspaces are the only maximum-sized families in $\mathcal{L}_n(q)$ that avoid both a $\wedge$ and a $\vee$ as a subposet. We generalize some of the results to brooms and forks, and we also show that the union of the set of subspaces of dimension $k$ and $k+1$, for $k = \left\lfloor n/2 \right\rfloor$ or $k = \left\lceil n/2 \right\rceil-1$, are the only maximum-sized families in $\mathcal{L}_n(q)$ that avoid a butterfly (definitions below).