Relaxed bound on performance of quantum key repeaters and secure content of generic private and independent bits

• URL: http://arxiv.org/abs/2206.00993v3
• Date: Thu, 29 Feb 2024 17:59:06 GMT
• Title: Relaxed bound on performance of quantum key repeaters and secure content of generic private and independent bits
• Authors: Karol Horodecki and {\L}ukasz Pawela
• Abstract summary: We place a novel bound on quantum key repeater rate. We show that the repeated key of the so called key-correlated states can exceed twice the one-way distillable entanglement.
• Score: 3.0367864044156088
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum key repeater is the backbone of the future Quantum Internet. It is an open problem for an arbitrary mixed bipartite state shared between stations of a quantum key repeater, how much of the key can be generated between its two end-nodes. We place a novel bound on quantum key repeater rate, which uses relative entropy distance from, in general, entangled quantum states. It allows us to generalize bound on key repeaters of M. Christandl and R. Ferrara [Phys. Rev. Lett. 119, 220506]. The bound, albeit not tighter, holds for a more general class of states. In turn, we show that the repeated key of the so called key-correlated states can exceed twice the one-way distillable entanglement at most by twice the max-relative entropy of entanglement of its attacked version. We also provide a non-trivial upper bound on the amount of private randomness of a generic independent bit.

Related papers

• The multimode conditional quantum Entropy Power Inequality and the squashed entanglement of the extreme multimode 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. Bosonic quantum systems constitute the mathematical model for the electromagnetic radiation in the quantum regime.
  arXiv  Detail & Related papers  (2024-10-18T13:59:50Z)
• Efficient Quantum Pseudorandomness from Hamiltonian Phase States [41.94295877935867]
  We introduce a quantum hardness assumption called the Hamiltonian Phase State (HPS) problem. We show that our assumption is plausibly fully quantum; meaning, it cannot be used to construct one-way functions. We show that our assumption and its variants allow us to efficiently construct many pseudorandom quantum primitives.
  arXiv  Detail & Related papers  (2024-10-10T16:10:10Z)
• Realizing fracton order from long-range quantum entanglement in programmable Rydberg atom arrays [45.19832622389592]
  Storing quantum information requires battling quantum decoherence, which results in a loss of information over time. To achieve error-resistant quantum memory, one would like to store the information in a quantum superposition of degenerate states engineered in such a way that local sources of noise cannot change one state into another. We show that this platform also allows to detect and correct certain types of errors en route to the goal of true error-resistant quantum memory.
  arXiv  Detail & Related papers  (2024-07-08T12:46:08Z)
• Quantum Circuit Switching with One-Way Repeaters in Star Networks [0.0]
  We analyze quantum circuit switching as a protocol to distribute quantum states in one-way quantum networks. We show that requests are met at a higher rate when packets are distributed in parallel, although sequential distribution can generally provide service to a larger number of users simultaneously.
  arXiv  Detail & Related papers  (2024-05-29T12:46:57Z)
• Variational-quantum-eigensolver-inspired optimization for spin-chain work extraction [39.58317527488534]
  Energy extraction from quantum sources is a key task to develop new quantum devices such as quantum batteries. One of the main issues to fully extract energy from the quantum source is the assumption that any unitary operation can be done on the system. We propose an approach to optimize the extractable energy inspired by the variational quantum eigensolver (VQE) algorithm.
  arXiv  Detail & Related papers  (2023-10-11T15:59:54Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• Revocable Cryptography from Learning with Errors [61.470151825577034]
  We build on the no-cloning principle of quantum mechanics and design cryptographic schemes with key-revocation capabilities. We consider schemes where secret keys are represented as quantum states with the guarantee that, once the secret key is successfully revoked from a user, they no longer have the ability to perform the same functionality as before.
  arXiv  Detail & Related papers  (2023-02-28T18:58:11Z)
• Secure distribution of a certified random quantum key using an entangled memory qubit [0.0]
  We produce a certified random secret key on both endpoints of the quantum communication channel. We certify the randomness of the key using the min-entropy of the atom-photon state.
  arXiv  Detail & Related papers  (2021-11-29T13:31:30Z)
• Multicell Atomic Quantum Memory as a Hardware-Efficient Quantum Repeater Node [10.687357167527669]
  We report a compact and hardware-efficient realization of a quantum repeater node using a single atomic ensemble for multicell quantum memories. We achieve heralded asynchronous entanglement generation in two quantum repeater segments one after another and then an on-demand entanglement connection of these two repeater segments. This work provides a promising constituent for efficient realization of quantum repeaters for large-scale quantum networks.
  arXiv  Detail & Related papers  (2021-10-18T19:32:36Z)
• Telecom-heralded entanglement between remote multimode solid-state quantum memories [55.41644538483948]
  Future quantum networks will enable the distribution of entanglement between distant locations and allow applications in quantum communication, quantum sensing and distributed quantum computation. Here we report the demonstration of heralded entanglement between two spatially separated quantum nodes, where the entanglement is stored in multimode solid-state quantum memories. We also show that the generated entanglement is robust against loss in the heralding path, and demonstrate temporally multiplexed operation, with 62 temporal modes.
  arXiv  Detail & Related papers  (2021-01-13T14:31:54Z)
• Heralded entanglement distribution between two absorptive quantum memories [7.245400332036547]
  Experimental demonstration of heralded entanglement between absorptive quantum memories. Quantum repeaters based on absorptive quantum memories can overcome limitations.
  arXiv  Detail & Related papers  (2021-01-13T09:17:10Z)
• Universal quantum computation and quantum error correction with ultracold atomic mixtures [47.187609203210705]
  We propose a mixture of two ultracold atomic species as a platform for universal quantum computation with long-range entangling gates. One atomic species realizes localized collective spins of tunable length, which form the fundamental unit of information. We discuss a finite-dimensional version of the Gottesman-Kitaev-Preskill code to protect quantum information encoded in the collective spins.
  arXiv  Detail & Related papers  (2020-10-29T20:17:14Z)
• Limitations for private randomness repeaters [1.145412128763251]
  We show that any state containing perfect, directly accessible, private key (a private state) is an independent state. We provide an upper bound on the rate of repeated randomness in this scenario, similar to the one derived for private key repeaters. In the case of restricted class of operations, we provide also a bound on repeated randomness which holds for arbitrary states.
  arXiv  Detail & Related papers  (2020-03-16T09:51:06Z)

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.