betaFeedback

WorksPhysics and Astronomy

An Unbounded Separation of Almost-Quantum and Commuting-Operator Correlations in Zero-Error Communication

Abstract

Almost-quantum correlations form the 1+AB\mathtt{1+AB} level of the Navascués–Pironio–Acín hierarchy. They strictly contain the quantum set, are characterized by a single semidefinite program, arise in Sorkin's quantum measure theory, and satisfy several principles proposed to single out quantum theory. We show that they are nevertheless unboundedly stronger than quantum correlations in a zero-error communication task. Alice and Bob receive labels s,t∈[N]s,t\in[N], N≥3N\ge3; after one bit from Alice, Bob must decide whether s=ts=t, never erring but allowed to abstain. For every model of quantum correlations, from finite-dimensional tensor products to commuting operators, the optimal worst-case probability of a conclusive answer is exactly 1/N1/N, the value attained with shared randomness, so the bound does not depend on the resolution of Tsirelson's problem. An explicit family of almost-quantum correlations attains 1/191/19 for every NN. For certificates of equality from binary-outcome boxes, we solve the underlying semidefinite programs in closed form. The almost-quantum optimum equals N2/(17N2−80N+64)N^2/(17N^2-80N+64) for N≥8N\ge8 and tends to 1/171/17. The first level of the hierarchy, which coincides with the set singled out by macroscopic locality, attains N/[8(N−2)]N/[8(N-2)], which tends to 1/81/8; its optimal boxes lie outside the almost-quantum set for every N≥5N\ge5. For longer messages, entanglement saves at most one bit over shared randomness, whereas almost-quantum correlations reduce the one-way zero-error cost of deciding equality of nn-bit strings from nn bits to at most 1313. The quantum bound also yields a linear witness of post-quantumness on a face of the nonsignalling polytope.

Introduction

Quantum theory allows distant observers to share correlations that no classical common cause can explain, and these correlations are a resource for information processing. Shared entanglement can reduce the communication needed to compute distributed functions [1, 2], in some cases exponentially [3, 4, 5]. The origin of this advantage is Bell nonlocality [6, 7, 8, 9]: correlations that admit a local hidden-variable model can be simulated with shared randomness, whereas violations of Bell inequalities can be converted into communication protocols that outperform every classical one [2, 10]. Quantum theory, however, does not exhaust the correlations compatible with relativistic causality, and stronger correlations would be more powerful still. Popescu–Rohrlich (PR) boxes [11, 12], for example, would make communication complexity trivial [13, 14, 15]. Observations of this kind have motivated a long-standing programme to identify physical or information-theoretic principles that rule out supra-quantum correlations and, ideally, single out the quantum set. Prominent candidates include nontrivial communication complexity [14], no advantage for nonlocal computation [16], information causality [17, 18, 19], macroscopic locality [20] and local orthogonality [21].

Almost-quantum (AQ) correlations [22] are the most demanding test case for this programme. They form the “1+AB1 + AB” Level of the Navascués–Pironio–Acín (NPA) hierarchy [23, 24], a set that strictly contains the quantum set yet is characterized by a single semidefinite program. AQ correlations have been proved to satisfy nontrivial communication complexity, no advantage for nonlocal computation, macroscopic locality and local orthogonality [22], and numerical evidence suggested that they also satisfy information causality [22]. They also arise outside the Hilbert-space formalism. In Sorkin’s quantum measure theory [25], a histories-based generalization of quantum mechanics, strongly positive decoherence functionals yield correlations lying between the AQ set and NPA Level 1, and exactly the AQ set when later measurements may depend on earlier outcomes [26]. The AQ set also follows from a principle of macroscopic noncontextuality [27]. Bipartite principles may in any case be insufficient to recover the quantum set [28], and the known arguments that exclude AQ correlations, based on Specker’s principle in contextuality scenarios [29] and on the no-restriction hypothesis for generalized probabilistic theories [30], rely on structure beyond correlations in Bell scenarios. Within Bell scenarios, none of the principles listed above other than information causality is known to exclude AQ correlations; that information causality does so, with the AQ boxes constructed here, is shown in a companion work [31] (see the Note added at the end of § 9). Is the difference between AQ and quantum correlations then also negligible in operational terms?

