arXiv subjects

Rafael Chaves

Publications and source records attributed to Rafael Chaves.

At least 91 records · Page 5Linked to original sources

arXiv2018

Experimental device-independent tests of quantum channels

Quantum tomography is currently the mainly employed method to assess the information of a system and therefore plays a fundamental role when trying to characterize the action of a particular channel. Nonetheless, quantum tomography requires the trust that the devices used in the laboratory perform state generation and measurements correctly. This work is based on the theoretical framework for the device-independent inference of quantum channels that was recently developed and experimentally implemented with superconducting qubits in [Dall'Arno, Buscemi, Vedral, arXiv:1805.01159] and [Dall'Arno, Brandsen, Buscemi, PRSA 473, 20160721 (2017)]. Here, we present a complete experimental test on a photonic setup of two device-independent quantum channels falsification and characterization protocols to analyze, validate, and enhance the results obtained by conventional quantum process tomography. This framework has fundamental implications in quantum information processing and may also lead to the development of new methods removing the assumptions typically taken for granted in all the previous protocols.

quant-ph↗

arXiv2018

Device independent certification of a quantum delayed choice experiment

Wave-particle duality has long been considered a fundamental signature of the non-classical behavior of quantum phenomena, specially in a delayed choice experiment (DCE), where the experimental setup revealing either the particle or wave nature of the system is decided after the system has entered the apparatus. However, as counter-intuitive as it might seem, usual DCEs do have a simple causal explanation. Here, we take a different route and under a natural assumption about the dimensionality of the system under test, we present an experimental proof of the non-classicality of a DCE based on the violation of a dimension witness inequality. Our conclusion is reached in a device-independent and loophole-free manner, that is, based solely on the observed data and without the need on any assumptions about the measurement apparatus.

quant-ph↗

arXiv2018

Computational tools for solving a marginal problem with applications in Bell non-locality and causal modeling

Marginal problems naturally arise in a variety of different fields: basically, the question is whether some marginal/partial information is compatible with a joint probability distribution. To this aim, the characterization of marginal sets via quantifier elimination and polyhedral projection algorithms is of primal importance. In this work, before considering specific problems, we review polyhedral projection algorithms with focus on applications in information theory, and, alongside known algorithms, we also present a newly developed geometric algorithm which walks along the face lattice of the polyhedron in the projection space. One important application of this is in the field of quantum non-locality, where marginal problems arise in the computation of Bell inequalities. We apply the discussed algorithms to discover many tight entropic Bell inequalities of the tripartite Bell scenario as well as more complex networks arising in the field of causal inference. Finally, we analyze the usefulness of these inequalities as nonlocality witnesses by searching for violating quantum states.

quant-ph↗

arXiv2018

Causal modeling the delayed choice experiment

Wave-particle duality has become one of the flagships of quantum mechanics. This counter-intuitive concept is highlighted in a delayed choice experiment, where the experimental setup that reveals either the particle or wave nature of a quantum system is decided after the system has entered the apparatus. Here we consider delayed choice experiments from the perspective of device-independent causal models and show their equivalence to a prepare-and-measure scenario. Within this framework, we consider Wheeler's original proposal and its variant using a quantum control and show that a simple classical causal model is capable of reproducing the quantum mechanical predictions. Nonetheless, among other results, we show that in a slight variant of Wheeler's Gedankenexperiment, a photon in an interferometer can indeed generate statistics incompatible with any non-retrocausal hidden variable model whose dimensionality is the same as that of the quantum system it is supposed to mimic. Our proposal tolerates arbitrary losses and inefficiencies making it specially suited to loophole-free experimental implementations.

quant-ph↗

arXiv2017

Probing the Non-Classicality of Temporal Correlations

Correlations between spacelike separated measurements on entangled quantum systems are stronger than any classical correlations and are at the heart of numerous quantum technologies. In practice, however, spacelike separation is often not guaranteed and we typically face situations where measurements have an underlying time order. Here we aim to provide a fair comparison of classical and quantum models of temporal correlations on a single particle, as well as timelike-separated correlations on multiple particles. We use a causal modeling approach to show, in theory and experiment, that quantum correlations outperform their classical counterpart when allowed equal, but limited communication resources. This provides a clearer picture of the role of quantum correlations in timelike separated scenarios, which play an important role in foundational and practical aspects of quantum information processing.

quant-ph↗

arXiv2017

Causal hierarchy of multipartite Bell nonlocality

