Search

Quantum sensing has become a broad field. It is generally related with the idea of using quantum resources to boost the performance of a number of practical tasks, including the radar-like detection of faint objects, the readout of information from optical memories, and the optical resolution of extremely close point-like sources. Here, we first focus on the basic tools behind quantum sensing, discussing the most recent and general formulations for the problems of quantum parameter estimation and hypothesis testing. With this basic background in hand, we then review emerging applications of quantum sensing in the photonic regime both from a theoretical and experimental point of view. Besides the state of the art, we also discuss open problems and potential next steps. ©Springer Nature Limited 2018., EPSRC via the UK Quantum Communications Hub (EP/M013472/1), Danish Research Council for Independent Research (Sapere Aude 4184-00338B), Innovation Fund Denmark (Qubiz), Danish National Research Foundation (Center for Macroscopic Quantum States, bigQ DNRF142)

Fast secure random number generation is essential for high-speed encrypted communication, and is the backbone of information security. Generation of truly random numbers depends on the intrinsic randomness of the process used and is usually limited by electronic bandwidth and signal processing data rates. Here we use a multiplexing scheme to create a fast quantum random number generator structurally tailored to encryption for distributed computing, and high bit-rate data transfer. We use vacuum fluctuations measured by seven homodyne detectors as quantum randomness sources, multiplexed using a single integrated optical device. We obtain a random number generation rate of 3.08 Gbit/s, from only 27.5 MHz of sampled detector bandwidth. Furthermore, we take advantage of the multiplexed nature of our system to demonstrate an unseeded strong extractor with a generation rate of 26 Mbit/s., Comment: 10 pages, 3 figures and 1 table

The continuous-variable version of quantum key distribution (QKD) offers the advantages (over discrete-variable systems) of higher secret key rates in metropolitan areas as well as the use of standard telecom components that can operate at room temperature. An important step in the real-world adoption of continuous-variable QKD is the deployment of field tests over commercial fibers. Here we report two different field tests of a continuous-variable QKD system through commercial fiber networks in Xi'an and Guangzhou over distances of 30.02 km (12.48 dB) and 49.85 km (11.62 dB), respectively. We achieve secure key rates two orders-of-magnitude higher than previous field test demonstrations. This is achieved by developing a fully automatic control system to create stable excess noise and by applying a rate-adaptive reconciliation protocol to achieve a high reconciliation efficiency with high success probability. Our results pave the way to achieving continuous-variable QKD in a metropolitan setting., 19 pages, 6 figures

We introduce Strawberry Fields, an open-source quantum programming architecture for light-based quantum computers, and detail its key features. Built in Python, Strawberry Fields is a full-stack library for design, simulation, optimization, and quantum machine learning of continuous-variable circuits. The platform consists of three main components: (i) an API for quantum programming based on an easy-to-use language named Blackbird; (ii) a suite of three virtual quantum computer backends, built in NumPy and TensorFlow, each targeting specialized uses; and (iii) an engine which can compile Blackbird programs on various backends, including the three built-in simulators, and -- in the near future -- photonic quantum information processors. The library also contains examples of several paradigmatic algorithms, including teleportation, (Gaussian) boson sampling, instantaneous quantum polynomial, Hamiltonian simulation, and variational quantum circuit optimization., Comment: Try the Strawberry Fields Interactive website, located at http://strawberryfields.ai . Source code available at https://github.com/XanaduAI/strawberryfields. Accepted in Quantum

Reply to 'Discrete and continuous variables for measurement-device-independent quantum cryptography'

Much progress has been made in the field of quantum computing using continuous variables over the last couple of years. This includes the generation of extremely large entangled cluster states (10,000 modes, in fact) as well as a fault tolerant architecture. This has led to the point that continuous-variable quantum computing can indeed be thought of as a viable alternative for universal quantum computing. With that in mind, we present a new algorithm for continuous-variable quantum computers which gives an exponential speedup over the best known classical methods. Specifically, this relates to efficiently calculating the scattering amplitudes in scalar bosonic quantum field theory, a problem that is believed to be hard using a classical computer. Building on this, we give an experimental implementation based on cluster states that is feasible with today's technology., 7 pages, 1 figure

