• Corpus ID: 249926474

Playing nonlocal games with phases of quantum matter

  title={Playing nonlocal games with phases of quantum matter},
  author={Vir B. Bulchandani and Fiona J. Burnell and S. L. Sondhi},
The parity game is an example of a nonlocal game: by sharing a Greenberger-Horne-Zeilinger (GHZ) state before playing this game, the players can win with a higher probability than is allowed by classical physics. The GHZ state of N qubits is also the ground state of the ferromagnetic quantum Ising model on N qubits in the limit of vanishingly weak quantum fluctuations. Motivated by this observation, we examine the probability that N players who share the ground state of a generic quantum Ising… 
1 Citations

Figures from this paper

Quantum algorithms for classical Boolean functions via adaptive measurements: Exponential reductions in space-time resources

The results constitute an alternative proof of an old theorem regarding an oracular separation between the power of constant- depth quantum circuits and constant-depth classical circuits with unbounded fan-in NAND and mod- p gates for any prime p.



A multi-player, multi-team nonlocal game for the toric code

Nonlocal games yield an unusual perspective on entangled quantum states. The defining property of such games is that a set of players in joint possession of an entangled state can win the game with

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.

Topological phases and quantum computation

The basic building block of quantum computation is the qubit, a system with two (nearly) degenerate states that can be used to encode quantum information. Real systems typically have a full

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.

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.

Scaling and Renormalization in Statistical Physics

This text provides a thoroughly modern graduate-level introduction to the theory of critical behaviour. Beginning with a brief review of phase transitions in simple systems and of mean field theory,

Fibonacci and Lucas Numbers With Applications

Preface. List of Symbols. Leonardo Fibonacci. The Rabbit Problem. Fibonacci Numbers in Nature. Fibonacci Numbers: Additional Occurrances. Fibonacci and Lucas Identities. Geometric Paradoxes.

Graph theory

The quantum theory of fields, Vol. 2 (Cambridge university

  • 1995

In order to obtain a non-zero result, the expectation value of a single Wilson loop Ŵ i 0 must be taken in a nonmacroscopically-entangled state