arXiv subjects

Antonio Acin

Publications and source records attributed to Antonio Acin.

At least 55 records · Page 3Linked to original sources

arXiv2010

Multipartite fully-nonlocal quantum states

We present a general method to characterize the quantum correlations obtained after local measurements on multipartite systems. Sufficient conditions for a quantum system to be fully-nonlocal according to a given partition, as well as being (genuinely) multipartite fully-nonlocal, are derived. These conditions allow us to identify all completely-connected graph states as multipartite fully-nonlocal quantum states. Moreover, we show that this feature can also be observed in mixed states: the tensor product of five copies of the Smolin state, a biseparable and bound entangled state, is multipartite fully-nonlocal.

quant-ph↗

arXiv2010

Convergent relaxations of polynomial optimization problems with non-commuting variables

We consider optimization problems with polynomial inequality constraints in non-commuting variables. These non-commuting variables are viewed as bounded operators on a Hilbert space whose dimension is not fixed and the associated polynomial inequalities as semidefinite positivity constraints. Such problems arise naturally in quantum theory and quantum information science. To solve them, we introduce a hierarchy of semidefinite programming relaxations which generates a monotone sequence of lower bounds that converges to the optimal solution. We also introduce a criterion to detect whether the global optimum is reached at a given relaxation step and show how to extract a global optimizer from the solution of the corresponding semidefinite programming problem.

math.OC↗

arXiv2009

Open-system dynamics of graph-state entanglement

We consider graph states of arbitrary number of particles undergoing generic decoherence. We present methods to obtain lower and upper bounds for the system's entanglement in terms of that of considerably smaller subsystems. For an important class of noisy channels, namely the Pauli maps, these bounds coincide and thus provide the exact analytical expression for the entanglement evolution. All the results apply also to (mixed) graph-diagonal states, and hold true for any convex entanglement monotone. Since any state can be locally depolarized to some graph-diagonal state, our method provides a lower bound for the entanglement decay of any arbitrary state. Finally, this formalism also allows for the direct identification of the robustness under size scaling of graph states in the presence of decoherence, merely by inspection of their connectivities.

quant-ph↗

arXiv2009

Device-independent quantum key distribution secure against collective attacks

Device-independent quantum key distribution (DIQKD) represents a relaxation of the security assumptions made in usual quantum key distribution (QKD). As in usual QKD, the security of DIQKD follows from the laws of quantum physics, but contrary to usual QKD, it does not rely on any assumptions about the internal working of the quantum devices used in the protocol. We present here in detail the security proof for a DIQKD protocol introduced in [Phys. Rev. Lett. 98, 230501 (2008)]. This proof exploits the full structure of quantum theory (as opposed to other proofs that exploit the no-signalling principle only), but only holds again collective attacks, where the eavesdropper is assumed to act on the quantum systems of the honest parties independently and identically at each round of the protocol (although she can act coherently on her systems at any time). The security of any DIQKD protocol necessarily relies on the violation of a Bell inequality. We discuss the issue of loopholes in Bell experiments in this context.

quant-ph↗

arXiv2008

Area laws and entanglement distillability of thermal states

We study the entanglement distillability properties of thermal states of many-body systems. Following the ideas presented in [D.Cavalcanti et al., arxiv:0705.3762], we first discuss the appearance of bound entanglement in those systems satisfying an entanglement area law. Then, we extend these results to other topologies, not necessarily satisfying an entanglement area law. We also study whether bound entanglement survives in the macroscopic limit of an infinite number of particles.

quant-ph↗

arXiv2008

Non-secret correlations can be used to distribute secrecy

A counter-intuitive result in entanglement theory was shown in [PRL 91 037902 (2003)], namely that entanglement can be distributed by sending a separable state through a quantum channel. In this work, following an analogy between the entanglement and secret key distillation scenarios, we derive its classical analog: secrecy can be distributed by sending non-secret correlations through a private channel. This strengthens the close relation between entanglement and secrecy.

quant-ph↗

arXiv2008

Space-QUEST: Experiments with quantum entanglement in space

