Search Results (52 total)

A continuous-variable Bell inequality, valid for an arbitrary number of observers measuring observables with an arbitrary number of outcomes, was recently introduced [Cavalcanti , Phys. Rev. Lett. 99, 210405 (2007)]. We prove that any n-mode quantum state violating this inequality with quadrature measurements necessarily has a negative partial transposition. Our results thus establish the first link between nonlocality and bound entanglement for continuous-variable systems.

We address the presence of nondistillable (bound) entanglement in natural many-body systems. In particular, we consider standard harmonic and spin-1 / 2 chains, at thermal equilibrium and characterized by few interaction parameters. The existence of bound entanglement is addressed by calculating explicitly the negativity of entanglement for different partitions. This allows us to individuate a range of temperatures for which no entanglement can be distilled by means of local operations, despite the system being globally entangled. We discuss how the appearance of bound entanglement can be linked to entanglement-area laws, typical of these systems. Various types of interactions are explored, showing that the presence of bound entanglement is an intrinsic feature of these systems. In the harmonic case, we analytically prove that thermal bound entanglement persists for systems composed by an arbitrary number of particles. Our results strongly suggest the existence of bound entangled states in the macroscopic limit also for spin-1 / 2 systems.

Given a set of correlations originating from measurements on a quantum state of unknown Hilbert space dimension, what is the minimal dimension d necessary to describe such correlations? We introduce the concept of dimension witness to put lower bounds on d. This work represents a first step in a broader research program aiming to characterize Hilbert space dimension in various contexts related to fundamental questions and quantum information applications.

Hypothesis testing is a fundamental issue in statistical inference and has been a crucial element in the development of information sciences. The Chernoff bound gives the minimal Bayesian error probability when discriminating two hypotheses given a large number of observations. Recently the combined work of Audenaert [Phys. Rev. Lett. 98, 160501 (2007)] and Nussbaum and Szkola [e-print arXiv:quant-ph/0607216] has proved the quantum analog of this bound, which applies when the hypotheses correspond to two quantum states. Based on this quantum Chernoff bound, we define a physically meaningful distinguishability measure and its corresponding metric in the space of states; the latter is shown to coincide with the Wigner-Yanase metric. Along the same lines, we define a second, more easily implementable, distinguishability measure based on the error probability of discrimination when the same local measurement is performed on every copy. We study some general properties of these measures, including the probability distribution of density matrices, defined via the volume element induced by the metric. It is shown that the Bures and the local-measurement based metrics are always proportional. Finally, we illustrate their use in the paradigmatic cases of qubits and Gaussian infinite-dimensional states.

Does bound entanglement naturally appear in quantum many-body systems? We address this question by showing the existence of bound-entangled thermal states for harmonic oscillator systems consisting of an arbitrary number of particles. By explicit calculations of the negativity for different partitions, we find a range of temperatures for which no entanglement can be distilled by means of local operations, despite the system being globally entangled. We offer an interpretation of this result in terms of entanglement-area laws, typical of these systems. Finally, we discuss generalizations of this result to other systems, including spin chains.

We investigate the decay of entanglement of generalized N-particle Greenberger-Horne-Zeilinger (GHZ) states interacting with independent reservoirs. Scaling laws for the decay of entanglement and for its finite-time extinction (sudden death) are derived for different types of reservoirs. The latter is found to increase with N. However, entanglement becomes arbitrarily small, and therefore useless as a resource, much before it completely disappears, around a time which is inversely proportional to the number of particles. We also show that the decay of multiparticle GHZ states can generate bound entangled states.

We investigate entanglement distribution in pure-state quantum networks. We consider the case when nonmaximally entangled two-qubit pure states are shared by neighboring nodes of the network. For a given pair of nodes, we investigate how to generate the maximal entanglement between them by performing local measurements, assisted by classical communication, on the other nodes. We find optimal measurement protocols for both small and large one-dimensional networks. Quite surprisingly, we prove that Bell measurements are not always the optimal ones to perform in such networks. We generalize then the results to simple small two-dimensional (2D) networks, finding again counterintuitive optimal measurement strategies. Finally, we consider large networks with hierarchical lattice geometries and 2D networks. We prove that perfect entanglement can be established on large distances with probability one in a finite number of steps, provided the initial entanglement shared by neighboring nodes is large enough. We discuss also various protocols of entanglement distribution in 2D networks employing classical and quantum percolation strategies.

