One-Shot Min-Entropy Calculation Of Classical-Quantum States And Its Application To Quantum Cryptography

• URL: http://arxiv.org/abs/2406.15226v2
• Date: Sat, 22 Feb 2025 15:10:02 GMT
• Title: One-Shot Min-Entropy Calculation Of Classical-Quantum States And Its Application To Quantum Cryptography
• Authors: Rong Wang, H. F. Chau,
• Abstract summary: We develop a one-shot lower bound calculation technique for the min-entropy of a classical-quantum state.<n>It offers an alternative tight finite-data analysis for the BB84 quantum key distribution scheme.<n>It gives the best finite-key bound known to date for a variant of device independent quantum key distribution protocol.
• Score: 21.823963925581868
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In quantum Shannon theory, various kinds of quantum entropies are used to characterize the capacities of noisy physical systems. Among them, min-entropy and its smooth version attract wide interest especially in the field of quantum cryptography as they can be used to bound the information obtained by an adversary. However, calculating the exact value or non-trivial bounds of min-entropy are extremely difficult because the composite system dimension may scale exponentially with the dimension of its subsystem. Here, we develop a one-shot lower bound calculation technique for the min-entropy of a classical-quantum state that is applicable to both finite and infinite dimensional reduced quantum states. Moreover, we show our technique is of practical interest in at least three situations. First, it offers an alternative tight finite-data analysis for the BB84 quantum key distribution scheme. Second, it gives the best finite-key bound known to date for a variant of device independent quantum key distribution protocol. Third, it provides a security proof for a novel source-independent continuous-variable quantum random number generation protocol. These results show the effectiveness and wide applicability of our approach.

Related papers

• Tensor Cross Interpolation of Purities in Quantum Many-Body Systems [0.0]
  In quantum many-body systems the exponential scaling of the Hilbert space with the number of degrees of freedom renders a complete state characterization. Recently, a compact way of storing subregions' purities by encoding them as amplitudes of a fictitious quantum wave function, known as entanglement feature, was proposed. In this work, we demonstrate that the entanglement feature can be efficiently defining using only a amount of samples in the number of degrees of freedom.
  arXiv  Detail & Related papers  (2025-03-21T15:33:00Z)
• 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 Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Disentanglement Provides a Unified Estimation for Quantum Entropies and Distance Measures [2.14566083603001]
  This paper introduces a unified approach using Disentangling Quantum Neural Networks (DEQNN) for estimating quantum entropies and distances. Our mathematical proof demonstrates that DEQNN can preserve quantum entropies and distances in smaller partial states. This method is scalable to an arbitrary number of quantum states and is particularly effective for less complex quantum systems.
  arXiv  Detail & Related papers  (2024-01-15T14:33:03Z)
• Universality of critical dynamics with finite entanglement [68.8204255655161]
  We study how low-energy dynamics of quantum systems near criticality are modified by finite entanglement. Our result establishes the precise role played by entanglement in time-dependent critical phenomena.
  arXiv  Detail & Related papers  (2023-01-23T19:23:54Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• Certification of quantum states with hidden structure of their bitstrings [0.0]
  We propose a numerically cheap procedure to describe and distinguish quantum states. We show that it is enough to characterize quantum states with different structure of entanglement. Our approach can be employed to detect phase transitions of different nature in many-body quantum magnetic systems.
  arXiv  Detail & Related papers  (2021-07-21T06:22:35Z)
• Quantum Fisher information from randomized measurements [0.0]
  The quantum Fisher information (QFI) is a fundamental quantity of interest in many areas. We use measurements of the density matrix to construct lower bounds that converge to the QFI. We present two examples of applications of the method in quantum systems made of coupled qubits and collective spins.
  arXiv  Detail & Related papers  (2021-05-27T14:16:14Z)
• Quantum Sampling for Optimistic Finite Key Rates in High Dimensional Quantum Cryptography [1.5469452301122175]
  We revisit so-called sampling-based entropic uncertainty relations, deriving newer, more powerful, relations and applying them to source-independent quantum random number generators and high-dimensional quantum key distribution protocols. These sampling-based approaches to entropic uncertainty, and their application to quantum cryptography, hold great potential for deriving proofs of security for quantum cryptographic systems.
  arXiv  Detail & Related papers  (2020-12-08T01:32:59Z)
• The Min-entropy as a Resource for One-Shot Private State Transfer, Quantum Masking and State Transition [0.0]
  We show that the min-entropy of entanglement of a pure bipartite state is the maximum number of qubits privately transferable. We show that the min-entropy of a quantum state is the half of the size of quantum state it can catalytically dephase.
  arXiv  Detail & Related papers  (2020-10-28T07:30:27Z)
• Entanglement transfer, accumulation and retrieval via quantum-walk-based qubit-qudit dynamics [50.591267188664666]
  Generation and control of quantum correlations in high-dimensional systems is a major challenge in the present landscape of quantum technologies. We propose a protocol that is able to attain entangled states of $d$-dimensional systems through a quantum-walk-based it transfer & accumulate mechanism. In particular, we illustrate a possible photonic implementation where the information is encoded in the orbital angular momentum and polarization degrees of freedom of single photons.
  arXiv  Detail & Related papers  (2020-10-14T14:33:34Z)
• Simpler Proofs of Quantumness [16.12500804569801]
  A proof of quantumness is a method for provably demonstrating that a quantum device can perform computational tasks that a classical device cannot. There are currently three approaches for exhibiting proofs of quantumness. We give a two-message (challenge-response) proof of quantumness based on any trapdoor claw-free function.
  arXiv  Detail & Related papers  (2020-05-11T01:31:18Z)
• Quantum Statistical Complexity Measure as a Signalling of Correlation Transitions [55.41644538483948]
  We introduce a quantum version for the statistical complexity measure, in the context of quantum information theory, and use it as a signalling function of quantum order-disorder transitions. We apply our measure to two exactly solvable Hamiltonian models, namely: the $1D$-Quantum Ising Model and the Heisenberg XXZ spin-$1/2$ chain. We also compute this measure for one-qubit and two-qubit reduced states for the considered models, and analyse its behaviour across its quantum phase transitions for finite system sizes as well as in the thermodynamic limit by using Bethe ansatz.
  arXiv  Detail & Related papers  (2020-02-05T00:45: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.