相关论文: Quantum Mechanics and Algorithmic Randomness
Let $f$ denote length preserving function on words. A classical algorithm can be considered as $T$ iterated applications of black box representing $f$, beginning with input word $x$ of length $n$. It is proved that if $T=O(2^{n/(7+e)}), e…
Quantum mechanics dramatically differs from classical physics, allowing for a wide range of genuinely quantum phenomena. The goal of quantum information is to understand information processing from a quantum perspective. In this mindset, it…
The Nelson stochastic mechanics is derived as a consequence of the basic physical principles such as the principle of relativity of observations and the invariance of the action quantum. The unitary group of quantum mechanics is represented…
In a fundamental formulation of the quantum mechanics of a closed system such as the universe as a whole, three forms of information are needed to make predictions for the probabilities of alternative time histories of the closed system .…
In classical physics the joint probability of a number of individually rare independent events is given by the Poisson distribution. It describes, for example, unidirectional transfer of population between the densely and sparsely populated…
Quantum Mechanics of photons leads to a theory of Quantum Gravity that nicely matches the experimental results of varying fine structure constant,obtained from many-multiplet Quaser absorption systems and atomic clocks.The variation of that…
We develop a fundamental framework for the quantum mechanics of stochastic systems (QMSS), showing that classical discrete stochastic processes emerge naturally as perturbations of the quantum harmonic oscillator (QHO). By constructing…
Fundamental principle of classical physics -- local realism, means that freely chosen observations can be explained by a local (slower than light) real process. It is apparently violated in quantum mechanics as shown by Bell theorem.…
Any physical transformation that equally distributes quantum information over a large number M of users can be approximated by a classical broadcasting of measurement outcomes. The accuracy of the approximation is at least of the order 1/M.…
In the classical world one can construct two identical systems which have identical behavior and give identical measurement results. We show this to be impossible in the quantum domain. We prove that after the same quantum measurement two…
The conceptual setting of quantum mechanics is subject to an ongoing debate from its beginnings until now. The consequences of the apparent differences between quantum statistics and classical statistics range from the philosophical…
Quantum random sampling is the leading proposal for demonstrating a computational advantage of quantum computers over classical computers. Recently, first large-scale implementations of quantum random sampling have arguably surpassed the…
Classical fingerprinting associates with each string a shorter string (its fingerprint), such that, with high probability, any two distinct strings can be distinguished by comparing their fingerprints alone. The fingerprints can be…
We propose a quantum programming paradigm where all data are familiar classical data, and the only non-classical element is a random number generator that can return results with negative probability. Currently, the vast majority of quantum…
The standard definition of quantum state randomization, which is the quantum analog of the classical one-time pad, consists in applying some transformation to the quantum message conditioned on a classical secret key $k$. We investigate…
One of the striking properties of quantum mechanics is the occurrence of the Bell-type non-locality. They are a fundamental feature of the theory that allows two parties that share an entangled quantum system to observe correlations…
Quantum Annealing, or Quantum Stochastic Optimization, is a classical randomized algorithm which provides good heuristics for the solution of hard optimization problems. The algorithm, suggested by the behaviour of quantum systems, is an…
Composition is something we take for granted in classical algorithms design, and in particular, we take it as a basic axiom that composing ``efficient'' algorithms should result in an ``efficient'' algorithm -- even using this intuition to…
The very old problem of the statistical content of quantum mechanics (QM) is studied in a novel framework. The Born's rule (one of the basic postulates of QM) is derived from theory of classical random signals. We present a measurement…
A full treatment for the scattering of an arbitrary number of bosons through a Bell multiport beam splitter is presented that includes all possible output arrangements. Due to exchange symmetry, the event statistics differs dramatically…