arXiv subjects

Song Yu

Publications and source records attributed to Song Yu.

At least 37 records · Page 2Linked to original sources

arXiv2025

High-rate discrete-modulated continuous-variable quantum key distribution with composable security

Continuous-variable quantum key distribution holds the potential to generate high secret key rates, making it a prime candidate for high-rate metropolitan quantum network applications. However, despite these promising opportunities, the realization of high-rate continuous-variable quantum key distribution systems with composable security remains an elusive goal. Here, we report a discrete-modulated continuous-variable quantum key distribution system with a composable secret key rate of 18.93 Mbps against collective attacks over a 25 km fiber channel. This record breaking rate is achieved through the probability shaped 16QAM-modulated protocol, which employs semidefinite programming to ensure its composable security. Furthermore, we have employed a fully digital and precise quantum signal processing technique to reduce excess noise to extremely low levels, thereby facilitating efficient broadband system operation. While ensuring low complexity and cost,our system achieves a performance advantage of over an order of magnitude compared to previous continuous-variable quantum key distribution systems, providing a promising solution for future deployment of quantum key distribution.

quant-ph↗

arXiv2025

High-rate discrete-modulated continuous-variable quantum key distribution with composable security

Continuous-variable quantum key distribution holds the potential to generate high secret key rates, making it a prime candidate for high-rate metropolitan quantum network applications. However, despite these promising opportunities, the realization of high-rate continuous-variable quantum key distribution systems with composable security remains an elusive goal. Here, we report a discrete-modulated continuous-variable quantum key distribution system with a composable secret key rate of 18.93 Mbps against collective attacks over a 25 km fiber channel. This record-breaking rate is achieved through the probability shaped 16QAM-modulated protocol, which employs semidefinite programming to ensure its composable security. Furthermore, we have employed a fully digital and precise quantum signal processing technique to reduce excess noise to extremely low levels, thereby facilitating efficient broadband system operation. While ensuring low complexity and cost, our system achieves a performance advantage of over an order of magnitude compared to previous continuous-variable quantum key distribution systems, providing a promising solution for future deployment of quantum key distribution.

quant-ph↗

arXiv2025

Long distance local local oscillator continuous variable quantum key distribution with digital signal processing

Quantum key distribution relying on the principles of quantum mechanics enables two parties to produce a shared random secret key, thereby ensuring the security of data transmission. Continuous variable quantum key distribution (CV-QKD) is widely applied because it can be well combined with standard telecommunication technology. Compared to CV-QKD with a transmitting local oscillator, the proposal of CV-QKD with a local local oscillator overcomes the limitation that local oscillator will attenuate as transmission distance increases, providing new possibilities in long-distance transmission. However, challenges still persist in practical long-distance transmission, including data sampling and recovery under low signal-to-noise ratio conditions. In order to better recover data and reduce the additional excess noise, we propose the least squares fitting algorithm to get more accurate sampling data and complete more accurate phase compensation.Herein, we demonstrate the long-distance local local oscillator CV-QKD experiment which have considered the effect of finite-size block over 120 km of standard optical fiber with high efficient real-time post-processing. The results not only verify the good performance of the system over long distance, but also paves the way for large-scale quantum secure communications in the future.

quant-ph↗

arXiv2025

A Topology-Aware Localized Update Strategy for Graph-Based ANN Index

The graph-based index has been widely adopted to meet the demand for approximate nearest neighbor search (ANNS) for high-dimensional vectors. However, in dynamic scenarios involving frequent vector insertions and deletions, existing systems improve update throughput by adopting a batch update method. However, a large batch size leads to significant degradation in search accuracy. This work aims to improve the performance of graph-based ANNS systems in small-batch update scenarios, while maintaining high search efficiency and accuracy. We identify two key issues in existing batch update systems for small-batch updates. First, the system needs to scan the entire index file to identify and update the affected vertices, resulting in excessive unnecessary I/O. Second, updating the affected vertices introduces many new neighbors, frequently triggering neighbor pruning. To address these issues, we propose a topology-aware localized update strategy for graph-based ANN index. We introduce a lightweight index topology to identify affected vertices efficiently and employ a localized update strategy that modifies only the affected vertices in the index file. To mitigate frequent heavy neighbor pruning, we propose a similar neighbor replacement strategy, which connects the affected vertices to only a small number (typically one) of the most similar outgoing neighbors of the deleted vertex during repair. Based on extensive experiments on real-world datasets, our update strategy achieves 2.47X-6.45X higher update throughput than the state-of-the-art system FreshDiskANN while maintaining high search efficiency and accuracy.

