KCBS pentagram

This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages) The topic of this article may not meet Wikipedia's general notability guideline. Please help to demonstrate the notability of the topic by citing reliable secondary sources that are independent of the topic and provide significant coverage of it beyond a mere trivial mention. If notability cannot be shown, the article is likely to be merged, redirected, or deleted. Find sources: "KCBS pentagram" – news · newspapers · books · scholar · JSTOR (December 2014) (Learn how and when to remove this message) This article possibly contains original research. Please improve it by verifying the claims made and adding inline citations. Statements consisting only of original research should be removed. (December 2014) (Learn how and when to remove this message) This article does not cite any sources. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "KCBS pentagram" – news · newspapers · books · scholar · JSTOR (December 2014) (Learn how and when to remove this message) (Learn how and when to remove this message)

In quantum foundations, the KCBS pentagram was discovered by Alexander Klyachko, M. Ali Can, Sinem Binicioglu, and Alexander Shumovsky as an example disproving noncontextual hidden variable models.

Let's say we have a pentagram, which is a graph with 5 vertices and 5 edges. Each vertex can be colored either red or blue. An edge is said to match if both of its vertices have the same color. Otherwise, it's a mismatch. In a hidden variable model, the total number of mismatches over all of the edges has to be an even number due to cyclicity, i.e. 0, 2 or 4. So, with a probability mixture over hidden variable assignments, the expectation value of the sum of mismatches over all of the 5 edges has to lie between 0 and 4.

Then, someone hands you a huge number of KCBS pentagrams, but at first, all of the colorings are hidden. You're told you can only uncover 2 vertices at most, and only if they share a common edge. So, for each pentagram, you randomly pick an edge and uncover the colors on its vertices. This random choice is necessary because if the pentagram producers had been able to guess your choice for each pentagram in advance, he could have "conspired" to fool you. You find no matter which edge you choose, you find blue-blue with a probability of ${\displaystyle 1-{\frac {2}{\sqrt {5}}}}$, red-blue with ${\displaystyle {\frac {1}{\sqrt {5}}}}$, and blue-red with ${\displaystyle {\frac {1}{\sqrt {5}}}}$. So, the expectation value of the sum of mismatches is ${\displaystyle 2{\sqrt {5}}\approx 4.47>4}$.

How was it done? Each pentagram is a 3D quantum system with an orthonormal basis ${\displaystyle \left\{|A\rangle ,|B\rangle ,|C\rangle \right\}}$. Each pentagram is initialized to ${\displaystyle |C\rangle }$. Each vertex is assigned a 1D projector projecting to ${\displaystyle {\frac {1}{\sqrt {\sqrt {5}}}}|C\rangle +{\sqrt {1-{\frac {1}{\sqrt {5}}}}}\left[\cos \left({\frac {4\pi n}{5}}\right)|A\rangle +\sin \left({\frac {4\pi n}{5}}\right)|B\rangle \right]}$, n = 0, ..., 4 . Adjacent projectors commute. If we project, color the vertex red. Otherwise, color it blue.

• Mermin–Peres square

This quantum mechanics-related article is a stub. You can help Wikipedia by expanding it.

• v
• t
• e