首页/论文/quant-ph/0610175

arXiv quant-ph/06101752006-10-20quant-ph

Pseudo-telepathy: input cardinality and Bell-type inequalities

N. Gisin, A. A. Methot, V. Scarani

备注：: 12 pages, no figures
发表信息：: International Journal of Quantum Information 5: 525-534, 2007.

英文摘要：

Pseudo-telepathy is the most recent form of rejection of locality. Many of its properties have already been discovered: for instance, the minimal entanglement, as well as the minimal cardinality of the output sets, have been characterized. This paper contains two main results. First, we prove that no bipartite pseudo-telepathy game exists, in which one of the partners receives only two questions; as a corollary, we show that the minimal "input cardinality", that is, the minimal number of questions required in a bipartite pseudo-telepathy game, is 3x3. Second, we study the Bell-type inequality derived from the pseudo-telepathy game known as the Magic Square game: we demonstrate that it is a tight inequality for 3 inputs and 4 outputs on each side and discuss its weak resistance to noise.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

量子伪远距游戏与贝尔不等式的定量比较

Quantitative comparison of quantum pseudo-telepathy games and Bell inequalities

HUN-REN Wigner Research Centre for Physics（匈牙利科学院维格纳物理研究中心）；Institute of Mathematics and Informatics, Faculty of Science, University of Pécs（佩奇大学理学院数学与信息学研究所）

本文通过定量比较量子伪远距游戏与贝尔不等式违反，揭示了贝尔不等式在揭示纠缠性方面的有效性。

2026-02-13quant-ph

借助与不借助量子伪心灵感应打破一比特通信

Beating one bit of communication with and without quantum pseudo-telepathy

本研究提出类Bell场景，证明高维态投影测量的两方关联无法用单比特通信模拟，并发现Magic square伪心灵感应游戏等两份拷贝需16x16态打破单比特界限，有望在光学平台实现。

2023-08-21quant-ph

非局域游戏再探：从贝尔局域性到量子伪远距的表示论路径

Nonlocal Games Revisited: A Representation-Theoretic Path from Bell Locality to Quantum Pseudo-Telepathy

Sorbonne Université（索邦大学）

本文通过连接贝尔局域性框架与非局域游戏的多种数学表示，探讨了非局域游戏作为几何对象、优化问题和算子构造的多维视角，揭示了贝尔不等式违反、完美量子策略与半正定松弛之间的关系。

2026-04-10quant-ph

Two-player quantum pseudo-telepathy based on recent all-versus-nothing violations of local realism

We introduce two two-player quantum pseudo-telepathy games based on two recently proposed all-versus-nothing (AVN) proofs of Bell's theorem [A. Cabello, Phys. Rev. Lett. 95, 210401 (2005); Phys. Rev. A 72, 050101(R) (2005)]. These games prove that Broadbent and Methot's claim that these AVN proofs do not rule out local-hidden-variable theories in which it is possible to exchange unlimited information inside the same light-cone (quant-ph/0511047) is incorrect.

2006-02-07quant-ph

通过量子心灵感应协调决策

Coordinating Decisions via Quantum Telepathy

本研究提出将量子心灵感应（贝尔不等式违背）应用于现实问题的框架，以高频交易为例证明其可立即实现量子优势，无需复杂度假设或容错，仅需简单纠缠操作即可超越经典策略。

2025-08-26quant-ph

Minimum entangled state dimension required for pseudo-telepathy

Pseudo-telepathy provides an intuitive way of looking at Bell's inequalities, in which it is often obvious that feats achievable by use of quantum entanglement would be classically impossible. A two-player pseudo-telepathy game proceeds as follows: Alice and Bob are individually asked a question and they must provide an answer. They are not allowed any form of communication once the questions are asked, but they may have agreed on a common strategy prior to the execution of the game. We say that they win the game if the questions and answers fulfil a specific relation. A game exhibits pseudo-t…

2004-12-20quant-ph

更多相关论文收起更多论文

Two theorems of Jhon Bell and Communication Complexity

John Bell taught us that quantum mechanics can not be reproduced by non-contextual and local Hidden variable theory. The impossibility of replacing quantum mechanics by non-contextual Hidden Variable Theory can be turned to a impossible coloring pseudo-telepathy game to be played by two distant players. The game can not be won without communication in the classical world. But if the players share entangled state (quantum correlation) the game can be won deterministically using no communication. This again shows that though quantum correlation can not be used for communication, two parties can …