Here we show that it is not. We consider a simple communication task. Alice and Bob each receive one of NN labels, Alice sends a single bit to Bob, and Bob must decide whether their labels coincide; he may abstain, but he must never be wrong. The figure of merit is the worst-case probability that Bob answers conclusively. We prove that, for every N≥3N \ge3, no quantum strategy exceeds 1/N1/N, the value already attained with shared randomness. This holds for finite- and infinite-dimensional entanglement alike, and also in the commuting-operator framework of quantum field theory. In contrast, an explicit family of AQ correlations, one for each NN, achieves 1/191/19, so the ratio between AQ and quantum performance grows without bound. For certificates of equality obtained from binary-outcome boxes, we determine the optimal AQ performance exactly: it exceeds the quantum value precisely when N≥9N \ge9 and tends to 1/171/17 as NN grows. The gap persists for longer messages. Entanglement never saves more than one bit over shared randomness, whereas AQ correlations reduce the one-way zero-error cost of deciding whether two nn-bit strings are equal, with abstention probability at most 1/21/2 on every input pair, from nn bits to at most 13.

The quantum bound also yields an exact-zero (face) witness of post-quantumness: a linear inequality that holds for all commuting-operator correlations on a face of the nonsignalling polytope, namely for boxes with prescribed vanishing entries, and that our AQ correlations violate by a factor growing linearly with NN. For tensor-product models, the inequality underlying this witness, as well as linear lower bounds on entanglement-assisted one-sided-error and zero-error communication for equality, were obtained earlier by Klauck and de Wolf [32]; Appendix § 11 compares their results with ours in detail. Our contributions on the quantum side are the exact one-bit value 1/N1/N, its refinement for longer messages and the extension of both to commuting operators.

The separation arises exactly at the boundary between the commuting-operator set and the AQ set. These differ only in whether Alice’s and Bob’s operators commute as operator identities or merely when acting on the shared state. Our quantum bound rests on a sequential-measurement argument that requires Bob’s operators to commute with products of Alice’s operators. The AQ condition guarantees commutation only for single operators acting on the state, and the correlations we construct exploit precisely this freedom.

The task also separates the AQ set from the next level of the NPA hierarchy. Level 1, the set CVecC_{\mathrm{Vec}} of vector correlations, contains the AQ set and coincides with the set singled out by macroscopic locality [20]. Its defining semidefinite constraint involves only the vectors ψ\psi, Aa∣xψA_{a|x}\psi and Bb∣yψB_{b|y}\psi, whereas that of the 1+AB1+\mathrm{AB} level also involves the vectors Aa∣xBb∣yψA_{a|x}B_{b|y}\psi. For CVecC_{\mathrm{Vec}} we determine the optimal certificate of equality from binary-outcome boxes in closed form. It equals N/[8(N−2)]N/[8(N-2)] for every N≥4N \ge4, exceeds the quantum value precisely when N≥5N \ge5, and decreases to 1/81/8, more than twice the AQ limit 1/171/17. The proof is elementary: the upper bound follows from the nonnegativity of two squared norms, and an explicit realization in N+1N+1 dimensions attains it. Since the level-1 optimum exceeds the AQ optimum for every N≥5N \ge5, the optimal level-1 boxes form an explicit family in CVec∖CAQC_{\mathrm{Vec}} \setminus C_{\mathrm{AQ}}, and thus separate the two sets analytically in an operational task. Macroscopic locality alone therefore permits certificates of equality approaching 1/81/8, and the constraints that distinguish the 1+AB1+\mathrm{AB} level from Level 1 lower this limit to 1/171/17. Combined with the classical certificate of inequality, level-1 correlations also solve the one-bit task with worst-case probability N/(10N−16)>1/10N/(10N-16) > 1/10 for every N≥4N \ge4.

