Conditional generation of an arbitrary superposition of coherent states

We present a scheme to conditionally generate an arbitrary superposition of a pair of coherent states from a squeezed vacuum by means of the modified photon subtraction where a coherent state ancilla and two on/off type detectors are used. We show that, even including realistic imperfections of the detectors, our scheme can generate a target state with a high fidelity. The amplitude of the generated states can be amplified by conditional homodyne detections.Comment: 7 pages, 5 figure

Large amplitude coherent state superposition generated by a time-separated two-photon subtraction from a continuous wave squeezed vacuum

Theoretical analysis is given for a two-photon subtraction from a continuous wave (CW) squeezed vacuum with finite time separation between two detection events. In the CW photon subtraction process, the generated states are inevitably described by temporal mutimode states. Our approach is based on Schr\"{o}dinger picture which provides mathematically simple forms and an intuitive understanding of its multimode structure. We show that, in our process, the photon subtracted squeezed vacuum is generated in two temporal modes and one of these modes acts as an ancillary mode to make the other one a large amplitude coherent state superposition.Comment: 9 pages, 8 figure

Temporally multiplexed superposition states of continuous variables

We study non-Gaussian states generated by two-photon subtraction from a cw squeezed light source. In a cw scheme one can subtract two photons from the source with a designated time separation and can genarate temporally multiplexed superposition states of continuous variables. We numerically study the properties of these states in the light of bosonic interference in the time domain. In an appropriate temporal mode amplified kittens are produced in a region where the time separation is comparable with the correlation time of squeezed packets.Comment: 12 pages, 10 figure

Programming the Kennedy Receiver for Capacity Maximization versus Minimizing One-shot Error Probability

We find the capacity attained by the Kennedy receiver for coherent-state BPSK when the symbol prior p and pre-detection displacement are optimized. The optimal displacement is different than what minimizes error probability for single-shot BPSK state discrimination.Comment: Updating email address format for this replacement submissio

Fundamental rate-loss tradeoff for optical quantum key distribution

Since 1984, various optical quantum key distribution (QKD) protocols have been proposed and examined. In all of them, the rate of secret key generation decays exponentially with distance. A natural and fundamental question is then whether there are yet-to-be discovered optical QKD protocols (without quantum repeaters) that could circumvent this rate-distance tradeoff. This paper provides a major step towards answering this question. We show that the secret-key-agreement capacity of a lossy and noisy optical channel assisted by unlimited two-way public classical communication is limited by an upper bound that is solely a function of the channel loss, regardless of how much optical power the protocol may use. Our result has major implications for understanding the secret-key-agreement capacity of optical channels---a long-standing open problem in optical quantum information theory---and strongly suggests a real need for quantum repeaters to perform QKD at high rates over long distances.Comment: 9+4 pages, 3 figures. arXiv admin note: text overlap with arXiv:1310.012

The squashed entanglement of a quantum channel

This paper defines the squashed entanglement of a quantum channel as the maximum squashed entanglement that can be registered by a sender and receiver at the input and output of a quantum channel, respectively. A new subadditivity inequality for the original squashed entanglement measure of Christandl and Winter leads to the conclusion that the squashed entanglement of a quantum channel is an additive function of a tensor product of any two quantum channels. More importantly, this new subadditivity inequality, along with prior results of Christandl, Winter, et al., establishes the squashed entanglement of a quantum channel as an upper bound on the quantum communication capacity of any channel assisted by unlimited forward and backward classical communication. A similar proof establishes this quantity as an upper bound on the private capacity of a quantum channel assisted by unlimited forward and backward public classical communication. This latter result is relevant as a limitation on rates achievable in quantum key distribution. As an important application, we determine that these capacities can never exceed log((1+eta)/(1-eta)) for a pure-loss bosonic channel for which a fraction eta of the input photons make it to the output on average. The best known lower bound on these capacities is equal to log(1/(1-eta)). Thus, in the high-loss regime for which eta << 1, this new upper bound demonstrates that the protocols corresponding to the above lower bound are nearly optimal.Comment: v3: 25 pages, 3 figures, significant expansion of paper; v2: error in a prior version corrected (main result unaffected), cited Tucci for his work related to squashed entanglement; 5 + epsilon pages and 2-page appendi