arXiv subjects

Christian Jansson

Publications and source records attributed to Christian Jansson.

3 recordsLinked to original sources

arXiv2008

The GMc-interpretation of Quantum Mechanics

The GMc-interpretation (Gravitation-Motion of mass-light with maximal speed c) is a consistent approach to quantum mechanics very closely related to classical physics. Several postulates are formulated that are satisfied in classical physics, general relativity theory, quantum theory and thermodynamics. In this interpretation, particles are always particles, never waves, and many paradoxes can be easily understood or avoided. In particular, the postulates allow to explain the measurement problem and the concept of interaction-free measurements; the latter allows to find objects without ``touching'' them, and sometimes the phrase ``seeing in the dark'' is used. Additionally, the concepts of complementarity, uncertainty, decoherence, locality and realism are investigated. One key property of this interpretation is that all observed probabilities and interference patterns are known before a particle is in the experiment. Ontological questions are discussed.

quant-ph↗

arXiv2008

A classical interpretation of quantum mechanics and the measurement problem

In this paper a didactic approach is described which immediately leads to an understanding of those postulates of quantum mechanics used most frequently in quantum computation. Moreover, an interpretation of quantum mechanics is presented which is motivated by retaining the point of view of classical mechanics as much as possible, and which is consistent with relativity theory. Everything can be written down in terms of well-known mathematical formulations that can be found in every textbook about quantum mechanics. Therefore, in this version, almost no formulas are used.

quant-ph↗

arXiv2007

Guaranteed Accuracy for Conic Programming Problems in Vector Lattices

This paper presents rigorous forward error bounds for linear conic optimization problems. The error bounds are formulated in a quite general framework; the underlying vector spaces are not required to be finite-dimensional, and the convex cones defining the partial ordering are not required to be polyhedral. In the case of linear programming, second order cone programming, and semidefinite programming specialized formulas are deduced yielding guaranteed accuracy. All computed bounds are completely rigorous because all rounding errors due to floating point arithmetic are taken into account. Numerical results, applications and software for linear and semidefinite programming problems are described.

math.OC↗