cs.DB↗

arXiv2024

TRAPP: An Efficient Point-to-Point Path Planning Algorithm for Road Networks with Restrictions

Path planning is a fundamental problem in road networks, with the goal of finding a path that optimizes objectives such as shortest distance or minimal travel time. Existing methods typically use graph indexing to ensure the efficiency of path planning. However, in real-world road networks, road segments may impose restrictions in terms of height, width, and weight. Most existing works ignore these road restrictions when building indices, which results in returning infeasible paths for vehicles. To address this, a naive approach is to build separate indices for each combination of different types of restrictions. However, this approach leads to a substantial number of indices, as the number of combinations grows explosively with the increase in different restrictions on road segments. In this paper, we propose a novel path planning method, TRAPP(Traffic Restrictions Adaptive Path Planning algorithm), which utilizes traffic flow data from the road network to filter out rarely used road restriction combinations, retain frequently used road restriction combinations, and build indices for them. Additionally, we introduce two optimizations aimed at reducing redundant path information storage within the indices and enhancing the speed of index matching. Our experimental results on real-world road networks demonstrate that TRAPP can effectively reduce the computational and memory overhead associated with building indices while ensuring the efficiency of path planning.

cs.DS↗

arXiv2024

LSMGraph: A High-Performance Dynamic Graph Storage System with Multi-Level CSR

The growing volume of graph data may exhaust the main memory. It is crucial to design a disk-based graph storage system to ingest updates and analyze graphs efficiently. However, existing dynamic graph storage systems suffer from read or write amplification and face the challenge of optimizing both read and write performance simultaneously. To address this challenge, we propose LSMGraph, a novel dynamic graph storage system that combines the write-friendly LSM-tree and the read-friendly CSR. It leverages the multi-level structure of LSM-trees to optimize write performance while utilizing the compact CSR structures embedded in the LSM-trees to boost read performance. LSMGraph uses a new memory structure, MemGraph, to efficiently cache graph updates and uses a multi-level index to speed up reads within the multi-level structure. Furthermore, LSMGraph incorporates a vertex-grained version control mechanism to mitigate the impact of LSM-tree compaction on read performance and ensure the correctness of concurrent read and write operations. Our evaluation shows that LSMGraph significantly outperforms state-of-the-art (graph) storage systems on both graph update and graph analytical workloads.

cs.DB↗

arXiv2024

Enhancing the Traditional Chinese Medicine Capabilities of Large Language Model through Reinforcement Learning from AI Feedback

Although large language models perform well in understanding and responding to user intent, their performance in specialized domains such as Traditional Chinese Medicine (TCM) remains limited due to lack of expertise. In addition, high-quality data related to TCM is scarce and difficult to obtain, making large language models ineffective in handling TCM tasks. In this work, we propose a framework to improve the performance of large language models for TCM tasks using only a small amount of data. First, we use medical case data for supervised fine-tuning of the large model, making it initially capable of performing TCM tasks. Subsequently, we further optimize the model's performance using reinforcement learning from AI feedback (RLAIF) to align it with the preference data. The ablation study also demonstrated the performance gain is attributed to both supervised fine-tuning and the direct policy optimization. The experimental results show that the model trained with a small amount of data achieves a significant performance improvement on a representative TCM task.

cs.CL↗

arXiv2024

Adaptive optical signal-to-noise ratio recovery for long-distance optical fiber transmission

