Fast qubit-based frequency recovery algorithm for quantum key distribution

• URL: http://arxiv.org/abs/2509.17849v1
• Date: Mon, 22 Sep 2025 14:42:04 GMT
• Title: Fast qubit-based frequency recovery algorithm for quantum key distribution
• Authors: Feng-Yu Lu, Zheng-Kai Huang, Jia-Jv Deng, Chi Zhang, Shuang Wang, De-Yong He, Zhen-Qiang Yin, Wei Chen, Guang-Can Guo, Zheng-Fu Han,
• Abstract summary: Recently proposed Qubit-based synchronization (Qubit4Sync) has opportunities in eliminating additional cost, noise, and potential side channels.<n>Current frequency recovery process in Qubit4Sync requires high data throughput and computational speed, limiting practical use.<n>We developed a fast frequency recovery algorithm that increases the recovery rate by orders of magnitude and remains robust under bad signal-to-noise ratio (SNR)
• Score: 9.124904114456733
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Clock synchronization serves as a foundational subsystem in quantum key distribution (QKD). The recently proposed Qubit-based synchronization (Qubit4Sync) has opportunities in eliminating additional cost, noise, and potential side channels. It offers a promising alternative to dedicated synchronization hardware. However, the current frequency recovery process in Qubit4Sync requires high data throughput and computational speed, limiting practical use. To overcome these issues, we developed a fast frequency recovery algorithm that increases the recovery rate by orders of magnitude and remains robust under bad signal-to-noise ratio (SNR). This enables Qubit4Sync to operate effectively in mainstream gated-mode QKD systems. We further establish a theoretical model for frequency recovery, showing that our algorithm is robust against disturbances like dead time, jitter, and afterpulse. A frequency-domain SNR calculation method is also provided to guide parameter design for specific experimental conditions. This work opens the door to practical Qubit4Sync deployment in general QKD systems.

Related papers

• FLaTEC: Frequency-Disentangled Latent Triplanes for Efficient Compression of LiDAR Point Clouds [52.997038111673966]
  FLaTEC is a frequency-aware compression model that enables the compression of a full scan with high compression ratios.<n>We convert voxelized embeddings into triplane representations to reduce sparsity, computational cost, and storage requirements.<n>Our method achieves state-of-the-art rate-distortion performance and outperforms the standard codecs by 78% and 94% in BD-rate on both datasets.
  arXiv  Detail & Related papers  (2025-11-25T08:37:49Z)
• Field-Trial Quantum Key Distribution with Qubit-Based Frame Synchronization [12.233357200393224]
  Quantum key distribution (QKD) is a cryptographic technique that uses quantum mechanical principles to enable secure key exchange.<n>We demonstrate a QKD system incorporating a recently proposed qubit-based distributed frame synchronization method, deployed over a metropolitan fiber network in Nanning, China.<n>During 12 hours of continuous operation, the system maintained a low average quantum bit error rate (QBER) of 1.12/%, achieving a secure key rate of 26.6 kbit/s under 18 dB channel loss.
  arXiv  Detail & Related papers  (2025-10-20T15:32:11Z)
• Clock Synchronization for Drone-Based Entanglement Quantum Key Distribution [12.241567591136695]
  Drone-based entanglement distribution provides full coverage for quantum networks, enabling quantum key distribution (QKD) in dynamic environments.<n>Our protocol enables drone-based entanglement distribution, paving the way for seamless precision of wide-area and local-area quantum internet.
  arXiv  Detail & Related papers  (2025-06-09T14:54:12Z)
• Clock offset recovery with sublinear complexity enables synchronization on low-level hardware for quantum key distribution [0.19999259391104385]
  We introduce iQSync, a clock offset recovery method for quantum key distribution (QKD) iQSync requires minimal memory, only a simple instruction set (e.g. no floating-point operations), and can be evaluated with sublinear time complexity. We implement the method on our QKD platform, demonstrating its performance and conformity with analytically derived success probabilities for channel attenuations exceeding 70 dB.
  arXiv  Detail & Related papers  (2024-04-05T13:16:57Z)
• Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
  We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
  arXiv  Detail & Related papers  (2023-12-21T17:40:18Z)
• Qubit-based distributed frame synchronization for quantum key distribution [9.43392013925968]
  We propose a qubit-based distributed frame synchronization method that can achieve time recovery in a continuously running system. Experimental results show that the proposed method outperforms the advanced qubit-based synchronization method Qubit4Sync. We believe our method is applicable to a broad range of QKD scenarios, including drone-based QKD and quantum network construction.
  arXiv  Detail & Related papers  (2023-08-25T03:17:43Z)
• Mitigating crosstalk errors by randomized compiling: Simulation of the BCS model on a superconducting quantum computer [41.94295877935867]
  Crosstalk errors, stemming from CNOT two-qubit gates, are a crucial source of errors on numerous quantum computing platforms. We develop and apply an extension of the randomized compiling protocol that includes a special treatment of neighboring qubits. Our twirling of neighboring qubits is shown to dramatically improve the noise estimation protocol without the need to add new qubits or circuits.
  arXiv  Detail & Related papers  (2023-05-03T18:00:02Z)
• Q-Diffusion: Quantizing Diffusion Models [52.978047249670276]
  Post-training quantization (PTQ) is considered a go-to compression method for other tasks. We propose a novel PTQ method specifically tailored towards the unique multi-timestep pipeline and model architecture. We show that our proposed method is able to quantize full-precision unconditional diffusion models into 4-bit while maintaining comparable performance.
  arXiv  Detail & Related papers  (2023-02-08T19:38:59Z)
• Shuffle-QUDIO: accelerate distributed VQE with trainability enhancement and measurement reduction [77.97248520278123]
  We propose Shuffle-QUDIO to involve shuffle operations into local Hamiltonians during the quantum distributed optimization. Compared with QUDIO, Shuffle-QUDIO significantly reduces the communication frequency among quantum processors and simultaneously achieves better trainability.
  arXiv  Detail & Related papers  (2022-09-26T06:51:20Z)
• Deep Learning-Based Synchronization for Uplink NB-IoT [72.86843435313048]
  We propose a neural network (NN)-based algorithm for device detection and time of arrival (ToA) estimation for the narrowband physical random-access channel (NPRACH) of narrowband internet of things (NB-IoT) The introduced NN architecture leverages residual convolutional networks as well as knowledge of the preamble structure of the 5G New Radio (5G NR) specifications.
  arXiv  Detail & Related papers  (2022-05-22T12:16:43Z)
• Accelerating variational quantum algorithms with multiple quantum processors [78.36566711543476]
  Variational quantum algorithms (VQAs) have the potential of utilizing near-term quantum machines to gain certain computational advantages. Modern VQAs suffer from cumbersome computational overhead, hampered by the tradition of employing a solitary quantum processor to handle large data. Here we devise an efficient distributed optimization scheme, called QUDIO, to address this issue.
  arXiv  Detail & Related papers  (2021-06-24T08:18:42Z)
• Pulse-efficient circuit transpilation for quantum applications on cross-resonance-based hardware [0.8057006406834467]
  We show a pulse-efficient circuit transpilation framework for noisy quantum hardware. This is achieved by scaling cross-resonance pulses and exposing each pulse as a gate to remove redundant single-qubit operations with the transpiler. We observe up to a 50% error reduction in the fidelity of RZZ(theta) and arbitrary SU(4) gates on IBM Quantum devices.
  arXiv  Detail & Related papers  (2021-05-03T17:59:55Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.