On the relation between completely bounded and $(1,cb)$-summing maps with applications to quantum XOR games

• URL: http://arxiv.org/abs/2112.05214v1
• Date: Thu, 9 Dec 2021 21:06:52 GMT
• Title: On the relation between completely bounded and $(1,cb)$-summing maps with applications to quantum XOR games
• Authors: Marius Junge, Aleksander M. Kubicki, Carlos Palazuelos, Ignacio Villanueva
• Abstract summary: We show that given a linear map from a general operator space into the dual of a C$*$-algebra, its completely bounded norm is upper bounded by a universal constant times its $(''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''
• Score: 65.51757376525798
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this work we show that, given a linear map from a general operator space into the dual of a C$^*$-algebra, its completely bounded norm is upper bounded by a universal constant times its $(1,cb)$-summing norm. This problem is motivated by the study of quantum XOR games in the field of quantum information theory. In particular, our results imply that for such games entangled strategies cannot be arbitrarily better than those strategies using one-way classical communication.

Related papers

• A bound on the quantum value of all compiled nonlocal games [49.32403970784162]
  A cryptographic compiler converts any nonlocal game into an interactive protocol with a single computationally bounded prover. We establish a quantum soundness result for all compiled two-player nonlocal games.
  arXiv  Detail & Related papers  (2024-08-13T08:11:56Z)
• A Quadratic Speedup in Finding Nash Equilibria of Quantum Zero-Sum Games [102.46640028830441]
  We introduce the Optimistic Matrix Multiplicative Weights Update (OMMWU) algorithm and establish its average-iterate convergence complexity as $mathcalO(d/epsilon)$ to $epsilon$-Nash equilibria. This quadratic speed-up sets a new benchmark for computing $epsilon$-Nash equilibria in quantum zero-sum games.
  arXiv  Detail & Related papers  (2023-11-17T20:38:38Z)
• Photonic implementation of the quantum Morra game [69.65384453064829]
  We study a faithful translation of a two-player quantum Morra game, which builds on previous work by including the classical game as a special case. We propose a natural deformation of the game in the quantum regime in which Alice has a winning advantage, breaking the balance of the classical game. We discuss potential applications of the quantum Morra game to the study of quantum information and communication.
  arXiv  Detail & Related papers  (2023-11-14T19:41:50Z)
• On the power of geometrically-local classical and quantum circuits [6.011628409537168]
  We show a relation, based on parallel repetition of the Magic Square game, that can be solved, with probability exponentially close to $1$. We show that the same relation cannot be solved, with an exponentially small success probability. We propose a protocol that can potentially demonstrate verifiable quantum advantage in the NISQ era.
  arXiv  Detail & Related papers  (2023-10-02T18:27:53Z)
• On the power of quantum entanglement in multipartite quantum XOR games [3.655021726150368]
  In particular, quantum entanglement can be a much more powerful resource than local operations and classical communication to play these games. This result shows a strong contrast to the bipartite case, where it was recently proved that the entangled bias is always upper bounded by a universal constant times the one-way classical communication bias.
  arXiv  Detail & Related papers  (2023-02-23T06:26:37Z)
• Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
  We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
  arXiv  Detail & Related papers  (2022-12-06T22:01:49Z)
• Rounding near-optimal quantum strategies for nonlocal games to strategies using maximally entangled states [0.0]
  In particular, we show that near-perfect quantum strategies are approximate representations of the corresponding BCS algebra in the little Frobenius norm. For the class of XOR nonlocal games, we show that near-optimal quantum strategies are approximate representations of the corresponding *-algebra associated with the game.
  arXiv  Detail & Related papers  (2022-03-04T19:05:58Z)
• Quantum-over-classical Advantage in Solving Multiplayer Games [0.0]
  Subtraction games are sometimes referred to as one-heap Nim games. In quantum game theory, a subset of Subtraction games became the first explicitly defined class of zero-sum games. For a narrower subset of Subtraction games, an exact quantum sublinear algorithm is known that surpasses all deterministic algorithms.
  arXiv  Detail & Related papers  (2020-06-12T06:36:07Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)
• Quantum one way vs. classical two way communication in XOR games [0.0]
  We show an example of a XOR game for which $O(n)$ bits of two way classical communication are needed. We also find a characterization for the value of a XOR game assisted with a limited amount of two way communication.
  arXiv  Detail & Related papers  (2020-03-21T20:30:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.