English
Related papers

Related papers: Generalized Tsirelson Inequalities, Commuting-Oper…

200 papers

This paper studies distributed online convex optimization with time-varying coupled constraints, motivated by distributed online control in network systems. Most prior work assumes a separability condition: the global objective and coupled…

Optimization and Control · Mathematics 2026-02-18 Zhaoye Pan , Haozhe Lei , Fan Zuo , Zilin Bian , Tao Li

The Lie-Trotter formula, together with its higher-order generalizations, provides a direct approach to decomposing the exponential of a sum of operators. Despite significant effort, the error scaling of such product formulas remains poorly…

Quantum Physics · Physics 2021-02-05 Andrew M. Childs , Yuan Su , Minh C. Tran , Nathan Wiebe , Shuchen Zhu

Recent work by Clark et al. (2020) shows that transformers can act as 'soft theorem provers' by answering questions over explicitly provided knowledge in natural language. In our work, we take a step closer to emulating formal theorem…

Computation and Language · Computer Science 2020-10-07 Swarnadeep Saha , Sayan Ghosh , Shashank Srivastava , Mohit Bansal

Quantum-proof randomness extractors are an important building block for classical and quantum cryptography as well as device independent randomness amplification and expansion. Furthermore they are also a useful tool in quantum Shannon…

Quantum Physics · Physics 2017-05-05 Mario Berta , Omar Fawzi , Volkher B. Scholz

Linear system games are a generalization of Mermin's magic square game introduced by Cleve and Mittal. They show that perfect strategies for linear system games in the tensor-product model of entanglement correspond to finite-dimensional…

Quantum Physics · Physics 2017-02-01 Richard Cleve , Li Liu , William Slofstra

Motivated by the limitations of near-term quantum devices, we study nonlocal games in the high-noise regime, where the two players may share arbitrarily many copies of a noisy entangled state. In this regime, existing rigidity theorems are…

Quantum Physics · Physics 2026-04-21 Honghao Fu , Minglong Qin , Haochen Xu , Penghui Yao

We produce a decidable super-intuitionistic normal modal logic of internalised intuitionistic (and thus disjunctive and monotonic) interactive proofs (LIiP) from an existing classical counterpart of classical monotonic non-disjunctive…

Logic · Mathematics 2015-09-22 Simon Kramer

This paper focuses on a class of inclusion problems of maximal monotone operators in a multi-agent network, where each agent is characterized by an operator that is not available to any other agents, but the agents can cooperate by…

Optimization and Control · Mathematics 2023-10-25 Kai Gong , Liwei Zhang

This paper investigates the task-driven exploration of unknown environments with mobile sensors communicating compressed measurements. The sensors explore the area and transmit their compressed data to another robot, assisting it to reach…

Robotics · Computer Science 2025-08-19 Evangelos Psomiadis , Dipankar Maity , Panagiotis Tsiotras

Nonlocality and its connections to entanglement are fundamental features of quantum mechanics that have found numerous applications in quantum information science. A set of correlations is said to be nonlocal if it cannot be reproduced by…

Quantum Physics · Physics 2023-11-30 Khashayar Barooti , Alexandru Gheorghiu , Grzegorz Głuch , Marc-Olivier Renou

This paper considers distributed nonconvex optimization with the cost functions being distributed over agents. Noting that information compression is a key tool to reduce the heavy communication load for distributed algorithms as agents…

Optimization and Control · Mathematics 2022-10-10 Xinlei Yi , Shengjun Zhang , Tao Yang , Tianyou Chai , Karl H. Johansson

This paper considers distributed online nonconvex optimization with time-varying inequality constraints over a network of agents. For a time-varying graph, we propose a distributed online primal-dual algorithm with compressed communication…

Optimization and Control · Mathematics 2025-09-01 Kunpeng Zhang , Lei Xu , Xinlei Yi , Ming Cao , Karl H. Johansson , Tianyou Chai , Tao Yang

In this paper, we introduce a new public quantum interactive proof system and the first quantum alternating Turing machine: qAM proof system and qATM, respectively. Both are obtained from their classical counterparts (Arthur-Merlin proof…

Computational Complexity · Computer Science 2012-05-25 Abuzer Yakaryilmaz

We consider a range of "theories" that violate the uncertainty relation for anti-commuting observables derived in [JMP, 49, 062105 (2008)]. We first show that Tsirelson's bound for the CHSH inequality can be derived from this uncertainty…

Quantum Physics · Physics 2011-05-02 Greg Ver Steeg , Stephanie Wehner

Studying generalized non-local theories brings insight to the foundations of quantum mechanics. Here we focus on non-locality swapping, the analogue of quantum entanglement swapping. In order to implement such a protocol, one needs a…

Quantum Physics · Physics 2009-07-15 Paul Skrzypczyk , Nicolas Brunner

In the realm of quantum information processing, the efficient characterization of entangled states poses an overwhelming challenge, rendering the traditional methods including quantum tomography unfeasible and impractical. To tackle this…

Quantum Physics · Physics 2025-12-09 Ye-Chao Liu , Jiangwei Shang

In recent years, agents have become capable of communicating seamlessly via natural language and navigating in environments that involve cooperation and competition, a fact that can introduce social dilemmas. Due to the interleaving of…

Artificial Intelligence · Computer Science 2025-01-28 Maayan Orner , Oleg Maksimov , Akiva Kleinerman , Charles Ortiz , Sarit Kraus

The outcomes of measurements on entangled quantum systems can be nonlocally correlated. However, while it is easy to write down toy theories allowing arbitrary nonlocal correlations, those allowed in quantum mechanics are limited. Quantum…

Quantum Physics · Physics 2015-03-17 Peter Janotta , Christian Gogolin , Jonathan Barrett , Nicolas Brunner

In the context of multiplayer games, the parallel repetition problem can be phrased as follows: given a game $G$ with optimal winning probability $1-\alpha$ and its repeated version $G^n$ (in which $n$ games are played together, in…

Quantum Physics · Physics 2025-06-09 Rotem Arnon , Renato Renner , Thomas Vidick

Multi-agent reinforcement learning has received significant interest in recent years notably due to the advancements made in deep reinforcement learning which have allowed for the developments of new architectures and learning algorithms.…

Multiagent Systems · Computer Science 2018-12-27 Nicolas Anastassacos , Mirco Musolesi