Determination of the quantum nature of correlations between two spatially separated systems plays a crucial role in quantum information science. Of particular interest is the questions of if and how these correlations enable quantum information protocols to be more powerful. Here, we report on a distributed quantum computation protocol in which the input and output quantum states are considered to be classically correlated in quantum informatics. Nevertheless, we show that the correlations between the outcomes of the measurements on the output state cannot be efficiently simulated using classical algorithms. Crucially, at the same time, local measurement outcomes can be efficiently simulated on classical computers. We show that the only known classicality criterion violated by the input and output states in our protocol is the one used in quantum optics, namely, phase-space nonclassicality. As a result, we argue that the global phase-space nonclassicality inherent within the output state of our protocol represents true quantum correlations.
Determination of the quantum nature of correlations between two spatially separated systems plays a crucial role in quantum information science. Of particular interest is the questions of if and how these correlations enable quantum information protocols to be more powerful. Here, we report on a distributed quantum computation protocol in which the input and output quantum states are considered to be classically correlated in quantum informatics. Nevertheless, we show that the correlations between the outcomes of the measurements on the output state cannot be efficiently simulated using classical algorithms. Crucially, at the same time, local measurement outcomes can be efficiently simulated on classical computers. We show that the only known classicality criterion violated by the input and output states in our protocol is the one used in quantum optics, namely, phase-space nonclassicality. As a result, we argue that the global phase-space nonclassicality inherent within the output state of our protocol represents true quantum correlations.
Deviations from classical physics when distant quantum systems become correlated are interesting both fundamentally and operationally. There exist situations where the correlations enable collaborative tasks that are impossible within the classical formalism. Here, we consider the efficiency of quantum computation protocols compared to classical ones as a benchmark for separating quantum and classical resources and argue that the computational advantage of collaborative quantum protocols in the discrete variable domain implies the nonclassicality of correlations. By analyzing a toy model, it turns out that this argument implies the existence of quantum correlations distinct from entanglement and discord. We characterize such quantum correlations in terms of the net global coherence resources inherent within quantum states and show that entanglement and discord can be understood as special cases of our general framework. Finally, we provide an operational interpretation of such correlations as those allowing two distant parties to increase their respective local quantum computational resources only using locally incoherent operations and classical communication.
This thesis presents results under the topics of quantum correlations and quantum information processing using linear-optical networks. The first part of this thesis concerns with quantum correlations, specially in Gaussian states, which play a central role as resource in quantum protocols. The second part is about quantum information processing using linear-optical networks that are of great practical interest due to their simple physical realization. In the first part, we present a measurement-based method for verifying nonzero quantum discord, a measure of quantum correlations, in bipartite systems that can be used for both continuous and discrete-variable systems. Based on this method, we show that the only bipartite Gaussian states with zero quantum discord are product states. We also present a simple and efficient experimental method for verifying quantum correlations in Gaussian states using homodyne measurements. Moreover, we introduce an operational measure for quantifying quantum correlations in Gaussian states that is purely based on Gaussian measurements. We then illustrate the operational significance of the measure in terms of a Gaussian quantum protocol. In the second part, we present results on linear quantum-optics experiments, specifically boson sampling, an intermediate model of quantum computation that can be implemented using single-photon states, linear-optical networks, and photodetectors. We first present an efficient experimental method for characterization of linear-optical networks, which is essential for practical implementation of boson sampling. We show that using coherent states one can directly measure all the nontrivial phases and moduli of the matrix describing the network. Next, we consider the problem of boson sampling with Gaussian states. We derive a general formula for calculating the output photon-counting probabilities. We show that for input thermal states, sampling from the output probability distribution can be efficiently classically simulated. Using this, we find that permanents of positive-semidefinite Hermitian matrices can be approximated to within a multiplicative error in BPPNP. We also discuss boson sampling with squeezed vacuum states. Finally, we provide a sufficient condition for the efficient classical simulation of the general sampling problem using linear-quantum optics, which involves a multimode input quantum state to a linear-optical network and set of measurements at the output. This condition is based on the phase-space quasiprobability distributions, and suggests that negativity is a quantum resource. We apply this condition to implementations of boson sampling using single-photon or spontaneous parametric down-conversion sources. We show that above some threshold for loss and noise in the experiment, boson sampling is classically simulatable.
We provide general sufficient conditions for the efficient classical simulation of quantum-optics experiments that involve inputting states to a quantum process and making measurements at the output.The first condition is based on the negativity of phase-space quasiprobability distributions (PQDs) of the output state of the process and the output measurements; the second one is based on the negativity of PQDs of the input states, the output measurements, and the transition function associated with the process.We show that these conditions provide useful practical tools for investigating the effects of imperfections in implementations of boson sampling.In particular, we apply our formalism to boson-sampling experiments that use single-photon or spontaneous-parametric-down-conversion sources and on-off photodetectors.Considering simple models for loss and noise, we show that above some threshold for the probability of random counts in the photodetectors, these boson-sampling experiments are classically simulatable.We identify mode mismatching as the major source of error contributing to random counts and suggest that this is the chief challenge for implementations of boson sampling of interesting size.
It is one of the most remarkable features of quantum physics that measurements on spatially separated systems cannot always be described by a locally causal theory. In such a theory, the outcomes of local measurements are determined in advance solely by some unknown (or hidden) variables and the choice of local measurements. Correlations that are allowed within the framework of a locally causal theory are termed classical. Typically, the fact that quantum mechanics does not always result in classical correlations is revealed by the violation of Bell inequalities, which are constraints that have to be satisfied by any classical correlations. It has been known for a long time that entanglement is necessary to demonstrate nonclassical correlations, and hence a Bell inequality violation. However, since some entangled quantum states are known to admit explicit locally causal models, the exact role of entanglement in Bell inequality violation has remained obscure. This thesis provides both a comprehensive review on these issues as well as a report on new discoveries made to clarify the relationship between entanglement and Bell inequality violation. In particular, within the framework of a standard Bell experiment, i.e., a Bell inequality test that is directly performed on a single copy of a quantum state r, we have derived two algorithms to determine, respectively, a lower bound and an upper bound on the strength of correlations that r can offer for any given Bell inequality. Both of these algorithms make use convex optimization techniques in the form of a semidefinite program. By examples, we show that these algorithms can often be used in tandem, in conjunction with convexity arguments, to determine if a quantum state can offer nonclassical correlations and hence violates a given Bell inequality. On the other hand, since a standard Bell experiment typically involves measurements over many copies of the quantum systems, we have also investigated the possibility of enhancing the strength of nonclassical correlation by, instead, performing collective measurements on multiple copies of the quantum systems. Our findings show that even without postselection, such joint measurements may also lead to stronger nonclassical correlations, and hence a better Bell inequality violation. Meanwhile, previous studies have indicated that entangled state admitting locally causal models may still lead to observable nonclassical correlations if, prior to a standard Bell experiment, the state is subjected to some appropriate local preprocessing. This phenomenon of hidden nonlocality was discovered more than a decade ago, but to date, it is still not known if all entangled states can demonstrate nonclassical correlations through these more sophisticated Bell experiments. A key result in this thesis then consists of showing that for all bipartite entangled states, observable nonclassical correlations, in the form of a Bell-CHSH inequality violation, can indeed be derived if we allow both local preprocessing and the usage of shared ancillary state which by itself does not violate the Bell-CHSH inequality. This establishes a kind of equivalence between bipartite entanglement and states that cannot be simulated by classical correlations. In summary, for a standard Bell experiment where no local preprocessing on a quantum state r is allowed, we have provided two algorithms that can be used in tandem to determine if r can be simulated by a locally causal theory, whereas in the scenario where local preprocessing is allowed, we have demonstrated that bipartite entangled states are precisely those which cannot always be simulated classically.
We provide general sufficient conditions for the efficient classical simulation of quantum-optics experiments that involve inputting states to a quantum process and making measurements at the output. The first condition is based on the negativity of phase-space quasiprobability distributions (PQDs) of the output state of the process and the output measurements; the second one is based on the negativity of PQDs of the input states, the output measurements, and the transition function associated with the process. We show that these conditions provide useful practical tools for investigating the effects of imperfections in implementations of boson sampling. In particular, we apply our formalism to boson-sampling experiments that use single-photon or spontaneous-parametric-down-conversion sources and on-off photodetectors. Considering simple models for loss and noise, we show that above some threshold for the probability of random counts in the photodetectors, these boson-sampling experiments are classically simulatable. We identify mode mismatching as the major source of error contributing to random counts and suggest that this is the chief challenge for implementations of boson sampling of interesting size.
Measurement-based quantum computation (or the one-way quantum computation) is a model in which a series of adaptive single qubit measurements upon an entangled resource state can produce classical output data equivalent to an arbitrary quantum logic circuit. Loosely speaking, the correlations in these measurements can be considered the resource which allows the computation to be performed. Bell inequalities demonstrate that quantum mechanics permits the outcomes of sets of measurements to be correlated in ways incompatible with the predictions of any local hidden variable theory, including classical physics. In the Bell inequality, and multi-party generalisations, a set of single-qubit measurements are performed, on spatially separated systems. Correlations in these measurements can act as a signature that no local hidden variable description of the experiment is possible. At first sight, we see superficial similarities between these settings. In both cases, non-classical correlations play a central role. However, there are also some key differences. Most importantly, measurement-based quantum computing requires adaptive measurements, at odds with the spatial-separated nature of Bell inequality experiments. Nevertheless some striking connections have been reported [1], [2] particularly between GHZ-type paradoxes and deterministic MBQC computations, and between CHSH-type Bell inequalities and non-deterministic MBQC correlations [1], [3]. In my talk I will survey these works and some recent results [3], [4] from my group at UCL, in which a number of connections between multi-party Bell inequalities and MBQC are explored. [1] J. Anders and D.E. Browne, "The Computational Power of Correlations", Physical Review Letters 102, 050502 (2009) [2] R. Raussendorf, "Quantum computation, discreteness, and contextuality", arxiv:0907.5449 [3] M. J. Hoban, E.T. Campbell, K. Loukopolous, D.E. Browne, "Non-adaptive measurement-based quantum computation and multi-party Bell inequalties", in preparation. [4] M. J. Hoban and D.E. Browne, in preparation.