25 research outputs found
Quantum computation and the physical computation level of biological information processing
On the basis of introspective analysis, we establish a crucial requirement
for the physical computation basis of consciousness: it should allow processing
a significant amount of information together at the same time. Classical
computation does not satisfy the requirement. At the fundamental physical
level, it is a network of two body interactions, each the input-output
transformation of a universal Boolean gate. Thus, it cannot process together at
the same time more than the three bit input of this gate - many such gates in
parallel do not count since the information is not processed together. Quantum
computation satisfies the requirement. At the light of our recent explanation
of the speed up, quantum measurement of the solution of the problem is
analogous to a many body interaction between the parts of a perfect classical
machine, whose mechanical constraints represent the problem to be solved. The
many body interaction satisfies all the constraints together at the same time,
producing the solution in one shot. This shades light on the physical
computation level of the theories that place consciousness in quantum
measurement and explains how informations coming from disparate sensorial
channels come together in the unity of subjective experience. The fact that the
fundamental mechanism of consciousness is the same of the quantum speed up,
gives quantum consciousness a potentially enormous evolutionary advantage.Comment: 13 page
The quantum speed up as advanced knowledge of the solution
With reference to a search in a database of size N, Grover states: "What is
the reason that one would expect that a quantum mechanical scheme could
accomplish the search in O(square root of N) steps? It would be insightful to
have a simple two line argument for this without having to describe the details
of the search algorithm". The answer provided in this work is: "because any
quantum algorithm takes the time taken by a classical algorithm that knows in
advance 50% of the information that specifies the solution of the problem".
This empirical fact, unnoticed so far, holds for both quadratic and exponential
speed ups and is theoretically justified in three steps: (i) once the physical
representation is extended to the production of the problem on the part of the
oracle and to the final measurement of the computer register, quantum
computation is reduction on the solution of the problem under a relation
representing problem-solution interdependence, (ii) the speed up is explained
by a simple consideration of time symmetry, it is the gain of information about
the solution due to backdating, to before running the algorithm, a
time-symmetric part of the reduction on the solution; this advanced knowledge
of the solution reduces the size of the solution space to be explored by the
algorithm, (iii) if I is the information acquired by measuring the content of
the computer register at the end of the algorithm, the quantum algorithm takes
the time taken by a classical algorithm that knows in advance 50% of I, which
brings us to the initial statement.Comment: 23 pages, to be published in IJT
Majority Adder Implementation by Competing Patterns in Life-Like Rule B2/S2345
In this paper we present a two-dimensional chaotic cellular automaton, the Life rule B2/S2345, able to simulate the action of an adder with majority gates, stimulated by gliders collisions transformed as competing patterns. Values of Boolean variables are encoded into two types of patterns --- symmetric (FALSE) and asymmetric (TRUE) patterns -- which compete for the `empty' space when propagate in the channels. We construct basic logical gates and elementary arithmetical circuits by simulating logical signals with gliders reaction propagating geometrically restricted by stationary non-destructible still life. Therefore an implementation of universal logical gates and a majority binary adder is constructe
A quantum probability explanation for violations of ‘rational’ decision theory
Two experimental tasks in psychology, the two-stage gambling game and the Prisoner's Dilemma game, show that people violate the sure thing principle of decision theory. These paradoxical findings have resisted explanation by classical decision theory for over a decade. A quantum probability model, based on a Hilbert space representation and Schrödinger's equation, provides a simple and elegant explanation for this behaviour. The quantum model is compared with an equivalent Markov model and it is shown that the latter is unable to account for violations of the sure thing principle. Accordingly, it is argued that quantum probability provides a better framework for modelling human decision-making
Human machine interaction: The special role for human unconscious emotional information processing
Item does not contain fulltextThe nature of (un)conscious human emotional information processing remains a great mystery. On the one hand, classical models view human conscious emotional information processing as computation among the brain’s neurons but fail to address its enigmatic features. On the other hand, quantum processes (superposition of states, nonlocality, entanglement,) also remain mysterious, yet are being harnessed in revolutionary information technologies like quantum computation, quantum cryptography, and quantum teleportation. In this paper, we would like to discuss several experiments that suggest a special role for unconscious emotional information processing in the human-computer interaction. What are its consequences and could this be the missing link between quantum information theory and conscious human emotional information processing