arXiv subjects

Nicolas J. Cerf

Publications and source records attributed to Nicolas J. Cerf.

At least 109 records · Page 6Linked to original sources

arXiv2004

Quantum cloning at the light-atoms interface: copying a coherent light state into two atomic quantum memories

A scheme for the optimal Gaussian cloning of coherent light states at the light-atoms interface is proposed. The distinct feature of this proposal is that the clones are stored in an atomic quantum memory, which is important for applications in quantum communication. The atomic quantum cloning machine requires only a single passage of the light pulse through the atomic ensembles followed by the measurement of a light quadrature and an appropriate feedback, which renders the protocol experimentally feasible. An alternative protocol, where one of the clones is carried by the outgoing light pulse, is discussed in connection with quantum key distribution.

quant-ph↗

arXiv2003

How to measure squeezing and entanglement of Gaussian states without homodyning

We propose a scheme for measuring the squeezing, purity, and entanglement of Gaussian states of light that does not require homodyne detection. The suggested setup only needs beam splitters and single-photon detectors. Two-mode entanglement can be detected from coincidences between photodetectors placed on the two beams.

quant-ph↗

arXiv2003

Continuous-variable quantum cryptography is secure against non-gaussian attacks

A general study of arbitrary finite-size coherent attacks against continuous-variable quantum cryptographic schemes is presented. It is shown that, if the size of the blocks that can be coherently attacked by an eavesdropper is fixed and much smaller than the key size, then the optimal attack for a given signal-to-noise ratio in the transmission line is an individual gaussian attack. Consequently, non-gaussian coherent attacks do not need to be considered in the security analysis of such quantum cryptosystems.

quant-ph↗

arXiv2003

Cloning the entanglement of a pair of quantum bits

It is shown that any quantum operation that perfectly clones the entanglement of all maximally-entangled qubit pairs cannot preserve separability. This ``entanglement no-cloning'' principle naturally suggests that some approximate cloning of entanglement is nevertheless allowed by quantum mechanics. We investigate a separability-preserving optimal cloning machine that duplicates all maximally-entangled states of two qubits, resulting in 0.285 bits of entanglement per clone, while a local cloning machine only yields 0.060 bits of entanglement per clone.

quant-ph↗

arXiv2003

Adiabatic quantum search algorithm for structured problems

The study of quantum computation has been motivated by the hope of finding efficient quantum algorithms for solving classically hard problems. In this context, quantum algorithms by local adiabatic evolution have been shown to solve an unstructured search problem with a quadratic speed-up over a classical search, just as Grover's algorithm. In this paper, we study how the structure of the search problem may be exploited to further improve the efficiency of these quantum adiabatic algorithms. We show that by nesting a partial search over a reduced set of variables into a global search, it is possible to devise quantum adiabatic algorithms with a complexity that, although still exponential, grows with a reduced order in the problem size.

quant-ph↗

arXiv2003

Cloning a real d-dimensional quantum state on the edge of the no-signaling condition

We investigate a new class of quantum cloning machines that equally duplicate all real states in a Hilbert space of arbitrary dimension. By using the no-signaling condition, namely that cloning cannot make superluminal communication possible, we derive an upper bound on the fidelity of this class of quantum cloning machines. Then, for each dimension d, we construct an optimal symmetric cloner whose fidelity saturates this bound. Similar calculations can also be performed in order to recover the fidelity of the optimal universal cloner in d dimensions.

quant-ph↗

arXiv2003

Security of Quantum Key Distribution with Entangled Qutrits

The study of quantum cryptography and quantum non-locality have traditionnally been based on two-level quantum systems (qubits). In this paper we consider a generalisation of Ekert's cryptographic protocol [Ekert] where qubits are replaced by qutrits. The security of this protocol is related to non-locality, in analogy with Ekert's protocol. In order to study its robustness against the optimal individual attacks, we derive the information gained by a potential eavesdropper applying a cloning-based attack.

