Use for exclusive or and regard all bits as elements of . For every public label , Alice computes the indicator functionwhile Bob computes from the known truth table. Exactly one of the is one, so the separated Boolean decomposition is
For each , they invoke an independent PR box with respective input bits and receive outputs . These satisfy . Alice forms , and Bob forms . Taking the exclusive or of all box constraints provesAlice sends the single bit . Bob combines it with his locally known , obtainingThis is one-bit computation using Popescu–Rohrlich boxes. It uses boxes; decomposing by Bob's input instead gives , so the smaller truth-table factorization uses at most . No efficiency bound on local calculation or box use is needed for the stated unlimited resource.
Each PR box has uniform local output distributions regardless of the other party's input. Independent invocations therefore give Bob a uniform output string before the message, carrying no information about . The useful correlation becomes accessible through Alice's final bit; the construction respects the no-signalling property of the boxes.
The target states here are qubit states, as appropriate to sharing singlet states of two qubits. Write and choose . These form an orthonormal basis, and the shared Bell state can be expressed asAlice knows the classical description of , so she can perform the projective measurement in this basis. The outcome has probability and leaves Bob in , up to an irrelevant overall phase. Alice sends a success bit: one for this outcome and zero for the other. Bob keeps his qubit only on success. This proves heralded remote preparation of an arbitrary qubit:The other outcome leaves at Bob's side; the protocol makes no claim of success in that branch.
For a block of targets, share independent singlet states. Alice measures her th qubit in the basis . She sends one bit indicating whether all outcomes were of the successful kind. Because the pairs are independent, all-success has probability ; conditioned on it, Bob's joint state is precisely . Thus one-bit heralding of a remote state preparation block givesOn failure Bob discards the block, so he does not need a list of which component states failed.
For asymptotic remote state preparation by block indexing, prelabel a supply of independent candidate blocks, each containing singlet states. Alice measures blocks until she finds the first all-success block, of index . She does not send a flag after each trial. Since is the success probability of each block,This geometric distribution is independent of the target states. The probability of never succeeding is . Alice needs to communicate only ; Bob retrieves the labelled qubits in that block, and thereby knows that every requested state was prepared exactly.
Here is an explicit prefix code for a rare geometric success. Set and divide , where . Encode as ones followed by zero, then encode in exactly bits. Bob can decode this without knowing any target-state description. The message length is . With ,Since ,This version succeeds exactly with probability one and has the stated expected classical communication cost. It consumes singlet states on average, compatible with the unlimited entanglement assumption.
There is also a fixed-message-length version. Try at most candidate blocks and send the first successful index, or a zero codeword reporting that none succeeded. Encoding the possibilities uses bits. Its failure probability isThus fixed-length communication approaches one bit per state with success probability tending to one; variable-length communication achieves exact eventual success with expected cost approaching one bit per state. Before the index arrives, Bob's unconditional state remains independent of the target descriptions, in agreement with the no-signalling theorem.
For the Kraus operators of the measurement in quantum mechanics, the Born rule givesThe density matrix is the unnormalized state of that outcome. It is positive, its trace is , and completeness gives . There is no conditional state to assign to an event with .
For a projective measurement, each is an orthogonal projection, satisfying . Completeness becomes . Fix in the range of . ThenSince , the th summand already equals . All other summands are nonnegative, so for . Consequently , and taking adjoints also gives . This proves the stronger completeness forces orthogonality of measurement projections:
For the unitary dilation of a measurement instrument, take a quantum ancilla with orthonormal states , initially in . DefineThe completeness equation impliesso is an isometry. Its action on the input subspace can be extended to a unitary operator on the enlarged system:Choose orthonormal bases in the two complementary subspaces and map one to the other. Their dimensions agree; the extra unused quantum ancilla level also ensures this extension is possible for an infinite-dimensional system. After the coupling, the joint density matrix is
Now perform a projective measurement on the larger system, withThese are pairwise orthogonal and sum to the full identity. The unused level has zero weight in , so merging it into outcome one adds no probability. For every ,Its trace is , and taking the partial trace over the quantum ancilla after normalization gives exactly . Hence unitary coupling to an quantum ancilla, a projective measurement, and discarding the quantum ancilla reproduce both the probabilities and the conditional states of the general measurement. This is the instrument version of a Stinespring dilation, rather than a construction reproducing only the outcome probabilities.
For each hidden variable , a deterministic local hidden-variable model assigns values to all settings. The responses depend only on the local setting; their averaging distribution is setting independent, as required by measurement independence.
Let be the sum of the nonnegative modular representatives in the chained modular Bell inequality. Before reduction modulo , the chain telescopes:Reduction changes this integer only by multiples of . Since all reduced terms are nonnegative,The smallest possible nonnegative value in this residue class is . Averaging over the hidden variable provesAdding local random seeds to gives the same result for stochastic local hidden-variable theories.
For the coplanar qubit realization of the chained Bell inequality, shareAt angle in the plane, use the projective measurement of the observableHere are Pauli matrices, and the classical bit records eigenvalue . Since and both crossed expected values vanish in this Bell state,The one-party expected values vanish, so the complete joint probabilities areFor binary outcomes, is one exactly when , while is one exactly when . Consequently
For , set and choose Alice's angle and Bob's angle . Every adjacent pair or differs by , giving expectation . The closing pair has angle difference ; its agreement probability is also . Thus every one of the terms contributes equally:Indeed for , so this value is below . For an explicit two-setting instance, Alice measures and Bob measures . The four relevant expected values sum toviolating the local bound one. At there is no violation; the two terms always sum to one. As , the displayed quantum value is asymptotic to and approaches the algebraic lower bound zero.
The violation rules out a local hidden-variable theory with setting-independent preassigned local responses reproducing these quantum correlations. It does not permit faster-than-light communication: the joint formula gives each local outcome probability , independent of the remote setting, as required by the no-signalling theorem. The contradiction concerns the joint correlations and the Bell assumptions, not the ability to send a signal.
Articles by others on the same topic
There are currently no matching articles.
