Abstract Department of Physics and Astronomy University of South Carolina, Columbia, SC 20208, USA [AF] Two of the most important unsolved problems in theoretical physics are the problem of quantizing gravitation and the measurement problem in quantum theory. It is possible that the solution of each one needs the other. Since we have successful quantum theories of electroweak, and strong interactions, the solution to the problem of the collapse of the wave function, known as the measurement problem, may lie in the yet unknown quantum theory of the remaining interaction, namely quantum gravity. On the other hand, the numerous unsuccessful attempts to construct a quantum theory of gravity for more than six decades on the assumption that the present linear quantum theory is correct suggests that perhaps not only general relativity but also quantum theory should be modified in order to construct of satisfactory quantum theory of gravity.
The problem of mind and consciousness cannot be treated as an object of science without much difficulty. Inevitably there is the self-contradiction that the work itself in science and thinking is an object of thought. In this meaning, we need to get back to the fundamental problem of how the world is perceived. The fundamental concept of quantum theory includes essentially unsolved problems such as the observation problem. In this paper, we begin to consider this fundamental problem in quantum theory and discuss the possibility of a description of mind in terms of quantum theory.
We consider a problem in quantum theory that can be formulated as an optimisation problem and present a global optimisation algorithm for solving it, the foundation of which relies in turn on a theorem from quantum theory. To wit, we consider the maximal output purity
νq of a quantum channel as measured by Schatten
q-norms, for integer
q. This quantity is of fundamental importance in the study of quantum channel capacities in quantum information theory. To calculate
νq one has to solve a non-convex optimisation problem that typically exhibits local optima. We show that this particular problem can be approximated to arbitrary precision by an eigenvalue problem over a larger matrix space, thereby circumventing the problem of local optima. The mathematical proof behind this algorithm relies on the Quantum de Finetti theorem, which is a theorem used in the study of the foundations of quantum theory. We expect that the approach presented here can be generalised and will turn out to be applicable to a larger class of global optimisation problems. We also present some preliminary numerical results, showing that, at least for small problem sizes, the present approach is practically realisable.