quant-ph↗

arXiv2002

Quantum cloning with continuous variables

Cloning machines, that is, transformations that achieve the best approximate copying of a quantum state compatible with the no-cloning theorem, have been a fundamental research topic over the last five years. This study is of particular significance given the close connection between quantum cloning and quantum cryptography: using an optimal cloner generally makes it possible to obtain a tight bound on the best individual eavesdropping strategy in a quantum cryptosystem. In this Chapter, the issue of cloning a continuous-variable quantum system will be analyzed, and a Gaussian cloning transformation will be introduced. This cloner, which copies equally well any two canonically conjugate continuous variables, duplicates all coherent states with a same fidelity (F=2/3). The optical implementation of this cloner and its extension to N-to-M cloners will also be discussed. Finally, the use of this cloner for the security assessment of a quantum key distribution scheme relying on continuous (Gaussian) key carriers will be sketched.

quant-ph↗

arXiv2001

Cloning a Qutrit

We investigate several classes of state-dependent quantum cloners for three-level systems. These cloners optimally duplicate some of the four maximally-conjugate bases with an equal fidelity, thereby extending the phase-covariant qubit cloner to qutrits. Three distinct classes of qutrit cloners can be distinguished, depending on two, three, or four maximally-conjugate bases are cloned as well (the latter case simply corresponds to the universal qutrit cloner). These results apply to symmetric as well as asymmetric cloners, so that the balance between the fidelity of the two clones can also be analyzed.

quant-ph↗

arXiv2001

Linear optics and projective measurements alone suffice to create large-photon-number path entanglement

We propose a method for preparing maximal path entanglement with a definite photon number N, larger than two, using projective measurements. In contrast with the previously known schemes, our method uses only linear optics. Specifically, we exhibit a way of generating four-photon, path-entangled states of the form |4,0> + |0,4>, using only four beam splitters and two detectors. These states are of major interest as a resource for quantum interferometric sensors as well as for optical quantum lithography and quantum holography.

quant-ph↗

arXiv2001

Security of quantum key distribution using d-level systems

We consider two quantum cryptographic schemes relying on encoding the key into qudits, i.e. quantum states in a d-dimensional Hilbert space. The first cryptosystem uses two mutually unbiased bases (thereby extending the BB84 scheme), while the second exploits all the d+1 available such bases (extending the six-state protocol for qubits). We derive the information gained by a potential eavesdropper applying a cloning-based individual attack, along with an upper bound on the error rate that ensures unconditional security against coherent attacks.

quant-ph↗

arXiv2001

Greenberger-Horne-Zeilinger paradoxes for many qudits

We construct GHZ contradictions for three or more parties sharing an entangled state, the dimension d of each subsystem being an even integer greater than 2. The simplest example that goes beyond the standard GHZ paradox (three qubits) involves five ququats (d=4). We then examine the criteria a GHZ paradox must satisfy in order to be genuinely M-partite and d-dimensional.

quant-ph↗

arXiv2001

Quantum Search by Local Adiabatic Evolution

The adiabatic theorem has been recently used to design quantum algorithms of a new kind, where the quantum computer evolves slowly enough so that it remains near its instantaneous ground state which tends to the solution [Farhi et al., quant-ph/0001106]. We apply this time-dependent Hamiltonian approach to the Grover's problem, i. e., searching a marked item in an unstructured database. We find that, by adjusting the evolution rate of the Hamiltonian so as to keep the evolution adiabatic on each infinitesimal time interval, the total running time is of order $\sqrt{N}$, where $N$ is the number of items in the database. We thus recover the advantage of Grover's standard algorithm as compared to a classical search, scaling as $N$. This is in contrast with the constant-rate adiabatic approach developed by Farhi et al., where the requirement of adiabaticity is expressed only globally, resulting in a time of order $N$.

quant-ph↗

arXiv2000

Optimal cloning of coherent states with a linear amplifier and beam splitters

