Quantum Computing SEArchived May 17, 2026✓ Full text saved
I have a small question about the usual proof for CHSH rigidity, as detailed in Cleve Lecture Notes . The CHSH rigidity assumes an optimal strategy of Alice and Bob, this strategy consists in observables $A_0$ and $A_1$ (two outcomes) for Alice and $B_0$ and $B_1$ for Bob, and a shared entangled state $|\psi_{AB}\rangle$ . The proof usually begins by prooving that a two outcomes POVM $\{E_0,E_1\}$ is equivalent to an ensemble of binary observables $\{A^{x}\}_{x}$ in which $x$ is a sample of Bern
Full text archived locally
✦ AI Summary· Claude Sonnet
CHSH rigidity Proof and POVMs
Ask Question
Asked today
Modified today
Viewed 4 times
0
I have a small question about the usual proof for CHSH rigidity, as detailed in Cleve Lecture Notes.
The CHSH rigidity assumes an optimal strategy of Alice and Bob, this strategy consists in observables
A
0
𝐴
0
and
A
1
𝐴
1
(two outcomes) for Alice and
B
0
𝐵
0
and
B
1
𝐵
1
for Bob, and a shared entangled state
|
ψ
AB
⟩
|
𝜓
𝐴
𝐵
⟩
.
The proof usually begins by prooving that a two outcomes POVM
{
E
0
,
E
1
}
{
𝐸
0
,
𝐸
1
}
is equivalent to an ensemble of binary observables
{
A
x
}
x
{
𝐴
𝑥
}
𝑥
in which
x
𝑥
is a sample of Bernouilli laws whose expectations are the eigenvalues of
E
0
𝐸
0
.
The CHSH rigidity proof continues then by focusing on each binary observable
A
x
𝐴
𝑥
.
I understand that POVM are more general than PVM, e.g. state discrimination does not lead to PVMs, but I just wonder why the CHSH rigidity proof cares about POVM ?
The initial assumption is just that Alice and Bob have observables
A
0
𝐴
0
,
A
1
𝐴
1
,
B
0
𝐵
0
and
B
1
𝐵
1
which check optimality :
1
4
⟨
ψ
AB
|
A
0
⊗
B
0
+
A
0
⊗
B
1
+
A
1
⊗
B
0
−
A
1
⊗
B
1
|
ψ
AB
⟩=
1
2
–
√
1
4
⟨
𝜓
𝐴
𝐵
|
𝐴
0
⊗
𝐵
0
+
𝐴
0
⊗
𝐵
1
+
𝐴
1
⊗
𝐵
0
−
𝐴
1
⊗
𝐵
1
|
𝜓
𝐴
𝐵
⟩
=
1
2
Those observables are then replaced in the proof by an ensemble of binary observables
{
A
x
0,1
}
x
{
𝐴
0
,
1
𝑥
}
𝑥
and
{
B
x
0,1
}
x
{
𝐵
0
,
1
𝑥
}
𝑥
for Alice and Bob. Does it mean that we have following equality ?
∑
x
p(x)⟨
ψ
AB
|
A
x
0
⊗
B
x
0
+
A
x
0
⊗
B
x
1
+
A
x
1
⊗
B
x
0
−
A
x
1
⊗
B
x
1
|
ψ
AB
⟩
=⟨
ψ
AB
|
A
0
⊗
B
0
+
A
0
⊗
B
1
+
A
1
⊗
B
0
−
A
1
⊗
B
1
|
ψ
AB
⟩
∑
𝑥
𝑝
(
𝑥
)
⟨
𝜓
𝐴
𝐵
|
𝐴
0
𝑥
⊗
𝐵
0
𝑥
+
𝐴
0
𝑥
⊗
𝐵
1
𝑥
+
𝐴
1
𝑥
⊗
𝐵
0
𝑥
−
𝐴
1
𝑥
⊗
𝐵
1
𝑥
|
𝜓
𝐴
𝐵
⟩
=
⟨
𝜓
𝐴
𝐵
|
𝐴
0
⊗
𝐵
0
+
𝐴
0
⊗
𝐵
1
+
𝐴
1
⊗
𝐵
0
−
𝐴
1
⊗
𝐵
1
|
𝜓
𝐴
𝐵
⟩
entanglementbell-experimentchsh
Share
Improve this question
Follow
asked 1 hour ago
deb2014
6233
3 silver badges
8
8 bronze badges
Add a comment
Know someone who can answer? Share a link to this question via email, Twitter, or Facebook.
Your Answer
Sign up or log in
Sign up using Google
Sign up using Email and Password
Post as a guest
Name
Email
Required, but never shown
Post Your Answer
By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.
Start asking to get answers
Find the answer to your question by asking.
Ask question
Explore related questions
entanglementbell-experimentchsh
See similar questions with these tags.
The Overflow Blog
Observability and human intuition in an AI world
Featured on Meta
(Almost) One year of Challenges
Related
10
Is there an algorithm for determining if a given vector is separable or entangled?
5
Applying density matrix based criterion to verify separability
4
Bra-Ket Notation and Proof of a Ket Equation in Two-Party Shared-Entanglement Setting
3
Formal proof of Bell's inequality in CHSH form
0
Why not just use Bell state entanglement in the CHSH game?
7
Worst Bell inequality violation with non-maximally entangled state?
1
On difference in the number of two-qubit stabilizer states that are separable (36) vs those that are maximally entangled (24) and partial entanglement
1
For CHSH game, why does the mathematica program gives 75% as the best winning rate when sharing 2 EPR pairs?
1
Quantum Teleportation and Quantum Internet
Hot Network Questions
Maximum sum of values in a grid
How do you get age-adjusted CI from age-specific CI?
Books with multiple proofs of one statement
Relabeling ticks on my number line
Format numbers on vertical axis in DateListPlot
Riddle of the regatta
How to flip vertex group and bone names?
How to install Firebird 2.5.9 on WSL?
Is this interval consonant or dissonant?
Does the number of eyes change a race's vision?
How to recover RAID5 using UFS Explorer?
more hot questions
Question feed
By continuing to use this website, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy. By exiting this window, default cookies will be accepted. To reject cookies, select an option from below.
Customize settings
Cookie Consent Preference Center
When you visit any of our websites, it may store or retrieve information on your browser, mostly in the form of cookies. This information might be about you, your preferences, or your device and is mostly used to make the site work as you expect it to. The information does not usually directly identify you, but it can give you a more personalized experience. Because we respect your right to privacy, you can choose not to allow some types of cookies. Click on the different category headings to find out more and manage your preferences. Please note, blocking some types of cookies may impact your experience of the site and the services we are able to offer.
Cookie Policy
Accept all cookies
Manage Consent Preferences
Strictly Necessary Cookies
Always Active
These cookies are necessary for the website to function and cannot be switched off in our systems. They are usually only set in response to actions made by you which amount to a request for services, such as setting your privacy preferences, logging in or filling in forms. You can set your browser to block or alert you about these cookies, but some parts of the site will not then work. These cookies do not store any personally identifiable information.
Targeting Cookies
Targeting Cookies
These cookies are used to make advertising messages more relevant to you and may be set through our site by us or by our advertising partners. They may be used to build a profile of your interests and show you relevant advertising on our site or on other sites. They do not store directly personal information, but are based on uniquely identifying your browser and internet device.
Performance Cookies
Performance Cookies
These cookies allow us to count visits and traffic sources so we can measure and improve the performance of our site. They help us to know which pages are the most and least popular and see how visitors move around the site. All information these cookies collect is aggregated and therefore anonymous. If you do not allow these cookies we will not know when you have visited our site, and will not be able to monitor its performance.
Functional Cookies
Functional Cookies
These cookies enable the website to provide enhanced functionality and personalisation. They may be set by us or by third party providers whose services we have added to our pages. If you do not allow these cookies then some or all of these services may not function properly.
Cookie List
Clear
checkbox label label
Apply Cancel
Consent Leg.Interest
checkbox label label
checkbox label label
checkbox label label
Necessary cookies only Confirm My Choices