Search

Discrete-variable (DV) and continuous-variable (CV) schemes constitute the two major families of quantum key distribution (QKD) protocols. Unfortunately, since the setup elements required by these schemes are quite different, making a fair comparison of their potential performance in particular applications is often troublesome, limiting the experimenters' capability to choose an optimal solution. In this work we perform a general comparison of the major entanglement-based DV and CV QKD protocols in terms of their resistance to the channel noise, with the otherwise perfect setup, showing the definite superiority of the DV family. We analytically derive fundamental bounds on the tolerable channel noise and attenuation for entanglement-based CV QKD protocols. We also investigate the influence of DV QKD setup imperfections on the obtained results in order to determine benchmarks for the parameters of realistic photon sources and detectors, allowing the realistic DV protocols to outperform even the ideal CV QKD analogs. Our results indicate the realistic advantage of DV entanglement-based schemes over their CV counterparts and suggests the practical efforts for maximizing this advantage. [ABSTRACT FROM AUTHOR]

Fundamental investigations in non-locality have shown that while the no-signaling principle alone is not sufficient to single out the set of quantum non-local correlations, local quantum mechanics and no-signaling together exactly reproduce the set of quantum correlations in the two-party Bell scenario. Here, we introduce and study an intermediate hybrid no-signaling quantum set of non-local correlations that we term HNSQ in the multi-party Bell scenario where some subsystems are locally quantum while the remaining subsystems are only constrained by the no-signaling principle. Specifically, the set HNSQ is a super-quantum set of correlations derived from no-signaling assemblages by performing quantum measurements on the trusted subsystems. We show that in contrast to the set NS of no-signaling behaviors, there exist extreme points of HNSQ in the tripartite Bell scenario that admit quantum realization. As a tool for optimization over the set HNSQ, we introduce an outer hierarchy of semi-definite programming approximations to the set following an approach put forward by Dohertyâ€"Parriloâ€"Spedalieri. We perform an extensive numerical analysis of the maximal violation of the facet Bell inequalities in the three-party binary inputâ€"output scenario and study the corresponding self-testing properties. In contrast to the usual no-signaling correlations, the new set allows for simple security proofs of (one-sided)-device-independent applications against super-quantum adversaries. [ABSTRACT FROM AUTHOR]

The generation and control of quantum correlations in high-dimensional systems is a major challenge in the present landscape of quantum technologies. Achieving such non-classical high-dimensional resources will potentially unlock enhanced capabilities for quantum cryptography, communication and computation. We propose a protocol that is able to attain entangled states of d-dimensional systems through a quantum-walk (QW)-based transfer & accumulate mechanism involving coin and walker degrees of freedom. The choice of investigating QW is motivated by their generality and versatility, complemented by their successful implementation in several physical systems. Hence, given the cross-cutting role of QW across quantum information, our protocol potentially represents a versatile general tool to control high-dimensional entanglement generation in various experimental platforms. 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. [ABSTRACT FROM AUTHOR]

Underwater quantum communication has recently been explored using polarization and orbital angular momentum (OAM). Here, we show that spatially structured modes, e.g., a coherent superposition of beams carrying both polarization and OAM, can also be used for underwater quantum cryptography. We also use the polarization degree of freedom to investigate the impact of the channel length on key rates for quantum communication applications. The underwater channel proves to be a difficult environment for establishing quantum communication as underwater optical turbulence results in significant beam wandering and distortions. However, the errors associated to the turbulence do not result in error rates above the threshold for establishing a positive key in a quantum communication link with both the polarization and spatially structured photons. The impact of the underwater channel on the spatially structured modes is also investigated at different distances using polarization tomography. [ABSTRACT FROM AUTHOR]

Quantum channels that break CHSH nonlocality on all input states are known as CHSH-breaking channels. In quantum networks, such channels are useless for distributing correlations that can violate the CHSH Inequality. Motivated by previous work on activation of nonlocality in quantum states, here we demonstrate an analogous activation of CHSH-breaking channels. That is, we show that certain pairs of CHSH-breaking channels are no longer CHSH-breaking when used in combination. We find that this type of activation can emerge in both uni-directional and bi-directional communication scenarios. [ABSTRACT FROM AUTHOR]