Quantum teleportation is one of the most important protocols in quantum information. By exploiting the physical resource of entanglement, quantum teleportation serves as a key primitive in a variety of quantum information tasks and represents an important building block for quantum technologies, with a pivotal role in the continuing progress of quantum communication, quantum computing and quantum networks. Here we review the basic theoretical ideas behind quantum teleportation and its variant protocols. We focus on the main experiments, together with the technical advantages and disadvantages associated with the use of the various technologies, from photonic qubits and optical modes to atomic ensembles, trapped atoms, and solid-state systems. Analysing the current state-of-the-art, we finish by discussing open issues, challenges and potential future implementations., Comment: Nature Photonics Review. Comments are welcome. This is a slightly-expanded arXiv version (14 pages, 5 figure, 1 table)

Quantum cryptography achieves a formidable task—the remote distribution of secret keys by exploiting the fundamental laws of physics. Quantum cryptography is now headed towards solving the practical problem of constructing scalable and secure quantum networks. A significant step in this direction has been the introduction of measurement-device independence, where the secret key between two parties is established by the measurement of an untrusted relay. Unfortunately, although qubit-implemented protocols can reach long distances, their key rates are typically very low, unsuitable for the demands of a metropolitan network. Here we show, theoretically and experimentally, that a solution can come from the use of continuous-variable systems. We design a coherent-state network protocol able to achieve remarkably high key rates at metropolitan distances, in fact three orders of magnitude higher than those currently achieved. Our protocol could be employed to build high-rate quantum networks where devices securely connect to nearby access points or proxy servers. An end-to-end continuous-variable quantum key distribution system with an untrusted node is proposed. A proof-of-principle experiment shows that 10−1 secret key bits per relay use are distributed at 4 dB loss, corresponding to 20 km in optical fibre.

In order to achieve universal quantum computation using continuous variables, one needs to jump out of the set of Gaussian operations and have a non-Gaussian element, such as the cubic phase gate. However, such a gate is currently very difficult to implement in practice. Here we introduce an experimentally viable 'repeat-until-success' approach to generating the cubic phase gate, which is achieved using sequential photon subtractions and Gaussian operations. We find that our scheme offers benefits in terms of the expected time until success, although we require a primitive quantum memory., 7 pages, 4 figures

We study the security of two-way quantum cryptography at different wavelengths of the electromagnetic spectrum, from the optical range down to the microwave range. In particular, we consider a two-way quantum communication protocol where Gaussian-modulated thermal states are subject to random Gaussian displacements and finally homodyned. We show how its security threshold (in reverse reconciliation) is extremely robust with respect to the preparation noise and able to outperform the security thresholds of one-way protocols at any wavelength. As a result, improved security distances are now accessible for implementing quantum key distribution at the very challenging regime of infrared frequencies., Comment: 8 pages, 6 figures

Imperfect devices in commercial quantum key distribution systems open security loopholes that an eavesdropper may exploit. An example of one such imperfection is the wavelength dependent coupling ratio of the fiber beam splitter. Utilizing this loophole, the eavesdropper can vary the transmittances of the fiber beam splitter at the receiver's side by inserting lights with wavelengths different from what is normally used. Here, we propose a wavelength attack on a practical continuous-variable quantum key distribution system using homodyne detection. By inserting light pulses at different wavelengths, this attack allows the eavesdropper to bias the shot noise estimation even if it is done in real time. Based on experimental data, we discuss the feasibility of this attack and suggest a prevention scheme by improving the previously proposed countermeasures., Comment: 8 pages, 3 figures. PRA accepted

In this paper, we show how continuous-variable dense coding can be implemented using entangled light generated from a membrane-in-the-middle geometry. The mechanical resonator is assumed to be a high reflectivity membrane hung inside a high quality factor cavity. We show that the mechanical resonator is able to generate an amount of entanglement between the optical modes at the output of the cavity, which is strong enough to approach the capacity of quantum dense coding at small photon numbers. The suboptimal rate reachable by our optomechanical protocol is high enough to outperform the classical capacity of the noiseless quantum channel.

