Bounds on Petz-Rényi Divergences and their Applications for Device-Independent Cryptography

• URL: http://arxiv.org/abs/2408.12313v1
• Date: Thu, 22 Aug 2024 11:40:37 GMT
• Title: Bounds on Petz-Rényi Divergences and their Applications for Device-Independent Cryptography
• Authors: Thomas A. Hahn, Ernest Y. -Z. Tan, Peter Brown,
• Abstract summary: Variational techniques have been recently developed to find tighter bounds on the von Neumann entropy in a device-independent setting. This has led to significantly improved key rates of DI protocols, in both the limit and in the finite-size regime. We show how this can be used to further improve the finite-size key rate of DI protocols.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Variational techniques have been recently developed to find tighter bounds on the von Neumann entropy in a completely device-independent (DI) setting. This, in turn, has led to significantly improved key rates of DI protocols, in both the asymptotic limit as well as in the finite-size regime. In this paper, we discuss two approaches towards applying these variational methods for Petz-R\'enyi divergences instead. We then show how this can be used to further improve the finite-size key rate of DI protocols, utilizing a fully-R\'enyi entropy accumulation theorem developed in a partner work. Petz-R\'enyi divergences can also be applied to study DI advantage distillation, in which two-way communication is used to improve the noise tolerance of quantum key distribution (QKD) protocols. We implement these techniques to derive increased noise tolerances for DIQKD protocols, which surpass all previous known bounds.

Related papers

• Interfering-or-not-interfering quantum key distribution with advantage distillation [0.0]
  INI-QKD is an innovative protocol whose performance surpasses existing twin-field protocol variants. We introduce an additional step of advantage distillation (AD) after the quantum communication phase to further enhance its performance.
  arXiv  Detail & Related papers  (2024-09-30T20:07:35Z)
• Flattened one-bit stochastic gradient descent: compressed distributed optimization with controlled variance [55.01966743652196]
  We propose a novel algorithm for distributed gradient descent (SGD) with compressed gradient communication in the parameter-server framework. Our gradient compression technique, named flattened one-bit gradient descent (FO-SGD), relies on two simple algorithmic ideas.
  arXiv  Detail & Related papers  (2024-05-17T21:17:27Z)
• Device-Independent Quantum Key Distribution beyond qubits [0.0]
  Device-Independent Quantum Key Distribution (DIQKD) aims to generate secret keys between two parties without relying on trust in their employed devices. This study explores the resilience of high-dimensional quantum systems in DIQKD, focusing on a comparison between qubits and qutrits.
  arXiv  Detail & Related papers  (2024-01-31T20:36:48Z)
• 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)
• Enhancing distributed sensing with imperfect error correction [4.812718493682455]
  Entanglement has shown promise in enhancing information processing tasks in a sensor network, via distributed quantum sensing protocols. As noise is ubiquitous in sensor networks, error correction schemes based on Gottesman, Kitaev and Preskill (GKP) states are required to enhance the performance. Here, we extend the analyses of performance enhancement to finite squeezed GKP states in a heterogeneous noise model.
  arXiv  Detail & Related papers  (2022-01-17T16:42:17Z)
• Device-independent lower bounds on the conditional von Neumann entropy [10.2138250640885]
  We introduce a numerical method to compute lower bounds on rates of quantum protocols. We find substantial improvements over all previous numerical techniques. Our method is compatible with the entropy accumulation theorem.
  arXiv  Detail & Related papers  (2021-06-25T15:24:12Z)
• Scalable Variational Gaussian Processes via Harmonic Kernel Decomposition [54.07797071198249]
  We introduce a new scalable variational Gaussian process approximation which provides a high fidelity approximation while retaining general applicability. We demonstrate that, on a range of regression and classification problems, our approach can exploit input space symmetries such as translations and reflections. Notably, our approach achieves state-of-the-art results on CIFAR-10 among pure GP models.
  arXiv  Detail & Related papers  (2021-06-10T18:17:57Z)
• 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)
• Round-robin differential phase-time-shifting protocol for quantum key distribution: theory and experiment [58.03659958248968]
  Quantum key distribution (QKD) allows the establishment of common cryptographic keys among distant parties. Recently, a QKD protocol that circumvents the need for monitoring signal disturbance, has been proposed and demonstrated in initial experiments. We derive the security proofs of the round-robin differential phase-time-shifting protocol in the collective attack scenario. Our results show that the RRDPTS protocol can achieve higher secret key rate in comparison with the RRDPS, in the condition of high quantum bit error rate.
  arXiv  Detail & Related papers  (2021-03-15T15:20:09Z)
• Improved DIQKD protocols with finite-size analysis [2.940150296806761]
  We show that positive randomness is achievable up to depolarizing noise values of $9.33%$, exceeding all previously known noise thresholds. We also develop a modification to random-key-measurement protocols, using a pre-shared seed followed by a "seed recovery" step.
  arXiv  Detail & Related papers  (2020-12-16T03:04:19Z)
• A Kernel-Based Approach to Non-Stationary Reinforcement Learning in Metric Spaces [53.47210316424326]
  KeRNS is an algorithm for episodic reinforcement learning in non-stationary Markov Decision Processes. We prove a regret bound that scales with the covering dimension of the state-action space and the total variation of the MDP with time.
  arXiv  Detail & Related papers  (2020-07-09T21:37:13Z)

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.