Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Error code negotiation method of quantum key distribution system

A quantum key distribution and bit error technology, which is applied in the field of quantum communication, can solve problems such as reducing negotiation efficiency, and achieve the effects of improving negotiation efficiency, reducing collision phenomena, and increasing processing speed

Active Publication Date: 2020-08-07
HARBIN INST OF TECH
View PDF11 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0017] Aiming at the problem that the existing Cascade algorithm reduces the negotiation efficiency due to collisions during the bit error negotiation process, the present invention provides a bit error negotiation method for a quantum key distribution system that prevents collisions and reduces the loss of negotiation efficiency

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Error code negotiation method of quantum key distribution system
  • Error code negotiation method of quantum key distribution system
  • Error code negotiation method of quantum key distribution system

Examples

Experimental program
Comparison scheme
Effect test

specific Embodiment

[0058] In the present embodiment, each frame is 64Kb long, and the bit error rate is 3%. 16 frames are set in parallel, α=64, and the negotiation process is:

[0059] 1) Determine the block length of each round according to the bit error rate. Here, the block length of the first round is 32, the block length of the second round is 256, and the 3rd-14th round is half of the entire data length, that is, 32Kb.

[0060] 2) In the first round, the data is divided into blocks according to the block length of 32, and binary search and error correction are performed on blocks with different parity checks. Since there is no backtracking in the first round, the processing is not related to other rounds. The first round works alone and provides data for the second round as data preprocessing.

[0061] 3) In the second round, Arnold scrambles the data of the first round of preprocessing according to 64Kb. The scramble table can be shared to save storage resources and placed in different f...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses an error code negotiation method of a quantum key distribution system, solves the problem that the negotiation efficiency is reduced due to collision in the error code negotiation process of a conventional Cascade algorithm, and belongs to the technical field of quantum communication. The method comprises the following steps: S1, in the first round, carrying out parallel processing on a binary lookup odd-even error correction process; S2, in the second round, obtaining blocks containing odd errors, placing the block with the highest collision probability in a processingset, and placing the rest blocks in an error set; S3, calculating the collision probability of blocks in the error set and the processing set, putting n blocks with the minimum collision probabilityin the error set a into the processing set, conducting one-step binary search odd-even error correction on the blocks in the processing set in parallel each time, when the error blocks are found, removing the blocks from the processing set, determining the positions of the error blocks in the previous round, and if the blocks are in the error set, removing the blocks are removed, and otherwise adding the blocks are added into the error set; S4, repeating S3 until the error set is 0, and turning to S5; and S5, carrying out all the following rounds according to the S2 to S4.

Description

technical field [0001] The invention relates to a bit error negotiation algorithm, in particular to an improved method of a Cascade type error bit negotiation algorithm, and belongs to the technical field of quantum communication. Background technique [0002] The function of the bit error negotiation algorithm is to correct the error bits in the screening code in Quantum Key Distribution (QKD). Bit error negotiation is the most concerned link in QKD post-processing. [0003] There are two main types of bit error negotiation algorithms, one is based on interactive bit error negotiation algorithm, and the other is based on forward error correction code error bit negotiation algorithm. The Cascade algorithm is an interaction-based bit error negotiation algorithm with better performance at present. [0004] The Cascade algorithm was proposed by Brassard et al. in 1993. It is an improvement of the BBBSS algorithm. The core of these two algorithms is the binary search (BINARY) ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): H04L9/08H04L1/00
CPCH04L9/0852H04L9/0858H04L1/0061H04L1/004
Inventor 李琼罗毅毛昊坤韩琦
Owner HARBIN INST OF TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com