Bounding quantum correlations with indefinite causal order

# Bounding quantum correlations with indefinite causal order

Časlav Brukner Faculty of Physics, University of Vienna, Boltzmanngasse 5, A-1090 Vienna, Austria.
Institute for Quantum Optics and Quantum Information, Austrian Academy of Sciences, Boltzmanngasse 3, A-1090 Vienna, Austria.
###### Abstract

Causal inequalities are bounds on correlations obtained when operations take place in a causal sequence, i.e. in which the background time or definite causal structure pre-exists such that every operation is either in the future, in the past or space-like separated from any other operation. Recently, a framework was developed where quantum theory is assumed to be valid in local laboratories, but where no reference is made to any global causal relations between the operations in the laboratories. The framework was shown to allow for correlations that violate a bipartite causal inequality. Here we prove that the maximal violation of the causal inequality is upper bounded (analogously to the “Tsirelson bound”‘) under a restricted set of local operations involving binary observables. The bound is lower than what is algebraically possible.

The strength of violation of Bell’s inequalities Bell () in quantum theory is bounded from above by Tsirelson’s bound Cirelson (). The bound is a characteristic feature of quantum theory. One can conceive theories which violate Bell’s inequalities stronger than quantum theory, still being in agreement with no signalling (i.e. not allowing instantaneous information transfer across space). A celebrated example are Popescu-Rohrlich boxes PR (), also known as non-local boxes, which are hypothetical systems that achieve the algebraic bound for violation of the Bell inequality, yet do not allow signalling. Progress in understanding the difference between no-signalling classical, quantum, and superquantum correlations has provided insights into fundamental features of quantum theory, which demarcate it from both classical physics and more general probabilistic theories (dam, ; pawlowski, ; navascues, ; cabello, ; acin, ).

In quantum mechanics and quantum field theory on curved space-times, all operations are embedded in a fixed space-time. Consequently, the correlations between operations respect definite causal order: they are either signalling correlations for the time-like or no-signalling correlations for the space-like separated operations. In quantum theory, however, every physical quantity is subject to quantum uncertainty. Recently, Hardy proposed to describe causal structures to be both dynamic, as in general relativity, as well as, indefinite, similarly to quantum observables hardyqg (). This suggests that incorporating such causal structures into a quantum framework might lead to situations in which the causal ordering of events, as well as to whether their spatio-temporal distance is space-like or time-like is not fixed in advanced. The possibility of quantum computation on indefinite causal structures was proposed hardyqgc () and it was shown that “superposition of orders of quantum gates” yield information processing advantages with respect to quantum circuits with a fixed order of gates chiribella (); chiribella1 (), even in the asymptotic case araujo ().

A framework was developed recently where it was presumed that operations in local laboratories are described by quantum theory (i.e. are completely-positive maps) while no reference is made to any global causal relations between these operations OCB (). The surprising feature of this framework was the fact that there are situations where two operations are neither causally ordered nor in a probabilistic mixture of definite causal orders. This means that it is not possible to know the order between the two operations – it is not clear whether one is prior to or after the other. Moreover, it was shown that the correlations between the operations violate a bipartite casual inequality, which is impossible if the operations are ordered according to a fixed causal structure. In the case of three parties the predefined causal order is violated by perfect signalling among the parties amin () (this is analogue to the “all versus nothing” type of argument against local hidden variables ghz ()). Furthermore, classical correlations (i.e. locally compatible with classical probability theory) exist that allow for deterministic signalling between three or more parties incompatible with any predefined causal order amin2 (). For a bipartite case, however, violation of causal inequalities is possible only with quantum laboratories. Whether correlations violating causal inequalities are realizable in nature is an open question. See a review (caslav, ) on recent theoretical progress in the field.

Here we derive a quantum bound (i.e. bound compatible with local quantum mechanics) on the strength of violation of the bipartite causal inequality. The proof is limited to the case where the parties perform operations from a restricted set of complete positive maps involving binary observables. Interestingly, both the causal and quantum bound on the causal inequality match numerically the corresponding classical and quantum (Tsirleson’s) bound on the Clauser-Horne-Shimony-Holt version CHSH () of Bell’s inequality.

In a general case, we have two scientists (who generally are dubbed Alice and Bob), who operate their experiment in two isolated laboratories. At a given run of the experiment the system enters into the respective laboratory of Alice and Bob respectively. Subsequently, Alice and Bob perform their operation on the system. And then, each experimenter transmits the system out of her/his laboratory. During the operations of each experimenter, the respective laboratories are completely shielded from the rest of the world. The system enters and exits each laboratory only once and is isolated from the outside world for the duration of the operations.

