Searcharxiv⌕ Search

arXiv subjects

N. J. Cerf

Publications and source records attributed to N. J. Cerf.

At least 55 records · Page 3Linked to original sources
arXiv2003

Quantum key distribution using gaussian-modulated coherent states

Quantum continuous variables are being explored as an alternative means to implement quantum key distribution, which is usually based on single photon counting. The former approach is potentially advantageous because it should enable higher key distribution rates. Here we propose and experimentally demonstrate a quantum key distribution protocol based on the transmission of gaussian-modulated coherent states (consisting of laser pulses containing a few hundred photons) and shot-noise-limited homodyne detection; squeezed or entangled beams are not required. Complete secret key extraction is achieved using a reverse reconciliation technique followed by privacy amplification. The reverse reconciliation technique is in principle secure for any value of the line transmission, against gaussian individual attacks based on entanglement and quantum memories. Our table-top experiment yields a net key transmission rate of about 1.7 megabits per second for a loss-free line, and 75 kilobits per second for a line with losses of 3.1 dB. We anticipate that the scheme should remain effective for lines with higher losses, particularly because the present limitations are essentially technical, so that significant margin for improvement is available on both the hardware and software.

quant-ph↗
arXiv2003

Security of Quantum Key Distribution with Coherent States and Homodyne Detection

We assess the security of a quantum key distribution protocol relying on the transmission of Gaussian-modulated coherent states and homodyne detection. This protocol is shown to be equivalent to a squeezed state protocol based on a CSS code construction, and is thus provably secure against any eavesdropping strategy. We also briefly show how this protocol can be generalized in order to improve the net key rate.

quant-ph↗
arXiv2003

Virtual Entanglement and Reconciliation Protocols for Quantum Cryptography with Continuous Variables

We discuss quantum key distribution protocols using quantum continuous variables. We show that such protocols can be made secure against individual gaussian attacks regardless the transmission of the optical line between Alice and Bob. This is achieved by reversing the reconciliation procedure subsequent to the quantum transmission, that is, using Bob's instead of Alice's data to build the key. Although squeezing or entanglement may be helpful to improve the resistance to noise, they are not required for the protocols to remain secure with high losses. Therefore, these protocols can be implemented very simply by transmitting coherent states and performing homodyne detection. Here, we show that entanglement nevertheless plays a crucial role in the security analysis of coherent state protocols. Every cryptographic protocol based on displaced gaussian states turns out to be equivalent to an entanglement-based protocol, even though no entanglement is actually present. This equivalence even holds in the absence of squeezing, for coherent state protocols. This ``virtual'' entanglement is important to assess the security of these protocols as it provides an upper bound on the mutual information between Alice and Bob if they had used entanglement. The resulting security criteria are compared to the separability criterion for bipartite gaussian variables. It appears that the security thresholds are well within the entanglement region. This supports the idea that coherent state quantum cryptography may be unconditionally secure.

quant-ph↗
arXiv2003

Conditional generation of arbitrary multimode entangled states of light with linear optics

We propose a universal scheme for the probabilistic generation of an arbitrary multimode entangled state of light with finite expansion in Fock basis. The suggested setup involves passive linear optics, single photon sources, strong coherent laser beams, and photodetectors with single-photon resolution. The efficiency of this setup may be greatly enhanced if, in addition, a quantum memory is available.

quant-ph↗
arXiv2003

Quantum circuit implementation of the Hamiltonian versions of Grover's algorithm

We analyze three different quantum search algorithms, the traditional Grover's algorithm, its continuous-time analogue by Hamiltonian evolution, and finally the quantum search by local adiabatic evolution. We show that they are closely related algorithms in the sense that they all perform a rotation, at a constant angular velocity, from a uniform superposition of all states to the solution state. This make it possible to implement the last two algorithms by Hamiltonian evolution on a conventional quantum circuit, while keeping the quadratic speedup of Grover's original algorithm.

quant-ph↗
arXiv2002

Reconciliation of a Quantum-Distributed Gaussian Key

Two parties, Alice and Bob, wish to distill a binary secret key out of a list of correlated variables that they share after running a quantum key distribution protocol based on continuous-spectrum quantum carriers. We present a novel construction that allows the legitimate parties to get equal bit strings out of correlated variables by using a classical channel, with as few leaked information as possible. This opens the way to securely correcting non-binary key elements. In particular, the construction is refined to the case of Gaussian variables as it applies directly to recent continuous-variable protocols for quantum key distribution.

cs.CR↗
arXiv2002

Generation of Large Photon-Number Cat States using Linear Optics and Quantum Memory

A recursive method for producing path-entangled states of light is presented. These states may find applications in quantum lithography and high-precision interferometric measurements. The required resources are single-photon sources, linear optics components, and photodetectors. Adding a quantum memory greatly enhances the yield in comparison with the previously known schemes.

quant-ph↗
arXiv2002

Multipartite Classical and Quantum Secrecy Monotones

In order to study multipartite quantum cryptography, we introduce quantities which vanish on product probability distributions, and which can only decrease if the parties carry out local operations or carry out public classical communication. These ``secrecy monotones'' therefore measure how much secret correlations are shared by the parties. In the bipartite case we show that the mutual information is a secrecy monotone. In the multipartite case we describe two different generalisations of the mutual information, both of which are secrecy monotones. The existence of two distinct secrecy monotones allows us to show that in multipartite quantum cryptography the parties must make irreversible choices about which multipartite correlations they want to obtain. Secrecy monotones can be extended to the quantum domain and are then defined on density matrices. We illustrate this generalisation by considering tri-partite quantum cryptography based on the Greenberger-Horne-Zeilinger (GHZ) state. We show that before carrying out measurements on the state, the parties must make an irreversible decision about what probability distribution they want to obtain.

