Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 79 tok/s
Gemini 2.5 Pro 41 tok/s Pro
GPT-5 Medium 25 tok/s Pro
GPT-5 High 23 tok/s Pro
GPT-4o 99 tok/s Pro
Kimi K2 199 tok/s Pro
GPT OSS 120B 444 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

Revisiting factorability and indeterminism (1111.5746v1)

Published 24 Nov 2011 in quant-ph, math-ph, and math.MP

Abstract: Perhaps it is not completely superfluous to remind that Clauser-Horne factorability, introduced in [1], is only necessary when \lambda, the hidden variable (HV), is sufficiently deterministic: for {M_i} a set of possible measurements (isolated or not by space-like intervals) on a given system, the most general sufficient condition for factorability on \lambda\ is obtained by finding a set of expressions M_i=M_i(\lambda,\xi_i), with {\xi_i} a set of HV's, all independent from one another and from \lambda. Otherwise, factorability can be recovered on \gamma = \lambda\ \oplus\ \mu, with \mu\ another additional HV, so that a description M_i=M_i(\gamma,\xi_i) is again found: conceptually, this is always possible; experimentally, it may not: \mu\ may be unaccessible or even its existence unknown (and so, too, from the point of view of a phenomenological theory). Results here may help clarify our recent post in [6].

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.