In long-distance fiber optic transmission, the optic fiber link and erbium-doped fiber amplifiers can introduce excessive noise, which reduces the optical signal-to-noise ratio (OSNR). The narrow-band optical filters can be used to eliminate noise and thereby improve OSNR. However, there is a relative frequency drift between the signal and the narrow-band filter, which leads to filtered signal instability. This paper proposes an adaptive OSNR recovery scheme based on a Fabry-Perot (F-P) cavity with mode width of 6 MHz. Utilizing the comb filtering of F-P cavity, the noise around the carrier and sidebands of the signal is filtered out simultaneously. To avoid frequency mismatch, we propose a double-servo scheme to suppress relative frequency drift between the signal and the F-P cavity. We constructed a stable radio frequency transfer system based on passive phase compensation and compared our scheme with other OSNR recovery schemes based on optical filters. Compared to the schemes based on dense wavelength division multiplexing (DWDM) and Waveshaper, our scheme demonstrates an improvement in OSNR of carrier by at least 12 dB and sidebands by at least 23.5 dB. The short-term transfer stability (1 s) is improved by one order of magnitude compared to DWDM and half an order of magnitude compared to Waveshper. This scheme can be applied to the recovery of signals with low OSNR in long-distance fiber optic transmission, improving signal quaility and extending the transmission distance limit.

physics.optics↗

arXiv2024

Trusted source noise model of discrete-modulated continuous-variable quantum key distribution

Discrete-modulated continuous-variable quantum key distribution offers a pragmatic solution, greatly simplifying experimental procedures while retaining robust integration with classical optical communication. Theoretical analyses have progressively validated the comprehensive security of this protocol, paving the way for practical experimentation. However, imperfect source in practical implementations introduce noise. The traditional approach is to assume that eavesdroppers can control all of the source noise, which overestimates the ability of eavesdroppers and underestimates secret key rate. In fact, some parts of source noise are intrinsic and cannot be manipulated by eavesdropper, so they can be seen as trusted noise. We tailor a trusted model specifically for the discrete-modulated protocol and upgrade the security analysis accordingly. Simulation results demonstrate that this approach successfully mitigates negative impact of imperfect source on system performance while maintaining security of the protocol. Furthermore, our method can be used in conjunction with trusted detector noise model, effectively reducing the influence of both source and detector noise in experimental setup. This is a meaningful contribution to the practical deployment of discrete-modulated continuous-variable quantum key distribution systems.

quant-ph↗

arXiv2024

Integrated high-performance error correction for continuous-variable quantum key distribution

An integrated error-correction scheme with high throughput, low frame errors rate (FER) and high reconciliation efficiency under low signal to noise ratio (SNR) is one of the major bottlenecks to realize high-performance and low-cost continuous variable quantum key distribution (CV-QKD). To solve this long-standing problem, a novel two-stage error correction method with limited precision that is suitable for integration given limited on-chip hardware resource while maintaining excellent decoding performance is proposed, and experimentally verified on a commercial FPGA. Compared to state-of-art results, the error-correction throughput can be improved more than one order of magnitude given FER<0.1 based on the proposed method, where 544.03 Mbps and 393.33 Mbps real-time error correction is achieved for typical 0.2 and 0.1 code rate, respectively. Besides, compared with traditional decoding method, the secure key rate (SKR) for CV-QKD under composable security framework can be improved by 140.09% and 122.03% by using the proposed two-stage decoding method for codes rate 0.2 and 0.1, which can support 32.70 Mbps and 5.66 Mbps real-time SKR under typical transmission distances of 25 km and 50 km, correspondingly. The record-breaking results paves the way for large-scale deployment of high-rate integrated CV-QKD systems in metropolitan quantum secure network.

quant-ph↗

arXiv2024

A Novel Hybrid Digital and Analog Laser Synchronization System

Laser synchronization is a technique that locks the wavelength of a free-running laser to that of the reference laser, thereby enabling synchronous changes in the wavelengths of the two lasers. This technique is of crucial importance in both scientific and industrial applications. Conventional synchronization systems, whether digital or analog, have intrinsic limitations in terms of accuracy or bandwidth. The hybrid "digital + analog" system can address this shortcoming. However, all above systems face the challenge of achieving an both high locking accuracy and low structural complexity simultaneously. This paper presents a hybrid "digital + analog" laser synchronization system with low-complexity and high-performance. In the digital part, we proposed a electric intensity locking method based on a band-pass filter, which realizes the fluctuation of frequency offset between a single frequency laser (SFL) and a mode-locked laser (MLL) less than 350 kHz in 24 hours. Following the incorporation of the analog control component, frequency fluctuation is less than 2.5 Hz in 24 hours. By synchronizing two SFLs to a repetition-frequency locked MLL, we achieve indirect synchronization between SFLs with a frequency offset of 10.6 GHz and fluctuation less than 5 Hz in 24 hours, demonstrating robust long- and short-term stability. Since the MLL is employed as a reference, the system can be utilized for cross-band indirect synchronization of multiple lasers. Based on the synchronization system, we propose a photonic-assisted microwave frequency identification scheme, which has detection error of less than 0.6 MHz. The high performance of the synchronization system enables the proposed frequency identification scheme to achieve high measurement accuracy and a theoretically large frequency range.

