Quantum Key Distribution Based on Systematic Polar Coding

• URL: http://arxiv.org/abs/2511.18818v1
• Date: Mon, 24 Nov 2025 06:52:41 GMT
• Title: Quantum Key Distribution Based on Systematic Polar Coding
• Authors: Georgi Bebrov,
• Abstract summary: The work proposes a combination between quantum key distribution and systematic polar coding (an error correction algorithm)<n>This results in obtaining key rates greater than standard quantum key distribution (BB84) and its efficient version (eBB84)
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Here we concerned with quantum key distribution - a way to establish common cryptographic key between several parties. The work proposes a combination between quantum key distribution and systematic polar coding (an error correction algorithm) frameworks - quantum key distribution based on systematic polar coding. This results in obtaining key rates greater than standard quantum key distribution (BB84) and its efficient version (eBB84) when finite-size regime and lower-error-rate quantum channel are considered.

Related papers

• Quantum Blackwell's Ordering and Differential Privacy [42.694152897125726]
  We develop a framework for quantum differential privacy (QDP) based on quantum hypothesis testing and Blackwell's ordering.<n>This approach characterizes $(eps,delta)$-QDP via hypothesis testing divergences and identifies the most informative quantum state pairs under privacy constraints.
  arXiv  Detail & Related papers  (2025-11-03T11:24:52Z)
• Efficient Gate Reordering for Distributed Quantum Compiling in Data Centers [0.0]
  It is crucial to develop methods and software that minimize the number of inter-QPU communications.<n>Here we describe key features of the quantum compiler araQne, which is designed to minimize distribution cost.<n>We establish the crucial role played by circuit reordering strategies, which strongly reduce the distribution cost compared to a baseline approach.
  arXiv  Detail & Related papers  (2025-07-01T18:00:02Z)
• Public-Key Quantum Authentication and Digital Signature Schemes Based on the QMA-Complete Problem [0.0]
  We propose a quantum authentication and digital signature protocol whose security is founded on the Quantum Merlin Arthur(QMA)-completeness of the consistency of local density matrices.<n>We provide a rigorous security analysis, proving the scheme's unforgeability against adaptive chosen-message attacks by quantum adversaries.
  arXiv  Detail & Related papers  (2025-06-20T10:56:50Z)
• Optimizing entanglement distribution via noisy quantum channels [44.99833362998488]
  Entanglement distribution is a crucial problem in quantum information science.<n>We investigate strategies for distributing quantum entanglement between two distant parties through noisy quantum channels.
  arXiv  Detail & Related papers  (2025-06-06T13:48:20Z)
• The multimode conditional quantum Entropy Power Inequality and the squashed entanglement of the multimode extreme bosonic Gaussian channels [53.253900735220796]
  Inequality determines the minimum conditional von Neumann entropy of the output of the most general linear mixing of bosonic quantum modes.<n>Bosonic quantum systems constitute the mathematical model for the electromagnetic radiation in the quantum regime.
  arXiv  Detail & Related papers  (2024-10-18T13:59:50Z)
• Twin-field-based multi-party quantum key agreement [0.0]
  We study a method to extend the twin-field key distribution protocol to a scheme for multi-party quantum key agreement.<n>We study our protocol's security using a minimum error discrimination analysis and derive the key rate based on the entanglement-based source-replacement scheme.
  arXiv  Detail & Related papers  (2024-09-06T11:51:10Z)
• Distributed Quantum Computing in Silicon [40.16556091789959]
  We present preliminary demonstrations of some key distributed quantum computing protocols on silicon T centres in isotopically-enriched silicon. We demonstrate the distribution of entanglement between modules and consume it to apply a teleported gate sequence.
  arXiv  Detail & Related papers  (2024-06-03T18:02:49Z)
• Information Reconciliation for High-Dimensional Quantum Key Distribution using Nonbinary LDPC codes [0.0]
  The application of nonbinary LDPC codes in the Information Reconciliation stage of a high-dimensional discrete-variable Quantum Key Distribution setup is proposed. We show that codes constructed using these distributions allow for efficient reconciliation of large-alphabet keys.
  arXiv  Detail & Related papers  (2023-05-15T13:26:08Z)
• Quantum Key Distribution Using a Quantum Emitter in Hexagonal Boron Nitride [48.97025221755422]
  We demonstrate a room temperature, discrete-variable quantum key distribution system using a bright single photon source in hexagonal-boron nitride. We have generated keys with one million bits length, and demonstrated a secret key of approximately 70,000 bits, at a quantum bit error rate of 6%. Our work demonstrates the first proof of concept finite-key BB84 QKD system realised with hBN defects.
  arXiv  Detail & Related papers  (2023-02-13T09:38:51Z)
• Hybrid Gate-Pulse Model for Variational Quantum Algorithms [33.73469431747376]
  Current quantum programs are mostly compiled on the gate-level, where quantum circuits are composed of quantum gates. pulse-level optimization has gained more attention from researchers due to their advantages in terms of circuit duration. We present a hybrid gate-pulse model that can mitigate these problems.
  arXiv  Detail & Related papers  (2022-12-01T17:06:35Z)
• Conference key agreement in a quantum network [67.410870290301]
  Quantum conference key agreement (QCKA) allows multiple users to establish a secure key from a shared multi-partite entangled state. In a quantum network, this protocol can be efficiently implemented using a single copy of a N-qubit Greenberger-Horne-Zeilinger (GHZ) state to distil a secure N-user conference key bit.
  arXiv  Detail & Related papers  (2022-07-04T18:00:07Z)
• Improved Polar-code-based Efficient Post-processing Algorithm for Quantum Key Distribution [7.762056267745584]
  This paper proposes an efficient post-processing algorithm based on polar codes for quantum key distribution. By analyzing the channel capacity of the main channel and the wiretap channel respectively, we design a codeword structure of polar codes.
  arXiv  Detail & Related papers  (2021-12-20T15:03:29Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• Towards fully-fledged quantum and classical communication over deployed fiber with up-conversion module [47.187609203210705]
  We propose and demonstrate a new method, based on up-conversion assisted receiver, for co-propagating classical light and QKD signals. Our proposal exhibits higher tolerance for noise in comparison to the standard receiver, thus enabling the distribution of secret keys in the condition of 4 dB-higher classical power.
  arXiv  Detail & Related papers  (2021-06-09T13:52:27Z)
• Tight finite-key analysis for generalized high-dimensional quantum key distribution [23.578892457164933]
  We propose a tight finite-key analysis suitable for generalized high-dimensional quantum key distribution protocols. Benefitting from our theory, high-dimensional quantum key distribution protocols with finite resources become experimentally feasible.
  arXiv  Detail & Related papers  (2020-08-08T12:33:53Z)

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.