The laws of quantum mechanics allow for the distribution of a secret random key between two parties. Here we analyse the security of a protocol for establishing a common secret key betweenNparties (i.e. a conference key), using resource states with genuineN-partite entanglement. We compare this protocol to conference key distribution via bipartite entanglement, regarding the required resources, achievable secret key rates and threshold qubit error rates. Furthermore we discuss quantum networks with bottlenecks for which our multipartite entanglement-based protocol can benefit from network coding, while the bipartite protocol cannot. It is shown how this advantage leads to a higher secret key rate. [ABSTRACT FROM AUTHOR]

Standard quantum key distribution (QKD) protocols typically assume that the distant parties share a common reference frame. In practice, however, establishing and maintaining a good alignment between distant observers is rarely a trivial issue, which may significantly restrain the implementation of long-distance quantum communication protocols. Here we propose simple QKD protocols that do not require the parties to share any reference frame, and study their security and feasibility in both the usual device-dependent (DD) case—in which the two parties use well characterized measurement devices—as well as in the device-independent (DI) case—in which the measurement devices can be untrusted, and the security relies on the violation of a Bell inequality. To illustrate the practical relevance of these ideas, we present a proof-of-principle demonstration of our protocols using polarization entangled photons distributed over a coiled 10-km long optical fiber. We consider two situations, in which either the fiber spool's polarization transformation freely drifts, or randomly chosen polarization transformations are applied. The correlations obtained from measurements allow, with high probability, to generate positive asymptotic secret key rates in both the DD and DI scenarios (under the fair-sampling assumption for the latter case). [ABSTRACT FROM AUTHOR]

The majority of recent works investigating the link between non-locality and randomness, e.g. in the context of device-independent cryptography, do so with respect to some specific Bell inequality, usually the CHSH inequality. However, the joint probabilities characterizing the measurement outcomes of a Bell test are richer than just the degree of violation of a single Bell inequality. In this work we show how to take this extra information into account in a systematic manner in order to optimally evaluate the randomness that can be certified from non-local correlations. We further show that taking into account the complete set of outcome probabilities is equivalent to optimizing over all possible Bell inequalities, thereby allowing us to determine the optimal Bell inequality for certifying the maximal amount of randomness from a given set of non-local correlations. [ABSTRACT FROM AUTHOR]

We report on in-lab free space quantum key distribution (QKD) experiments over 40 cm distance using highly efficient electrically driven quantum dot single-photon sources emitting in the red as well as near-infrared spectral range. In the case of infrared emitting devices, we achieve sifted key rates of 27.2 kbit s-1(35.4 kbit s-1) at a quantum bit error rate (QBER) of 3.9% (3.8%) and a g(2)(0) value of 0.35 (0.49) at moderate (high) excitation. The red emitting diodes generate sifted keys at a rate of 95.0 kbit s-1 at a QBER of 4.1% and a g(2)(0) value of 0.49. This first successful proof of principle QKD experiment based on electrically operated semiconductor single-photon sources can be considered as a major step toward practical and efficient quantum cryptography scenarios. [ABSTRACT FROM AUTHOR]

In practical decoy-state quantum key distribution, the raw key length is finite. Thus, deviation of the estimated single photon yield and single photon error rate from their respective true values due to finite sample size can seriously lower the provably secure key rate R. Current method to obtain a lower bound of R follows an indirect path by first bounding the yields and error rates both conditioned on the type of decoy used. These bounds are then used to deduce the single photon yield and error rate, which in turn are used to calculate a lower bound of the key rate R. Here we report an improved version of McDiarmid inequality in statistics and show how use it to directly compute a lower bound of R via the so-called centering sequence. A novelty in this work is the optimization of the bound through the freedom of choosing possible centering sequences. The provably secure key rate of realistic 100 km long quantum channel obtained by our method is at least twice that of the state-of-the-art procedure when the raw key length ℓraw is ≈105–106. In fact, our method can improve the key rate significantly over a wide range of raw key length from about 105 to 1011. More importantly, it is achieved by pure theoretical analysis without altering the experimental setup or the post-processing method. In a boarder context, this work introduces powerful concentration inequality techniques in statistics to tackle physics problem beyond straightforward statistical data analysis especially when the data are correlated so that tools like the central limit theorem are not applicable. [ABSTRACT FROM AUTHOR]

