A multiplayer multiteam nonlocal game for the toric code

  title={A multiplayer multiteam nonlocal game for the toric code},
  author={Vir B. Bulchandani and Fiona J. Burnell and S. L. Sondhi},
  journal={Physical Review B},

Figures from this paper



Recasting mermin's multi-player game into the framework of pseudo-telepathy

An upper bound on the best possible classical strategy for attempting to play this game is proved, as well as a novel, matching lower bound on how well imperfect quantum-mechanical apparatus must perform in order to exhibit a behaviour that would be classically impossible to explain.

Playing Quantum Nonlocal Games with Six Noisy Qubits on the Cloud

The present implementation of the nonlocal game proposed in Science 362, 308 (2018) includes several levels of optimization, such as circuit identities and error mitigation, and allows us to cross the classical threshold and demonstrate quantum advantage in one quantum computer.

A Simple Protocol for Verifiable Delegation of Quantum Computation in One Round

The parameters of the protocol make it possible to prove security even if the servers are allowed to communicate, but respecting the plausible assumption that information cannot be propagated faster than speed of light, making it the first relativistic protocol for quantum computation.

Quantum Pseudo-Telepathy

Pseudo-telepathy is a surprising application of quantum information processing to communication complexity and a survey of recent and not-so-recent work on the subject is presented.

Self testing quantum apparatus

If the nine distinct probability distributions that are generated by the self checking configuration, one for each pair of angles, are consistent with the specifications, the source and the two measurement apparatus are guaranteed to be identical to the claimed specifications up to a local change of basis on each side.

The sheaf-theoretic structure of non-locality and contextuality

It is shown that contextuality, and non-locality as a special case, correspond exactly to obstructions to the existence of global sections, and a linear algebraic approach to computing these obstructions is described, which allows a systematic treatment of arguments for non- Locality and contextuality.

Quantum advantage with shallow circuits

It is shown that parallel quantum algorithms running in a constant time period are strictly more powerful than their classical counterparts; they are provably better at solving certain linear algebra problems associated with binary quadratic forms.

Contextuality supplies the ‘magic’ for quantum computation

This work proves a remarkable equivalence between the onset of contextuality and the possibility of universal quantum computation via ‘magic state’ distillation, which is the leading model for experimentally realizing a fault-tolerant quantum computer.

Classical command of quantum systems

A scheme is described that can be used to determine the initial state and to classically command the system to evolve according to desired dynamics, and makes it possible to test whether a claimed quantum computer is truly quantum.