To describe the causal inequality, a game we might call “guess your partner’s input” could be useful (see Figure 1, left) OCB (). At the beginning each partner receives a random input bit value 0 or 1, say Alice receives the bit value and Bob . In addition, Bob is given another random input , which specifies their goal: if , Alice is required to return her best guess of Bob’s input , whereas if , he is asked to give his best guess for the bit . We denote by and the guesses by Alice and Bob respectively, for the bit of the other. Their goal is to maximize the probability of success

 psucc:=12[P(x=b|b′=0)+P(y=a|b′=1)]. (1)

It is easy to see that if all events obey causal order, the two partners cannot exceed the bound

 pcaussucc≤3/4. (2)

Without loss of generality consider the following case. The experiment performed by Alice is in the past of the one performed by Bob (see Figure 1 right). Accordingly, Alice is able to transmit her input to Bob. If , Alice and Bob have successfully concluded their experiment: in this case, Bob is able to expose Alice’s bit: . However, if she is asked to guess his bit, she cannot do it better than giving a random answer. This results in an overall success probability of 3/4. Formally, the inequality is based on a set of three assumptions: “definite causal structure”, “freedom of choice” and “closed laboratories” (i.e. the laboratories are shielded from the rest of the world) which are thoroughly discussed in Ref. OCB ().

We now give a brief overview of the most important elements of the framework for quantum theory without a global causal order OCB (), which are relevant for the present work. The main premiss of the framework is the validity of local quantum mechanics: the local operations of each party are described by quantum theory, i.e. the local operation are completely positive (CP) trace non-increasing maps. If an operation is performed on a quantum state and an outcome is observed, describes the updated state after the operation (up to normalization), where is a CP trace non-increasing map. We denote Alice’s map by , where is the space of matrices over the input Hilbert space and the one over the output Hilbert space . (The two Hilbert spaces can have different dimensions since the operation may involve ancillas). Similarly is for Bob’s CP map.

The Choi-Jamiolkowski (CJ) choi (); jam () isomorphism allows to represent operations by operators (bipartite states) rather than maps. The CJ matrix corresponding to a linear map is defined as , where is a (not normalized) maximally entangled state, the set of states is an orthonormal basis of of dimension , is the identity map, and denotes matrix transposition (the transposition is introduced for convenience).

The quantum framework with no reference to background causal structure leads to a certain form for the probability for a pair of Alice’s and Bob’s CP maps. It can be expressed as a bilinear function of the CJ representations and of local CP maps performed by Alice and Bob, respectively, as follows

 P(MAi,MBj)=Tr[WA1A2B1B2(MA1A2i⊗MB1B2j)]. (3)

Here is a matrix from the space of matrices over the tensor product of the input and output Hilbert spaces.

The matrix represents a new resource called ”process“ and is a generalization of the notion of “state”. It can describe non-signalling correlations arising from measurements on a bipartite state, signalling ones, which can arise when a system is sent from one laboratory to another through a quantum channel, as well as correlations arising from the situations that are not causally ordered. The later type of qubit process matrix (i.e. where all input and output Hilbert spaces are two-dimensional) was shown to allow the causal inequality to be violated by , but the question has remained whether it is the highest possible value. Mathematically, a process matrix is a positive matrix and it returns unit probability for any pair of complete-positive trace-preserving maps. A closely related object to the process is a “quantum comb” networks (), but it is subject to additional conditions fixing a definite causal order.

We now derive a quantum bound on violation of the causal inequality. We consider an arbitrary process matrix but restrict Alice’s and Bob’s CP maps to involve dichotomic observables with outcomes denoted by +1 and -1. Specifically, such a map could be of measurement-repreparation type, where the partners measure traceless dichotomic observables, and reprepare their states from a (degenerative) eigenspaces of the observables. A Hilbert-Schmidt basis of , with is given by a set of matrices , with , , and for and is even. A traceless dichotomic observable can be expressed as , where specifies the observable and is the scalar product in dimensional Euclidean space. Since , one has , where denotes the two-norm. The projectors onto two eigenspaces are given as with outcomes or . We also introduce a traceless dichotomic “correlation observable” , where and .