quant-ph↗
arXiv2001

Quantum cloning of orthogonal qubits

An optimal universal cloning transformation is derived that produces M copies of an unknown qubit from a pair of orthogonal qubits. For M>6, the corresponding cloning fidelity is higher than that of the optimal copying of a pair of identical qubits. It is shown that this cloning transformation can be implemented probabilistically via parametric down-conversion by feeding the signal and idler modes of a nonlinear crystal with orthogonally polarized photons.

quant-ph↗
arXiv2001

Cloning and Cryptography with Quantum Continuous Variables

The cloning of quantum variables with continuous spectra is investigated. We define a Gaussian 1-to-2 cloning machine, which copies equally well two conjugate variables such as position and momentum or the two quadrature components of a light mode. The resulting cloning fidelity for coherent states, namely $F=2/3$, is shown to be optimal. An asymmetric version of this Gaussian cloner is then used to assess the security of a continuous-variable quantum key distribution scheme that allows two remote parties to share a Gaussian key. The information versus disturbance tradeoff underlying this continuous quantum cryptographic scheme is then analyzed for the optimal individual attack. Methods to convert the resulting Gaussian keys into secret key bits are also studied. The extension of the Gaussian cloner to optimal $N$-to-$M$ continuous cloners is then discussed, and it is shown how to implement these cloners for light modes, using a phase-insensitive optical amplifier and beam splitters. Finally, a phase-conjugated inputs $(N,N')$-to-$(M,M')$ continuous cloner is defined, yielding $M$ clones and $M'$ anticlones from $N$ replicas of a coherent state and $N'$ replicas of its phase-conjugate (with $M'-M=N'-N$). This novel kind of cloners is shown to outperform the standard $N$-to-$M$ cloners in some situations.

quant-ph↗
arXiv2001

Phase-Conjugated Inputs Quantum Cloning Machines

A quantum cloning machine is introduced that yields $M$ identical optimal clones from $N$ replicas of a coherent state and $N'$ replicas of its phase conjugate. It also optimally produces $M'=M+N'-N$ phase-conjugated clones at no cost. For well chosen input asymmetries $N'/(N+N')$, this machine is shown to provide better cloning fidelities than the standard $(N+N') \to M$ cloner. The special cases of the optimal balanced cloner ($N=N'$) and the optimal measurement ($M=\infty$) are investigated.

quant-ph↗
arXiv2000

Phase Conjugation of Continuous Quantum Variables

The phase conjugation of an unknown Gaussian state cannot be realized perfectly by any physical process. A semi-classical argument is used to derive a tight lower bound on the noise that must be introduced by an approximate phase conjugation operation. A universal transformation achieving the optimal imperfect phase conjugation is then presented, which is the continuous counterpart of the universal-NOT transformation for quantum bits. As a consequence, it is also shown that more information can be encoded into a pair of conjugate Gaussian states than using twice the same state.

quant-ph↗
arXiv2000

Quantum Distribution of Gaussian Keys with Squeezed States

A continuous key distribution scheme is proposed that relies on a pair of canonically conjugate quantum variables. It allows two remote parties to share a secret Gaussian key by encoding it into one of the two quadrature components of a single-mode electromagnetic field. The resulting quantum cryptographic information vs disturbance tradeoff is investigated for an individual attack based on the optimal continuous cloning machine. It is shown that the information gained by the eavesdropper then simply equals the information lost by the receiver.

quant-ph↗
arXiv2000

Optimal N-to-M Cloning of Quantum Coherent States

The cloning of continuous quantum variables is analyzed based on the concept of Gaussian cloning machines, i.e., transformations that yield copies that are Gaussian mixtures centered on the state to be copied. The optimality of Gaussian cloning machines that transform N identical input states into M output states is investigated, and bounds on the fidelity of the process are derived via a connection with quantum estimation theory. In particular, the optimal N-to-M cloning fidelity for coherent states is found to be equal to MN/(MN+M-N).

quant-ph↗
arXiv1999

Universal cloning of continuous quantum variables

The cloning of quantum variables with continuous spectra is analyzed. A universal - or Gaussian - quantum cloning machine is exhibited that copies equally well the states of two conjugate variables such as position and momentum. It also duplicates all coherent states with a fidelity of 2/3. More generally, the copies are shown to obey a no-cloning Heisenberg-like uncertainty relation.

quant-ph↗
arXiv1999

Classical Teleportation of a Quantum Bit

Classical teleportation is defined as a scenario where the sender is given the classical description of an arbitrary quantum state while the receiver simulates any measurement on it. This scenario is shown to be achievable by transmitting only a few classical bits if the sender and receiver initially share local hidden variables. Specifically, a communication of 2.19 bits is sufficient on average for the classical teleportation of a qubit, when restricted to von Neumann measurements. The generalization to positive-operator-valued measurements is also discussed.

quant-ph↗
arXiv1999

Physical Complexity of Symbolic Sequences

A practical measure for the complexity of sequences of symbols (``strings'') is introduced that is rooted in automata theory but avoids the problems of Kolmogorov-Chaitin complexity. This physical complexity can be estimated for ensembles of sequences, for which it reverts to the difference between the maximal entropy of the ensemble and the actual entropy given the specific environment within which the sequence is to be interpreted. Thus, the physical complexity measures the amount of information about the environment that is coded in the sequence, and is conditional on such an environment. In practice, an estimate of the complexity of a string can be obtained by counting the number of loci per string that are fixed in the ensemble, while the volatile positions represent, again with respect to the environment, randomness. We apply this measure to tRNA sequence data.

adap-org↗