相关论文: Quantum Randomness and Nondeterminism

We explain the quantum structure as due to the presence of two effects, (a) a real change of state of the entity under influence of the measurement and, (b) a lack of knowledge about a deeper deterministic reality of the measurement…

Classical programming languages cannot model essential elements of complex systems such as true random number generation. This paper develops a formal programming language called the lambda-q calculus that addresses the fundamental…

We show that a new interpretation of quantum mechanics, in which the notion of event is defined without reference to measurement or observers, allows to construct a quantum general ontology based on systems, states and events. Unlike the…

The certification of randomness is essential for both fundamental science and information technologies. Unlike traditional random number generators, randomness obtained from nonlocal correlations is fundamentally guaranteed to be…

Based on the {\it nonlinear coherent states} method, a general and simple algebraic formalism for the construction of \textit{`$f$-deformed intelligent states'} has been introduced. The structure has the potentiality to apply to systems…

The complexity of quantum computation remains poorly understood. While physicists attempt to find ways to create quantum computers, we still do not have much evidence one way or the other as to how useful these machines will be. The tools…

It is argued that there is no evidence for causality as a metaphysical relation in quantum phenomena. The assumption that there are no causal laws, but only probabilities for physical processes constrained by symmetries, leads naturally to…

In this paper we give a definition for the Kolmogorov complexity of a pure quantum state. In classical information theory the algorithmic complexity of a string is a measure of the information needed by a universal machine to reproduce the…

The outcomes of quantum mechanical experiments are inherently random. It is therefore necessary to develop stringent methods for quantifying the degree of statistical uncertainty about the results of quantum experiments. For the…

We present a general theory of quantum information processing devices, that can be applied to human decision makers, to atomic multimode registers, or to molecular high-spin registers. Our quantum decision theory is a generalization of the…

I argue that scientific determinism is not supported by facts, but results from the elegance of the mathematical language physicists use, in particular from the so-called real numbers and their infinite series of digits. Classical physics…

The development of quantum algorithms based on quantum versions of random walks is placed in the context of the emerging field of quantum computing. Constructing a suitable quantum version of a random walk is not trivial: pure quantum…

Over the past decade quantum information theory has developed into a vigorous field of research despite the fact that quantum information, as a precise concept, is undefined. Indeed the very idea of viewing quantum states as carriers of…

A formulation of quantum mechanics based on an operational definition of state is presented. This formulation, which includes explicitly the macroscopic systems, assumes the probabilistic interpretation and is nevertheless objective. The…

The influence of additional information on the decision making of agents, who are interacting members of a society, is analyzed within the mathematical framework based on the use of quantum probabilities. The introduction of social…

One advantage of quantum algorithms over classical computation is the possibility to spread out, process, analyse and extract information in multipartite configurations in coherent superpositions of classical states. This will be discussed…

An intense effort is being made today to build a quantum computer. Instead of presenting what has been achieved, I invoke here analogies from the history of science in an attempt to glimpse what the future might hold. Quantum computing is…

The qualitatively new concept of dynamic complexity in quantum mechanics is based on a new paradigm appearing within a nonperturbational analysis of the Schroedinger equation for a generic Hamiltonian system. The unreduced analysis…

Interpretation of the nonclassical total probability formula arising in some quantum experiments is provided based on stochastic models described by means of a sequence of random vectors changing in the measurement procedures.

Universality of quantum mechanics -- its applicability to physical systems of quite different nature and scales -- indicates that quantum behavior can be a manifestation of general mathematical properties of systems containing…