As with entanglement, different forms of Bell nonlocality arise in the multipartite scenario. These can be defined in terms of relaxations of the causal assumptions in local hidden-variable theories. However, a characterisation of all the forms of multipartite nonlocality has until now been out of reach, mainly due to the complexity of generic multipartite causal models. Here, we employ the formalism of Bayesian networks to reveal connections among different causal structures that make a both practical and physically meaningful classification possible. Our framework holds for arbitrarily many parties. We apply it to study the tripartite scenario in detail, where we fully characterize all the nonlocality classes. Remarkably, we identify new highly nonlocal causal structures that cannot reproduce all quantum correlations. This shows, to our knowledge, the strongest form of quantum multipartite nonlocality known to date. Finally, as a by-product result, we derive a non-trivial Bell-type inequality with no quantum violation. Our findings constitute a significant step forward in the understanding of multipartite Bell nonlocality and open several venues for future research.

quant-ph↗

arXiv2017

Experimental bilocality violation without shared reference frames

Non-classical correlations arising in complex quantum networks are attracting growing interest, both from a fundamental perspective and for potential applications in information processing. In particular, in an entanglement swapping scenario a new kind of correlations arise, the so-called nonbilocal correlations that are incompatible with local realism augmented with the assumption that the sources of states used in the experiment are independent. In practice, however, bilocality tests impose strict constraints on the experimental setup and in particular to presence of shared reference frames between the parties. Here, we experimentally address this point showing that false positive nonbilocal quantum correlations can be observed even though the sources of states are independent. To overcome this problem, we propose and demonstrate a new scheme for the violation of bilocality that does not require shared reference frames and thus constitute an important building block for future investigations of quantum correlations in complex networks.

quant-ph↗

arXiv2017

Maximal violation of n-locality inequalities in a star-shaped quantum network

Bell's theorem was a cornerstone for our understanding of quantum theory, and the establishment of Bell non-locality played a crucial role in the development of quantum information. Recently, its extension to complex networks has been attracting a growing attention, but a deep characterization of quantum behaviour is still missing for this novel context. In this work we analyze quantum correlations arising in the bilocality scenario, that is a tripartite quantum network where the correlations between the parties are mediated by two independent sources of states. First, we prove that non-bilocal correlations witnessed through a Bell-state measurement in the central node of the network form a subset of those obtainable by means of a separable measurement. This leads us to derive the maximal violation of the bilocality inequality that can be achieved by arbitrary two-qubit quantum states and arbitrary projective separable measurements. We then analyze in details the relation between the violation of the bilocality inequality and the CHSH inequality. Finally, we show how our method can be extended to n-locality scenario consisting of n two-qubit quantum states distributed among n+1 nodes of a star-shaped network.

quant-ph↗

arXiv2017

Semidefinite tests for latent causal structures

Testing whether a probability distribution is compatible with a given Bayesian network is a fundamental task in the field of causal inference, where Bayesian networks model causal relations. Here we consider the class of causal structures where all correlations between observed quantities are solely due to the influence from latent variables. We show that each model of this type imposes a certain signature on the observable covariance matrix in terms of a particular decomposition into positive semidefinite components. This signature, and thus the underlying hypothetical latent structure, can be tested in a computationally efficient manner via semidefinite programming. This stands in stark contrast with the algebraic geometric tools required if the full observable probability distribution is taken into account. The semidefinite test is compared with tests based on entropic inequalities.

stat.ML↗

arXiv2016

Indistinguishability of causal relations from limited marginals

We investigate the possibility of distinguishing among different causal relations starting from a limited set of marginals. Our main tool is the notion of adhesivity, that is, the extension of probability or entropies defined only on subsets of variables, which provides additional independence constraints among them. Our results provide a criterion for recognizing which causal structures are indistinguishable when only limited marginal information is accessible. Furthermore, the existence of such extensions greatly simplifies the characterization of a marginal scenario, a result that facilitates the derivation of Bell inequalities both in the probabilistic and entropic frameworks, and the identification of marginal scenarios where classical, quantum, and postquantum probabilities coincide.

quant-ph↗

arXiv2016

Experimental non-locality in a quantum network

Non-locality stands nowadays not only as one of the cornerstones of quantum theory, but also plays a crucial role in quantum information processing. Several experimental investigations of nonlocality have been carried out over the years. In spite of their fundamental relevance, however, all previous experiments do not consider a crucial ingredient that is ubiquitous in quantum networks: the fact that correlations between distant parties are mediated by several, typically independent, sources of quantum states. Here, using a photonic setup we investigate a quantum network consisting of three spatially separated nodes whose correlations are mediated by two independent sources. This scenario allows for the emergence of a new kind of non-local correlations that we experimentally witness by violating a novel Bell inequality. Our results provide the first experimental proof-of-principle of generalizations of Bell's theorem for networks, a topic that has attracted growing attention and promises a novel route for quantum communication protocols.

quant-ph↗

arXiv2016

Bell scenarios with communication