We next consider a strategy for violation of the causal inequality. As Alice does not have an access to bit , she performs a single map decoding from the incoming system and encoding into and the correlations between systems and . Hence, the possible operations performed by Alice can be represented by the CJ matrix as follows , where we omit the identity operators in the spaces of the subsystems. The encoding one-bit value function can depend both on and . The sign is set to ensure the complete positivity of the CJ matrix in the particular case when the map is of the measurement-repreparation type: . In that case Alice measures observable on the incoming system, assigning the value to the measured subspace . Subsequently, she reprepares the system, encoding in the totally mixed state in the support of a subspace of another observable , and sends it out of her laboratory. In the most general case, , and can all depend on and . The present maps belong to a restricted class.

Bob chooses a strategy that depends on the bit value . If he wants to receive Alice’s bit (), his encoding strategy is unimportant. Hence, the CJ matrix representing Bob’s CP map can be chosen as (where for definiteness we denote the reprepared state by ). He measures observable on the incoming system and assigns , to the outcome . If Bob wants to send his bit (), he applies the map with the CJ representation: . Again this includes as a special case the maps of the measurement-repreparation type. Bob measures , assigning the value to the measured subspace . He reprepares the state from a subspace of the observable of the outgoing system, where the encoding function can in general depend on both and the observed outcome . Since in the case for Bob sends a signal to Alice, his assignment in is arbitrary.

The most general bipartite process matrix has the form OCB ()

 WA1A2B1B2 =1dA1dB1(\leavevmode\small 1\kern% -3.3pt\normalsize 1+σB⪯A+σA⪯B+σA⋠⋡B), (4) σB⪯A :=∑ij>0cijσA1iσB2j+∑ijk>0dijkσA1iσB1jσB2k, σA⪯B :=∑ij>0eijσA2iσB1j+∑ijk>0fijkσA1iσA2jσB1k, σA⋠⋡B :=∑i>0viσA1i+∑i>0xiσB1i+∑ij>0gijσA1iσB1j, where cij,dijk,eij,fijk,gij,vi,xi∈R.

The terms in allow signalling from Bob to Alice (channels from B to A), those in allow signalling from Alice to Bob (channels from A to B), whereas the terms describe no-signalling situations (bipartite states). We will refer to terms of the form as of the type , terms of the form as of the type and so on.

According to Eq. (3) the probabilities for different possible outcomes in the protocol are given by . For a successful calculation of the success probability, it is necessary to compute the intermediate probabilities as well as . Note that the sum of a local CP map over the outcomes gives a complete-positive trace preserving map.

After a lengthy but straightforward calculation one obtains that either

 P(x=b|a,b,b′=0) =12[1+(−1)b(→v|→m)+(^c|→m⊗→o)] or (5) P(x=b|a,b,b′=0) =12[1+(−1)b(→v|→m)+(^d|→m⊗^S)]. (6)

Similarly one has either

 P(y=a|a,b,b′=1) =12[1+(−1)a(→x|→r)+(^e|→n⊗→r)] or (7) P(y=a|a,b,b′=1) =12[1+(−1)a(→x|→r)+(^f|^T⊗→r)]. (8)

(One can obtain any sign in front of the third terms on the right-hand side, but it can always be absorbed by a choice of the vectors representing the local operations.) Here the tensors and vectors are defined through their components as introduced in (4), respectively. After averaging Eq. (5) and (6) over , as well as Eq. (7) and (8) over , and inserting different combinations of them in (1), one obtains four possible expressions for the probability of success. In order to find the bound on the violation of the causal inequality we need to maximize the probability over the choice of observables. The four expressions for the maximal probability of success are given as follows:

 pmaxsucc =max→n,→r,→m,→o14[2+(^e|→n⊗→r)+(^c|→m⊗→o)], (9) pmaxsucc =max→n,→r,→m,^S14[2+(^e|→n⊗→r)+(^d|→m⊗^S)], (10) pmaxsucc =max^T,→r,→m,→o14[2+(^f|^T⊗→r)+(^c|→m⊗→o)], (11) pmaxsucc =max^T,→r,→m,^S14[2+(^f|^T⊗→r)+(^d|→m⊗^S)]. (12)

We give the proof for the case (10); other cases can be treated analogously. We first construct a properly normalized density matrix from the given process matrix. Next we introduce vectors , and from the complex vector space of dimension , where we consider the operators on the right hand sides as vectors. The scalar product between two vectors and is defined by the inner product of the corresponding matrices: . The vectors are of the unit length since . Similarly, one has . On the other hand, and . Finally, since contains neither terms of the type nor .