We consider the ground-state entanglement in highly connected many-body systems consisting of harmonic oscillators and spin-1∕2 systems. Varying their degree of connectivity, we investigate the interplay between the enhancement of entanglement, due to connections, and its frustration, due to monogamy constraints. Remarkably, we see that in many situations the degree of entanglement in a highly connected system is essentially of the same order as in a low connected one. We also identify instances in which the entanglement decreases as the degree of connectivity increases.

The entanglement of superpositions [Linden , Phys. Rev. Lett. 97, 100502 (2006)]is generalized to the multipartite scenario: an upper bound to the multipartite entanglement of a superposition is given in terms of the entanglement of the superposed states and the superposition coefficients. This bound is proven to be tight for a class of states composed of an arbitrary number of qubits. We also extend the result to a large family of quantifiers, which includes the negativity, the robustness of entanglement, and the best separable approximation measure.

We study the nonlocal properties of states resulting from the mixture of an arbitrary entangled state ρ of two d-dimensional systems and completely depolarized noise, with respective weights p and 1-p. We first construct a local model for the case in which ρ is maximally entangled and p at or below a certain bound. We then extend the model to arbitrary ρ. Our results provide bounds on the resistance to noise of the nonlocal correlations of entangled states. For projective measurements, the critical value of the noise parameter p for which the state becomes local is at least asymptotically log⁡(d) larger than the critical value for separability.

It is shown that the ensemble {P(α),|α⟩|α^*⟩}, where P(α) is a Gaussian distribution of finite variance and |α⟩ is a coherent state, can be better discriminated with an entangled measurement than with any local strategy supplemented by classical communication. Although this ensemble consists of products of quasiclassical states without any squeezing, it thus exhibits a purely quantum feature. This remarkable effect is demonstrated experimentally by implementing the optimal local strategy on coherent states of light together with a global strategy that yields a higher fidelity.

We present the optimal collective attack on a quantum key distribution protocol in the “device-independent” security scenario, where no assumptions are made about the way the quantum key distribution devices work or on what quantum system they operate. Our main result is a tight bound on the Holevo information between one of the authorized parties and the eavesdropper, as a function of the amount of violation of a Bell-type inequality.

We consider the problem of discriminating two different quantum states in the setting of asymptotically many copies, and determine the minimal probability of error. This leads to the identification of the quantum Chernoff bound, thereby solving a long-standing open problem. The bound reduces to the classical Chernoff bound when the quantum states under consideration commute. The quantum Chernoff bound is the natural symmetric distance measure between quantum states because of its clear operational meaning and because it does not seem to share some of the undesirable features of other distance measures.

We provide a general formalism to characterize the cryptographic properties of quantum channels in the realistic scenario where the two honest parties employ prepare and measure protocols and the known two-way communication reconciliation techniques. We obtain a necessary and sufficient condition to distill a secret key using this type of schemes for Pauli qubit channels and generalized Pauli channels in higher dimension. Our results can be applied to standard protocols such as Bennett-Brassard 1984 or six-state, giving a critical error rate of 20% and 27.6%, respectively. We explore several possibilities to enlarge these bounds, without any improvement. These results suggest that there may exist weakly entangling channels useless for key distribution using prepare and measure schemes.

We introduce a hierarchy of conditions necessarily satisfied by any distribution P_αβ representing the probabilities for two separate observers to obtain outcomes α and β when making local measurements on a shared quantum state. Each condition in this hierarchy is formulated as a semidefinite program. Among other applications, our approach can be used to obtain upper bounds on the quantum violation of an arbitrary Bell inequality. It yields, for instance, tight bounds for the violations of the Collins et al. inequalities.

We analyze the asymptotic security of the family of Gaussian modulated quantum key distribution protocols for continuous-variables systems. We prove that the Gaussian unitary attack is optimal for all the considered bounds on the key rate when the first and second momenta of the canonical variables involved are known by the honest parties.