2005-04-26quant-ph

Linear game non-contextuality and Bell inequalities - a graph-theoretic approach

We study the classical and quantum values of one- and two-party linear games, an important class of unique games that generalizes the well-known XOR games to the case of non-binary outcomes. We introduce a ``constraint graph" associated to such a game, with the constraints defining the linear game represented by an edge-coloring of the graph. We use the graph-theoretic characterization to relate the task of finding equivalent games to the notion of signed graphs and switching equivalence from graph theory. We relate the problem of computing the classical value of single-party anti-correlation …

2015-11-17quant-ph

Multisetting Bell-type inequalities for detecting genuine tripartite entanglement

In a recent paper, Bancal et al. put forward the concept of device-independent witnesses of genuine multipartite entanglement. These witnesses are capable of verifying genuine multipartite entanglement produced in a lab without resorting to any knowledge of the dimension of the state space or of the specific form of the measurement operators. As a by-product they found a three-party three-setting Bell inequality which enables to detect genuine tripartite entanglement in a noisy 3-qubit Greenberger-Horne-Zeilinger (GHZ) state for visibilities as low as 2/3 in a device-independent way. In this p…

2011-02-21quant-ph

Extending and Characterizing Quantum Magic Games

The Mermin-Peres magic square game is a cooperative two-player nonlocal game in which shared quantum entanglement allows the players to win with certainty, while players limited to classical operations cannot do so, a phenomenon dubbed "quantum pseudo-telepathy". The game has a referee separately ask each player to color a subset of a 3x3 grid. The referee checks that their colorings satisfy certain parity constraints that can't all be simultaneously realized. We define a generalization of these games to be played on an arbitrary arrangement of intersecting sets of elements. We characterize ex…

2012-09-18quant-ph

Universal bound on the cardinality of local hidden variables in networks

We present an algebraic description of the sets of local correlations in arbitrary networks, when the parties have finite inputs and outputs. We consider networks generalizing the usual Bell scenarios by the presence of multiple uncorrelated sources. We prove a finite upper bound on the cardinality of the value sets of the local hidden variables. Consequently, we find that the sets of local correlations are connected, closed and semialgebraic, and bounded by tight polynomial Bell-like inequalities.

2017-09-03quant-ph

小输入基数的完美量子策略

Perfect quantum strategies with small input cardinality

本文通过扩展偶数维 Kochen-Specker 集并给出最优使用方式，构造了具有最小输入基数的一族 qudit-qudit 完美量子策略，并证明其关联 Bell 不等式非紧，为 2007 年猜想提供第二个反例。

2024-07-31quant-ph

量子网络贝尔非局域性的最小示例

The minimal example of quantum network Bell nonlocality

University of Geneva（日内瓦大学）；Ulm University（乌尔姆大学）；Center for Integrated Quantum Science and Technology (IQST)（集成量子科学与技术中心）；Sorbonne Université（索邦大学）；CNRS（法国国家科学研究中心）；Polish Academy of Sciences（波兰科学院）；Jagiellonian University（雅盖隆大学）；Constructor University（建构大学）

研究发现三角网络中无需输入选择即可产生贝尔非局域关联，通过构建量子模型验证了非局域性的最小网络配置。

2026-05-01quant-ph

LOCC不可区分的广义贝尔态集合的构造

Construnctions of LOCC indistinguishable set of generalized Bell states

本文基于线性系统和Vandermonde矩阵构造了在$d\otimes d$系统中1-LOCC不可区分的小型广义贝尔态集合，给出了最小基数的统一上界并改进了已有结果。

2018-05-23cs.ITmath.ITquant-ph

挤压纠缠无基数界

No cardinality bound for squashed entanglement

University of Waterloo（滑铁卢大学）

本文证明挤压纠缠的优化无需对条件系统维度设界，并以部分去相位贝尔对为例，说明任何有限维扩展都无法达到其挤压纠缠值。

2026-09-15cs.ITmath.ITquant-ph

Algebraic and geometric properties of local transformations

Some properties of physical systems can be characterized from their correlations. In that framework, subsystems are viewed as abstract devices that receive measurement settings as inputs and produce measurement outcomes as outputs. The labeling convention used to describe these inputs and outputs does not affect the physics; and relabelings are easily implemented by rewiring the input and output ports of the devices. However, a more general class of operations can be achieved by using correlated preprocessing and postprocessing of the inputs and outputs. In contrast to relabelings, some of the…

2020-04-20quant-ph