Classical and quantum physics provide fundamentally different predictions about experiments with separate observers that do not communicate, a phenomenon known as quantum nonlocality. This insight is a key element of our present understanding of quantum physics, and also enables a number of information processing protocols with security beyond what is classically attainable. Relaxing the pivotal assumption of no communication leads to new insights into the nature quantum correlations, and may enable new applications where security can be established under less strict assumptions. Here, we study such relaxations where different forms of communication are allowed. We consider communication of inputs, outputs, and of a message between the parties. Using several measures, we study how much communication is required for classical models to reproduce quantum or general no-signalling correlations, as well as how quantum models can be augmented with classical communication to reproduce no-signalling correlations.

quant-ph↗

arXiv2016

Entropic nonsignaling correlations

We introduce the concept of entropic nonsignaling correlations, i.e., entropies arising from probabilistic theories that are compatible with the fact that we cannot transmit information instantaneously. We characterize and show the relevance of these entropic correlations in a variety of different scenarios, ranging from typical Bell experiments to more refined descriptions such as bilocality and information causality. In particular, we apply the framework to derive the first entropic inequality testing genuine tripartite nonlocality in quantum systems of arbitrary dimension and also prove the first known monogamy relation for entropic Bell inequalities. Further, within the context of complex Bell networks, we show that entropic nonlocal correlations can be activated.

quant-ph↗

arXiv2015

Algorithmic independence of initial condition and dynamical law in thermodynamics and causal inference

We postulate a principle stating that the initial condition of a physical system is typically algorithmically independent of the dynamical law. We argue that this links thermodynamics and causal inference. On the one hand, it entails behaviour that is similar to the usual arrow of time. On the other hand, it motivates a statistical asymmetry between cause and effect that has recently postulated in the field of causal inference, namely, that the probability distribution P(cause) contains no information about the conditional distribution P(effect|cause) and vice versa, while P(effect) may contain information about P(cause|effect).

cond-mat.stat-mech↗

arXiv2015

Polynomial Bell inequalities

It is a recent realization that many of the concepts and tools of causal discovery in machine learning are highly relevant to problems in quantum information, in particular quantum nonlocality. The crucial ingredient in the connection between both fields is the tool of Bayesian networks, a graphical model used to reason about probabilistic causation. Indeed, Bell's theorem concerns a particular kind of a Bayesian network and Bell inequalities are a special case of linear constraints following from such models. It is thus natural to look for generalized Bell scenarios involving more complex Bayesian networks. The problem, however, relies on the fact that such generalized scenarios are characterized by polynomial Bell inequalities and no current method is available to derive them beyond very simple cases. In this work, we make a significant step in that direction, providing a general and practical method for the derivation of polynomial Bell inequalities in a wide class of scenarios, applying it to a few cases of interest. We also show how our construction naturally gives rise to a notion of non-signalling in generalized networks.

quant-ph↗

arXiv2015

Device-Independent Tests of Entropy

We show that the entropy of a message can be tested in a device-independent way. Specifically, we consider a prepare-and-measure scenario with classical or quantum communication, and develop two different methods for placing lower bounds on the communication entropy, given observable data. The first method is based on the framework of causal inference networks. The second technique, based on convex optimization, shows that quantum communication provides an advantage over classical, in the sense of requiring a lower entropy to reproduce given data. These ideas may serve as a basis for novel applications in device-independent quantum information processing.

quant-ph↗

arXiv2014

A unifying framework for relaxations of the causal assumptions in Bell's theorem

Bell's Theorem shows that quantum mechanical correlations can violate the constraints that the causal structure of certain experiments impose on any classical explanation. It is thus natural to ask to which degree the causal assumptions -- e.g. locality or measurement independence -- have to be relaxed in order to allow for a classical description of such experiments. Here, we develop a conceptual and computational framework for treating this problem. We employ the language of Bayesian networks to systematically construct alternative causal structures and bound the degree of relaxation using quantitative measures that originate from the mathematical theory of causality. The main technical insight is that the resulting problems can often be expressed as computationally tractable linear programs. We demonstrate the versatility of the framework by applying it to a variety of scenarios, ranging from relaxations of the measurement independence, locality and bilocality assumptions, to a novel causal interpretation of CHSH inequality violations.

quant-ph↗

arXiv2014

Information-Theoretic Implications of Quantum Causal Structures

The correlations that can be observed between a set of variables depend on the causal structure underpinning them. Causal structures can be modeled using directed acyclic graphs, where nodes represent variables and edges denote functional dependencies. In this work, we describe a general algorithm for computing information-theoretic constraints on the correlations that can arise from a given interaction pattern, where we allow for classical as well as quantum variables. We apply the general technique to two relevant cases: First, we show that the principle of information causality appears naturally in our framework and go on to generalize and strengthen it. Second, we derive bounds on the correlations that can occur in a networked architecture, where a set of few-body quantum systems is distributed among a larger number of parties.

quant-ph↗