We can now rewrite Eq. (10) in terms of the vectors and as follows:

 pmaxsucc=max→a,→b14[2+(→a|→i)+(→b|→i)]. (13)

Note that and cannot be chosen independently of as they all depend on the given . Since the three vectors are of unit length and and are orthogonal to each other, the maximum is achieved if lies in the plane spanned by and . Then one can write and . This finally implies

 pmaxsucc≤maxθ14(2+cosθ+sinθ)=12(1+1√2). (14)

As shown in Ref. OCB () the bound can be achieved with the qubit process matrix

 WA1A2B1B2=14[\leavevmode\small 1\kern% -3.3pt\normalsize 1A1A2B1B2+1√2(σA2zσB1z+σA1zσB1xσB2z)], (15)

where , , , and are two-level systems (e.g. the spin degrees of freedom of a spin- particle) and and are the Pauli spin matrices. The strategies are of the measurement-repreparation type. Alice always performs map . If , Bob chooses map , while if , he performs .

Signalling correlations do not have a definite causal order if they violate a causal inequality. Another feature of quantum theory without global causal order is the existence of causally non-separable processes, i.e. processes which cannot be written in a causal form (or, more generally, as a mixture of processes in a causal form), , where , and is the process in which Alice cannot signal to Bob (i.e. channels from Bob to Alice or the two share a bipartite state) and in which Bob cannot signal to Alice OCB (). If the process matrix can be written in a causal form, we call it causally separable. The process matrix (15) is an example of a causally non-separable process.

The two notions are analogous to nonlocality and entanglement in quantum theory. Even though the latter are intimately related, they are distinct notions. There are mixed quantum states (for example, the Werner states werner ()), which, while entangled, yield outcomes that allow a description in terms of local hidden variables. Next we consider a family of processes (which are process analogue to the Werner states) and show that they violate the causal inequality if and only if they are causally non-separable. Therefore, there is no gap between causal non-separability and correlations violating the causal inequality for this family of processes.

We consider the processes of the form:

 Wη1,η2=14[\leavevmode\small 1\kern-3.3pt% \normalsize 1A1A2B1B2+η1σA2zσB1z+η2σA1zσB1xσB2z]. (16)

Since the process matrix is positive, one has . For the special case of , the process can be written as an admixture of totally noisy process to the process from Eq. (15): with .

The process matrix is causally non-separable if and only if its distance to the closest causally separable process is strictly positive. As for the distance measure we introduce the following geometric measure

 D(W)≡minWc∈Ωc||W−Wc||2, (17)

where is the set of causally separable processes and is the square norm in the Hilbert-Schmidt space.

We decompose any causally separable process matrix as , where contains only terms from Eq. (15), whereas contains both terms and . This particular decomposition is chosen because in the Hilbert-Schmidt space and are orthogonal to each other on the traceless parts. To determine the geometric distance we compute the following: , and . Here denotes the sum of the squares of all but element in the Hilbert-Schmidt decomposition of . Similarly, is the sum of the squares of all but element in the decomposition of .

The geometric distance to the set of causally separable processes can be expressed as

 D(W)=min→x||→x−→y||2, (18)

where and and is taken because otherwise always. Hence, the geometric distance will be zero if there is , i.e. if and . Note that due to , one has to guarantee the positivity of and , respectively. This implies that whenever the distance is zero one has , where the sign of and is chosen to match those of and , respectively. Hence, if , the distance is always strictly positive, and the process is causally non-separable. The opposite is also true, since at the values one can always write the process matrix in a causally separable form as with and , where is the sign of . On the other hand, the causal inequality is violated if , as one can easily convince oneself.

In conclusion, under restricted class of local strategies involving binary observables the quantum bound on the violation of the causal inequality is . An intuitive understanding of this violation becomes possible through the realization that Bob, with a probability of respectively, might end up either “before” or “after” Alice. He, however, cannot choose the causal order with certainty, as the bound is lower than what is algebraically maximal possible value. This raises the question of why it is so, and what principle limits quantum correlations with indefinite causal order.

###### Acknowledgements.
I thank M. Araujo, F. Costa, A. Feix and I. Ibnouhsein for discussions. This work has been supported by the European Commission Project RAQUEL, the John Templeton Foundation, FQXi, and the Austrian Science Fund (FWF) through CoQuS, SFB FoQuS, and the Individual Project 2462.