A transformation achieving the optimal symmetric N-to-M cloning of coherent states is presented. Its implementation only requires a phase-insensitive linear amplifier and a network of beam splitters. An experimental demonstration of this continuous-variable cloner should therefore be in the scope of current technology. The link between optimal quantum cloning and optimal amplification of quantum states is also pointed out.

quant-ph↗

arXiv1998

Asymmetric quantum cloning machines in any dimension

A family of asymmetric cloning machines for $N$-dimensional quantum states is introduced. These machines produce two imperfect copies of a single state that emerge from two distinct Heisenberg channels. The tradeoff between the quality of these copies is shown to result from a complementarity akin to Heisenberg uncertainty principle. A no-cloning inequality is derived for isotropic cloners: if $π_a$ and $π_b$ are the depolarizing fractions associated with the two copies, the domain in $(\sqrt{π_a},\sqrt{π_b})$-space located inside a particular ellipse representing close-to-perfect cloning is forbidden. More generally, a no-cloning uncertainty relation is discussed, quantifying the impossibility of copying imposed by quantum mechanics. Finally, an asymmetric Pauli cloning machine is defined that makes two approximate copies of a quantum bit, while the input-to-output operation underlying each copy is a (distinct) Pauli channel. The class of symmetric Pauli cloning machines is shown to provide an upper bound on the quantum capacity of the Pauli channel of probabilities $p_x$, $p_y$ and $p_z$.

quant-ph↗

arXiv1998

Entropic bounds on coding for noisy quantum channels

In analogy with its classical counterpart, a noisy quantum channel is characterized by a loss, a quantity that depends on the channel input and the quantum operation performed by the channel. The loss reflects the transmission quality: if the loss is zero, quantum information can be perfectly transmitted at a rate measured by the quantum source entropy. By using block coding based on sequences of n entangled symbols, the average loss (defined as the overall loss of the joint n-symbol channel divided by n, when n tends to infinity) can be made lower than the loss for a single use of the channel. In this context, we examine several upper bounds on the rate at which quantum information can be transmitted reliably via a noisy channel, that is, with an asymptotically vanishing average loss while the one-symbol loss of the channel is non-zero. These bounds on the channel capacity rely on the entropic Singleton bound on quantum error-correcting codes [Phys. Rev. A 56, 1721 (1997)]. Finally, we analyze the Singleton bounds when the noisy quantum channel is supplemented with a classical auxiliary channel.

quant-ph↗

arXiv1998

Quantum cloning and the capacity of the Pauli channel

A family of quantum cloning machines is introduced that produce two approximate copies from a single quantum bit, while the overall input-to-output operation for each copy is a Pauli channel. A no-cloning inequality is derived, describing the balance between the quality of the two copies. This also provides an upper bound on the quantum capacity of the Pauli channel with probabilities $p_x$, $p_y$ and $p_z$. The capacity is shown to be vanishing if $(\sqrt{p_x},\sqrt{p_y},\sqrt{p_z})$ lies outside an ellipsoid whose pole coincides with the depolarizing channel that underlies the universal cloning machine.

quant-ph↗

arXiv1997

Information-theoretic interpretation of quantum error-correcting codes

Quantum error-correcting codes are analyzed from an information-theoretic perspective centered on quantum conditional and mutual entropies. This approach parallels the description of classical error correction in Shannon theory, while clarifying the differences between classical and quantum codes. More specifically, it is shown how quantum information theory accounts for the fact that "redundant" information can be distributed over quantum bits even though this does not violate the quantum "no-cloning" theorem. Such a remarkable feature, which has no counterpart for classical codes, is related to the property that the ternary mutual entropy vanishes for a tripartite system in a pure state. This information-theoretic description of quantum coding is used to derive the quantum analogue of the Singleton bound on the number of logical bits that can be preserved by a code of fixed length which can recover a given number of errors.

quant-ph↗