We give an operational definition of the quantum, classical and total amount of correlations in a bipartite quantum state. We argue that these quantities can be defined via the amount of work (noise) that is required to erase (destroy) the correlations: for the total correlation, we have to erase completely, for the quantum correlation one has to erase until a separable state is obtained, and the classical correlation is the maximal correlation left after erasing the quantum correlations.
In particular, we show that the total amount of correlations is equal to the quantum mutual information, thus providing it with a direct operational interpretation for the first time. As a byproduct, we obtain a direct, operational and elementary proof of strong subadditivity of quantum entropy.
In quantum teleportation, the role of entanglement has been much discussed. It is known that entanglement is necessary for achieving non-classical teleportation fidelity. Here we focus on the amount of classical communication that is necessary to obtain non-classical fidelity in teleportation. We quantify the amount of classical communication that is sufficient for achieving non-classical fidelity for two independent 1-bit and single 2-bits noisy classical channels. It is shown that on average 0.208 bits of classical communication is sufficient to get non-classical fidelity. We also find the n…
We discuss the problem of separating consistently the total correlations in a bipartite quantum state into a quantum and a purely classical part. A measure of classical correlations is proposed and its properties are explored.
We initiate the study of quantifying nonlocalness of a bipartite measurement by the minimum amount of classical communication required to simulate the measurement. We derive general upper bounds, which are expressed in terms of certain tensor norms of the measurement operator. As applications, we show that (a) If the amount of communication is constant, quantum and classical communication protocols with unlimited amount of shared entanglement or shared randomness compute the same set of functions; (b) A local hidden variable model needs only a constant amount of communication to create, within…
We quantify the total, quantum, and classical correlations with entropic measures, and quantitatively compare these correlations in a quantum system, as exemplified by a Heisenberg dimer which is subjected to the change of environmental parameters: temperature and nonuniform external field. Our results show that the quantum correlation may exceed the classical correlation at some nonzero temperatures, though the former is rather fragile than the later under thermal fluctuation. The effect of the external field to the classical correlation is quite different from the quantum correlation.
The amount of information transmissible through a communications channel is determined by the noise characteristics of the channel and by the quantities of available transmission resources. In classical information theory, the amount of transmissible information can be increased twice at most when the transmission resource (e.g. the code length, the bandwidth, the signal power) is doubled for fixed noise characteristics. In quantum information theory, however, the amount of information transmitted can increase even more than twice. We present a proof-of-principle demonstration of this super-ad…
We study the activation of entanglement in teleportation protocols. To this end, we a present derivation of the average fidelity of teleportation process with noisy classical channel for qudits. In our work we do not make any assumptions about the entangled states shared by communicating parties. Our result allows us to specify the minimum amount of classical information required to beat the classical limit when the protocol is based on the Bell measurements. We also compare average fidelity of teleportation obtained using noisy and perfect classical channel with restricted capacity. The most …
Consider a source E of pure quantum states with von Neumann entropy S. By the quantum source coding theorem, arbitrarily long strings of signals may be encoded asymptotically into S qubits/signal (the Schumacher limit) in such a way that entire strings may be recovered with arbitrarily high fidelity. Suppose that classical storage is free while quantum storage is expensive and suppose that the states of E do not fall into two or more orthogonal subspaces. We show that if E can be compressed with arbitrarily high fidelity into A qubits/signal plus any amount of auxiliary classical storage then …
We analyze a quantum measurement where the apparatus is initially in a mixed state. We show that the amount of information gained in a measurement is not equal to the amount of entanglement between the system and the apparatus, but is instead equal to the degree of classical correlations between the two. As a consequence, we derive an uncertainty-like expression relating the information gain in the measurement and the initial mixedness of the apparatus. Final entanglement between the environment and the apparatus is also shown to be relevant for the efficiency of the measurement.
We will discuss the generalization of entropic uncertainty principles in terms of a game. The game involves k-players, each measuring one of k possible observables. The question is, what is the maximum number of players that can play such that their joint entropic uncertainties are tightened by the presence of non-classical correlations? We answer this question and relate it to the ratio of quantum mutual information to classical correlations. This game hence serves to construct an operational interpretation of the aforementioned ratio. It provides another example of quantum correlations provi…
We introduce a new aspect of nonlocality which arises when the task of quantum states distinguishability is considered under local operations and shared entanglement in the absence of classical communication. We find the optimal amount of entanglement required to accomplish the task perfectly for sets of orthogonal states and argue that it quantifies information nonlocality.
We consider situations in which i) Alice wishes to send quantum information to Bob via a noisy quantum channel, ii) Alice has a classical description of the states she wishes to send and iii) Alice can make use of a finite amount of noiseless classical information. After setting up the problem in general, we focus attention on one specific scenario in which Alice sends a known qubit down a depolarizing channel along with a noiseless cbit. We describe a protocol which we conjecture is optimal and calculate the average fidelity obtained. A surprising amount of structure is revealed even for this…
The Dirac equation provides a description of spin 1/2 particles, consistent with both the principles of quantum mechanics and of special relativity. Often its presentation to students is based on mathematical propositions that may hide the physical meaning of its contents. Here we show that Dirac spinors provide the quantum description of two unit classical vectors: one whose components are the speed of an elementary particle and the rate of change of its proper time and a second vector which fixes the velocity direction. In this context both the spin degree of freedom and antiparticles can be…
We discuss the problem of separating the total correlations in a given quantum joint probability distribution into nonlocality, contextuality and classical correlations. Bell discord and Mermin discord which qunatify nonlocality and contextuality of quantum correlations are interpreted as distance measures in the nonsignaling polytope. A measure of total correlations is introduced to divide the total amount of correlations into a purely nonclassical part and a classical part. We show that quantum correlations satisfy additivity relations among these three measures.
We present a local hidden-variable model supplemented by classical communication that reproduces the quantum-mechanical predictions for measurements of all products of Pauli operators on an n-qubit GHZ state (or "cat state"). The simulation is efficient since the required amount of communication scales linearly with the number of qubits, even though there are Bell-type inequalities for these states for which the amount of violation grows exponentially with n. The structure of our model yields insight into the Gottesman-Knill theorem by demonstrating that, at least in this limited case, the cor…
In quantum teleportation, neither Alice nor Bob acquires any classical knowledge on teleported states. The teleportation protocol is said to be oblivious to both parties. In remote state preparation (RSP) it is assumed that Alice is given complete classical knowledge on the state that is to be prepared by Bob. Recently, Leung and Shor showed that the same amount of classical information as that in teleportation needs to be transmitted in any exact and deterministic RSP protocol that is oblivious to Bob. We study similar RSP protocols, but not necessarily oblivious to Bob. First it is shown tha…
In this paper, we study quantum dense coding between two arbitrarily fixed particles in a (N+2)-particle maximally-entangled states through introducing an auxiliary qubit and carrying out local measurements. It is shown that the transmitted classical information amount through such an entangled quantum channel usually is less than two classical bits. However, the information amount may reach two classical bits of information, and the classical information capacity is independent of the number of the entangled particles in the initial entangled state under certain conditions. The results offer …
We study the amount of classical communication needed for distributed quantum information processing. In particular, we introduce the concept of "remote preparation" of a quantum state. Given an ensemble of states, Alice's task is to help Bob in a distant laboratory to prepare a state of her choice. We find several examples of an ensemble with an entropy S where the remote preparation can be done with a communication cost lower than the amount (2S) required by standard teleportation. We conjecture that, for an arbitrary N-dimensional pure state, its remote preparation requires 2log_2 N bits of…
Quantum processes cannot be reduced, in a nontrivial way, to classical processes without specifying the context in the description of a measurement procedure. This requirement is implied by the Kochen-Specker theorem in the outcome-deterministic case and, more generally, by the Gleason theorem. The latter establishes that there is only one non-contextual classical model compatible with quantum theory, the one that trivially identifies the quantum state with the classical state. However, this model requires a breaking of the unitary evolution to account for macroscopic realism. Thus, a causal c…
Quantum communication and Bell nonlocality require infinite classical communication to simulate
CPHT, LIX, CNRS, Inria, École polytechnique, Institut Polytechnique de Paris（巴黎高等师范学院、巴黎综合理工学院）；Instituto de Matemática, Estatística e Computação Científica, Universidade Estadual de Campinas（坎皮纳斯州立大学）；Sorbonne Université, CNRS, LIP6（索邦大学）
Total Ordering of Resources: A Quantum-Classical Separation
Institute of Fundamental Technological Research, Polish Academy of Sciences（波兰科学院基础技术研究所在）；Departamento de Matemáticas, Universidad Carlos III de Madrid（马德里卡洛斯三世大学数学系）；Instituto de Ciencias Matemáticas (ICMAT)（马德里高等数学研究所）
Entanglement shared between the two ends of a quantum communication channel has been shown to be a useful resource in increasing both the quantum and classical capacities for these channels. The entanglement-assisted capacities were derived assuming an unlimited amount of shared entanglement per channel use. In this paper, bounds are derived on the minimum amount of entanglement required per use of a channel, in order to asymptotically achieve the capacity. This is achieved by introducing a class of entanglement-assisted quantum codes. Codes for classes of qubit channels are shown to achieve t…
We show that a qubit can be used to substitute for an arbitrarily large number of classical bits. We consider a physical system S interacting locally with a classical field phi(x) as it travels directly from point A to point B. The field has the property that its integrated value is an integer multiple of some constant. The problem is to determine whether the integer is odd or even. This task can be performed perfectly if S is a qubit. On the otherhand, if S is a classical system then we show that it must carry an arbitrarily large amount of classical information. We identify the physical reas…
A fundamental objective in quantum information science is to determine the cost in classical resources of simulating a particular quantum system. The classical simulation cost is quantified by the signaling dimension which specifies the minimum amount of classical communication needed to perfectly simulate a channel's input-output correlations when unlimited shared randomness is held between encoder and decoder. This paper provides a collection of device-independent tests that place lower and upper bounds on the signaling dimension of a channel. Among them, a single family of tests is shown to…
It's the key research topic of signal processing that recognizing genuine targets real time from the disturbed signal which has giant amount of data. A quantum algorithm for pattern recognition of classical signal which has time complexity O(sqrt(N)) is presented in this paper. Key Words: Pattern recognition, Grover's algorithm, Rotation on subspace
A notion of asymmetric quantum dialogue (AQD) is introduced. Conventional protocols of quantum dialogue are essentially symmetric as both the users (Alice and Bob) can encode the same amount of classical information. In contrast, the scheme for AQD introduced here provides different amount of communication powers to Alice and Bob. The proposed scheme, offers an architecture, where the entangled state and the encoding scheme to be shared between Alice and Bob depends on the amount of classical information they want to exchange with each other. The general structure for the AQD scheme has been o…
We give an exponential separation between one-way quantum and classical communication complexity for a Boolean function. Earlier such a separation was known only for a relation. A very similar result was obtained earlier but independently by Kerenidis and Raz [KR06]. Our version of the result gives an example in the bounded storage model of cryptography, where the key is secure if the adversary has a certain amount of classical storage, but is completely insecure if he has a similar amount of quantum storage.
We calculate the entanglement-assisted classical capacity of symmetric and asymmetric Pauli channels where two consecutive uses of the channels are correlated. It is evident from our study that in the presence of memory, a higher amount of classical information is transmitted over quantum channels if there exists prior entanglement as compared to product and entangled state coding.
We study the influence of errors and decoherence on both the performance of Shor's factoring algorithm and Grover's search algorithm, and on the amount of interference in these algorithms using a recently proposed interference measure. We consider systematic unitary errors, random unitary errors, and decoherence processes. We show that unitary errors which destroy the interference destroy the efficiency of the algorithm, too. However, unitary errors may also create useless additional interference. In such a case the total amount of interference can increase, while the efficiency of the quantum…
In this paper we give a definition for quantum Kolmogorov complexity. In the classical setting, the Kolmogorov complexity of a string is the length of the shortest program that can produce this string as its output. It is a measure of the amount of innate randomness (or information) contained in the string. We define the quantum Kolmogorov complexity of a qubit string as the length of the shortest quantum input to a universal quantum Turing machine that produces the initial qubit string with high fidelity. The definition of Vitanyi (Proceedings of the 15th IEEE Annual Conference on Computation…
We investigate the nonclassicality of photon-added coherent states in the photon loss channel by exploring the entanglement potential and negative Wigner distribution. The total negative probability defined by the absolute value of the integral of the Wigner function over the negative distribution region reduces with the increase of decay time. The total negative probability and the entanglement potential of pure photon-added coherent states exhibit the similar dependence on the beam intensity. The reduce of the total negative probability is consistent with the behavior of entanglement potenti…
A theoretical model of a quantum device which can factorize any number N in two steps i.e. by preparing an input state and performing a measurement is discussed. The analysis reveals that the duration of state preparation and measurement is proportional to N while the energy consumption grows like log N. These results suggest the existence of Heisenberg-type relation putting limits on the efficiency of a quantum computer in terms of a total computation time, a total energy consumption and a classical complexity of the problem.
We investigate whether certain non-classical communication channels can be simulated by a classical channel with a given number of states and a given `amount' of noise. It is proved that any noisy quantum channel can be simulated by a corresponding classical channel with `the same amount' of noise. Classical simulations of general probabilistic channels are also studied.
We analyze the time dependence of entanglement and total correlations between a system and fractions of its environment in the course of decoherence. For the quantum Brownian motion model we show that the entanglement and total correlations have rather different dependence on the size of the environmental fraction. Redundancy manifests differently in both types of correlations and can be related with induced--classicality. To study this we introduce a new measure of redundancy and compare it with the existing one.
We consider composability of quantum channels from a limited amount of entanglement via local operations and classical communication (LOCC). We show that any $k$-partially entanglement breaking channel can be composed from an entangled state with Schmidt number of $k$ via one-way LOCC. From the entanglement assisted construction we can reach an alternative definition of partially entanglement breaking channels.
We experimentally demonstrate a method to control the relative amount of quantum and classical energy correlations between two photons from a pair emitted by spontaneous parametric downconversion. Decoherence in the energy basis is achieved by applying random spectral phases on the photons. As a consequence a diverging temporal second order correlation function is observed and is explained by a mixture between an energy entangled pure state and a fully classically correlated mixte state.
The Quantum Reverse Shannon Theorem states that any quantum channel can be simulated by an unlimited amount of shared entanglement and an amount of classical communication equal to the channel's entanglement assisted classical capacity. In this paper, we provide a new proof of this theorem, which has previously been proved by Bennett, Devetak, Harrow, Shor, and Winter. Our proof has a clear structure being based on two recent information-theoretic results: one-shot Quantum State Merging and the Post-Selection Technique for quantum channels.
How much of the uncertainty in predicting measurement outcomes for non-commuting quantum observables is genuinely quantum mechanical? We provide a natural decomposition of the total entropic uncertainty of two non-commuting observables into a classical component, and an intrinsically quantum mechanical component. We show that the total quantum component in a state is never lower or upper bounded by any state-independent quantities, but instead admits "purity-based" lower bounds that generalize entropic formulations such as the Maassen-Uffink relation. These relations reveal a non-trivial inter…
Quantum coherence is an essential feature of quantum mechanics and is an important physical resource in quantum information. Recently, the resource theory of quantum coherence has been established parallel with that of entanglement. In the resource theory, a resource can be well defined if given three ingredients: the free states, the resource, the (restricted) free operations. In this paper, we study the resource theory of coherence in a different light, that is, we consider the total coherence defined by the basis-free coherence maximized among all potential basis. We define the distillable …
We show that for qubits and qutrits it is always possible to perfectly recover quantum coherence by performing a measurement only on the environment, whereas for dimension d>3 there are situations where recovery is impossible, even with complete access to the environment. For qubits, the minimal amount of classical information to be extracted from the environment equals the entropy exchange.
We show that there exist bipartite quantum states which contain large hidden classical correlation that can be unlocked by a disproportionately small amount of classical communication. In particular, there are $(2n+1)$-qubit states for which a one bit message doubles the optimal classical mutual information between measurement results on the subsystems, from $n/2$ bits to $n$ bits. States exhibiting this behavior need not be entangled. We study the range of states exhibiting this phenomenon and bound its magnitude.
We introduce the concepts of geometric classical and total correlations through Schatten 1-norm (trace norm), which is the only Schatten p-norm able to ensure a well-defined geometric measure of correlations. In particular, we derive the analytical expressions for the case of two-qubit Bell-diagonal states, discussing the superadditivity of geometric correlations. As an illustration, we compare our results with the entropic correlations, discussing both their hierarchy and monotonicity properties. Moreover, we apply the geometric correlations to investigate the ground state of spin chains in t…
This paper is motivated by the suggestion [W. Zurek, Physica Scripta, T76, 186 (1998)] that the chaotic tumbling of the satellite Hyperion would become non-classical within 20 years, but for the effects of environmental decoherence. The dynamics of quantum and classical probability distributions are compared for a satellite rotating perpendicular to its orbital plane, driven by the gravitational gradient. The model is studied with and without environmental decoherence. Without decoherence, the maximum quantum-classical (QC) differences in its average angular momentum scale as hbar^{2/3} for ch…
We establish a quantitative connection between the amount of lost classical information about a quantum state and the concomitant loss of entanglement. Using methods that have been developed for the optimal purification of mixed states we find a class of mixed states with known distillable entanglement. These results can be used to determine the quantum capacity of a quantum channel which randomizes the order of transmitted signals.
We derive an analogue of the quantum total probability rule by constructing a probability theory based on paraconsistent logic. Bayesian probability theory is constructed upon classical logic and a desiderata, that is, a set of desired properties that the theory must obey. We construct a new probability theory following the desiderata of Bayesian probability theory but replacing the classical logic by paraconsistent logic. This class of logic has been conceived to handle eventual inconsistencies or contradictions among logical propositions without leading to the trivialisation of the theory. W…
The class of commuting quantum circuits known as IQP (instantaneous quantum polynomial-time) has been shown to be hard to simulate classically, assuming certain complexity-theoretic conjectures. Here we study the power of IQP circuits in the presence of physically motivated constraints. First, we show that there is a family of sparse IQP circuits that can be implemented on a square lattice of n qubits in depth O(sqrt(n) log n), and which is likely hard to simulate classically. Next, we show that, if an arbitrarily small constant amount of noise is applied to each qubit at the end of any IQP ci…
The maximal amount of information which is reliably transmitted over two uses of general Pauli channels with memory is proven to be achieved by maximally entangled states beyond some memory threshold. In particular, this proves a conjecture on the depolarizing channel by Macchiavello and Palma [Phys. Rev. A {\bf 65}, 050301(R) (2002)]. Below the memory threshold, for arbitrary Pauli channels, the two-use classical capacity is only achieved by a particular type of product states.
In this work we give an example of exponential separation between quantum and classical resources in the setting of XOR games assisted with communication. Specifically, we show an example of a XOR game for which $O(n)$ bits of two way classical communication are needed in order to achieve the same value as can be attained with $\log n$ qubits of one way communication. We also find a characterization for the value of a XOR game assisted with a limited amount of two way communication in terms of tensor norms of normed spaces.
We define "coherent communication" in terms of a simple primitive, show it is equivalent to the ability to send a classical message with a unitary or isometric operation, and use it to relate other resources in quantum information theory. Using coherent communication, we are able to generalize super-dense coding to prepare arbitrary quantum states instead of only classical messages. We also derive single-letter formulae for the classical and quantum capacities of a bipartite unitary gate assisted by an arbitrary fixed amount of entanglement per use.
Instantaneous measurements of non-local observables between space-like separated regions can be performed without violating causality. This feat relies on the use of entanglement. Here we propose novel protocols for this task and the related problem of multipartite quantum computation with local operations and a single round of classical communication. Compared to previously known techniques, our protocols reduce the entanglement consumption by an exponential amount. We also prove a linear lower bound on the amount of entanglement required for the implementation of a certain non-local measurem…
In most communication scenarios, sending a symbol encoded in a quantum state requires spending resources such as energy, which can be quantified by a cost of communication. A standard approach in this context is to quantify the performance of communication protocol by classical capacity, quantifying the maximal amount of information that can be transmitted through a quantum channel per single use of the channel. However, different figures of merit are also possible, and a particularly well-suited one is the classical capacity per unit cost, which quantifies the maximal amount of information th…
Recent work has extended Bell's theorem by quantifying the amount of communication required to simulate entangled quantum systems with classical information. The general scenario is that a bipartite measurement is given from a set of possibilities and the goal is to find a classical scheme that reproduces exactly the correlations that arise when an actual quantum system is measured. Previous results have shown that, using local hidden variables, a finite amount of communication suffices to simulate the correlations for a Bell state. We extend this in a number of ways. First, we show that, when…
A process of preparation, transmission and subsequent projective measurement of a qubit can be simulated by a classical model with only two bits of communication and some amount of shared randomness. However no model for n qubits with a finite amount of classical communication is known at present. A lower bound for the communication cost can provide useful hints for a generalization. It is known for example that the amount of communication must be greater than c 2^n, where c~0.01. The proof uses a quite elaborate theorem of communication complexity. Using a mathematical conjecture known as the…
Mathematical models are an essential component of quantitative science. They generate predictions about the future, based on information available in the present. In the spirit of Occam's razor, simpler is better; should two models make identical predictions, the one that requires less input is preferred. Yet, for almost all stochastic processes, even the provably optimal classical models waste information. The amount of input information they demand exceeds the amount of predictive information they output. We systematically construct quantum models that break this classical bound, and show th…
The most trivial way to simulate classically the communication of a quantum state is to transmit the classical description of the quantum state itself. However, this requires an infinite amount of classical communication if the simulation is exact. A more intriguing and potentially less demanding strategy would encode the full information about the quantum state into the probability distribution of the communicated variables, so that this information is never sent in each single shot. This kind of simulation is called weak, as opposed to strong simulations, where the quantum state is communica…
We continue our investigation concerning the question of whether atomic bound states begin to stabilize in the ultra-intense field limit. The pulses considered are essentially arbitrary, but we distinguish between three situations. First the total classical momentum transfer is non-vanishing, second not both the total classical momentum transfer and the total classical displacement are vanishing together with the requirement that the potential has a finite number of bound states and third both the total classical momentum transfer and the total classical displacement are vanishing. For the fir…
We investigate a two-qubit system to understand the relationship between concurrence and mutual information, where the former determines the amount of quantum entanglement, whereas the latter is its classical residue after performing local projective measurement. For a given ensemble of random pure states, in which the values of concurrence are uniformly distributed, we calculate the joint probability of concurrence and mutual information. Although zero mutual information is the most probable in the uniform ensemble, we find positive correlation between the classical information and concurrenc…
