Geometric Discord of any arbitrary dimensional bipartite system and its application in quantum key distribution

• URL: http://arxiv.org/abs/2509.04927v1
• Date: Fri, 05 Sep 2025 08:46:24 GMT
• Title: Geometric Discord of any arbitrary dimensional bipartite system and its application in quantum key distribution
• Authors: Rashi Jain, Satyabrata Adhikari,
• Abstract summary: Entangled quantum states are regarded as a key resource in quantum key distribution protocols.<n>We will focus on one such measure of quantum correlation, known as geometric quantum discord (GQD)<n>We find that for a certain range of GQD, the successful generation of the secret key is not guaranteed.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Entangled quantum states are regarded as a key resource in quantum key distribution (QKD) protocols. However, quantum correlations, other than entanglement can also play a significant role the QKD protocols. In this work, we will focus on one such measure of quantum correlation, known as geometric quantum discord (GQD). Firstly, we derive an analytical expression of GQD for two-qutrit quantum systems and further generalize it for $d_1\otimes d_2$ dimensional systems. Next, we apply the concept of GQD in studying QKD. In particular, we derive the lower bound for a distillable secret key rate $K_D$ in terms of GQD when two communicating parties uses private states for generating a secret key in the presence of an eavesdropper. The lower bound of $K_D$ depends upon the GQD of $\frac{\sigma_0+\sigma_1}{2}$ and $\frac{\sigma_2+\sigma_3}{2}$, where $\sigma_i$'s, $i=0,1,2,3$ are the density matrices. We find that for a certain range of GQD, the successful generation of the secret key is not guaranteed. We further study the behavior of distillable key rate when the geometric discord of $\frac{\sigma_0+\sigma_1}{2}$ and $\frac{\sigma_2+\sigma_3}{2}$ increases, decreases or remains constant, with the help of a few examples. Moreover, we find that even when $\sigma_i$'s are separable or positive partial transpose entangled states, the distillable key can still be generated. %Thus, indicating that entanglement is not strictly necessary for a successful QKD protocol.

Related papers

• Super-Quadratic Quantum Speed-ups and Guessing Many Likely Keys [43.5605535402594]
  We study the fundamental problem of guessing cryptographic keys.<n>We find that in a multi-key setting the guessing cost per key is substantially smaller than in a single-key setting.
  arXiv  Detail & Related papers  (2025-09-08T11:03:49Z)
• High-Dimensional Quantum Key Distribution with Qubit-like States [0.0]
  We introduce a high-dimensional QKD protocol using qubit-like states, referred to as Fourier-qubits (or $textitF$-qubits)<n>In our scheme, each $textitF$-qubit is a superposition of only two computational basis states with a relative phase that can take $d$ distinct values, where $d$ is the dimension of the computational basis.<n>This non-mutually unbiased approach allows us to bound the information leaked to an eavesdropper, maintaining security in high-dimensional quantum systems despite the states' seemingly two-dimensional nature
  arXiv  Detail & Related papers  (2025-04-04T19:34:28Z)
• Quantum Homogenization as a Quantum Steady State Protocol on NISQ Hardware [42.52549987351643]
  Quantum homogenization is a reservoir-based quantum state approximation protocol.<n>We extend the standard quantum homogenization protocol to the dynamically-equivalent ($mathttSWAP$)$alpha$ formulation.<n>We show that our proposed protocol yields a completely positive, trace preserving (CPTP) map under which the code subspace is correctable.
  arXiv  Detail & Related papers  (2024-12-19T05:50:54Z)
• Quantum Security Analysis of the Key-Alternating Ciphers [2.5383384004287937]
  We study the quantum security of key-alternating ciphers (KAC)<n>We give the first nontrivial quantum key-recovery attack on multi-round KAC in the $Q1$ model.
  arXiv  Detail & Related papers  (2024-12-06T13:23:29Z)
