Ping-pong quantum key distribution with trusted noise: non-Markovian advantage

• URL: http://arxiv.org/abs/2004.05689v2
• Date: Mon, 5 Oct 2020 12:05:46 GMT
• Title: Ping-pong quantum key distribution with trusted noise: non-Markovian advantage
• Authors: Shrikant Utagi, R. Srikanth and Subhashish Banerjee
• Abstract summary: We show how non-unital quantum non-Markovianity of the added noise can improve the key rate. This noise-induced advantage cannot be obtained by Alice and Bob by adding local classical noise to their post-measurement data.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The ping-pong protocol adapted for quantum key distribution is studied in the trusted quantum noise scenario, wherein the legitimate parties can add noise locally. For a well-studied attack model, we show how non-unital quantum non-Markovianity of the added noise can improve the key rate. We also point out that this noise-induced advantage cannot be obtained by Alice and Bob by adding local classical noise to their post-measurement data.

Related papers

• Noise-adapted Quantum Error Correction for Non-Markovian Noise [1.8799303827638123]
  We show that conditions for approximate QEC can be easily generalized for the case of non-Markovian noise. We also construct a Markovian Petz map that achieves similar performance, with only a slight compromise on the fidelity.
  arXiv  Detail & Related papers  (2024-11-14T18:03:16Z)
• Continuous-variable quantum key distribution with noisy squeezed states [0.0]
  We address the role of noisy squeezing in security and performance of continuous-variable (CV) quantum key distribution (QKD) protocols. The noise of the squeezed states, that unavoidably originates already from optical loss in the source, raises concerns about its potential exploitation by an eavesdropper. We show that anti-squeezing noise is typically more harmful for security of the protocols, as it potentially provides more information to an eavesdropper.
  arXiv  Detail & Related papers  (2024-04-08T07:23:27Z)
• Power Characterization of Noisy Quantum Kernels [52.47151453259434]
  We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small. We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T01:02:16Z)
• Noise robustness of a multiparty quantum summation protocol [0.0]
  Near-term quantum networks are noisy, and hence correctness and security of protocols are not guaranteed. We study the impact of both depolarising and dephasing noise on a multiparty summation protocol with imperfect shared entangled states. We conclude by eliminating the need for a trusted third party in the protocol using Shamir's secret sharing.
  arXiv  Detail & Related papers  (2023-11-26T14:29:49Z)
• Noise-robust proofs of quantum network nonlocality [0.49157446832511503]
  We present noise-robust proofs of network quantum nonlocality, for a class of quantum distributions on the triangle network. Our work opens interesting perspectives towards the practical implementation of quantum network nonlocality.
  arXiv  Detail & Related papers  (2023-11-03T18:25:59Z)
• Optimizing the Noise in Self-Supervised Learning: from Importance Sampling to Noise-Contrastive Estimation [80.07065346699005]
  It is widely assumed that the optimal noise distribution should be made equal to the data distribution, as in Generative Adversarial Networks (GANs) We turn to Noise-Contrastive Estimation which grounds this self-supervised task as an estimation problem of an energy-based model of the data. We soberly conclude that the optimal noise may be hard to sample from, and the gain in efficiency can be modest compared to choosing the noise distribution equal to the data's.
  arXiv  Detail & Related papers  (2023-01-23T19:57:58Z)
• Certified Robustness of Quantum Classifiers against Adversarial Examples through Quantum Noise [68.1992787416233]
  We show that adding quantum random rotation noise can improve robustness in quantum classifiers against adversarial attacks. We derive a certified robustness bound to enable quantum classifiers to defend against adversarial examples.
  arXiv  Detail & Related papers  (2022-11-02T05:17:04Z)
• High-Order Qubit Dephasing at Sweet Spots by Non-Gaussian Fluctuators: Symmetry Breaking and Floquet Protection [55.41644538483948]
  We study the qubit dephasing caused by the non-Gaussian fluctuators. We predict a symmetry-breaking effect that is unique to the non-Gaussian noise.
  arXiv  Detail & Related papers  (2022-06-06T18:02:38Z)
• Analyzing and Improving the Optimization Landscape of Noise-Contrastive Estimation [50.85788484752612]
  Noise-contrastive estimation (NCE) is a statistically consistent method for learning unnormalized probabilistic models. It has been empirically observed that the choice of the noise distribution is crucial for NCE's performance. In this work, we formally pinpoint reasons for NCE's poor performance when an inappropriate noise distribution is used.
  arXiv  Detail & Related papers  (2021-10-21T16:57:45Z)
• Quantum noise protects quantum classifiers against adversaries [120.08771960032033]
  Noise in quantum information processing is often viewed as a disruptive and difficult-to-avoid feature, especially in near-term quantum technologies. We show that by taking advantage of depolarisation noise in quantum circuits for classification, a robustness bound against adversaries can be derived. This is the first quantum protocol that can be used against the most general adversaries.
  arXiv  Detail & Related papers  (2020-03-20T17:56:14Z)
• Noise reduction caused by eavesdropping on six-state quantum key distribution over collective-noise channel [0.0]
  We show that there are instances where eavesdropping causes noise reduction for a quantum key distribution protocol. In this paper, we investigate a fault-tolerant six-state QKD protocol over a collective unitary noise channel.
  arXiv  Detail & Related papers  (2019-11-30T12:57:18Z)

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.