physics.optics↗

arXiv2024

Fast Iterative Graph Computing with Updated Neighbor States

Enhancing the efficiency of iterative computation on graphs has garnered considerable attention in both industry and academia. Nonetheless, the majority of efforts focus on expediting iterative computation by minimizing the running time per iteration step, ignoring the optimization of the number of iteration rounds, which is a crucial aspect of iterative computation. We experimentally verified the correlation between the vertex processing order and the number of iterative rounds, thus making it possible to reduce the number of execution rounds for iterative computation. In this paper, we propose a graph reordering method, GoGraph, which can construct a well-formed vertex processing order effectively reducing the number of iteration rounds and, consequently, accelerating iterative computation. Before delving into GoGraph, a metric function is introduced to quantify the efficiency of vertex processing order in accelerating iterative computation. This metric reflects the quality of the processing order by counting the number of edges whose source precedes the destination. GoGraph employs a divide-and-conquer mindset to establish the vertex processing order by maximizing the value of the metric function. Our experimental results show that GoGraph outperforms current state-of-the-art reordering algorithms by 1.83x on average (up to 3.34x) in runtime.

cs.DC↗

arXiv2024

Secure Combination of Untrusted Time information Based on Optimized Dempster-Shafer Theory

Secure precision time synchronization is important for applications of Cyber-Physical Systems. However, several attacks, especially the Time Delay Attack (TDA), deteriorates the performance of time synchronization system seriously. Multiple paths scheme is thought as an effective security countermeasure to decrease the influence of TDA. However, the effective secure combination algorithm is still missed for precision time synchronization. In this paper, a secure combination algorithm based on Dempster-Shafer theory is proposed for multiple paths method. Special optimizations are done for the combination algorithm to solve the potential problems due to untrusted evidence. Theoretical simulation shows that the proposed algorithm works much better than Fault Tolerant Algorithm (FTA) and the attack detection method based on single path. And experimental demonstration proves the feasibility and superiority of the proposed algorithm, where the time stability with 27.97 ps, 1.57 ps, and 1.12 ps at average time 1s, 10s, 100s is achieved under TDA and local clock jump. The proposed algorithm can be used to improve the security and resilience of many importance synchronization protocol, such as NTP, PTP, and TWFTT.

cs.CR↗

arXiv2024

Dual-comb-enhanced microwave clock synchronization over commercial fiber

The large-scale clock network is the key ingredient to obtain high precision in many scenarios, from fundamental research to cutting-edge applications. The advantage of the time synchronization among microwave clocks is their cost, size, and accessibility. Here, we demonstrate a femtosecond-level time synchronization of microwave clocks through a commercial link of 205.86 km via dual-comb-enhanced optical two-way time transfer, which achieves a 6.23-fs residual time deviation between synchronized timescales at 1 s and an instability below 6E-18 at 10,000 s. Further, the high-precision time synchronization of microwave clocks significantly enhances the probe ability of subtle reciprocity changes of fiber to the sub-picosecond level. This work provides a path toward secure fiber time-frequency networks to support future microwave-clock-based precise timing and sensing systems.

physics.optics↗

arXiv2024

Highly stable power control for chip-based continuous-variable quantum key distribution system