The paper is organized as follows. § 2 defines the correlation models and records two closure properties of the AQ set, and § 3 introduces the communication task. § 4 proves the packing lemma, the quantum sum rule and the value 1/N1/N for all quantum models. § 5 constructs the AQ boxes p⋆p^\star, reduces AQ membership on the relevant face of the nonsignalling polytope to a condition on vectors with prescribed inner products, and determines the optimal AQ certificate of equality. § 6 derives the exact-zero witness and determines when p⋆p^\star is local, and § 7 treats longer messages and communication cost. § 8 determines the optimal certificate of equality at Level 1 of the NPA hierarchy and uses it to separate this level from the AQ set. § 9 discusses the results and open questions, and Appendix § 10 gives an explicit local model for p⋆p^\star. Appendix § 11 compares our quantum bounds with the earlier work of Klauck and de Wolf [32]. Table 1 summarizes the results: it separates the quantities that are determined exactly from those for which only bounds are known, and lists the values of NN from which each construction takes effect.

QuantityValueStatus
One-bit task, Ω\Omega from CL\mathrm{C}_{\mathrm{L}} to Cqc\mathrm{C}_{\mathrm{qc}}: ηΩ(N)\eta_{\Omega}(N)1/N1/Nexact (Corollary 1)
Binary-box AQ certificate of equality: ηAQeq(N)\eta_{\mathrm{AQ}}^{\mathrm{eq}}(N)Eq. (14)exact (Theorem 3)
One-bit task, almost-quantum: ηAQ(N)\eta_{\mathrm{AQ}}(N)≥1/19\ge1/19; Eq. (13)lower bounds only; optimum open
Binary-box certificate of equality, vector correlations: ηCVeceq(N)\eta_{\mathrm{CVec}}^{\mathrm{eq}}(N)Eq. (25)exact (Proposition 2)
One-bit task, vector correlations: ηCVec(N)\eta_{\mathrm{CVec}}(N)≥N/(10N−16)\ge N/(10N-16)lower bound only
ConstructionFirst NNReference
Optimal vector-correlation certificate exceeds 1/N1/N5Proposition 2
Optimal vector-correlation box lies outside CAQ\mathrm{C}_{\mathrm{AQ}}5§ 8
Optimal AQ certificate of equality exceeds 1/N1/N9Theorem 3
Mixture with the optimal level-1 boxes exceeds ηQ(N)\eta_{\mathrm{Q}}(N)9Eq. (13)
Mixture with the optimal boxes exceeds ηQ(N)\eta_{\mathrm{Q}}(N)14Eq. (13)
p∗p^{*} is nonlocal14Proposition 1
p∗p^{*} violates the face witness (21)18Corollary 2
1/191/19 protocol exceeds ηQ(N)\eta_{\mathrm{Q}}(N)20Theorem 2

Table 1. Table 1. Summary of the results. Upper part: the efficiencies studied, and what is known about each. Lower part: the smallest NN from which each explicit construction takes effect. Here ηQ(N)=1/N\eta_{\mathrm{Q}}(N)=1/N is the common value of all quantum models.

Correlation models

Consider two spacelike-separated laboratories that share a source. In each round, Alice chooses a measurement setting x∈Xx \in\mathcal{X} and records an outcome a∈Aa \in\mathcal{A}; Bob independently chooses y∈Yy \in\mathcal{Y} and records b∈Bb \in\mathcal{B}. All four alphabets are finite. Repeating the experiment produces the behaviour (or box) p={p(a,b∣x,y)}\mathbf{p} = \{p(a,b|x,y)\}, with p(a,b∣x,y)≥0p(a,b|x,y) \ge0 and ∑a,bp(a,b∣x,y)=1\sum_{a,b} p(a,b|x,y) = 1. Throughout, x,yx,y denote box settings and a,ba,b box outcomes; the inputs of the communication task are denoted by s,ts,t. The data alone do not fix a physical model of the source and the devices, and different assumptions about the two laboratories lead to different sets of admissible behaviours [33, 34, 35, 36]. The sets relevant here are defined as follows.