• The Power of Unentangled Quantum Proofs with Non-negative Amplitudes [55.90795112399611]
  We study the power of unentangled quantum proofs with non-negative amplitudes, a class which we denote $textQMA+(2)$. In particular, we design global protocols for small set expansion, unique games, and PCP verification. We show that QMA(2) is equal to $textQMA+(2)$ provided the gap of the latter is a sufficiently large constant.
  arXiv  Detail & Related papers  (2024-02-29T01:35:46Z)
• The role of shared randomness in quantum state certification with unentangled measurements [36.19846254657676]
  We study quantum state certification using unentangled quantum measurements. $Theta(d2/varepsilon2)$ copies are necessary and sufficient for state certification. We develop a unified lower bound framework for both fixed and randomized measurements.
  arXiv  Detail & Related papers  (2024-01-17T23:44:52Z)
• On sampling determinantal and Pfaffian point processes on a quantum computer [49.1574468325115]
  DPPs were introduced by Macchi as a model in quantum optics the 1970s. Most applications require sampling from a DPP, and given their quantum origin, it is natural to wonder whether sampling a DPP on a classical computer is easier than on a classical one. Vanilla sampling consists in two steps, of respective costs $mathcalO(N3)$ and $mathcalO(Nr2)$ operations on a classical computer, where $r$ is the rank of the kernel matrix.
  arXiv  Detail & Related papers  (2023-05-25T08:43:11Z)
• Qudit entanglers using quantum optimal control [0.0]
  We study the generation of two-qudit entangling quantum logic gates using two techniques in quantum optimal control. We find efficient protocols for creating high-fidelity entangling gates. This provides a powerful platform to explore the various applications of quantum information processing of qudits.
  arXiv  Detail & Related papers  (2022-12-17T04:58:45Z)
• The Franke-Gorini-Kossakowski-Lindblad-Sudarshan (FGKLS) Equation for Two-Dimensional Systems [62.997667081978825]
  Open quantum systems can obey the Franke-Gorini-Kossakowski-Lindblad-Sudarshan (FGKLS) equation. We exhaustively study the case of a Hilbert space dimension of $2$.
  arXiv  Detail & Related papers  (2022-04-16T07:03:54Z)
• Finite-key analysis for quantum key distribution with discrete phase randomization [21.561489948824274]
  We develop a technique based on conjugate measurement and quantum state distinguishment to ana-lyze the security. Our result shows that TF-QKD with reasonable number of discrete random phases, e.g. 8 phases from 0, pi/4, pi/2,..., 7pi/4, can achieve satisfactory performance.
  arXiv  Detail & Related papers  (2022-01-09T15:45:44Z)
• Straddling-gates problem in multipartite quantum systems [20.428960719376164]
  We study a variant of quantum circuit complexity, the binding complexity. We show that any $m$partite Schmidt decomposable state has binding complexity linear in $m$, which hints its multi-separable property.
  arXiv  Detail & Related papers  (2021-10-13T16:28:12Z)
• Quantum double aspects of surface code models [77.34726150561087]
  We revisit the Kitaev model for fault tolerant quantum computing on a square lattice with underlying quantum double $D(G)$ symmetry. We show how our constructions generalise to $D(H)$ models based on a finite-dimensional Hopf algebra $H$.
  arXiv  Detail & Related papers  (2021-06-25T17:03:38Z)
• Relating relative R\'enyi entropies and Wigner-Yanase-Dyson skew information to generalized multiple quantum coherences [0.0]
  We investigate the $alpha$-MQCs, a novel class of multiple quantum coherences based on $alpha$-relative purity. Our framework enables linking $alpha$-MQCs to Wigner-Yanase-Dyson skew information. We illustrate these ideas for quantum systems described by single-qubit states, two-qubit Bell-diagonal states, and a wide class of multiparticle mixed states.
  arXiv  Detail & Related papers  (2020-02-25T21:12:32Z)

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.