## References

• (1) J. S. Bell, On the Einstein Podolsky Rosen Paradox, Physics 1, 3, 195-200 (1964).
• (2) B. S. Cirel’son, Quantum Generalizations of Bell’s Inequality, Lett. Math. Phys. 4, 93 (1980).
• (3) S. Popescu and D. Rohrlich, Quantum nonlocality as an axiom. Found. Phys. 24, 379-385 (1994).
• (4) W. van Dam, Nonlocality and Communication Complexity, PhD thesis, (University of Oxford, 2000). Preprint at arXiv:quant-ph/0501159 (2005).
• (5) M. Pawlowski, T. Paterek, D. Kaszlikowski, V. Scarani, A. Winter, and M. Zukowski, Information causality as a physical principle, Nature 461, 1101-1104 (2009).
• (6) M. Navascues and H. Wunderlich, A glance beyond the quantum model, Proc. R. Soc. A 466, 881-890 (2010).
• (7) A. Cabello, Simple explanation of the quantum violation of a fundamental inequality, Phys. Rev. Lett. 110, 060402 (2013).
• (8) T. Fritz, A. B. Sainz, R. Augusiak, J. B. Brask, R. Chaves, A. Leverrier, and A. Acin, Local orthogonality as a multipartite principle for quantum correlations, Nat. Commun., 4:2263 doi: 10.1038/ncomms3263 (2013).
• (9) L. Hardy, Probability Theories with Dynamic Causal Structure: A New Framework for Quantum Gravity, Preprint at arXiv:gr-qc/0509120 (2005).
• (10) L. Hardy, Quantum gravity computers: On the theory of computation with indefinite causal structure, in Proceedings of “Quantum Reality, Relativistic Causality, and Closing the Epistemic Circle: An International Conference in Honour of Abner Shimony”, Preprint at arXiv: quant-ph/0701019 (2007).
• (11) G. Chiribella, G. M. D’Ariano, P. Perinotti, and B. Valiron, Quantum computations without definite causal structure, Phys. Rev. A 88, 022318 (2013), Preprint at arXiv:0912.0195 (2009).
• (12) G. Chiribella, Perfect discrimination of no-signalling channels via quantum superposition of causal structures, Phys. Rev. A 86, 040301(R) (2012).
• (13) M. Araújo, F. Costa, and Č. Brukner, Computational advantage from quantum-controlled ordering of gates, Phys. Rev. Lett. 113, 250402 (2014).
• (14) O. Oreshkov, F. Costa, and Č. Brukner, Quantum correlations with no causal order, Nature Communications 3, 1092, doi:10.1038/ncomms2076 (2012), Preprint at arXiv:1105.4464 (2011).
• (15) Ä. Baumeler, and S. Wolf, Perfect signaling among three parties violating predefined causal order, Proc. of International Symposium on Information Theory (ISIT), 526-530 (2014).
• (16) D. Greenberger, M. Horne, A. Shimony, and A. Zeilinger, Bell’s theorem without inequalities, Am. J. Phys. 58, 1131 (1990).
• (17) Ä. Baumeler, A. Feix and S. Wolf, Maximal incompatibility of locally classical behavior and global causal order in multi-party scenarios, Phys. Rev. A 90, 042106 (2014).
• (18) Č. Brukner, Quantum Causality, Nature Physics 10, 259-263 (2014).
• (19) J. F. Clauser, M. A. Horne, A. Shimony, and R. A. Holt, Proposed experiment to test local hidden-variable theories, Phys. Rev. Lett. 23, 880-884 (1969).
• (20) A. Jamiołkowski, Linear transformations which preserve trace and positive semidefiniteness of operators, Rep. Math. Phys. 3, 4, 275-278 (1972).
• (21) M.-D. Choi, Completely positive linear maps on complex matrices, Lin. Alg. Appl. 10, 285-290 (1975).
• (22) G. Chiribella, G. M. D’Ariano, and P. Perinotti, Theoretical framework for quantum networks, Phys. Rev. A 80, 022339 (2009).
• (23) R. F. Werner, Quantum states with Einstein-Podolsky-Rosen correlations admitting a hidden-variable model, Phys. Rev. A 40, 4277-4281 (1989).
You are adding the first comment!
How to quickly get a good reply:
• Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
• Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
• Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
The feedback must be of minimum 40 characters and the title a minimum of 5 characters