Tag Info

Accepted

What exactly are Quantum XOR Games?

Quantum xor games are a method of greatly simplifying the ideas behind Bell's theorem, which states that no physical theory of local hidden variables can ever reproduce all of the predictions of ...
• 3,908

Optimal strategy to a quantum state game

We simply translate the binary result of a qubit measurement to our guess whether it's the first state or the second, calculate the probability of success for every possible measurement of the qubit, ...
• 201

Algorithm-based game project to introduce quantum computing

This is definitely doable, but the tasks seem quite simple and they only introduce single-qubit measurement and the X gate, while quantum state preparation usually involves some superposition and ...
• 8,116
Accepted

Are correlations stronger than those allowed by quantum mechanics possible?

Yes, it is possible to conceive theories with "stronger correlations" than those given by quantum mechanics. One way to make this statement precise is to consider some kind of "measurement apparatus" ...
• 18.7k
Accepted

In which paper was the CHSH game first presented?

As far as I have been researching from the intrenet about the CHSH game, the first experimental realization seems to be the one published by Aspect in Experimental Realization of Einstein-Podolsky-...
Accepted

How can quantum computing win 97% of times in coin flipping experiment?

We translate this game into conventional QC terminology as follows: The coin is a single qbit state $|\psi\rangle=\begin{bmatrix}\alpha \\ \beta\end{bmatrix}$ where $\alpha, \beta \in \mathbb{C}$ and ...
• 3,908

Proof of optimality for CHSH game classical strategy

I would argue that this is the critical issue to understand for Bell inequalities. Finding a violation of a Bell inequality tells you that the system is not classical (note: it does not prove that it ...
• 47.1k
Accepted

Is Connes' Embedding Problem akin the word problem for finitely presented groups?

There are a number of equivalent formulations to CEP. One of them is Tsirelson's problem from quantum information theory, which asks whether the infinite dimensional commuting operator correlations ...
• 251

How could a quantum computer perform nimber arithmetic?

Nonlocal games such as the CHSH game are not impartial games in the sense of Sprague-Grundy. Alice and Bob are thought to be cooperating rather than competing, and randomness is central to the study ...
• 359

Has anyone analyzed multi-round nonlocal games?

It seems that using more rounds will not be such helpful for us to get something more powerful from complexity perspectives. There are a few comments about the number of rounds and the number of ...
• 478

Proof of optimality for CHSH game classical strategy

One way to go about proving this is to characterise the set of all possible strategies that Alice & Bob can adopt. By "strategy" here I mean a possible relation between inputs and outputs, encoded ...
• 18.7k

What is the quantum strategy required to win the Magic Squares game

Instead of $0$s and $1$s, suppose the labels of the column/rows are $+1$ and $-1$ respectively. Then if the rows are labelled $(1,1,1)$ (instead of $(0,0,0)$) and the columns are labelled $(1,1,-1)$ (...
• 1,512
Accepted

How are nonlocal games used in device-independent quantum cryptography?

Imagine you're playing a CHSH game with someone, although you don't know what quantum system it is that you're playing with, or even what measurements it is that you're doing on the system. You just ...
• 47.1k

Algorithm-based game project to introduce quantum computing

They certainly seem doable. I'd suggest the first one, as it is a little more complex. For added complexity you could also include constraints on the allowed gates, such as not allowing X or Y on ...
• 10.6k
Accepted

Using XOR games to benchmark quantum computers

If you look at the literature for blind quantum computation, there is the concept of a "trap state". Basically, something that isn't part of the main computation that is supposed to give specific ...
• 47.1k

Algorithm-based game project to introduce quantum computing

Consider the task on one qubit. You are given a state that is either $H|0\rangle$ or $H|1\rangle$ and your task before the measurement is to get it to be either more probably $|0\rangle$ or $|1\rangle$...
• 3,533

How could a quantum computer perform nimber arithmetic?

It is relevant to consider the following research paper from Mashiko Fukiyama on Nim Game on Graph to come up with an algorithmic approach . At first, to set a starting position of the game, we fix ...
• 857

Proof of optimality for CHSH game classical strategy

In the CHSH game we have 2 players Alice and Bob. Can we proof in the form of a noncommunication pair of TMs which takes as input independant random bits x and y plus an arbitrary shared bitstring, ...
• 499
Accepted

Why is $P(1,2)_{\text{same}} = \frac{1}{4}$ and not $\frac{1}{2}$ in Preskill's Bell experiment?

I do understand that the sum of these three probabilities is greater than one because there are some constraints already involved; like if we uncover all three coins at least two have to be the ...
• 47.1k

Using Qiskit with Blender

import sys sys.exec_prefix will show the path of python used by blender. Rename this python folder to something else. Now ...
Accepted

How does a classical computer simulate nonclassical correlations?

How then, would one be able to simulate say CHSH, which produces fundamentally quantum probabilities that cannot be explained locally/classically? Am I misinterpreting the meaning of simulate? ...
• 18.7k

How does a classical computer simulate nonclassical correlations?

There are two definitions of simulation that are commonly used in this context. We consider a quantum computation to be: 1. loading an input 2. performing some processing 3. doing a measurement This ...
• 321

Problems in understanding the solution for "Mermin–Peres Magic Square Game"

Not an answer yet, but to long for comment: Alice and Bob share two entangled pairs. Now look only at Alice's. The last line gives the state that only one of'em has: \frac1{\sqrt 2}(|00〉+|11〉) =\...
• 608
1 vote

• 18.7k
1 vote

How are Franson Interferometers used to prove security in Photonic QKD Experiments?

What a Franson interferometer does is to superpose two-photon wavepackets generated at different times (within the coherence time of the pump, supposing we are generating a pair of entangled photons ...
1 vote
Accepted

MS Quantum Katas - Measurements Task 2.3 - problems in understanding the solution

Von Neumann measurement is a measurement that corresponds to an orthonormal basis, not necessary standard. Though it's related to the standard by a unitary transformation. As for the solution, at ...
• 5,453
1 vote

Using Qiskit with Blender

Are you using Qiskit from within a conda virtual environment? If Blender isn't launched from within the same venv they may not be able to communicate (or share libraries).
1 vote

Optimal strategy to a quantum state game

The key is in the optimal strategy for distinguishing two non-orthogonal states. This is something called the Helstrom measurement, which I described here.
• 47.1k

Only top scored, non community-wiki answers of a minimum length are eligible