Binary quantum random number generator based on value indefinite observables.

All quantum random number generators based on measuring value indefinite observables are at least three-dimensional because the Kochen-Specker Theorem and the Located Kochen-Specker Theorem are false in dimension two. In this article, we construct quantum random number generators based on measuring a three-dimensional value indefinite observable that generates binary quantum random outputs with the same randomness qualities as the ternary ones: the outputs are maximally unpredictable.

(Re)Construction of Quantum Space-Time: Transcribing Hilbert into Configuration Space.

Space-time in quantum mechanics is about bridging Hilbert and configuration space. Thereby, an entirely new perspective is obtained by replacing the Newtonian space-time theater with the image of a presumably high-dimensional Hilbert space, through which space-time becomes an epiphenomenon construed by internal observers.

On the Complete Description of Entangled Systems Part II: The (Meta)Physical Status and Semantic Aspects.

We review some semantical aspects of probability bounds from Boole's "conditions on possible experience" violated by quantum mechanics. We also speculate about emerging space-time categories as an epiphenomenon of quantization and the resulting breakdown of relativity theory by non-unitary and non-linear processes.

Extending Kolmogorov's Axioms for a Generalized Probability Theory on Collections of Contexts.

Kolmogorov's axioms of probability theory are extended to conditional probabilities among distinct (and sometimes intertwining) contexts. Formally, this amounts to row stochastic matrices whose entries characterize the conditional probability to find some observable (postselection) in one context, given an observable (preselection) in another context. As the respective probabilities need not (but, depending on the physical/model realization, can) be of the Born rule type, this generalizes approaches to quantum probabilities by Aufféves and Grangier, which in turn are inspired by Gleason's theorem.

Generalized Householder Transformations.

The Householder transformation, allowing a rewrite of probabilities into expectations of dichotomic observables, is generalized in terms of its spectral decomposition. The dichotomy is modulated by allowing more than one negative eigenvalue or by abandoning binaries altogether, yielding generalized operator-valued arguments for contextuality. We also discuss a form of contextuality by the variation of the functional relations of the operators, in particular by additivity.

Generalized Greenberger-Horne-Zeilinger Arguments from Quantum Logical Analysis.

The Greenberger-Horne-Zeilinger (GHZ) argument against noncontextual local hidden variables is recast in quantum logical terms of fundamental propositions, states and probabilities. Unlike Kochen-Specker- and Hardy-like configurations, this operator based argument proceeds within four nonintertwining contexts. The nonclassical performance of the GHZ argument is due to the choice or filtering of observables with respect to a particular state.

Quantum Violation of the Suppes-Zanotti Inequalities and "Contextuality".

The Suppes-Zanotti inequalities involving the joint expectations of just three binary quantum observables are (re-)derived by the hull computation of the respective correlation polytope. A min-max calculation reveals its maximal quantum violations correspond to a generalized Tsirelson bound. Notions of "contextuality" motivated by such violations are critically reviewed.

Quantum Randomness is Chimeric.

If quantum mechanics is taken for granted, the randomness derived from it may be vacuous or even delusional, yet sufficient for many practical purposes. "Random" quantum events are intimately related to the emergence of both space-time as well as the identification of physical properties through which so-called objects are aggregated. We also present a brief review of the metaphysics of indeterminism.

What Is So Special about Quantum Clicks?

This is an elaboration of the "extra" advantage of the performance of quantized physical systems over classical ones, both in terms of single outcomes as well as probabilistic predictions. From a formal point of view, it is based on entities related to (dual) vectors in (dual) Hilbert spaces, as compared to the Boolean algebra of subsets of a set and the additive measures they support.

Quantum Probability and Randomness.

The recent quantum information revolution has stimulated interest in the quantum foundations by perceiving and re-evaluating the theory from a novel information-theoretical viewpoint [...

New Forms of Quantum Value Indefiniteness Suggest That Incompatible Views on Contexts Are Epistemic.

Extensions of the Kochen-Specker theorem use quantum logics whose classical interpretation suggests a true-implies-value indefiniteness property. This can be interpreted as an indication that any view of a quantum state beyond a single context is epistemic. A remark by Gleason about the ad hoc construction of probability measures in Hilbert spaces as a result of the Pythagorean property of vector components is interpreted platonically.

Dimensional Lifting through the Generalized Gram-Schmidt Process.

A new way of orthogonalizing ensembles of vectors by "lifting" them to higher dimensions is introduced. This method can potentially be utilized for solving quantum decision and computing problems.

East-West paths to unconventional computing.

Unconventional computing is about breaking boundaries in thinking, acting and computing. Typical topics of this non-typical field include, but are not limited to physics of computation, non-classical logics, new complexity measures, novel hardware, mechanical, chemical and quantum computing. Unconventional computing encourages a new style of thinking while practical applications are obtained from uncovering and exploiting principles and mechanisms of information processing in and functional properties of, physical, chemical and living systems; in particular, efficient algorithms are developed, (almost) optimal architectures are designed and working prototypes of future computing devices are manufactured.

The complexity of proving chaoticity and the Church-Turing thesis.

Proving the chaoticity of some dynamical systems is equivalent to solving the hardest problems in mathematics. Conversely, classical physical systems may "compute the hard or even the incomputable" by measuring observables which correspond to computationally hard or even incomputable problems.

Generalizing Tsirelson's bound on Bell inequalities using a min-max principle.

Bounds on the norm of quantum operators associated with classical Bell-type inequalities can be derived from their maximal eigenvalues. This quantitative method enables detailed predictions of the maximal violations of Bell-type inequalities.