We extend the formalism of cluster state quantum secret sharing, as presented in Markham and Sanders [Phys. Rev. A 78, 042309 (2008)] and Keet et al. [Phy. Rev. A 82, 062315 (2010)], to the continuous-variable regime. We show that both classical and quantum information can be shared by distributing continuous-variable cluster states through either public or private channels. We find that the adversary structure is completely denied from the secret if the cluster state is infinitely squeezed, but some secret information would be leaked if a realistic finitely squeezed state is employed. We suggest benchmarks to evaluate the security in the finitely squeezed cases. For the sharing of classical secrets, we borrow techniques from the continuous-variable quantum key distribution to compute the secret sharing rate. For the sharing of quantum states, we estimate the amount of entanglement distilled for teleportation from each cluster state., v3: Modified abstract and introduction

The security proofs of continuous-variable quantum key distribution are based on the assumptions that the eavesdropper can neither act on the local oscillator nor control Bob's beam splitter. These assumptions may be invalid in practice due to potential imperfections in the implementations of such protocols. In this paper, we consider the problem of transmitting the local oscillator in a public channel and propose a wavelength attack which can allow the eavesdropper to control the intensity transmission of Bob's beam splitter by switching the wavelength of the input light. Specifically we target continuous-variable quantum key distribution systems that use the heterodyne detection protocol using either direct or reverse reconciliation. Our attack is proved to be feasible and renders all of the final key shared between the legitimate parties insecure, even if they have monitored the intensity of the local oscillator. To prevent our attack on commercial systems, a simple wavelength filter should be added before performing the monitoring detection., Comment: 9 pages, 4 figures. arXiv admin note: substantial text overlap with arXiv:1206.6550

We analyze the performance of continuous-variable quantum key distribution protocols where the entangled source originates not from one of the trusted parties, Alice or Bob, but from the malicious eavesdropper in the middle. This is in contrast to the typical simulations where Alice creates the entangled source and sends it over an insecure quantum channel to Bob. By using previous techniques and identifying certain error correction protocol equivalences, we show that Alice and Bob do not need to trust their source, and can still generate a positive key rate. Such a situation can occur in a quantum network where the untrusted source originated in between the two users., Comment: 5 pages, 3 figures

We consider the security of continuous-variable quantum key distribution using thermal (or noisy) Gaussian resource states. Specifically, we analyze this against collective Gaussian attacks using direct and reverse reconciliation where both protocols use either homodyne or heterodyne detection. We show that in the case of direct reconciliation with heterodyne detection, an improved robustness to channel noise is achieved when large amounts of preparation noise is added, as compared to the case when no preparation noise is added. We also consider the theoretical limit of infinite preparation noise and show a secure key can still be achieved in this limit provided the channel noise is less than the preparation noise. Finally, we consider the security of quantum key distribution at various electromagnetic wavelengths and derive an upper bound related to an entanglement-breaking eavesdropping attack and discuss the feasibility of microwave quantum key distribution., 12 pages, 11 figures. Updated from published version with some minor corrections

We consider the distinguishability of Gaussian states from the view point of continuous-variable quantum cryptography using post-selection. Specifically, we use the probability of error to distinguish between two pure coherent (squeezed) states and two particular mixed symmetric coherent (squeezed) states where each mixed state is an incoherent mixture of two pure coherent (squeezed) states with equal and opposite displacements in the conjugate quadrature. We show that the two mixed symmetric Gaussian states (where the various components have the same real part) never give an eavesdropper more information than the two pure Gaussian states. Furthermore, when considering the distinguishability of squeezed states, we show that varying the amount of squeezing leads to a "squeezing" and "anti-squeezing" of the net information rates., Comment: 10 pages, 9 figures

