SearcharxivSearch

arXiv subjects

Shouvik Ghorai

Publications and source records attributed to Shouvik Ghorai.

4 recordsLinked to original sources

Security of device-independent quantum key distribution protocols: a review

Device-independent quantum key distribution (DI-QKD) is often seen as the ultimate key exchange protocol in terms of security, as it can be performed securely with uncharacterised black-box devices. The advent of DI-QKD closes several loopholes and side-channels that plague current QKD systems. While implementing DI-QKD protocols is technically challenging, there have been recent proof-of-principle demonstrations, resulting from the progress made in both theory and experiments. In this review, we will provide an introduction to DI-QKD, an overview of the related experiments performed, and the theory and techniques required to analyse its security. We conclude with an outlook on future DI-QKD research.

quant-ph

Asymptotic security of continuous-variable quantum key distribution with a discrete modulation

We establish a lower bound on the asymptotic secret key rate of continuous-variable quantum key distribution with a discrete modulation of coherent states. The bound is valid against collective attacks and is obtained by formulating the problem as a semidefinite program. We illustrate our general approach with the quadrature phase-shift keying (QPSK) modulation scheme and show that distances over 100 km are achievable for realistic values of noise. We also discuss the application to more complex quadrature amplitude modulations (QAM) schemes. This work is a major step towards establishing the full security of continuous-variable protocols with a discrete modulation in the finite-size regime and opens the way to large-scale deployment of these protocols for quantum key distribution.

quant-ph

Composable security of two-way continuous-variable quantum key distribution without active symmetrization

We present a general framework encompassing a number of continuous-variable quantum key distribution protocols, including standard one-way protocols, measurement-device-independent protocols as well as some two-way protocols, or any other continuous-variable protocol involving only a Gaussian modulation of coherent states and heterodyne detection. The main interest of this framework is that the corresponding protocols are all covariant with respect to the action of the unitary group $U(n)$, implying that their security can be established thanks to a Gaussian de Finetti reduction. In particular, we give a composable security proof of two-way continuous-variable quantum key distribution against general attacks. We also prove that no active symmetrization procedure is required for these protocols, which would otherwise make them prohibitively costly to implement.

quant-ph

Optimal quantum preparation contextuality in $n$-bit parity-oblivious multiplexing task

In [ PRL, 102, 010401 (2009)], Spekkens et al., have shown that quantum preparation contextuality can power the parity-oblivious multiplexing (POM) task. The bound on the optimal success probability of $n$-bit POM task performed with the classical resources was shown to be the \textit{same} as in a preparation non-contextual theory. This non-contextual bound is violated if the task is performed with quantum resources. While in $2$-bit POM task the optimal quantum success probability is achieved, in 3-bit case optimality was left as an open question. In this paper, we show that the quantum success probability of a $n$-bit POM task is solely dependent on a suitable $2^{n-1}\times n$ Bell's inequality and optimal violation of it optimizes the success probability of the said POM task. Further, we discuss how the degree of quantum preparation contextuality restricts the amount of quantum violations of Bell's inequalities, and consequently the success probability of a POM task.

quant-ph