Searcharxiv⌕ Search

arXiv subjects

Leandro Aolita

Publications and source records attributed to Leandro Aolita.

65 records · Page 4Linked to original sources
arXiv2012

Complete experimental toolbox for alignment-free quantum communication

Quantum communication employs the counter-intuitive features of quantum physics to perform tasks that are im- possible in the classical world. It is crucial for testing the foundations of quantum theory and promises to rev- olutionize our information and communication technolo- gies. However, for two or more parties to execute even the simplest quantum transmission, they must establish, and maintain, a shared reference frame. This introduces a considerable overhead in communication resources, par- ticularly if the parties are in motion or rotating relative to each other. We experimentally demonstrate how to circumvent this problem with the efficient transmission of quantum information encoded in rotationally invariant states of single photons. By developing a complete toolbox for the efficient encoding and decoding of quantum infor- mation in such photonic qubits, we demonstrate the fea- sibility of alignment-free quantum key-distribution, and perform a proof-of-principle alignment-free entanglement distribution and violation of a Bell inequality. Our scheme should find applications in fundamental tests of quantum mechanics and satellite-based quantum communication.

quant-ph↗
arXiv2012

Fully nonlocal quantum correlations

Quantum mechanics is a nonlocal theory, but not as nonlocal as the no-signalling principle allows. However, there exist quantum correlations that exhibit maximal nonlocality: they are as nonlocal as any non-signalling correlations and thus have a local content, quantified by the fraction $p_L$ of events admitting a local description, equal to zero. Exploiting the link between the Kochen-Specker and Bell's theorems, we derive, from every Kochen-Specker proof, Bell inequalities maximally violated by quantum correlations. We then show that these Bell inequalities lead to experimental bounds on the local content of quantum correlations which are significantly better than those based on other constructions. We perform the experimental demonstration of a Bell test originating from the Peres-Mermin Kochen-Specker proof, providing an upper bound on the local content $p_L\lesssim 0.22$.

quant-ph↗
arXiv2012

Fully nonlocal, monogamous, and random genuinely multipartite quantum correlations

Local measurements on bipartite maximally entangled states can yield correlations that are maximally nonlocal, monogamous, and associated to fully random outcomes. This makes these states ideal for bipartite cryptographic tasks. Genuine-multipartite nonlocality constitutes a stronger notion of nonlocality that appears in the multipartite case. Maximal genuine-multipartite nonlocality, monogamy and full random outcomes are thus highly desired properties for multipartite correlations in intrinsically genuine-multipartite cryptographic scenarios. We prove that local measurements on Greenberger-Horne-Zeilinger states, for all local dimension and number of parts, can produce correlations that are fully genuine-multipartite nonlocal, monogamous and with fully random outcomes. A key ingredient in our proof is a multipartite chained Bell inequality detecting genuine-multipartite nonlocality, which we introduce. Finally, we discuss the applications of our results for intrinsically genuine-multipartite cryptographic protocols such as device-independent secret sharing.

quant-ph↗
arXiv2011

Sequential measurement-based quantum computing with memories

We introduce a general scheme for sequential one-way quantum computation where static systems with long-living quantum coherence (memories) interact with moving systems that may possess very short coherence times. Both the generation of the cluster state needed for the computation and its consumption by measurements are carried out simultaneously. As a consequence, effective clusters of one spatial dimension fewer than in the standard approach are sufficient for computation. In particular, universal computation requires only a one-dimensional array of memories. The scheme applies to discrete-variable systems of any dimension as well as to continuous-variable ones, and both are treated equivalently under the light of local complementation of graphs. In this way our formalism introduces a general framework that encompasses and generalizes in a unified manner some previous system-dependent proposals. The procedure is intrinsically well-suited for implementations with atom-photon interfaces.

quant-ph↗
arXiv2011

Photonic Multiqubit States from a Single Atom

We propose a protocol for the creation of photonic Greenberger-Horne-Zeilinger and linear cluster states emitted from a single atom---or ion---coupled to an optical cavity field. The method is based on laser pulses with different polarizations and exploits the atomic transition amplitudes to state-selectively achieve the desired transitions. The scheme lies within reach of current technology.

quant-ph↗
arXiv2011

Gapped Two-Body Hamiltonian for continuous-variable quantum computation

We introduce a family of Hamiltonian systems for measurement-based quantum computation with continuous variables. The Hamiltonians (i) are quadratic, and therefore two body, (ii) are of short range, (iii) are frustration-free, and (iv) possess a constant energy gap proportional to the squared inverse of the squeezing. Their ground states are the celebrated Gaussian graph states, which are universal resources for quantum computation in the limit of infinite squeezing. These Hamiltonians constitute the basic ingredient for the adiabatic preparation of graph states and thus open new venues for the physical realization of continuous-variable quantum computing beyond the standard optical approaches. We characterize the correlations in these systems at thermal equilibrium. In particular, we prove that the correlations across any multipartition are contained exactly in its boundary, automatically yielding a correlation area law.

quant-ph↗
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

Scalability of GHZ and random-state entanglement in the presence of decoherence

We derive analytical upper bounds for the entanglement of generalized Greenberger-Horne-Zeilinger states coupled to locally depolarizing and dephasing environments, and for local thermal baths of arbitrary temperature. These bounds apply for any convex quantifier of entanglement, and exponential entanglement decay with the number of constituent particles is found. The bounds are tight for depolarizing and dephasing channels. We also show that randomly generated initial states tend to violate these bounds, and that this discrepancy grows with the number of particles.

quant-ph↗
arXiv2007

Measuring Multipartite Concurrence with a Single Factorizable Observable

We show that, for any composite system with an arbitrary number of finite-dimensional subsystems, it is possible to directly measure the multipartite concurrence of pure states by detecting only one single factorizable observable, provided that two copies of the composite state are available. This result can be immediately put into practice in trapped-ion and entangled-photon experiments.

quant-ph↗
arXiv2007

Universal quantum computation in decoherence-free subspaces with hot trapped-ions

We consider interactions that generate a universal set of quantum gates on logical qubits encoded in a collective-dephasing-free subspace, and discuss their implementations with trapped ions. This allows for the removal of the by-far largest source of decoherence in current trapped-ion experiments, collective dephasing. In addition, an explicit parametrization of all two-body Hamiltonians able to generate such gates without the system's state ever exiting the protected subspace is provided.

quant-ph↗