Quantum Computer on a Turing Machine. Infinite but Converging Computation. Vasil Penchev. email@example.com , firstname.lastname@example.org http:// www.scribd.com/vasil7penchev http://www.wprdpress.com/vasil7penchev CV: http:// old-philosophy.issk-bas.org/CV/cv-pdf/V.Penchev-CV-eng.pdf.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Infinite but Converging Computation
The term of “quantum computer” means both:
1. A mathematical model like a Turing machine, which is the general model of any usual computer we use, and:
2. Any concrete technical realization involving the laws of quantum mechanics to implement computations
A classical Turing
tape of bits:
The list of all
operations on a cell:
A quantum Turing
tape of qubits:
A quantum Turing machine
That model is intended:
- For elucidating the most general mathematical and philosophical properties of quantum computer or computation
- For their comparison with those of a classical computer or computation
That model cannot serve to design any technical realization of quantum computer just as the true machine of Turing cannot as to a standard computer
are two complex numbers:
, are two orthonormal
vectors or a basis such as two orthogonal
great circles of the unit ball
defines a point of the unit ball
and define a point of the unit sphere
Given any point in (complex) Hilbert space as a vector one can replace any successive couple of its components such as (, with a single corresponding qubitsuch that:
if are not both 0. However if both are 0 one needs to add conventionally the center ( to conserve the mapping of Hilbert space and an infinite qubit tape to be one-to-one (*) (**)
Quantum Turing tape
One qubit(an infinite choice)
Turing tapes = well orderings:
What is the relation between information and its carrier, e.g. between an empty cell of the tape and the written on it?
The classical notion of information or algorithm separates them disjunctively from their corresponding carriers.
The Turing machine model represents that distinction by an empty cell, on the one hand, and the set of values, which can be written on it, or a given written value, on the other hand
as a given and
of that carrier
The carrier of
An empty cell
The classical concept of information divides unconditionally information from its carrier and excludes information without some energetic or material carrier:
Information obeys the carrier: no information without its carrier: Information needs something with nonzero energy, on which is written or from which is read. Otherwise it cannot exist
OK, but all this refers to the classical information, not to the quantum one. One can call the latter emancipated information
The definition (e.g. of Shannon) of classical information delimits the quantity of some information from the number of cells on its carrier: that definition is not invariant to the transformation between the quantity of information and the number of cell for it.
All those classical demarcations are removed in quantum information:
It coincides with its carrier
Potential and actual choice merge
The empty cells and the written on them are interchangeable (as a basis and as a vector in an orthonormal vector space like Hilbert space)
However all this contradicts our prejudices borrowed from “common sense”: so much the worse for the prejudices ...
The particle “carries”
the information of all its
properties and quantities:
That is: the set of them
is ‘particle’ or the ‘carrier
The ‘particle’ is split into
two complementary sets
of properties, each of
which can be as if the
carrier of the other. Their
interchange is identical
The quantum case
The classical case
X(B) should mean the number of qubits necessary to store the quantity of information A, and X(A), that of B
other: The “carrier” and information are identical
Two dual, complementary qubits
That principle of quantum invariance is quite not obvious and even contradicts “common sense”: It can obtain relevant foundation from quantum mechanics and quantum measurement:
Quantum measure underlies quantum measurement: It is a fundamentally new kind of measure, which transfers Skolem’s “relativity of ‘set’” (1922 ) into the theory of measure as that measure, to which a “much” and a “many” are relative and can share it and thus measured jointly
The justification of quantum invariance is as follows:
The limit, to which it converges, is the result of this quantum computation
That definition raises two questions:
Quantum computation involves the notion of actual infinity since the computational series is both infinite and considered as a completed whole by dint of its limit
Furthermore quantum computation unifies both definitions of ‘function”:
That unifying cannot be obtained without involving actual infinity
The offered model of quantum computer on a Turing machine as a convergent and infinite process comprises the more general case where that infinite process does not converge and even has infinitely many limit points
This is due to quantum invariance, which allows of two equivalent “hypostases” of quantum computation:
One can use the granted above axiom of choice to order the limit points even being infinitely many as a monotonic series, which necessarily converges if it is a subset of any finite interval, and to accept this last limit as the ultimate result of the quantum computer
Consequently quantum invariance underlain by all quantum mechanics is what guarantees that any quantum computation has a single result, and thus it unlike a Turing machines in general is complete
Any qubit represents equivalently a limit point of the “tape” of the Turing machine, on which the quantum computer is modeled
That qubit or that limit point can be expanded into a series of qubits (i.e. a subspace of Hilbert space) or to a series, which converges to this limit point
The axiom of choice implies that “reverse action” as above: Indeed, given the set of all series converging to a limit point, it enables a series to be chosen from it
If those limit points are even infinitely many, they can be represented equivalently by a point in Hilbert space where any “axis” of it corresponds one-to-one to a qubit ant thus to a limit point of the quantum computational process (see Slide 10)
So any limit point corresponds one-to-one to a subspace of Hilbert space, and any that one can be compacted into a single qubit by the axiom of choice. The same compacting as to a series means to be chosen its limit point to represent all series
Limit point m
Limit point n
Limit point p
The ultimate result of any quantum
computation exists always!
Using the axiom of choice, one can always reorder monotonically a bounded set of limit points to converge or represent a point in Hilbert space as a single qubit by the Banach-Tarski paradox (Banach, Tarski 1924):
Both are only different images of one and the same quantum computation:
The one is compacted into a qubit or reordered as a converging series
The other is expanded as Hilbert space (a converging vector in it) or as an arbitrary series non-converging, non-reordered, but reorderable in principle
Your kind attention!
Banach, Stefan, Alfred Tarski 1924. “Sur la decomposition des ensembles de points en parties respectivementcongruentes.” FundamentaMathematicae. 6, (1): 244-277.
Deutsch, David 1985. “Quantum theory, the Church-Turing principle and the universal quantum computer,” Proceedings of the Royal Society of London A. 400: 97-117.
Deutsch, David 1989. “Quantum computational networks,” Proceedings of the Royal Society of London. Volume A 425 73-90
Kochen, Simon and Ernst Specker1968. “The problem of hidden variables in quantum mechanics,” Journal of Mathematics and Mechanics. 17 (1): 59-87.
Neumann, Johan von 1932. MathematischeGrundlagen der Quantenmechanik, Berlin: Verlag von Julius Springer.
Skolem, Thoralf 1922. “EinigeBemerkungenzuraxiomatischenBegründung der Mengenlehre. ‒ In: T. Skolem,” in Selected works in logic (ed. E. Fenstad), Oslo: Univforlaget (1970).
Turing, Allen 1937. “On computable numbers, with an application to the Entscheidungsproblem,” Proceedings of London Mathematical Society, series 2. 42 (1): 230-265
Andrew Yao (1993). "Quantum circuit complexity". Proceedings of the 34th Annual Symposium on Foundations of Computer Science. Los Alamos: IEEE Computer Society Press pp. 352–361