Related papers: The physical basis of teleological evolutions
Involving only the measurements of commuting observables - the problem-setting and the corresponding solution - quantum algorithms should be subject to classical logic. This would allow flanking their customary quantum description with a…
We show that the quantum computational speedup of quantum algorithms is due to their teleological character, their being evolutions toward a goal (the solution of the problem) with an attractor in the very goal they will produce in the…
It can be argued that the ordinary description of the reversible quantum process between two one-to-one correlated measurement outcomes is incomplete because, by not specifying the direction of causality, it allows causal structures that…
In former work, we showed that a quantum algorithm is the sum over the histories of a classical algorithm that knows in advance 50% of the information about the solution of the problem - each history is a possible way of getting the…
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…
In previous works, we showed that an optimal quantum algorithm can always be seen as a sum over classical histories in each of which the problem solver knows in advance one of the possible halves of the solution she will read in the future…
We consider the reversible processes between two one-to-one correlated measurement outcomes which underly both problem-solving and quantum nonlocality. In the former case the two outcomes are the setting and the solution of the problem, in…
The usual representation of quantum algorithms is limited to the process of solving the problem. We extend it to the process of setting the problem. Bob, the problem setter, selects a problem-setting by the initial measurement. Alice, the…
We explain the mechanism of the quantum speed-up - quantum algorithms requiring fewer computation steps than their classical equivalent - for a family of algorithms. Bob chooses a function and gives to Alice the black box that computes it.…
A quantum algorithm succeeds not because the superposition principle allows 'the computation of all values of a function at once' via 'quantum parallelism,' but rather because the structure of a quantum state space allows new sorts of…
It is often claimed that one cannot locate a notion of causation in fundamental physical theories. The reason most commonly given is that the dynamics of those theories do not support any distinction between the past and the future, and…
Insofar as quantum computation is faster than classical, it appears to be irreversible. In all quantum algorithms found so far the speed-up depends on the extra-dynamical irreversible projection representing quantum measurement. Quantum…
Quantum mechanics allows coherent superposition between different states of matter. This quality is responsible for major non-classical phenomena that occur in quantum systems. Beyond states, coherent superpositions are also possible…
Quantum computers are expected to revolutionize our ability to process information. The advancement from classical to quantum computing is a product of our advancement from classical to quantum physics -- the more our understanding of the…
The nature of quantum computation is discussed. It is argued that, in terms of the amount of information manipulated in a given time, quantum and classical computation are equally efficient. Quantum superposition does not permit quantum…
Most continuous mathematical formulations arising in science and engineering can only be solved numerically and therefore approximately. We shall always assume that we're dealing with a numerical approximation to the solution. There are two…
In the near future, there will likely be special-purpose quantum computers with 40-50 high-quality qubits. This paper lays general theoretical foundations for how to use such devices to demonstrate "quantum supremacy": that is, a clear…
Computational methods are the most effective tools we have besides scientific experiments to explore the properties of complex biological systems. Progress is slowing because digital silicon computers have reached their limits in terms of…
Quantum algorithms require less operations than classical algorithms. The exact reason of this has not been pinpointed until now. Our explanation is that quantum algorithms know in advance 50% of the solution of the problem they will find…
The aim of this dissertation is to clarify the debate over the explanation of quantum speedup and to submit a tentative resolution to it. In particular, I argue that the physical explanation for quantum speedup is precisely the fact that…