betaFeedback

WorksPhysics and Astronomy

Information Causality Defeats Every Finite NPA Level

Abstract

For every finite level of the Navascués-Pironio-Acín (NPA) hierarchy, we construct correlations that satisfy all its constraints but violate information causality. At each fixed level, one use of a binary-outcome correlation and one classical bit suffice for a violation that grows without bound as the number of measurement settings increases. Information causality bounds the information gained about independent database bits, summed over possible requests, by the length of the message. Quantum correlations obey the one-bit bound; the optimal information gain at any fixed NPA level grows logarithmically with the number of settings. The violation remains unbounded even when all outcome probabilities are positive and, for any fixed number of measurement settings on each side, every choice of those settings admits a local model. One communicated bit therefore exposes an unbounded gap between information causality and every finite NPA level.

With independent copies of a Popescu–Rohrlich correlation [1], Bob can recover whichever bit he requests from an arbitrarily long database of independent bits using one bit from Alice. Alice never learns which bit Bob wants, and the correlations respect the prohibition on faster-than-light signalling [2, 3]. Information causality (IC) requires that the information Bob gains about the requested bit, summed over all possible requests, be at most the number of bits Alice sends [2]. Quantum theory obeys this bound, whose derivation uses nonsignalling and entropy rules that can be stated independently of quantum theory (Methods).

The Navascués–Pironio–Acín (NPA) hierarchy bounds the correlations between distant measurements by imposing successively stronger consistency conditions on the measured probabilities [4, 5]. For a fixed Bell scenario, its levels converge to the commuting-operator correlation set, in which the parties’ measurements act on a common Hilbert space and commute across parties. The first level, Q1Q_1, coincides with macroscopic locality, which requires the fluctuations in outcome counts from many independent pairs to admit a local description [6]. Both macroscopic locality and IC give the quantum bound on the Clauser–Horne–Shimony–Holt (CHSH) expression.

Cavalcanti, Salles and Scarani found IC violations in Q1Q_1 using larger outcome alphabets and concatenation [7]. The almost-quantum set Q1+ABQ_{1+AB} lies between Q1Q_1 and Q2Q_2 and satisfied the numerical IC tests reported when it was introduced [8]. Das Bhowmik and Banik obtained unbounded IC violations with a single use of an almost-quantum correlation and one communicated bit [9], using the correlations of Gazi et al. [10]. The question is whether stronger consistency conditions can enforce IC at a finite level that works independently of the number of measurement settings.

For each fixed finite NPA level, we construct a family of binary-outcome correlations that satisfy every constraint at that level and violate IC by an amount that grows without bound as the number of settings increases. Each protocol uses the correlation once and sends one bit from Alice to Bob. The optimal information gain grows logarithmically with the number of settings at each fixed level. To enforce the quantum one-bit bound across these Bell scenarios, the hierarchy level must grow with the number of settings.

Reading a database with one bit

We construct binary-outcome correlations in which Alice and Bob can both obtain zero only when their measurement settings agree. At each fixed NPA level L≥2L \ge2, this event has the same probability sL>0s_L > 0 at every pair of equal settings, independent of how many settings each party has. Let x,y∈{1,…,N}x,y \in\{1,\ldots,N\} be Alice’s and Bob’s settings, and let a,b∈{0,1}a,b \in\{0,1\} be their outcomes. Either party obtains zero with probability 3sL3s_L at every setting, as in the almost-quantum correlations of Gazi et al. [10]. Write QL(N,N,2,2)Q_L(N,N,2,2) for the level-LL set in this scenario and δxy\delta_{xy} for the indicator of x=yx=y. For each integer L≥2L \ge2, we choose a rational sL>1/(185L3)s_L > 1/(185L^3) so that, for every N≥2N \ge2, the following correlation belongs to QL(N,N,2,2)Q_L(N,N,2,2):