Alice’s measurements are denoted {Aa∣x}a\{A_{a|x}\}_a and Bob’s {Bb∣y}b\{B_{b|y}\}_b. In the Hilbert-space models below they are projective, Aa∣x=Aa∣x†=Aa∣x2A_{a|x}=A_{a|x}^{\dagger}=A_{a|x}^{2} and ∑aAa∣x=I\sum_a A_{a|x}=\mathbb{I}, and likewise for Bob. For CqC_{\mathrm{q}} and CqcC_{\mathrm{q c}}, allowing general POVMs gives the same sets, by Naimark dilation in the first case and by a less elementary argument in the second [36].

[CL][\mathrm{C}_{\mathrm{L}}] Local hidden variables. Alice’s and Bob’s outcomes are spacelike separated. Reichenbach’s common-cause principle [37] then requires that their correlation be explained by a common cause λ\lambda emitted by the source, and that conditioning on λ\lambda screen the outcomes off from each other, p(a,b∣x,y,λ)=pA(a∣x,λ)pB(b∣y,λ)p(a,b|x,y,\lambda)=p_{\mathrm{A}}(a|x,\lambda)p_{\mathrm{B}}(b|y,\lambda). In addition, the settings are assumed to be chosen independently of λ\lambda. Together these yield Bell’s local-causality condition [6, 38], p(a,b∣x,y)=p(a,b|x,y)= ∑λq(λ) pA(a∣x,λ) pB(b∣y,λ)\sum_{\lambda}q(\lambda)\,p_{\mathrm{A}}(a|x,\lambda)\,p_{\mathrm{B}}(b|y,\lambda). Quantum violations of this condition admit no classical causal explanation without fine-tuning [39].

[Cq] Finite-dimensional quantum. Alice’s and Bob’s systems have finite-dimensional Hilbert spaces HA\mathcal{H}_{\mathrm{A}} and HB\mathcal{H}_{\mathrm{B}}. The source prepares a unit vector ψ∈HA⊗HB\psi\in\mathcal{H}_{\mathrm{A}}\otimes\mathcal{H}_{\mathrm{B}}, and p(a,b∣x,y)=⟨ψ,(Aa∣x⊗Bb∣y)ψ⟩p(a,b|x,y)=\langle\psi,(\mathsf{A}_{a|x}\otimes\mathsf{B}_{b|y})\psi\rangle. Mixed states give nothing new, since they can be purified in a larger finite-dimensional space.

[Cqs] Spatial quantum. As Cq\mathrm{C}_{\mathrm{q}}, but HA\mathcal{H}_{\mathrm{A}} and HB\mathcal{H}_{\mathrm{B}} may be infinite dimensional.

[Cqa] Approximately quantum. The closure Cq‾=Cqs\overline{\mathrm{C}_{\mathrm{q}}}=\mathrm{C}_{\mathrm{qs}}: behaviours that can be approximated to arbitrary precision by finite-dimensional quantum experiments.

[Cqc] Commuting-operator quantum. The two laboratories are not assumed to be tensor factors. Instead there is a single Hilbert space H\mathcal{H}, a unit vector ψ∈H\psi\in\mathcal{H}, and Alice’s and Bob’s observables commute as operators, [Aa∣x,Bb∣y]=0[\mathsf{A}_{a|x},\mathsf{B}_{b|y}]=0, with p(a,b∣x,y)=⟨ψ,Aa∣xBb∣yψ⟩p(a,b|x,y)=\langle\psi,\mathsf{A}_{a|x}\mathsf{B}_{b|y}\psi\rangle. This is how locality is encoded in algebraic quantum field theory, where observables localized in spacelike-separated regions commute [40].

[CAQ] Almost quantum. As Cqc\mathrm{C}_{\mathrm{qc}}, but commutation is required only on the state prepared by the source:

Definition 1 (Almost-quantum correlations [22]). A behaviour pp belongs to CAQ\mathrm{C}_{\mathrm{AQ}} if there exist a Hilbert space H\mathcal{H}, a unit vector ψ∈H\psi\in\mathcal{H}, and projective measurements {Aa∣x}a\{\mathsf{A}_{a|x}\}_{a}, {Bb∣y}b\{\mathsf{B}_{b|y}\}_{b} on H\mathcal{H} such that, for all a,b,x,ya,b,x,y,

