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.
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 chapter begins by introducing and motivating the classically correlated states and then shows how to quantify the quantum correlations using an entropic approach, arriving at a well-known measure called the quantum discord. In particular, the quantumness of correlations manifests itself when two microscopic systems interact with each other, and stands as one of the weirdest of all quantum features. The chapter focuses on the most general type of quantum correlations between spatially separated parties. Quantum correlations and discord are then operationally linked with the task of local broadcasting. Quantum correlations beyond entanglement can represent a resource for some operational tasks and allow achieving them with an efficiency that is unreachable by any classical means. The chapter concludes by providing some alternative perspectives on quantum correlations and how to measure them.
Discordant states appear in a large number of quantum phenomena and seem to be a good indicator of divergence from classicality. While there is evidence that they are essential for a quantum algorithm to have an advantage over a classical one, their precise role is unclear. We examine the role of discord in quantum algorithms using the paradigmatic framework of restricted distributed quantum gates and show that manipulating discordant states using local operations has an associated cost in terms of entanglement and communication resources. Changing discord reduces the total correlations and reversible operations on discordant states usually require nonlocal resources. Discord alone is, however, not enough to determine the need for entanglement. A more general type of similar quantities, which we call K discord, is introduced as a further constraint on the kinds of operations that can be performed without entanglement resources.
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.
Quantum entanglement is the most popular kind of quantum correlations. Its role in several tasks in quantum information theory like quantum cryptography, quantum dense coding and quantum teleportation is indisputable. The role of entanglement in quantum algorithms has also attracted enormous amount of attention in the literature. The research in this direction is motivated by the finding that a quantum computer can efficiently factorize arbitrary integer numbers. Since no classical algorithm is known today that can solve this problem efficiently, this example clearly demonstrates the superiority of a quantum computer compared to its classical counterpart. In this context, entanglement also plays a crucial role: if the quantum computer operates on a pure state without entanglement, then the computational process can be simulated efficiently on a classical computer. In this case entanglement is the key ingredient that makes the difference between a quantum and a classical computer.
However, the situation is more involved if the computational process is not perfect. In this case the quantum computer operates on a mixed state, and the role of entanglement is less obvious. A seminal result in this direction is a quantum algorithm known under the acronym DQC1. This algorithm operates on an almost maximally mixed state with vanishingly little entanglement. However, DQC1 can still perform tasks efficiently for which no efficient classical algorithm is known today. Thus, it is reasonable to assume that entanglement in general is not related to the efficiency of a quantum algorithm.
Triggered by this observation other kinds of quantum correlations have been studied. In this context a particular measure of quantum correlations known as quantum discord is referred to frequently in the literature. Quantum discord is a measure of quantum correlations beyond entanglement, i.e., a quantum state can have no entanglement, but nonvanishing quantum discord. Quantum discord is also regarded as the key resource in the DQC1 algorithm. Although this statement is still controversial, it was shown under very general assumptions that quantum discord is required if a quantum computer is to show an exponential speedup over any classical algorithm.
In this thesis we give a short introduction into the theory of entanglement and general quantum correlations, and further discuss our results. In particular, we show that two different kinds of entanglement measures can coincide. This result is used to build an algorithm for computing entanglement. We also consider the role of quantum correlations for the distribution of entanglement and for the quantum measurement process. We further discuss the behavior of quantum correlations under local noise, and their monogamy properties.
In the works leading to this thesis the aim was to give a clear operational interpretation of different aspects of non-classicality. Doing so, enables to see the different properties as different aspects of the same underlying question, namely whether there is a classical explanation of the measurements at hand. If one incorporates the additional assumptions in the setting (such as locality by the separation of the two parties in entanglement theory), the question of whether some system is classical, boils down to ask whether one can simulate everything one can possibly observe by classical variables governed by a stochastic process. This new perspective allows to characterise dynamic properties of non-classicality, and also to connect them to more static types of non-classicality such as entanglement. Indeed we unify entanglement, discord and coherence from one single perspective. We do this by restricting our setting such that the operations have a clear classical interpretation and hence incorporating natural restrictions of classical systems, if the initial state of the system is not entangled does not have discord or does not have coherence. If the initial state of the system is different, we see the magic of quantum mechanics happening again. For instance we show for one specific quantum algorithm, which is thought to be better than any classical algorithm for its task, that the precision of the algorithm scales with the coherence present at its start. In other words, it is these resources (coherence, discord and entanglement) that make the magic possible and with our perspective we can interpret the role of the different resources and analyse how they are linked to each other. This does not give an explanation of the magic of quantum mechanics, but it does make the mechanisms more transparent allowing for new explanations and there are some examples already in this thesis. Finally we also look at the dual of when states are non-classical, asking, and answering, in a specific setting, what makes measurements non-classical.
The relation between genuine multipartite entanglement in the pure state of a collection of N qubits and the nonclassical correlations in its two-qubit subsystems is studied. Quantum discord is used as the quantifier of nonclassical correlations in the subsystem while the generalized geometric measure [A. Sen(De) and U. Sen, Phys. Rev. A 81, 012308 (2010)] is used to quantify global entanglement in the N-qubit state. While no definite discernible dependence between the two can be found for randomly generated global states, for those with additional structure like weighted graph states we find that local discord is indicative of global multipartite entanglement. Global states that admit efficient classical descriptions like stabilizer states furnish an exception in which, despite multipartite entanglement, nonclassical correlation is absent in two-qubit subsystems. We discuss these results in the context of mixed state quantum computation where nonclassical correlation is considered a candidate resource that enables exponential speedup over classical computers.