Continuous-variable cluster states offer a potentially promising method of implementing a quantum computer. This paper extends and further refines theoretical foundations and protocols for experimental implementation. We give a cluster-state implementation of the cubic phase gate through photon detection, which, together with homodyne detection, facilitates universal quantum computation. In addition, we characterize the offline squeezed resources required to generate an arbitrary graph state through passive linear optics. Most significantly, we prove that there are universal states for which the offline squeezing per mode does not increase with the size of the cluster. Simple representations of continuous-variable graph states are introduced to analyze graph state transformations under measurement and the existence of universal continuous-variable resource states., Comment: 17 pages, 5 figures

We consider the quantum cloning of continuous variable entangled states. This is achieved by introducing two symmetric entanglement cloning machines (or e-cloners): a local e-cloner and a global e-cloner; where we look at the preservation of entanglement in the clones under the condition that the fidelity of the clones is maximized. These cloning machines are implemented using simple linear optical elements such as beam splitters and homodyne detection along with squeeze gates. We show that the global e-cloner out-performs the local e-cloner both in terms of the fidelity of the cloned states as well as the strength of the entanglement of the clones. There is a minimum strength of entanglement (3dB for the inseparability criterion and 5.7dB for the EPR paradox criterion) of the input state of the global e-cloner that is required to preserve the entanglement in the clones., Comment: 11 pages, 6 figures

We analyze an optical parametric oscillator (OPO) in which cascaded down-conversion occurs inside a cavity resonant for all modes but the initial pump. Due to the resonant cascade design, the OPO present two \chi^2 level oscillation thresholds that are therefore remarkably lower than for a \chi^3 OPO. This is promising for reaching the regime of an effective third-order nonlinearity well above both thresholds. Such a \chi^2 cascaded device also has potential applications in frequency conversion to far infra-red regimes. But, most importantly, it can generate novel multi-partite quantum correlations in the output radiation, which represent a step beyond squeezed or entangled light. The output can be highly non-Gaussian, and therefore not describable by any semi-classical model., Comment: 7 pages, 13 figures

In realistic continuous variable quantum key distribution protocols, an eavesdropper may exploit the additional Gaussian noise generated during transmission to mask her presence. We present a theoretical framework for a post-selection based protocol which explicitly takes into account excess Gaussian noise. We derive a quantitative expression of the secret key rates based on the Levitin and Holevo bounds. We experimentally demonstrate that the post-selection based scheme is still secure against both individual and collective Gaussian attacks in the presence of this excess noise., 4 pages, 4 figures

The linear optical creation of Gaussian cluster states, a potential resource for universal quantum computation, is investigated. We show that for any Gaussian cluster state, the canonical generation scheme in terms of QND-type interactions, can be entirely replaced by off-line squeezers and beam splitters. Moreover, we find that, in terms of squeezing resources, the canonical states are rather wasteful and we propose a systematic way to create cheaper states. As an application, we consider Gaussian cluster computation in multiple-rail encoding. This encoding may reduce errors due to finite squeezing, even when the extra rails are achieved through off-line squeezing and linear optics., Comment: 5 Pages, 3 figures

The random switching of measurement bases is commonly assumed to be a necessary step of quantum key distribution protocols. In this paper we show that switching is not required for coherent state continuous variable quantum key distribution. We show this via the no-switching protocol which results in higher information rates and a simpler experimental setup. We propose an optimal eavesdropping attack against this protocol, for individual Gaussian attacks, and we investigate and compare the no-switching protocol applied to the original BB84 scheme., Comment: 9 pages, 4 figures, submitted

The imperfections of a receiver's detector affect the performance of two-way continuous-variable quantum key distribution protocols and are difficult to adjust in practical situations. We propose a method to improve the performance of two-way continuous-variable quantum key distribution by adding a parameter-adjustable optical amplifier at the receiver. A security analysis is derived against a two-mode collective entangling cloner attack. Our simulations show that the proposed method can improve the performance of protocols as long as the inherent noise of the amplifier is lower than a critical value, defined as the tolerable amplifier noise. Furthermore, the optimal performance can approach the scenario where a perfect detector is used., Comment: 14 pages, 7 figures