The negatively charged nitrogen vacancy (NV−) center in diamond has properties that make it a promising candidate for applications such as a qubit in room temperature quantum computing, single-molecule photoluminescence and NMR sensor, and as a single photon source for quantum cryptography. For many of its uses it is desirable to have the NV-center close to the diamond surface. In this work, we use density functional theory simulations to investigate how the distance of the NV− center to a surface, and its orientation, affect its properties, including the zero-phonon-line. We study the three technologically important surfaces terminated with fluorine, oxygen/hydroxyl and nitrogen. Since the NV-center is charged it requires special measures to simulate within a slab-model. We use the recently proposed charging with a substitutional donor in the diamond lattice resulting in a neutral super-cell, which provides very satisfactory results. We have found that the NV-centers properties converge to bulk values already at 5 Å depth. [ABSTRACT FROM AUTHOR]

We present protocols to generate arbitrary photonic graph states from quantum emitters that are in principle deterministic. We focus primarily on two-dimensional cluster states of arbitrary size due to their importance for measurement-based quantum computing. Our protocols for these and many other types of two-dimensional graph states require a linear array of emitters in which each emitter can be controllably pumped, rotated about certain axes, and entangled with its nearest neighbors. We show that an error on one emitter produces a localized region of errors in the resulting graph state, where the size of the region is determined by the coordination number of the graph. We describe how these protocols can be implemented for different types of emitters, including trapped ions, quantum dots, and nitrogen-vacancy centers in diamond. [ABSTRACT FROM AUTHOR]

We study topological phenomena of quantum walks by implementing a novel protocol that extends the range of accessible properties to the eigenvalues of the walk operator. To this end, we experimentally realise for the first time a split-step quantum walk with decoupling, which allows for investigating the effect of a bulk-boundary while realising only a single bulk configuration. The experimental platform is implemented with the well-established time-multiplexing architecture based on fibre-loops and coherent input states. The symmetry protected edge states are approximated with high similarities and we read-out the phase relative to a reference for all modes. In this way we observe eigenvalues which are distinguished by the presence or absence of sign flips between steps. Furthermore, the results show that investigating a bulk-boundary with a single bulk is experimentally feasible when decoupling the walk beforehand. [ABSTRACT FROM AUTHOR]

Relativistic protocols have been proposed to overcome certain impossibility results in classical and quantum cryptography. In such a setting, one takes the location of honest players into account, and uses the signalling limit given by the speed of light to constraint the abilities of dishonest agents. However, composing such protocols with each other to construct new cryptographic resources is known to be insecure in some cases. To make general statements about such constructions, a composable framework for modelling cryptographic security in Minkowski space is required. Here, we introduce a framework for performing such a modular security analysis of classical and quantum cryptographic schemes in Minkowski space. As an application, we show that (1) fair and unbiased coin flipping can be constructed from a simple resource called channel with delay; (2) biased coin flipping, bit commitment and channel with delay through any classical, quantum or post-quantum relativistic protocols are all impossible without further setup assumptions; (3) it is impossible to securely increase the delay of a channel, given several short-delay channels as ingredients. Results (1) and (3) imply in particular the non-composability of existing relativistic bit commitment and coin flipping protocols. [ABSTRACT FROM AUTHOR]

Quantum cryptography is information-theoretically secure owing to its solid basis in quantum mechanics. However, generally, initial implementations with practical imperfections might open loopholes, allowing an eavesdropper to compromise the security of a quantum cryptographic system. This has been shown to happen for quantum key distribution (QKD). Here we apply experience from implementation security of QKD to several other quantum cryptographic primitives. We survey quantum digital signatures, quantum secret sharing, source-independent quantum random number generation, quantum secure direct communication, and blind quantum computing. We propose how the eavesdropper could in principle exploit the loopholes to violate assumptions in these protocols, breaking their security properties. Applicable countermeasures are also discussed. It is important to consider potential implementation security issues early in protocol design, to shorten the path to future applications. [ABSTRACT FROM AUTHOR]

We present a detailed security analysis of a d-dimensional quantum key distribution protocol based on two and three mutually unbiased bases (MUBs) both in an asymptotic and finite-key-length scenario. The finite secret key rates (in bits per detected photon) are calculated as a function of the length of the sifted key by (i) generalizing the uncertainly relation-based insight from BB84 to any d-level 2-MUB QKD protocol and (ii) by adopting recent advances in the second-order asymptotics for finite block length quantum coding (for both d-level 2- and 3-MUB QKD protocols). Since the finite and asymptotic secret key rates increase with d and the number of MUBs (together with the tolerable threshold) such QKD schemes could in principle offer an important advantage over BB84. We discuss the possibility of an experimental realization of the 3-MUB QKD protocol with the orbital angular momentum degrees of freedom of photons. [ABSTRACT FROM AUTHOR]