Quantum key distribution allows secret key generation with information theoretical security. It can be realized with photonic integrated circuits to benefit the tiny footprints and the large-scale manufacturing capacity. Continuous-variable quantum key distribution is suitable for chip-based integration due to its compatibility with mature optical communication devices. However, the quantum signal power control compatible with the mature photonic integration process faces difficulties on stability, which limits the system performance and causes the overestimation of secret key rate that opens practical security loopholes. Here, a highly stable chip-based quantum signal power control scheme based on a biased Mach-Zehnder interferometer structure is proposed, theoretically analyzed and experimentally implemented with standard silicon photonic techniques. Simulations and experimental results show that the proposed scheme significantly improves the system stability, where the standard deviation of the secret key rate is suppressed by an order of magnitude compared with the system using traditional designs, showing a promising and practicable way to realize highly stable continuous-variable quantum key distribution system on chip.

quant-ph↗

arXiv2024

High-Rate 16-node quantum access network based on passive optical network

Quantum key distribution can provide information-theoretical secure communication, which is now heading towards building the quantum secure network for real-world applications. In most built quantum secure networks, point-to-multipoint (PTMP) topology is one of the most popular schemes, especially for quantum access networks. However, due to the lack of custom protocols with high secret key rate and compatible with classical optical networks for PTMP scheme, there is still no efficient way for a high-performance quantum access network with a multitude of users. Here, we report an experimental demonstration of a high-rate 16-nodes quantum access network based on passive optical network, where a high-efficient coherent-state PTMP protocol is novelly designed to allow independent secret key generation between one transmitter and multiple receivers concurrently. Such accomplishment is attributed to a well-designed real-time shot-noise calibration method, a series of advanced digital signal processing algorithms and a flexible post-processing strategy with high success probability. Finally, the experimental results show that the average secret key rate is around 2.086 Mbps between the transmitter and each user, which is two orders of magnitude higher than previous demonstrations. With the advantages of low cost, excellent compatibility, and wide bandwidth, our work paves the way for building practical PTMP quantum access networks, thus constituting an important step towards scalable quantum secure networks.

quant-ph↗

arXiv2024

Continuous-variable quantum key distribution over 28.6 km fiber with an integrated silicon photonic receiver chip

Quantum key distribution, which ensures information-theoretically secret key generation, is currently advancing through photonic integration to achieve high performance, cost reduction and compact size, thereby facilitating the large-scale deployment. Continuous-variable quantum key distribution is an attractive approach for photonic integrations due to its compatibility with off-the-shelf optical communication devices. However, its chip-based systems have encountered significant limitations primarily related to the shot-noise-limited receiver design, which demands low noise, wide bandwidth, high clearance and well stability. Here, we report the implementation of a real local oscillator continuous-variable quantum key distribution system with an integrated silicon photonic receiver chip. Thanks to the well-designed chip-based homodyne detectors with a bandwidth up to 1.5 GHz and a clearance up to 7.42 dB, the transmission distance of the system has been extended to 28.6 km, achieving a secret key generation rate of Mbps level. This technological advancement enables the quantum key distribution systems with photonic integrated receivers to achieve the coverage in both access network scenarios and short-distance metropolitan interconnections, paving the way for the development of the next-generation quantum key distribution networks on a large scale.

quant-ph↗

arXiv2024

Practical No-Switching Continuous-Variable Quantum Key Distribution with Biased Quadrature Detection

Continuous-variable quantum key distribution protocol using coherent states and heterodyne detection, called No-Switching protocol, is widely used in practical systems due to the simple experimental setup without basis switching and easy assessment to phase information. The security of an ideal No-Switching protocol has been proved against general attacks in finite-size regime and composable security framework, whose heterodyne detector consists of a beam splitter with transmittance of $50\%$ and two ideal homodyne detectors. However, the transmittance of a beam splitter is inaccurate and the two detectors always have different quantum efficiency and electronic noise, which introduce asymmetry into the heterodyne detection, and further lead to the mismatch between the ideal protocol and practical systems, thereby overestimating the secret key rate and resulting in a practical security loophole. In this paper, we close this loophole by proposing a modified No-Switching protocol with biased quadrature detection, where the asymmetry of the heterodyne detection is modeled to match the practical systems, and the security of the protocol is analyzed in asymptotic and finite-size regimes. Further, an optimization strategy is proposed to achieve the optimal secret key rate by adjusting the transmittance of the beam splitter. Simulation results show the necessity of considering the asymmetry in heterodyne detection and the effectiveness of the optimization, which provides a promising way to realize a practical secure and high-performance No-Switching system.

quant-ph↗