In a previous paper, we pointed out the problem of missing data outside the detector range for continuous-variable entanglement verification and quantum key distribution, and we provided a straightforward solution based on entropic separability criteria (as those work better than variance-based criteria). We apply that solution here to the verification of time-frequency entanglement of photon pairs, particularly to the quantum key distribution scheme proposed by Nunn et al. [Opt. Express 21, 15959 (2013)]. We find that the scheme does lead to verifiable entanglement, but that transmission noise quickly destroys the ability to verify the entanglement.
In a previous paper, we pointed out the problem of missing data outside the detector range for continuous-variable entanglement verification and quantum key distribution, and we provided a straightforward solution based on entropic separability criteria (as those work better than variance-based criteria). We apply that solution here to the verification of time-frequency entanglement of photon pairs, particularly to the quantum key distribution scheme proposed by Nunn et al. [Opt. Express 21, 15959 (2013)]. We find that the scheme does lead to verifiable entanglement, but that transmission noise quickly destroys the ability to verify the entanglement.
In continuous-variable quantum information processing, detectors are necessarily coarse grained and of finite range. We discuss how, especially, the latter feature is a bug and may easily lead to overoptimistic estimates of entanglement and of security when missed data outside the detector range are ignored. We demonstrate that a straightforward worst-case analysis is sufficient to avoid false positive statements about entanglement. We show that, for our worst-case analysis, entropic separability or security criteria are much superior to variance-based criteria.
We look at the problem of verifying optical entanglement for two types of states relevant to quantum information processing. One type occurs in Hong-Ou-Mandel interference and is relevant to quantum computing. The other type is time frequency entanglement which is useful for quantum key distribution. For these types of states the conventional methods of entanglement verification do not work well, and we develop new criteria and methods to verify entanglement of such states. Explicitly, one method takes into account the possible multimode character of two photons, while the other method takes into account the missing data that occur due to the finite range of detectors. \n \nThis dissertation includes previously published and unpublished co-authored material.
In this thesis, we investigate the uses of entanglement and its verification in quantum communication. Typically, it is the presence of entanglement which allows quantum communication protocols to outperform their classical counterparts, or to achieve tasks which are infeasible with classical physics. Therefore, the verification of entanglement can provide fundamental tests to certify that experimental implementations of such protocols operate quantum mechanically. The main object here is to develop a verification procedure which is adaptable to a wide range of applications, and whose implementation has low requirements on experimental resources. We present such a procedure in the form of the Expectation Value Matrix. The structure of this thesis is as follows: Chapters 1 and 2 give a short introduction and background information on quantum theory and the quantum states of light. In particular, we discuss the basic postulates of quantum mechanics, quantum state discrimination, the description of quantum light and the homodyne detector. Chapter 3 gives a brief introduction to quantum information and in particular to entanglement, and we discuss the basics of quantum key distribution and teleportation. The general framework of the Expectation Value Matrix is introduced. The main matter of this thesis is contained in the subsequent three chapters, which describe different quantum communication protocols and the corresponding adaptation of the entanglement verification method. The subject of Chapter 4 is quantum key distribution, where the detection of entanglement is a means of excluding intercept-resend attacks, and the presence of quantum correlations in the raw data is a necessary precondition for the generation of secret key. We investigate a continuous-variable version of the two-state protocol and develop the Expectation Value Matrix method for such qubit-mode systems. Furthermore, we analyse the role of the phase reference with respect to the security of the protocol and raise awareness of a corresponding security threat. For this, we adapt the verification method to different settings of Stokes operator measurements. In Chapter 5, we investigate quantum memory channels and propose a fundamental bench- mark for these based on the verification of entanglement. After describing some physical effects which can be used for the coherent storage of light, we focus on the storage of squeezed light. This situation requires an extension of our verification procedure to sources of mixed input states. We propose such an extension, and give a detailed analysis of its application to squeezed thermal states, displaced thermal states and mixed qubit states. This is supplemented by finding the optimal entanglement-breaking channels for each of these situations, which provides us with an indication of the strength of the extension to our entanglement criterion. The subject of Chapter 6 is also the benchmarking of quantum memory or teleportation experiments. Considering a number of recently published benchmark criteria, we investigate the question which one is most useful to actual experiments. For this, a criterion must be both strong, i.e., easy to overcome, and it must be implementable with a reasonable amount of experimental resources. We first compare the different criteria for typical settings and sort them according to their resilience to excess noise. Then, we introduce a further improvement to the Expectation Value Matrix method, which results in the desired optimal benchmark criterion. Finally, we investigate naturally occurring phase fluctuations and find them to further simplify the implementation of our criterion. Thus, we formulate the first truly useful way of validating experiments for the quantum storage or transmission of light.
The security analysis of quantum key distribution is difficult to perform when there is efficiency mismatch between various threshold detectors involved in an experimental setup. Even the verification that the device actually performs in the quantum domain, referred to as the task of entanglement verification, is hard to perform. In this article we provide such an entanglement-verification method for characterized detection-efficiency mismatch. Our method does not rely on a cutoff of photon numbers in the optical signal. It can be applied independently of the degrees of freedom involved, thus covering, for example, efficiency mismatch in polarization and time-bin modes, but also in spatial modes. The evaluation of typical experimental scenarios suggests that an increase of detection-efficiency mismatch will drive the performance of a given setup out of the quantum domain.
The measurement range problem, where one cannot determine the data outside the range of the detector, limits the characterization of entanglement in high-dimensional quantum systems when employing, among other tools from information theory, the entropic uncertainty relations. Practically, the measurement range problem weakens the security of entanglement-based large-alphabet quantum key distribution (QKD) employing degrees of freedom including time-frequency or electric field quadrature. We present a modified entropic uncertainty relation that circumvents the measurement range problem under certain conditions and apply it to well-known QKD protocols. For time-frequency QKD, although our bound is an improvement, we find that high channel loss poses a problem for its feasibility. In homodyne-based continuous variable QKD, we find our bound provides a quantitative way to monitor for saturation attacks.
Any experiment attempting to verify the presence of entanglement in a physical system can only generate a finite amount of data. The statement that entanglement was present in the system can thus never be issued with certainty, requiring instead a statistical analysis of the data. Because entanglement plays a central role in the performance of quantum devices, it is crucial to make statistical claims in entanglement verification experiments that are reliable and have a clear interpretation. In this work, we apply recent results by Christandl and Renner [Phys. Rev. Lett. 109, 120403 (2012)] to construct a reliable entanglement verification procedure based on the concept of confidence regions. The statements made do not require the specification of a prior distribution, the assumption of independent measurements, or the assumption of an independent and identically distributed source of states. Moreover, we develop numerical tools that are necessary to employ this approach in practice, rendering the procedure ready to be applied to current experiments. We demonstrate this technique by analyzing the data of a photonic experiment generating two-photon states whose entanglement is verified with the use of an accessible nonlinear witness.