Quantum cryptography shows that one can guarantee the secrecy of correlation on the sole basis of the laws of physics, that is, without limiting the computational power of the eavesdropper. The usual security proofs suppose that the authorized partners, Alice and Bob, have a perfect knowledge and control of their quantum systems and devices; for instance, they must be sure that the logical bits have been encoded in true qubits and not in higher dimensional systems. In this paper, we present an approach that circumvents this strong assumption. We define protocols, both for the case of bits and for generic d-dimensional outcomes, in which the security is guaranteed by the very structure of the Alice-Bob correlations, under the no-signaling condition. The idea is that if the correlations cannot be produced by shared randomness, then Eve has poor knowledge of Alice’s and Bob’s symbols. The present study assumes on the one hand that the eavesdropper Eve performs only individual attacks (this is a limitation to be removed in further work), and on the other hand that Eve can distribute any correlation compatible with the no-signaling condition (in this sense her power is greater than what quantum physics allows). Under these assumptions, we prove that the protocols defined here allow extracting secrecy from noisy correlations, when these correlations violate a Bell-type inequality by a sufficiently large amount. The region in which secrecy extraction is possible extends within the region of correlations achievable by measurements on entangled quantum states.

We present a family of three-qubit quantum states with a basic local hidden-variable model. Any von Neumann measurement can be described by a local model for these states. We show that some of these states are genuine three-partite entangled and also distillable. The generalization for larger dimensions or higher number of parties is also discussed. As a by-product, we present symmetric extensions of two-qubit Werner states.

The first step in any quantum key distribution (QKD) protocol consists of sequences of measurements that produce correlated classical data. We show that these correlation data must violate some Bell inequality in order to contain distillable secrecy, if not they could be produced by quantum measurements performed on a separable state of larger dimension. We introduce a new QKD protocol and prove its security against any individual attack by an adversary only limited by the no-signaling condition.

The impossibility of perfect cloning and state estimation are two fundamental results in quantum mechanics. It has been conjectured that quantum cloning becomes equivalent to state estimation in the asymptotic regime where the number of clones tends to infinity. We prove this conjecture using two known results of quantum information theory: the monogamy of quantum correlations and the properties of entanglement breaking channels.

We relate the nonlocal properties of noisy entangled states to Grothendieck’s constant, a mathematical constant appearing in Banach space theory. For two-qubit Werner states ρ_p^W=p∣ψ⁻⟩⟨ψ⁻∣+(1−p)1∕4, we show that there is a local model for projective measurements if and only if p≤1∕K_G(3), where K_G(3) is Grothendieck’s constant of order 3. Known bounds on K_G(3) prove the existence of this model at least for p≲0.66, quite close to the current region of Bell violation, p∼0.71. We generalize this result to arbitrary quantum states.

This article identifies a series of properties common to all theories that do not allow for superluminal signaling and predict the violation of Bell inequalities. Intrinsic randomness, uncertainty due to the incompatibility of two observables, monogamy of correlations, impossibility of perfect cloning, privacy of correlations, bounds in the shareability of some states; all these phenomena are solely a consequence of the no-signaling principle and nonlocality. In particular, it is shown that for any distribution, the properties of (i) nonlocal, (ii) no arbitrarily shareable, and (iii) positive secrecy content are equivalent.

We identify those properties of a quantum channel that are relevant for cryptography. We focus on general key distribution protocols that use prepare and measure schemes and the existing classical reconciliation techniques, as these are the protocols feasible with current technology. Given a channel, we derive an easily computable necessary condition of security for such protocols. In spite of its simplicity, this condition is shown to be tight for the Bennett-Brassard 1984 and six-state protocols. We show that the condition becomes also sufficient in the event of a so-called collective attack.

Any Bell test consists of a sequence of measurements on a quantum state in spacelike separated regions. Thus, a state is better than others for a Bell test when, for the optimal measurements and the same number of trials, the probability of existence of a local model for the observed outcomes is smaller. The maximization over states and measurements defines the optimal nonlocality proof. Numerical results show that the required optimal state does not have to be maximally entangled.

The impossibility of perfectly copying (or cloning) an unknown quantum state is one of the basic rules governing the physics of quantum systems. The processes that perform the optimal approximate cloning have been found in many cases. These “quantum cloning machines” are important tools for studying a wide variety of tasks, e.g., state estimation and eavesdropping on quantum cryptography. This paper provides a comprehensive review of quantum cloning machines both for discrete-dimensional and for continuous-variable quantum systems. In addition, it presents the role of cloning in quantum cryptography, the link between optimal cloning and light amplification via stimulated emission, and the experimental demonstrations of optimal quantum cloning.