Quantum key distribution (QKD) has been studied for achieving perfectly secure cryptography based on quantum mechanics. This paper presents a novel QKD scheme that is based on an intensity-modulation and direct-detection system. Two slightly intensity-modulated pulses are sent from a transmitter, and a receiver determines key bits from the directly detected intensity. We analyzed the system performance for two typical eavesdropping methods, a beam splitting attack and an intercept-resend attack, with an assumption that the transmitting and receiving devices are fully trusted. Our brief analysis showed that short- or middle-range QKD systems are achievable with a simple setup. [ABSTRACT FROM AUTHOR]

Recent advances in theoretical and experimental quantum computing bring us closer to scalable quantum computing devices. This makes the need for protocols that verify the correct functionality of quantum operations timely and has led to the field of quantum verification. In this paper we address key challenges to make quantum verification protocols applicable to experimental implementations. We prove the robustness of the single server verifiable universal blind quantum computing protocol of Fitzsimons and Kashefi (2012 arXiv:1203.5217) in the most general scenario. This includes the case where the purification of the deviated input state is in the hands of an adversarial server. The proved robustness property allows the composition of this protocol with a device-independent state tomography protocol that we give, which is based on the rigidity of CHSH games as proposed by Reichardt et al (2013 Nature496 456–60). The resulting composite protocol has lower round complexity for the verification of entangled quantum servers with a classical verifier and, as we show, can be made fault tolerant. [ABSTRACT FROM AUTHOR]

We experimentally demonstrate, for the first time to our knowledge, the generation of correlated photon pairs in a liquid-core photonic crystal fiber. Moreover, we show that, thanks to the specific Raman properties of liquids, the Raman noise (which is the main limitation of the performance of silica-core fiber-based correlated photon pair sources) is highly reduced. With a demonstrated coincident-to-accidental ratio equal to 63 and a pair generation efficiency of about 10−4 per pump pulse, this work contributes to the development of high-quality correlated photon pair sources for quantum communications. [ABSTRACT FROM AUTHOR]

Quantum key distribution (QKD) systems often rely on polarization of light for encoding, thus limiting the amount of information that can be sent per photon and placing tight bounds on the error rates that such a system can tolerate. Here we describe a proof-of-principle experiment that indicates the feasibility of high-dimensional QKD based on the transverse structure of the light field allowing for the transfer of more than 1 bit per photon. Our implementation uses the orbital angular momentum (OAM) of photons and the corresponding mutually unbiased basis of angular position (ANG). Our experiment uses a digital micro-mirror device for the rapid generation of OAM and ANG modes at 4 kHz, and a mode sorter capable of sorting single photons based on their OAM and ANG content with a separation efficiency of 93%. Through the use of a seven-dimensional alphabet encoded in the OAM and ANG bases, we achieve a channel capacity of 2.05 bits per sifted photon. Our experiment demonstrates that, in addition to having an increased information capacity, multilevel QKD systems based on spatial-mode encoding can be more resilient against intercept-resend eavesdropping attacks. [ABSTRACT FROM AUTHOR]

A quantum key distribution (QKD) system may be probed by an eavesdropper Eve by sending in bright light from the quantum channel and analyzing the back-reflections. We propose and experimentally demonstrate a setup for mounting such a Trojan-horse attack. We show it in operation against the quantum cryptosystem Clavis2 from ID Quantique, as a proof-of-principle. With just a few back-reflected photons, Eve discerns Bobʼs (secret) basis choice, and thus the raw key bit in the Scarani–Acín–Ribordy–Gisin 2004 protocol, with higher than 90% probability. This would clearly breach the security of the cryptosystem. Unfortunately, Eveʼs bright pulses have a side effect of causing a high level of afterpulsing in Bobʼs single-photon detectors, resulting in a large quantum bit error rate that effectively protects this system from our attack. However, in a Clavis2-like system equipped with detectors with less-noisy but realistic characteristics, an attack strategy with positive leakage of the key would exist. We confirm this by a numerical simulation. Both the eavesdropping setup and strategy can be generalized to attack most of the current QKD systems, especially if they lack proper safeguards. We also propose countermeasures to prevent such attacks. [ABSTRACT FROM AUTHOR]