Aa∣xBb∣yψ=Bb∣yAa∣xψandp(a,b∣x,y)=⟨ψ,Aa∣xBb∣yψ⟩.(1)\mathsf{A}_{a|x}\mathsf{B}_{b|y}\psi=\mathsf{B}_{b|y}\mathsf{A}_{a|x}\psi \quad\text{and}\quad p(a,b|x,y)=\langle\psi,\mathsf{A}_{a|x}\mathsf{B}_{b|y}\psi\rangle. \tag*{(1)}

Thus CAQ\mathrm{C}_{\mathrm{AQ}} differs from Cqc\mathrm{C}_{\mathrm{qc}} only in that commutation is imposed on the state ψ\psi rather than as an operator identity. Equivalently, CAQ\mathrm{C}_{\mathrm{AQ}} is Level 1 + AB of the NPA hierarchy, characterized by a single semidefinite program [22].

References

  1. [1]Richard Cleve and Harry Buhrman. Substituting quantum entanglement for communication. Phys. Rev. A, 56:1201, 1997. doi:10.1103/PhysRevA.56.1201.DOI
  2. [2]Harry Buhrman, Richard Cleve, Serge Massar, and Ronald de Wolf. Nonlocality and communication complexity. Rev. Mod. Phys., 82:665, 2010. doi:10.1103/RevModPhys.82.665.DOI
  3. [3]Harry Buhrman, Richard Cleve, and Avi Wigderson. Quantum vs. classical communication and computation. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC ’98), pages 63–68, New York, 1998. ACM. doi:10.1145/276698.276713.DOI
  4. [4]Harry Buhrman, Oded Regev, Giannicola Scarpa, and Ronald de Wolf. Near-optimal and explicit Bell inequality violations. Theory Comput., 8:623–645, 2012. doi:10.4086/toc.2012.v008a027.DOI
  5. [5]Ananya Chakraborty, Manik Banik, and Ronald de Wolf. Exponential Advantage of Multipartite Entanglement over Quantum Communication with Applications to Bounded-Storage Cryptography, 2026. URL https://arxiv.org/abs/2607.27957.
  6. [6]John S. Bell. On the Einstein Podolsky Rosen paradox. Physics Physique Fizika, 1:195, 1964. doi:10.1103/PhysicsPhysiqueFizika.1.195.DOI
  7. [7]John S. Bell. On the Problem of Hidden Variables in Quantum Mechanics. Rev. Mod. Phys., 38:447, 1966. doi:10.1103/RevModPhys.38.447.DOI
  8. [8]N. David Mermin. Hidden variables and the two theorems of John Bell. Rev. Mod. Phys., 65:803, 1993. doi:10.1103/RevModPhys.65.803.DOI
  9. [9]Nicolas Brunner, Daniel Cavalcanti, Stefano Pironio, Valerio Scarani, and Stephanie Wehner. Bell nonlocality. Rev. Mod. Phys., 86:419, 2014. doi:10.1103/RevModPhys.86.419.DOI
  10. [10]Časlav Brukner, Marek Žukowski, Jian-Wei Pan, and Anton Zeilinger. Bell’s inequalities and quantum communication complexity. Phys. Rev. Lett., 92:127901, 2004. doi:10.1103/PhysRevLett.92.127901.DOI
  11. [11]Sandu Popescu and Daniel Rohrlich. Quantum nonlocality as an axiom. Found. Phys., 24:379, 1994. doi:10.1007/BF02058098.DOI
  12. [12]Sandu Popescu. Nonlocality beyond quantum mechanics. Nat. Phys., 10:264, 2014. doi:10.1038/nphys2916.DOI
  13. [13]Wim van Dam. Implausible consequences of superstrong nonlocality. Nat. Comput., 12:9, 2013. doi:10.1007/s11047-012-9353-6.DOI
  14. [14]Gilles Brassard, Harry Buhrman, Noah Linden, André Allan Méthot, Alain Tapp, and Falk Unger. Limit on Nonlocality in Any World in Which Communication Complexity Is Not Trivial. Phys. Rev. Lett., 96:250401, 2006. doi:10.1103/PhysRevLett.96.250401.DOI
  15. [15]Nicolas Brunner and Paul Skrzypczyk. Nonlocality Distillation and Postquantum Theories with Trivial Communication Complexity. Phys. Rev. Lett., 102:160403, 2009. doi:10.1103/PhysRevLett.102.160403.DOI
  16. [16]Noah Linden, Sandu Popescu, Anthony J. Short, and Andreas Winter. Quantum nonlocality and beyond: Limits from nonlocal computation. Phys. Rev. Lett., 99:180502, 2007. doi:10.1103/PhysRevLett.99.180502.DOI
  17. [17]Marcin Pawłowski, Tomasz Paterek, Dagomir Kaszlikowski, Valerio Scarani, Andreas Winter, and Marek Żukowski. Information causality as a physical principle. Nature, 461:1101, 2009. doi:10.1038/nature08400.DOI
  18. [18]Daniel Cavalcanti, Alejo Salles, and Valerio Scarani. Macroscopically local correlations can violate information causality. Nat. Commun., 1:136, 2010. doi:10.1038/ncomms1138.DOI
  19. [19]Ram Krishna Patra, Sahil Gopalkrishna Naik, Edwin Peter Lobo, Samrat Sen, Govind Lal Sidhardh, Mir Alimuddin, and Manik Banik. Principle of information causality rationalizes quantum composition. Phys. Rev. Lett., 130:110202, 2023. doi:10.1103/PhysRevLett.130.110202.DOI
  20. [20]Miguel Navascués and Harald Wunderlich. A glance beyond the quantum model. Proc. R. Soc. A, 466:881, 2010. doi:10.1098/rspa.2009.0453.DOI
  21. [21]Tobias Fritz, Ana Belén Sainz, Remigiusz Augusiak, Jonatan Bohr Brask, Rafael Chaves, Anthony Leverrier, and Antonio Acín. Local orthogonality as a multipartite principle for quantum correlations. Nat. Commun., 4:2263, 2013. doi:10.1038/ncomms3263.DOI
  22. [22]Miguel Navascués, Yelena Guryanova, Matty J. Hoban, and Antonio Acín. Almost quantum correlations. Nat. Commun., 6:6288, 2015. doi:10.1038/ncomms7288.DOI
  23. [23]Miguel Navascués, Stefano Pironio, and Antonio Acín. Bounding the set of quantum correlations. Phys. Rev. Lett., 98:010401, 2007. doi:10.1103/PhysRevLett.98.010401.DOI
  24. [24]Miguel Navascués, Stefano Pironio, and Antonio Acín. A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations. New J. Phys., 10:073013, 2008. doi:10.1088/1367-2630/10/7/073013.DOI
  25. [25]Rafael D. Sorkin. Quantum mechanics as quantum measure theory. Mod. Phys. Lett. A, 9:3119, 1994. doi:10.1142/S021773239400294X.DOI
  26. [26]Fay Dowker, Joe Henson, and Petros Wallden. A histories perspective on characterizing quantum non-locality. New J. Phys., 16:033033, 2014. doi:10.1088/1367-2630/16/3/033033.DOI
  27. [27]Joe Henson and Ana Belén Sainz. Macroscopic noncontextuality as a principle for almost-quantum correlations. Phys. Rev. A, 91:042114, 2015. doi:10.1103/PhysRevA.91.042114.DOI
  28. [28]Rodrigo Gallego, Lars Erik Würflinger, Antonio Acín, and Miguel Navascués. Quantum correlations require multipartite information principles. Phys. Rev. Lett., 107:210403, 2011. doi:10.1103/PhysRevLett.107.210403.DOI
  29. [29]Tomáš Gonda, Ravi Kunjwal, David Schmid, Elie Wolfe, and Ana Belén Sainz. Almost quantum correlations are inconsistent with Specker’s principle. Quantum, 2:87, 2018. doi:10.22331/q-2018-08-27-87.DOI
  30. [30]Ana Belén Sainz, Yelena Guryanova, Antonio Acín, and Miguel Navascués. Almost-quantum correlations violate the no-restriction hypothesis. Phys. Rev. Lett., 120:200402, 2018. doi:10.1103/PhysRevLett.120.200402.DOI
  31. [31]Anandamay Das Bhowmik and Manik Banik. Almost-Quantum Correlations Violate Information Causality, 2026. [companion paper].
  32. [32]Hartmut Klauck and Ronald de Wolf. Fooling one-sided quantum protocols. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), volume 20 of Leibniz International Proceedings in Informatics (LIPIcs), pages 424–433, Dagstuhl, 2013. Schloss Dagstuhl–Leibniz-Zentrum für Informatik. doi:10.4230/LIPIcs.STACS.2013.424. arXiv:1204.4619.DOI
  33. [33]Boris S. Tsirelson. Some results and problems on quantum Bell-type inequalities. Hadronic J. Suppl., 8:329, 1993.
  34. [34]Tobias Fritz. Tsirelson’s problem and Kirchberg’s conjecture. Rev. Math. Phys., 24:1250012, 2012. doi:10.1142/S0129055X125000122.DOI
  35. [35]Marius Junge, Miguel Navascués, Carlos Palazuelos, David Pérez-García, Volkher B. Scholz, and Reinhard F. Werner. Connes’ embedding problem and Tsirelson’s problem. J. Math. Phys., 52:012102, 2011. doi:10.1063/1.3514538.DOI
  36. [36]Ken Dykema, Vern I. Paulsen, and Jitendra Prakash. The Delta game. arXiv:1707.06186 [math.OA], 2017.arxiv.org/abs/1707.06186
  37. [37]Hans Reichenbach. The Direction of Time. University of California Press, Berkeley, 1956.
  38. [38]John S. Bell. La nouvelle cuisine. In A. Sarlemijn and P. Kroes, editors, Between Science and Technology, page 97. Elsevier, Amsterdam, 1990. doi:10.1016/B978-0-444-88659-0.50010-7.DOI
  39. [39]Christopher J. Wood and Robert W. Spekkens. The lesson of causal discovery algorithms for quantum correlations: causal explanations of Bell-inequality violations require fine-tuning. New J. Phys., 17:033002, 2015. doi:10.1088/1367-2630/17/3/033002.DOI
  40. [40]Rudolf Haag and Daniel Kastler. An algebraic approach to quantum field theory. J. Math. Phys., 5:848, 1964. doi:10.1063/1.1704187.DOI
  41. [41]Andrea Coladangelo and Jalex Stark. An inherently infinite-dimensional quantum correlation. Nat. Commun., 11:3335, 2020. doi:10.1038/s41467-020-17077-9.DOI
  42. [42]William Slofstra. The set of quantum correlations is not closed. Forum Math. Pi, 7:e1, 2019. doi:10.1017/fmp.2018.3.DOI
  43. [43]Volkher B. Scholz and Reinhard F. Werner. Tsirelson’s problem. arXiv:0812.4305 [math-ph], 2008.arxiv.org/abs/0812.4305
  44. [44]NArutaka Ozawa. About the Connes embedding conjecture: algebraic approaches. Jpn. J. Math., 8:147, 2013. doi:10.1007/s11537-013-1280-5.DOI
  45. [45]Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, and Henry Yuen. MIP*=RE. arXiv:2001.04383 [quant-ph], 2020.arxiv.org/abs/2001.04383
  46. [46]Boris S. Cirel’son. Quantum generalizations of Bell’s inequality. Lett. Math. Phys., 4:93, 1980. doi:10.1007/BF00417500.DOI
  47. [47]I. D. Ivanovic. How to differentiate between non-orthogonal states. Phys. Lett. A, 123:257, 1987. doi:10.1016/0375-9601(87)90222-2.DOI
  48. [48]D. Dieks. Overlap and distinguishability of quantum states. Phys. Lett. A, 126:303, 1988. doi:10.1016/0375-9601(88)90840-7.DOI
  49. [49]Asher Peres. How to differentiate between non-orthogonal states. Phys. Lett. A, 128:19, 1988. doi:10.1016/0375-9601(88)91034-1.DOI
  50. [50]Andrew Chi-Chih Yao. Some complexity questions related to distributive computing. In Proceedings of the 11th Annual ACM Symposium on Theory of Computing (STOC ’79), pages 209–213, New York, 1979. ACM. doi:10.1145/800135.804414.DOI
  51. [51]Eyal Kushilevitz and Noam Nisan. Communication Complexity. Cambridge University Press, Cambridge, 1997. doi:10.1017/CBO9780511574948.
  52. [52]Ilan Newman. Private vs. common random bits in communication complexity. Inf. Process. Lett., 39:67, 1991. doi:10.1016/0020-0190(91)90157-D.DOI
  53. [53]Harry Buhrman, Richard Cleve, John Watrous, and Ronald de Wolf. Quantum fingerprinting. Phys. Rev. Lett., 87:167902, 2001. doi:10.1103/PhysRevLett.87.167902.DOI
  54. [54]Andris Ambainis. Communication complexity in a 3-computer model. Algorithmica, 16:298, 1996. doi:10.1007/BF01955678.DOI
  55. [55]Ilan Newman and Mario Szegedy. Public vs. private coin flips in one round communication games. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC ’96), pages 561–570, New York, 1996. ACM. doi:10.1145/237814.238004.DOI
  56. [56]Kurt Mehlhorn and Erik M. Schmidt. Las Vegas is better than determinism in VLSI and distributed computing. In Proceedings of the 14th Annual ACM Symposium on Theory of Computing (STOC ’82), pages 330–337, New York, 1982. ACM. doi:10.1145/800070.802208.DOI
  57. [57]Hartmut Klauck. On quantum and probabilistic communication: Las Vegas and one-way protocols. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC ’00), pages 644–651, New York, 2000. ACM. doi:10.1145/335305.335396.DOI
  58. [58]Andreas Winter. Coding theorem and strong converse for quantum channels. IEEE Trans. Inf. Theory, 45:2481, 1999. doi:10.1109/18.796385.DOI
  59. [59]Pranab Sen. Achieving the Han-Kobayashi inner bound for the quantum interference channel. In Proceedings of the IEEE International Symposium on Information Theory (ISIT), pages 736–740, 2012. doi:10.1109/ISIT.2012.6284656. arXiv:1109.0802.DOI
  60. [60]Mark M. Wilde. Sequential decoding of a general classical-quantum channel. Proc. R. Soc. A, 469:20130259, 2013. doi:10.1098/rspa.2013.0259.DOI
  61. [61]Jingliang Gao. Quantum union bounds for sequential projective measurements. Phys. Rev. A, 92:052331, 2015. doi:10.1103/PhysRevA.92.052331.DOI
  62. [62]Teiko Heinosaari and Michael M. Wolf. Nondisturbing quantum measurements. J. Math. Phys., 51:092201, 2010. doi:10.1063/1.3480658.DOI
  63. [63]Mafalda L. Almeida, Jean-Daniel Bancal, Nicolas Brunner, Antonio Acín, Nicolas Gisin, and Stefano Pironio. Guess your neighbor’s input: A multipartite nonlocal game with no quantum advantage. Phys. Rev. Lett., 104:230404, 2010. doi:10.1103/PhysRevLett.104.230404.DOI
  64. [64]Marius Junge and Carlos Palazuelos. Large violation of Bell inequalities with low entanglement. Commun. Math. Phys., 306:695–746, 2011. doi:10.1007/s00220-011-1296-8.DOI
  65. [65]Luca Bombelli, Joohan Lee, David Meyer, and Rafael D. Sorkin. Space-time as a causal set. Phys. Rev. Lett., 59:521, 1987. doi:10.1103/PhysRevLett.59.521.
  66. [66]Charles H. Bennett and Stephen J. Wiesner. Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states. Phys. Rev. Lett., 69:2881–2884, 1992. doi:10.1103/PhysRevLett.69.2881.DOI
  67. [67]Charles H. Bennett, Gilles Brassard, Claude Crépeau, Richard Jozsa, Asher Peres, and William K. Wootters. Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. Phys. Rev. Lett., 70:1895–1899, 1993. doi:10.1103/PhysRevLett.70.1895.DOI

Paper details

vlnc:W_hvsp63uf
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

Claude, ChatGPT

View statement
Looking for related papers…
Contents