Finite-key analysis for memory-assisted decoy-state quantum key distribution

• URL: http://arxiv.org/abs/2005.04435v2
• Date: Mon, 14 Sep 2020 14:34:36 GMT
• Title: Finite-key analysis for memory-assisted decoy-state quantum key distribution
• Authors: Guillermo Curr\'as-Lorenzo, Mohsen Razavi
• Abstract summary: Memory-assisted quantum key distribution (MA-QKD) systems are among novel promising solutions. We show that accounting for finite-key effects would actually favour MA-QKD setups.
• Score: 1.218340575383456
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Memory-assisted quantum key distribution (MA-QKD) systems are among novel promising solutions that can improve the key-rate scaling with channel loss. By using a middle node with quantum storage and measurement functionalities, they offer the same key-rate scaling with distance as a single-node quantum repeater. However, the distance at which they can surpass the nominal key rate of repeaterless systems, in terms of bits per second, is typically long, owing to the efficiency and/or interaction time issues when one deals with quantum memories. This crossover distance can be a few hundred kilometres, for instance, when one relies on the exchange of infinitely many key bits for the key-rate analysis. In a realistic setup, however, we should account for the finite-key effects in our analysis. Here, we show that accounting for such effects would actually favour MA-QKD setups, by reducing the crossover distance to the regime where realistic implementations can take place. We demonstrate this by rigorously analysing a decoy-state version of MA-QKD, in the finite-key regime, using memory parameters already achievable experimentally. This provides us with a better understanding of the advantages and challenges of working with memory-based systems.

Related papers

• Beating the break-even point with autonomous quantum error correction [23.98841239616206]
  Quantum error correction (QEC) protects fragile quantum information from errors by encoding it in high-dimensional Hilbert spaces. Here, we realize autonomous QEC with a logical qubit encoded in multiple internal spin states of a single trapped ion. We extend the logical qubit lifetime to approximately 11.6 ms, substantially outperforming lifetime for both the physical qubit and the uncorrected logical qubit.
  arXiv  Detail & Related papers  (2025-04-23T14:16:41Z)
• Secure Multi-Party Biometric Verification using QKD assisted Quantum Oblivious Transfer [34.46964288961048]
  We present a practical implementation of a secure multiparty computation application enabled by quantum oblivious transfer (QOT) The QOT protocol uses polarization-encoded entangled states to share oblivious keys between two parties with quantum key distribution (QKD) providing authentication. A practical use case is demonstrated for privacy-preserving fingerprint matching against no-fly lists from Interpol and the United Nations.
  arXiv  Detail & Related papers  (2025-01-09T15:51:30Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Federated Quantum Long Short-term Memory (FedQLSTM) [58.50321380769256]
  Quantum federated learning (QFL) can facilitate collaborative learning across multiple clients using quantum machine learning (QML) models. No prior work has focused on developing a QFL framework that utilizes temporal data to approximate functions. A novel QFL framework that is the first to integrate quantum long short-term memory (QLSTM) models with temporal data is proposed.
  arXiv  Detail & Related papers  (2023-12-21T21:40:47Z)
• Nonlinear improvement of measurement-device-independent quantum key distribution using multimode quantum memory [0.0]
  We show a nonlinear increase in the secure key rate due to the utilization of quantum memory (QM) We adopt an atomic frequency comb as a QM that incorporates the two functions and propose an architecture based on MDI-QKD to attain experimental feasibility.
  arXiv  Detail & Related papers  (2023-06-17T15:06:15Z)
• Tight One-Shot Analysis for Convex Splitting with Applications in Quantum Information Theory [23.18400586573435]
  We establish a one-shot error exponent and a one-shot strong converse for convex splitting with trace distance as an error criterion. This leads to new one-shot exponent results in various tasks such as communication over quantum wiretap channels, secret key distillation, one-way quantum message compression, quantum measurement simulation, and quantum channel coding with side information at the transmitter.
  arXiv  Detail & Related papers  (2023-04-24T12:47:37Z)
• Single-emitter quantum key distribution over 175 km of fiber with optimised finite key rates [45.82374977939355]
  We perform fibre-based quantum key distribution with a quantum dot frequency-converted to telecom wavelength. We demonstrate positive key rates up to 175 km in the regime. This result represents major progress towards the feasibility of long-distance single-emitter QKD networks.
  arXiv  Detail & Related papers  (2022-09-07T18:03:36Z)
• Memoryless quantum repeaters based on cavity-QED and coherent states [0.0]
  A quantum repeater scheme based on cavity-QED and quantum error correction of channel loss via rotation-symmetric bosonic codes is proposed. A numerical simulation shows that the total fidelity and the success probability for quantum communication over a long distance can almost approach unity. Based upon the cavity-QED setting, this scheme can be realized at room temperature and at optical frequencies.
  arXiv  Detail & Related papers  (2022-07-06T05:21:36Z)
• Exact rate analysis for quantum repeaters with imperfect memories and entanglement swapping as soon as possible [0.0]
  We present an exact rate analysis for a secret key that can be shared among two parties employing a linear quantum repeater chain. We consider additional tools and parameters such as memory cut-offs, multiplexing, initial state and swapping gate fidelities.
  arXiv  Detail & Related papers  (2022-03-19T12:55:56Z)
• Tensor Ring Parametrized Variational Quantum Circuits for Large Scale Quantum Machine Learning [28.026962110693695]
  We propose an algorithm that compresses the quantum state within the circuit using a tensor ring representation. The storage and computational time increases linearly in the number of qubits and number of layers, as compared to the exponential increase with exact simulation algorithms. We achieve a test accuracy of 83.33% on Iris dataset and a maximum of 99.30% and 76.31% on binary and ternary classification of MNIST dataset.
  arXiv  Detail & Related papers  (2022-01-21T19:54:57Z)
• Optimised Multithreaded CV-QKD Reconciliation for Global Quantum Networks [3.4519649635864584]
  Quantum Key Distribution system requires estimation of quantum channel characteristics and extraction of secure key bits. On standard processors, it can take several hours to reconcile the required number of quantum signals. New solution results in a significant increase in the final key rate relative to non-optimised reconciliation.
  arXiv  Detail & Related papers  (2021-08-19T00:43:07Z)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)
• Finite-key analysis for twin-field quantum key distribution based on generalized operator dominance condition [23.004519226886444]
  Quantum key distribution (QKD) can help two distant peers to share secret key bits, whose security is guaranteed by the law of physics. Recently, twin-field (TF) QKD has been proposed and intensively studied, since it can beat the rate-distance limit. We propose an improved finite-key analysis of TF-QKD through new operator dominance condition.
  arXiv  Detail & Related papers  (2020-07-17T09:41:06Z)
• Efficient optimization of cut-offs in quantum repeater chains [0.0]
  We develop an algorithm for computing the probability distribution of the waiting time and fidelity of entanglement produced by repeater chain protocols. We use the algorithm to optimize cut-offs in order to maximize secret-key rate between the end nodes of the repeater chain.
  arXiv  Detail & Related papers  (2020-05-11T09:17:21Z)

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.