Dimensional advantage in secure information trading via the noisy dense coding protocol

• URL: http://arxiv.org/abs/2310.20688v1
• Date: Tue, 31 Oct 2023 17:50:48 GMT
• Title: Dimensional advantage in secure information trading via the noisy dense coding protocol
• Authors: Ayan Patra, Rivu Gupta, Tamoghna Das, and Aditi Sen De
• Abstract summary: We present the DC-based QKD protocol for higher dimensional systems. We report the lower bounds on secret key rate, when the shared state is a two-qudit maximally entangled state. We prove that the set of useless states in the DC-based QKD protocol is convex and compact.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The quantum dense coding (DC) protocol, which has no security feature, deals with the transmission of classical information encoded in a quantum state by using shared entanglement between a single sender and a single receiver. Its appropriate variant has been established as a quantum key distribution (QKD) scheme for shared two-qubit maximally entangled states, with the security proof utilizing the uncertainty relation of complementary observables and the Shor-Preskill entanglement purification scheme. We present the DC-based QKD protocol for higher dimensional systems and report the lower bounds on secret key rate, when the shared state is a two-qudit maximally entangled state, and mixtures of maximally entangled states with different ranks. The analysis also includes the impact of noisy channels on the secure key rates, before and after encoding. In both the noiseless and the noisy scenarios, we demonstrate that the key rate as well as the robustness of the protocol against noise increases with the dimension. Further, we prove that the set of useless states in the DC-based QKD protocol is convex and compact.

Related papers

• The Road to Near-Capacity CV-QKD Reconciliation: An FEC-Agnostic Design [53.67135680812675]
  A new codeword-based QKD reconciliation scheme is proposed. Both the authenticated classical channel (ClC) and the quantum channel (QuC) are protected by separate forward error correction (FEC) coding schemes. The proposed system makes QKD reconciliation compatible with a wide range of FEC schemes.
  arXiv  Detail & Related papers  (2024-03-24T14:47:08Z)
• Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information [53.85237314348328]
  We introduce for non-uniform messages a novel hybrid universal network coding cryptosystem (NU-HUNCC) We show that NU-HUNCC is information-theoretic individually secured against an eavesdropper with access to any subset of the links.
  arXiv  Detail & Related papers  (2024-02-13T12:12:39Z)
• Efficient Device-Independent Quantum Key Distribution [4.817429789586127]
  Device-independent quantum key distribution (DIQKD) is a key distribution scheme whose security is based on the laws of quantum physics. We propose an efficient device-independent quantum key distribution protocol in which one participant prepares states and transmits them to another participant.
  arXiv  Detail & Related papers  (2023-11-16T13:01:34Z)
• Practical quantum secure direct communication with squeezed states [55.41644538483948]
  We report the first table-top experimental demonstration of a CV-QSDC system and assess its security. This realization paves the way into future threat-less quantum metropolitan networks, compatible with coexisting advanced wavelength division multiplexing (WDM) systems.
  arXiv  Detail & Related papers  (2023-06-25T19:23:42Z)
• Robust and efficient verification of graph states in blind measurement-based quantum computation [52.70359447203418]
  Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
  arXiv  Detail & Related papers  (2023-05-18T06:24:45Z)
• Improved coherent one-way quantum key distribution for high-loss channels [0.0]
  We present a simple variant of COW-QKD and prove its security in the infinite-key limit. Remarkably, the resulting key rate of our protocol is comparable with both the existing upper-bound on COW-QKD key rate and the secure key rate of the coherent-state BB84 protocol.
  arXiv  Detail & Related papers  (2022-06-17T00:07:03Z)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• Discrete-variable quantum key distribution with homodyne detection [14.121646217925441]
  We propose a protocol that combines the simplicity of quantum state preparation in DV-QKD together with the cost-effective and high-bandwidth of homodyne detectors used in CV-QKD. Our simulation suggests that the protocol is suitable for secure and high-speed practical key distribution over distances.
  arXiv  Detail & Related papers  (2021-09-01T17:12:28Z)
• Overcoming the rate-distance limit of device-independent quantum key distribution [7.864517207531803]
  Device-independent quantum key distribution (DIQKD) exploits the violation of a Bell inequality to extract secure key. We propose a heralded DIQKD scheme based on entangled coherent states to improve entangling rates.
  arXiv  Detail & Related papers  (2021-03-31T14:58:46Z)
• 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)

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.