The European Space Agency (ESA) has supported a range of studies in the field of quantum physics and quantum information science in space for several years, and consequently we have submitted the mission proposal Space-QUEST (Quantum Entanglement for Space Experiments) to the European Life and Physical Sciences in Space Program. We propose to perform space-to-ground quantum communication tests from the International Space Station (ISS). We present the proposed experiments in space as well as the design of a space based quantum communication payload.

quant-ph↗

arXiv2008

Testing the Hilbert space dimension

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 describes 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.

quant-ph↗

arXiv2008

A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations

We are interested in the problem of characterizing the correlations that arise when performing local measurements on separate quantum systems. In a previous work [Phys. Rev. Lett. 98, 010401 (2007)], we introduced an infinite hierarchy of conditions necessarily satisfied by any set of quantum correlations. Each of these conditions could be tested using semidefinite programming. We present here new results concerning this hierarchy. We prove in particular that it is complete, in the sense that any set of correlations satisfying every condition in the hierarchy has a quantum representation in terms of commuting measurements. Although our tests are conceived to rule out non-quantum correlations, and can in principle certify that a set of correlations is quantum only in the asymptotic limit where all tests are satisfied, we show that in some cases it is possible to conclude that a given set of correlations is quantum after performing only a finite number of tests. We provide a criterion to detect when such a situation arises, and we explain how to reconstruct the quantum states and measurement operators reproducing the given correlations. Finally, we present several applications of our approach. We use it in particular to bound the quantum violation of various Bell inequalities.

quant-ph↗

arXiv2008

Bounding the set of quantum correlations

We introduce a hierarchy of conditions necessarily satisfied by any distribution P(ab) representing the probabilities for two separate observers to obtain outcomes a and b when making local measurements on a shared quantum state. Each condition in this hierarchy is formulated as a semidefinite program. 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.

quant-ph↗

arXiv2007

Monogamy and ground-state entanglement in highly connected systems

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.

quant-ph↗

arXiv2007

Noise robustness of the nonlocality of entangled quantum states

We study the nonlocal properties of states resulting from the mixture of an arbitrary entangled state rho 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 rho is maximally entangled and p at or below a certain bound. We then extend the model to arbitrary rho. 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.

quant-ph↗

arXiv2007

Device-independent security of quantum cryptography against collective attacks

We present the optimal collective attack on a Quantum Key Distribution (QKD) protocol in the "device-independent" security scenario, where no assumptions are made about the way the QKD 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.

quant-ph↗

arXiv2006

Entanglement Percolation in Quantum Networks

Quantum networks are composed of nodes which can send and receive quantum states by exchanging photons. Their goal is to facilitate quantum communication between any nodes, something which can be used to send secret messages in a secure way, and to communicate more efficiently than in classical networks. These goals can be achieved, for instance, via teleportation. Here we show that the design of efficient quantum communication protocols in quantum networks involves intriguing quantum phenomena, depending both on the way the nodes are displayed, and the entanglement between them. These phenomena can be employed to design protocols which overcome the exponential decrease of signals with the number of nodes. We relate the problem of establishing maximally entangled states between nodes to classical percolation in statistical mechanics, and demonstrate that quantum phase transitions can be used to optimize the operation of quantum networks.

quant-ph↗

arXiv2006

Genuine three-partite entangled states with a local hidden variable model

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 byproduct, we present symmetric extensions of two-qubit Werner states.

quant-ph↗

arXiv2006

Key distillation from quantum channels using two-way communication protocols

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 BB84 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.

quant-ph↗

arXiv2006

Efficient quantum key distribution secure against no-signalling eavesdroppers

By carrying out measurements on entangled states, two parties can generate a secret key which is secure not only against an eavesdropper bound by the laws of quantum mechanics, but also against a hypothetical "post-quantum" eavesdroppers limited by the no-signalling principle only. We introduce a family of quantum key distribution protocols of this type, which are more efficient than previous ones, both in terms of key rate and noise resistance. Interestingly, the best protocols involve large number of measurements. We show that in the absence of noise, these protocols can yield one secret bit per entanglement bit, implying that the key rates in the no-signalling post-quantum scenario are comparable to the key rates in usual quantum key distribution.

quant-ph↗

arXiv2006

Optimality of Gaussian Attacks in Continuous Variable Quantum Cryptography

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.

quant-ph↗