pL,N(a,b∣x,y)={sLδxy,a=b=0,3sL−sLδxy,a≠b,1−6sL+sLδxy,a=b=1.(1)p_{L,N}(a,b \mid x,y)= \begin{cases} s_L\delta_{xy}, & a=b=0,\\ 3s_L-s_L\delta_{xy}, & a\ne b,\\ 1-6s_L+s_L\delta_{xy}, & a=b=1. \end{cases} \tag*{(1)}

A nonsignalling correlation cannot by itself transmit information from Alice to Bob. Information causality constrains how much information Bob can gain when Alice also sends him a classical message. To test IC, we therefore need a communication task and a protocol that uses the correlation.

In the IC task, Alice holds independent database bits RiR_i and Bob is asked for one of them, without revealing the requested position ii to Alice. Their shared nonsignalling resource is independent of the database and request. She sends him a classical message MM of at most mm bits. Let GiG_i be Bob’s output for request ii, obtained using the message and their shared correlation. Information causality requires that the Shannon mutual information, measured in bits and summed over possible requests, obey [2]

I:=∑iI(Ri:Gi)≤m.(2)\mathcal{I} := \sum_i I(R_i:G_i) \le m. \tag*{(2)}

This bound must hold for every communication protocol. To exhibit a violation, we therefore need to specify how Alice encodes the database, how the parties use the correlation, and how Bob produces his output. We do so with one use of Eq. (1) and one communicated bit, for which the IC bound is I≤1\mathcal{I} \le1.

Take NN database bits, each equal to one with probability rr, where 0<r<10 < r < 1. Alice uses the position of the first one as her setting xx and sends her outcome M=aM=a, adapting the block-selection protocol of Ref. [9] to biased bits. If there is no one, she uses any fixed setting and sends M=1M=1. Bob uses the requested position ii as his setting. He sets Gi=1G_i=1 when M=b=0M=b=0 and Gi=0G_i=0 otherwise (Figure 1a). Joint zeros are impossible for x≠ix\ne i, so Gi=1G_i=1 certifies that Alice’s first-one position is ii and hence that Ri=1R_i=1.

Figure 1. One-bit communication and matching settings. a, Alice’s independent database bits are one with probability 1/N1/N. She uses the position xx of the first one as her setting and sends her outcome M=aM=a. She sends M=1M=1 on an all-zero database. Bob uses the requested position ii as his setting. The circles mark equal settings, where both outcomes are zero with probability sLs_L. The filled circle marks the example x=y=i=3x=y=i=3. Bob records Gi=1G_i=1 if M=b=0M=b=0, which implies Ri=1R_i=1, and Gi=0G_i=0 otherwise. b, The solid line gives the lower bound (1−e−1)X(1-e^{-1})X on the information score for X=sLlog⁡2NX=s_L\log_2N. The dashed line marks the one-bit quantum bound. The shading marks the amount by which the lower bound exceeds it. At fixed NPA level LL, the rate sL>0s_L>0 is independent of NN, so increasing NN makes the lower bound arbitrarily large.

Upon seeing Gi=1G_i=1, Bob learns that Ri=1R_i=1, which had prior probability rr. The relative entropy of this posterior from the prior is log⁡2(1/r)\log_2(1/r) bits. For request ii, this outcome has probability sLr(1−r)i−1s_Lr(1-r)^{i-1}, since ii must be the first position with a one. For a given database, only a request for that position can give Gi=1G_i=1. Summing over requests therefore gives sLs_L times the chance that there is a one in the database. The output Gi=0G_i=0 also contributes a nonnegative term, so the total information I\mathcal{I} obeys

I≥sL[1−(1−r)N]log⁡2(1/r).(3)\mathcal{I} \ge s_L\left[1-(1-r)^N\right]\log_2(1/r). \tag*{(3)}

At r=1/Nr=1/N, a one is rare at any given address and the probability of at least one in the database is at least 1−e−11-e^{-1}. The lower bound is (1−e−1)sLlog⁡2N(1-e^{-1})s_L\log_2N (Figure 1b).

The same encoding works with fair bits by grouping them into blocks. Alice chooses the first all-ones block from NN blocks of kk independent fair bits and sends her outcome; if no such block exists, she sends one. Bob chooses the block containing his requested bit. This is the original block protocol [9]. Joint zeros imply that every bit of the selected block is one. For each of the kk requests within that block, the probability of a one changes from the prior 1/21/2 to certainty, giving one bit of relative entropy. An all-ones block has probability 2−k2^{-k}, so the score is at least ksL[1−(1−2−k)N]ks_L[1-(1-2^{-k})^N]. Taking k=⌊log⁡2N⌋k=\lfloor\log_2N\rfloor also gives logarithmic growth.

If joint zeros never occur at unequal settings, quantum correlations have average joint-zero probability at most 1/N1/N across the NN equal settings. The same bound holds in the commuting-operator set Qc\mathcal{Q}_c. In this model, Alice’s and Bob’s projectors act on a common Hilbert space and commute across parties; measurements on separate tensor factors are included. Let si=p(0,0∣i,i)s_i=p(0,0\mid i,i), with no restriction on the marginals. Let Alice measure her projectors in order, stopping at the first zero. Conditional on Bob obtaining zero at setting ii, Alice cannot obtain zero at any earlier setting because joint zeros are absent at unequal settings. Each earlier measurement therefore gives outcome one with certainty and leaves her conditional state unchanged. The joint probability of Bob’s zero and Alice’s first zero at ii is therefore sis_i. Alice’s distribution for the position of her first zero is independent of Bob’s setting by nonsignalling. The unconditional probability of her first zero at ii is at least sis_i. These events are disjoint, so ∑isi≤1\sum_i s_i\le1 [10, 11]. A shared uniform label attains the bound if each party outputs zero exactly when its setting equals that label.

To determine how fast the information can grow, let FL(N)F_L(N) be the supremum of I\mathcal{I} over all correlations in QL(N,N,2,2)\mathcal{Q}_L(N,N,2,2) and all protocols with at most one use of the correlation and at most one classical bit from Alice to Bob. The database may be any finite collection of independent bits with arbitrary biases. Shared randomness is independent of the database, the request and the correlation. The message alphabet has at most two values, including on runs where the correlation is unused. Bob may choose his setting using the message, and his output GiG_i may be his full transcript. In quantum theory this optimum is one, attained by sending a fair database bit.

For a nonsignalling correlation, transmitting Alice’s setting as well as her bit is sufficient to reproduce Bob’s transcript classically. Before either party receives an input, draw a table with one sample of Alice’s outcome at each of her settings. For each sampled outcome, draw a response for every Bob setting, conditioned on that Alice setting and outcome. In the simulation Alice generates her message using the table outcome at her actual setting. Bob receives the setting and the message, applies his original setting rule and reads the corresponding response. The table and all random controls are independent of the database. Data processing and independence of the bits bound the score by the conditional entropy of the setting and bit given this shared information, at most log⁡2N+1\log_2N+1. At powers of two this bound is attained by a nonsignalling correlation (Methods). Combining this upper bound with Eq. (3) and sL>1/(185L3)s_L>1/(185L^3) gives, for N,L≥2N,L\ge2,

(1−e−1)log⁡2N185L3≤FL(N)≤log⁡2N+1.(4)\frac{(1-e^{-1})\log_2N}{185L^3}\le F_L(N)\le\log_2N+1. \tag*{(4)}

Hence FL(N)=ΘL(log⁡N)F_L(N)=\Theta_L(\log N) at each fixed L≥2L\ge2. By containment of level two in level one, this order also holds for L=1L=1.

The optimal information gain

For the correlation in Eq. (1), the probability sLs_L of two zeros on equal settings fixes the leading coefficient of the optimal information gain. Let JL(N)J_L(N) be the supremum over the same one-copy, one-bit protocols with this correlation fixed. Then

JL(N)=sLlog⁡2N+O(1).(5)J_L(N)=s_L\log_2N+O(1). \tag*{(5)}

The additive bounds are uniform in LL. To make Alice use every setting equally often, give her N−1N-1 independent bits with Pr⁡(Ri=1)=1/(N−i+1)\Pr(R_i=1)=1/(N-i+1). She uses the first-one position, or setting NN on an all-zero database, and sends her outcome in either case. The chosen setting is uniform over all NN labels. For each request i<Ni<N, the outcome Gi=1G_i=1 occurs with probability sL/Ns_L/N and implies Ri=1R_i=1, an event of prior probability 1/(N−i+1)1/(N-i+1). The information from these outcomes sums to (sL/N)log⁡2(N!)≥sLlog⁡2N−sLlog⁡2e(s_L/N)\log_2(N!)\ge s_L\log_2N-s_L\log_2e.

The upper bound uses a table that reproduces Bob’s possible responses. An outcome impossible at unequal settings identifies Alice’s setting in this table. For Eq. (1), that outcome is two zeros, with probability sLs_L on equal settings. In the remaining cases the table contains only a bounded amount of information about Alice’s setting (Methods and Supplementary Information).

False coincidences and the optimal score

If two zero outcomes can occur at unequal settings, Bob can see M=b=0M=b=0 even when the addresses differ. Mix the correlation in Eq. (1) with a fixed fraction 0<ϵ<10<\epsilon<1 of a local product correlation in which each party independently outputs zero with probability 0<uN≤1/20<u_N\le1/2. Neither party knows which correlation was used on a given run. Write c=(1−ϵ)sLc=(1-\epsilon)s_L and tN=ϵuN2t_N=\epsilon u_N^2, so joint zeros have probability c+tNc+t_N on equal settings and tNt_N on unequal settings. The optimal one-copy, one-bit score for this mixture is

JN=clog⁡2(N1+NtN/c)+O(1),(6)J_N=c\log_2\left(\frac{N}{1+Nt_N/c}\right)+O(1), \tag*{(6)}

with the remainder bounded uniformly in NN and uNu_N at fixed sL,ϵs_L,\epsilon (Supplementary Information). The database with a uniform first-one index attains the lower bound up to an additive constant.

References

  1. [1]S. Popescu and D. Rohrlich, Quantum nonlocality as an axiom, Found. Phys. 24, 379 (1994).DOI
  2. [2]M. Pawłowski, T. Paterek, D. Kaszlikowski, V. Scarani, A. Winter, and M. Żukowski, Information causality as a physical principle, Nature 461, 1101 (2009), arXiv:0905.2292 [quant-ph].DOI
  3. [3]A. Chaturvedi, M. Pawłowski, and K. Horodecki, Random access codes and nonlocal resources, Phys. Rev. A 96, 022125 (2017), arXiv:1610.01268 [quant-ph].DOI
  4. [4]M. Navascués, S. Pironio, and A. Acín, Bounding the set of quantum correlations, Phys. Rev. Lett. 98, 010401 (2007), arXiv:quant-ph/0607119 [quant-ph].DOI
  5. [5]M. Navascués, S. Pironio, and A. Acín, A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations, New J. Phys. 10, 073013 (2008), arXiv:0803.4290 [quant-ph].DOI
  6. [6]M. Navascués and H. Wunderlich, A glance beyond the quantum model, Proc. R. Soc. A 466, 881 (2010), arXiv:0907.0372 [quant-ph].DOI
  7. [7]D. Cavalcanti, A. Salles, and V. Scarani, Macroscopically local correlations can violate information causality, Nat. Commun. 1, 136 (2010), arXiv:1008.2624 [quant-ph].DOI
  8. [8]M. Navascués, Y. Guryanova, M. J. Hoban, and A. Acín, Almost quantum correlations, Nat. Commun. 6, 6288 (2015), arXiv:1403.4621 [quant-ph].DOI
  9. [9]A. Das Bhowmik and M. Banik, Almost-quantum correlations violate information causality (2026), arXiv:2610.41444 [quant-ph].
  10. [10]R. Gazi, B. Chatterjee, J. Karmakar, R. K. Patra, M. Banik, and A. Das Bhowmik, An unbounded separation of almost-quantum and commuting-operator correlations in zero-error communication (2026), arXiv:2610.41448 [quant-ph].arxiv.org/abs/2610.41448
  11. [11]H. Klauck and R. de Wolf, Following One-Sided Quantum Protocols, in 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), Leibniz International Proceedings in Informatics (LIPIcs), Vol. 20, edited by N. Portier and T. Wilke (Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2013) pp. 424–433, arXiv:1204.4619 [quant-ph].arxiv.org/abs/1204.4619
  12. [12]N. Miklin, P. Jain, and M. Gachechiladze, Communication complexity bounds from information causality (2026), arXiv:2602.10206 [quant-ph].arxiv.org/abs/2602.10206
  13. [13]A. Mukherjee, A. Roy, S. S. Bhattacharya, S. Das, M. R. Gazi, and M. Banik, Hardy’s test as a device-independent dimension witness, Phys. Rev. A 92, 022302 (2015).DOI
  14. [14]A. Rai, M. Pivoluska, M. Plesch, S. Sasmal, M. Banik, and S. Ghosh, Device-independent bounds from Cabello’s nonlocality argument, Phys. Rev. A 103, 062219 (2021).DOI
  15. [15]A. Rai, M. Pivoluska, S. Sasmal, M. Banik, S. Ghosh, and M. Plesch, Self-testing quantum states via nonmaximal violation in Hardy’s test of nonlocality, Phys. Rev. A 105, 052227 (2022).DOI
  16. [16]M. Alimuddin, A. Chakraborty, G. L. Siddhardh, R. K. Patra, S. Sen, S. R. Chowdhury, S. G. Naik, and M. Banik, Advantage of Hardy’s nonlocal correlation in reverse zero-error channel coding, Phys. Rev. A 108, 052430 (2023).arxiv.org/abs/2303.06848
  17. [17]M. Fanizza, L. Kroell, A. Mehta, C. Paddock, D. Rochette, W. Slofstra, and Y. Zhao, The NPA hierarchy does not always attain the commuting operator value (2025), arXiv:2510.04943 [quant-ph].arxiv.org/abs/2510.04943
  18. [18]N. Gigena, E. Panwar, G. Scala, M. Araújo, M. Farkas, and A. Chaturvedi, Self-testing tilted strategies for maximal loophole-free nonlocality, npj Quantum Inf. 11, 82 (2025), arXiv:2405.08743 [quant-ph].DOI
  19. [19]A. Chatelain, No finite NPA level characterizes the complete quantum set in the simplest Bell scenario, Phys. Rev. Lett. 10.1103/9298-2bth (2026), accepted 6 November 2026, arXiv:2607.14569v2 [quant-ph].
  20. [20]M. R. Gazi, M. Banik, S. Das, A. Rai, and S. Kunkri, Macroscopic locality with equal bias reproduces with high fidelity a quantum distribution achieving the Tsirelson’s bound, Phys. Rev. A 88, 052115 (2013), arXiv:1308.4003 [quant-ph].DOI
  21. [21]S. Das, M. Banik, M. R. Gazi, A. Rai, and S. Kunkri, Local orthogonality provides a tight upper bound for Hardy’s nonlocality, Phys. Rev. A 88, 062101 (2013).DOI
  22. [22]N. Miklin and M. Pawłowski, Information causality without concatenation, Phys. Rev. Lett. 126, 220403 (2021), arXiv:2101.12710 [quant-ph].DOI
  23. [23]M. Gachechiladze, B. Bąk, M. Pawłowski, and N. Miklin, Quantum Bell inequalities from Information Causality – tight for Macroscopic Locality, Quantum 6, 717 (2022), arXiv:2103.05029 [quant-ph].DOI
  24. [24]P. Jain, M. Gachechiladze, and N. Miklin, Information causality as a tool for bounding the set of quantum correlations, Phys. Rev. Lett. 133, 160201 (2024), arXiv:2308.02478 [quant-ph].DOI
  25. [25]M. Gachechiladze and N. Miklin, Information causality characterizes the set of quantum correlations in the simplest Bell scenario (2026), arXiv:2609.10508 [quant-ph].arxiv.org/abs/2609.10508
  26. [26]M. Pompili and C. Budroni, Bounding single-copy information causality violations (2026), arXiv:2610.32783 [quant-ph].arxiv.org/abs/2610.32783
  27. [27]S. Sami, I. Chakrabarty, and A. Chaturvedi, Complementarity of genuine multipartite Bell nonlocality, Phys. Rev. A 96, 022121 (2017), arXiv:1603.09120 [quant-ph].
  28. [28]L. Pollyceno, R. Chaves, and R. Rabelo, Information causality in multipartite scenarios, Phys. Rev. A 107, 042203 (2023), arXiv:2212.05601 [quant-ph].DOI
  29. [29]L. Pollyceno, A. Chaturvedi, C. Raj, P. R. Dieguez, and M. Pawlowski, Security of device-independent quantum key distribution via monogamy relations from multipartite information causality, Phys. Rev. A 112, 042201 (2025), arXiv:2405.20115 [quant-ph].DOI
  30. [30]L. Pollyceno, D. Freudenheim, J. Nogueira, A. Chaturvedi, R. Rabelo, and M. Pawlowski, Communication-constrained nonlocal correlations (2026), arXiv:2603.08610 [quant-ph].arxiv.org/abs/2603.08610
  31. [31]S. Rout, A. Chaturvedi, S. S. Bhattacharya, and P. Horodecki, Facets of non-locality and advantage in entanglement-assisted classical communication tasks (2025), arXiv:2507.10830 [quant-ph].arxiv.org/abs/2507.10830
  32. [32]S. Manna, A. Chaturvedi, and D. Saha, Unbounded quantum advantage in communication complexity measured by distinguishability, Phys. Rev. Research 6, 043269 (2024), arXiv:2401.12903 [quant-ph].DOI
  33. [33]S. Manna, A. Pandit, A. Chaturvedi, and D. Saha, Entanglement assisted communication complexity measured by distinguishability (2026), arXiv:2603.19105 [quant-ph].arxiv.org/abs/2603.19105
  34. [34]R. K. Patra, S. G. Naik, E. P. Lobo, S. Sen, G. L. Siddharth, M. Alimuddin, and M. Banik, Principle of information causality rationalizes quantum composition, Phys. Rev. Lett. 130, 110202 (2023), arXiv:2208.13996 [quant-ph].arxiv.org/abs/2208.13996
  35. [35]V. M, R. k. Patra, M. Janpandit, S. Sen, M. Banik, and A. Chaturvedi, Mutually unbiased balanced functions and generalized random access codes, Phys. Rev. A 104, 012420 (2021), arXiv:2105.03932 [quant-ph].DOI
  36. [36]A. Ambainis, M. Banik, A. Chaturvedi, D. Kravchenko, and A. Rai, Parity oblivious d-level random access codes and class of noncontextuality inequalities, Quantum Inf. Process. 18, 111 (2019), arXiv:1607.05490 [quant-ph].arxiv.org/abs/1607.05490
  37. [37]D. Saha and A. Chaturvedi, Preparation contextuality as an essential feature underlying quantum communication advantage, Phys. Rev. A 100, 022108 (2019), arXiv:1802.07215 [quant-ph].DOI
  38. [38]A. Chaturvedi, M. Farkas, and V. J. Wright, Characterising and bounding the set of quantum behaviours in contextuality scenarios, Quantum 5, 484 (2021), arXiv:2100.05853 [quant-ph].DOI
  39. [39]A. Chaturvedi, M. Ray, R. Veynar, and M. Pawlowski, On the security of semi-device-independent QKD protocols, Quantum Inf. Process. 17, 131 (2018), arXiv:1504.00939 [quant-ph].arxiv.org/abs/1504.00939
  40. [40]A. Chaturvedi, G. Viola, E. Panwar, T. Prasad, and D. Saha, Semi-device-independent quantum key distribution from operational assumptions (2026), arXiv:2607.06682 [quant-ph].arxiv.org/abs/2607.06682
  41. [41]M. Pompili and M. Weilenmann, Information causality does not single out the set of quantum correlations (2026), arXiv:2610.06604 [quant-ph].arxiv.org/abs/2610.06604
  42. [42]S. W. Al-Safi and A. J. Short, Information causality from an entropic and a probabilistic perspective, Phys. Rev. A 84, 042323 (2011), arXiv:1107.4031 [quant-ph].DOI
  43. [43]E. Wakakuwa and M. Murao, The chain rule implies Tsirelson’s bound: an approach from generalized mutual information, New J. Phys. 14, 113037 (2012), arXiv:1207.2286 [quant-ph].DOI

Paper details

vlnc:W_zct2u79j
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Not recorded for this paper

View statement
Looking for related papers…
Contents